• Journal of Korea Water Resources Association
• /
• v.40 no.9
• /
• pp.687-696
• /
• 2007

Preference ordering approach is applied to optimize the parameters of Tank model using multi-objective genetic algorithm (MOGA). As more than three multi-objective functions are used in MOGA, too many non-dominated optimal solutions would be obtained thus the stakeholder hardly find the best optimal solution. In order to overcome this shortcomings of MOGA, preference ordering method is employed. The number of multi-objective functions in this study is 4 and a single Pareto-optimal solution, which is 2nd order efficiency and 3 degrees preference ordering, is chosen as the most preferred optimal solution. The comparison results among those from Powell method and SGA (simple genetic algorithm), which are single-objective function optimization, and NSGA-II, multi-objective optimization, show that the result from NSGA-II could be reasonalby accepted since the performance of NSGA-II is not deteriorated even though it is applied to the verification period which is totally different from the calibration period for parameter estimation.

• Journal of Radiation Protection and Research
• /
• v.42 no.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.

• The Journal of Information Technology and Database
• /
• v.7 no.1
• /
• pp.42-53
• /
• 2000

The major goal of this research is to develop an optimal route search algorithm for an intelligent route guidance system, one sub-area of ITS. ITS stands for intelligent Transportation System. ITS offers a fundamental solution to various issues concerning transportation and it will eventually help comfortable and swift moves of drivers by receiving and transmitting information on humans, roads and automobiles. Genetic algorithm, and fuzzy logic are utilized in order to implement the proposed algorithm. Using genetic algorithm, the proposed algorithm searches shortest routes in terms of travel time in consideration of stochastic traffic volume, diverse turn constraints, etc. Then using fuzzy logic, it selects driver-preference optimal route among the candidate routes searched by GA, taking into account various driver's preferences such as difficulty degree of driving and surrounding scenery of road, etc. In order to evaluate this algorithm, a virtual road-traffic network DB with various road attributes is simulated, where the suggested algorithm promptly produces the best route for a driver with reference to his or her preferences.

• Journal of the Korea Society for Simulation
• /
• v.10 no.3
• /
• pp.83-94
• /
• 2001

In this paper, the consumable spare parts requirement determination problem of newly procured equipment systems is considered. The problem is formulated as the cost minimization problem with operational availability constraint. Assuming part failure rate is constant during operational period, an analytical method is developed to obtain spare part requirements. Since this solution tends to overestimate the requirements, a fast search simulation procedure is introduced to adjust it to the realistic solution. The analytical solution procedure and the simulation procedure are performed recursively until a near optimal solution is achieved. The experimental results show that the near optimal solution is approached in a fairly short amount of time.

• Journal of Korean Society of Transportation
• /
• v.12 no.1
• /
• pp.75-84
• /
• 1994

In this paper we address the issue of how an optimal sample size computation relates the level of precision required for travel demand estimations and transportation planning. We approach the problem by 1) deriving a theoretical solution, 2) developing a computational procedure (algorithm) to implement the theoretical solution, and 3) demonstrating a practical application. Ultimately, we construct a formal scheme of optimal sample size computation for use in travel data collection processe.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.157-160
• /
• 2001

This paper has been studied a Adaptive Mutation rate Genetic Algorithm Processor. Genetic Algorithm(GA) has some control parameters such as the probability of bit mutation or the probability of crossover. These value give a priori by the designer There exists a wide variety of values for for control parameters and it is difficult to find the best choice of these values in order to optimize the behavior of a particular GA. We proposed a Adaptive mutation rate GA within a steady-state genetic algorithm in order to provide a self-adapting mutation mechanism. In this paper, the proposed a adaptive mutation rate GAP is implemented on the FPGA board with a APEX EP20K600EBC652-3 devices. The proposed a adaptive mutation rate GAP increased the speed of finding optimal solution by about 10%, and increased probability of finding the optimal solution more than the conventional GAP

• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.3
• /
• pp.164-175
• /
• 2010

In this study, we developed a genetic algorithm to find a near optimal solution of concurrent spare parts selection for the operational time period with limited information of weapon systems purchased from overseas. Through the analysis of time profiles related with system operations, we first define the optimization goal which maintains the expected system operating rate under the budget restrictions, and the number of failures and the lead time for each spare part are used to calculate the estimated total down time of the system. The genetic algorithm for CSP selection shows that the objective function minimizes the estimated total down time of systems with satisfying the restrictions. The method provided by this study can be applied to the generalized model of CSP selection for the systems purchased from overseas without provision of their full structure and adequate information.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.1
• /
• pp.58-65
• /
• 2001

This paper proposes a self tuning fuzzy inference method by the genetic algorithm in the fuzzy-sliding mode control for a robot. Using this method, the number of inference rules and the shape of membership functions are optimized without an expert in robotics. The fuzzy outputs of the consequent part are updated by the gradient descent method. And, it is guaranteed that he selected solution become the global optimal solution by optimizing the Akaikes information criterion expressing the quality of the inference rules. The trajectory tracking simulation and experiment of the polishing robot show that the optimal fuzzy inference rules are automatically selected by the genetic algorithm and the proposed fuzzy-sliding mode controller provides reliable tracking performance during the polishing process.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.6
• /
• pp.77-81
• /
• 2016

This paper deals with the optimization problem that decides the routing of connection between multi-source and multi-sink. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with $O(mn)^2$ time complexity to solve the optimal solution for this problem. This paper suggests the simple method that assigns the possible call flow quantity to augmenting path of ($s_i,t_i$) city pair satisfied with demand of ($s_i,t_i$). The proposed algorithm can be get the same optimal solution as LP for experimental data.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.125-128
• /
• 1996

In this paper, we consider a ring loading problem, which arises in the design of SONET bidirectional rings. We deal with the case where demands are allowed to be split and routed in two different directions. Even if integral . demands are given, the optimal solution of the problem doesn't always have integral values. We present an efficient algorithm which produces an integral optimal solution.