• Journal of Radiation Protection and Research
• /
• 제42권4호
• /
• pp.212-221
• /
• 2017

Background: This study aims to calculate detector positions as a design of a radioactive source localizing radiation portal monitor (RPM) system using an improved genetic algorithm. Materials and Methods: To calculate of detector positions for a source localizing RPM system optimization problem is defined. To solve the problem, a modified iterative genetic algorithm (MIGA) is developed. In general, a genetic algorithm (GA) finds a globally optimal solution with a high probability, but it is not perfect at all times. To increase the probability to find globally optimal solution rather, a MIGA is designed by supplementing the iteration, competition, and verification with GA. For an optimization problem that is defined to find detector positions that maximizes differences of detector signals, a localization method is derived by modifying the inverse radiation transport model, and realistic parameter information is suggested. Results and Discussion: To compare the MIGA and GA, both algorithms are implemented in a MATLAB environment. The performance of the GA and MIGA and that of the procedures supplemented in the MIGA are analyzed by computer simulations. The results show that the iteration, competition, and verification procedures help to search for globally optimal solutions. Further, the MIGA is more robust against falling into local minima and finds a more reliably optimal result than the GA. Conclusion: The positions of the detectors on an RPM for radioactive source localization are optimized using the MIGA. To increase the contrast of the measurements from each detector, a relationship between the source and the detectors is derived by modifying the inverse transport model. Realistic parameters are utilized for accurate simulations. Furthermore, the MIGA is developed to achieve a reliable solution. By utilizing results of this study, an RPM for radioactive source localization has been designed and will be fabricated soon.

• 한국전자파학회논문지
• /
• 제17권11호
• /
• pp.1065-1072
• /
• 2006

OFDM(Orthogonal Frequency Division Multiplexing) 시스템은 다수 부반송파들의 중첩 현상으로 인해 PAPR (Peak-to-Average Power Ratio) 문제를 가진다. 기존의 제안된 GA-SPW(Genentic-Sub-block Phase Weighting) 기법은 하나의 OFDM 심볼에서 부 블록 수를 증가시켜 PAPR 감소 성능을 향상시키고, 부 블록 수에 따라 지수적으로 증가하는 위상 탐색량을 유전자 알고리즘을 이용하여 개체군과 세대수에 고정시켜 감소시켰다. 본 논문에서는 더 적은 탐색량으로 주어진 부 블록에서 최적에 가까운 PAPR 감소 성능을 얻기 위해 기존의 GA-SPW 기법에 새로이 변형된 유전자 알고리즘을 적용한다. 제안된 기법의 성능과 계산량의 우수성을 모든 부 블록과 위상수에 따른 모든 탐색을 하는 일반적인 탐색 방법, iterative flipping그리고 기존의 GA-SPW와 시뮬레이션과 결과의 분석을 통하여 나타내었다.

• Smart Structures and Systems
• /
• 제31권3호
• /
• pp.229-245
• /
• 2023

The absence of excitation measurements may pose a big challenge in the application of structural damage identification owing to the fact that substantial effort is needed to reconstruct or identify unknown input force. To address this issue, in this paper, an iterative strategy, a synergy of Tikhonov regularization method for force identification and modified Jaya algorithm (M-Jaya) for stiffness parameter identification, is developed for damage identification with partial output-only responses. On the one hand, the probabilistic clustering learning technique and nonlinear updating equation are introduced to improve the performance of standard Jaya algorithm. On the other hand, to deal with the difficulty of selection the appropriate regularization parameters in traditional Tikhonov regularization, an improved L-curve method based on B-spline interpolation function is presented. The applicability and effectiveness of the iterative strategy for simultaneous identification of structural damages and unknown input excitation is validated by numerical simulation on a 21-bar truss structure subjected to ambient excitation under noise free and contaminated measurements cases, as well as a series of experimental tests on a five-floor steel frame structure excited by sinusoidal force. The results from these numerical and experimental studies demonstrate that the proposed identification strategy can accurately and effectively identify damage locations and extents without the requirement of force measurements. The proposed M-Jaya algorithm provides more satisfactory performance than genetic algorithm, Gaussian bare-bones artificial bee colony and Jaya algorithm.

• Nuclear Engineering and Technology
• /
• 제55권3호
• /
• pp.968-980
• /
• 2023

The dynamic structural responses are sensitive to the time-frequency content of seismic waves, and seismic input motions in time-history analysis are usually required to be compatible with design response spectra according to nuclear codes. In order to generate spectra-compatible input motions while maintaining the intrinsic non-stationarity of seismic waves, an improved time-domain approach is proposed in this paper. To maintain the nonstationary characteristics of the given seismic waves, a new time-frequency envelope function is constructed using the Hilbert amplitude spectrum. Based on the intrinsic mode functions (IMFs) obtained from given seismic waves through variational mode decomposition, a new corrective time history is constructed to locally modify the given seismic waves. The proposed corrective time history and time-frequency envelope function are unique for each earthquake records as they are extracted from the given seismic waves. In addition, a dimension reduction iterative technique is presented herein to simultaneously superimpose corrective time histories of all the damping ratios at a specific frequency in the time domain according to optimal weights, which are found by the genetic algorithm (GA). Examples are presented to show the capability of the proposed approach in generating spectra-compatible time histories, especially in maintaining the nonstationary characteristics of seismic records. And numerical results reveal that the modified time histories generated by the proposed method can obtain similar dynamic behaviors of AP1000 nuclear power plant with the natural seismic records. Thus, the proposed method can be efficiently used in the design practices.