• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.9
• /
• pp.1521-1526
• /
• 2007

This paper presents the application of Adaptive Evolutionary Algorithm (AEA) to search an optimal setting of overcurrent relay coordination to protect ring distribution systems. The AEA takes the merits of both a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner to use the global search capability of GA and the local search capability of ES. The overcurrent relay settings and coordination requirements are formulated into a set of constraint equations and an objective function is developed to manage the overcurrent relay settings by the Time Coordination Method. The domain of overcurrent relays coordination for the ring-fed distribution systems is a non-linear system with a lot of local optimum points and a highly constrained optimization problem. Thus conventional methods fail in searching for the global optimum. AEA is employed to search for the optimum relay settings with maximum satisfaction of coordination constraints. The simulation results show that the proposed method can optimize the overcurrent relay settings, reduce relay mis-coordinated operations, and find better optimal overcurrent relay settings than the present available methods.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.6 s.177
• /
• pp.1529-1539
• /
• 2000

A newly developed optimization method which uses the genetic algorithm combined with the sensitivity analysis is presented in this paper. The genetic algorithm is a probabilistic method, searching the optimum at several points simultaneously, requiring only the values of the object and constraint functions. It has therefore more chances to find global solution and can be applied various problems. Nevertheless, it has such shortcomings that even it approaches the optimum rapidly in the early stage, it slows down afterward and it can't consider the constraints explicitly. It is only because it can't search the local area near the current points. The traditional method, on the other hand, using sensitivity analysis is of great advantage in searching the near optimum. Thus the combination of the two techniques makes use of the individual advantages, that is, the superiority both in global searching by the genetic algorithm and in local searching by the sensitivity analysis. Application of the method to the several test functions verifies that the method suggested is very efficient and powerful to find the global solutions, and that the constraints can be considered properly.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.3
• /
• pp.12-18
• /
• 1994

Optimization in the engineering design is to select the best of many possible design alternatives in a complex design space. In order to optimize, various optimization methods have been used. One major problem of traditional optimization methods is that they often result in local optima. Recently genetic algorithm based on the mechanics of natural selection and natural genetics is used in many application fields for optimization. Genetic algorithm is more powerful to local optima, but it requires more calculation time and has difficulties in finding exact optimum point in design variable with real data type generally. In this paper. hybrid method was developed by coupling genetic algorithm and traditional direct search method. The developed method finds out a region for global optimum using genetic algorithm, and is to search global optimum using direct search method based on results obtained from genetic algorithm. By using hybrid method, calculation time is reduced and search efficient for optimum point is increased.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.11 s.254
• /
• pp.1358-1368
• /
• 2006

This paper proposes a Pareto artificial life algorithm for solving multi-objective optimization problems. The artificial life algorithm for optimization problem with a single objective function is improved to handle Pareto optimization problem through incorporating the new method to estimate the fitness value for a solution and the Pareto list to memorize and to improve the Pareto optimal set. The proposed algorithm was applied to the optimum design of a journal bearing which has two objective functions. The Pareto front and the optimal solution set for the application were presented to give the possible solutions to a decision maker or a designer. Furthermore, the relation between linearly combined single-objective optimization problem and Pareto optimization problem has been studied.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.12
• /
• pp.1061-1069
• /
• 2000

In this paper, a new genetic algorithm is proposed for solving multimodal function optimization problems that are not easily solved by conventional genetic algorithm(GA)s. This algorithm finds one of local optima first and another optima at the next iteration. By repeating this process, we can locate all the local solutions instead of one local solution as in conventional GAs. To avoid converging to the same optimum again, we devise a new genetic operator, called a Mendel operator which simulates the Mendels genetic law. The proposed algorithm remembers the optima obtained so far, compels individuals to move away from them, and finds a new optimum.

• Proceeding of KASS Symposium
• /
• 2005.05a
• /
• pp.246-253
• /
• 2005

The design of structural engineering optimization is to minimize the cost. This problem has many objective functions formulating section and shape as a function of the included discrete variables. simulated annealing, genetic algerian and TABU algorithm are searching methods for optimum values. The object of this reserch is comparing the result of TABU algorithm, and verifying the efficiency of TABU algorithm in structural optimization design field. For the purpose, this study used a solid truss of 25 elements having 10 nodes, and size optimization for each constraint and load condition of Geodesic one, and shape optimization of Cable Dome for verifying spatial structures by the application of TABU algorithm

• International Journal of Aeronautical and Space Sciences
• /
• v.14 no.4
• /
• pp.341-349
• /
• 2013

This paper considers the optimum design of flexbeam cross-sections for a full-scale bearingless helicopter rotor, using an efficient hybrid optimization algorithm based on particle swarm optimization, and an improved genetic algorithm, with an effective constraint handling scheme for constrained nonlinear optimization. The basic operators of the genetic algorithm, of crossover and mutation, are revisited, and a new rank-based multi-parent crossover operator is utilized. The rank-based crossover operator simultaneously enhances both the local, and the global exploration. The benchmark results demonstrate remarkable improvements, in terms of efficiency and robustness, as compared to other state-of-the-art algorithms. The developed algorithm is adopted for two baseline flexbeam section designs, and optimum cross-section configurations are obtained with less function evaluations, and less computation time.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.1
• /
• pp.150-155
• /
• 2011

In an active noise control systems, an IIR filter may cause a problem in stability beacause of its poles. For IIR filter, its poles goes sometimes out of a unit circle in a z-plane in the transition state, where the adaptive algorithm converges to the optimum value, which causes the system to diverge. Fuzzy LMS algorithm has a better convergence property than conventional LMS algorithms, but is not applicable to IIR filter because of the reasons. Stabilized adaptive algorithm could be improves stability by moving the pole of IIR filer toward the origin forcibly in the transient state, and by introducing forgetting factor to maintain the optimum convergence when it reaches to the steady state. In this paper, We proposed stabilized adaptive fuzzy LMS algorithms with IIR filter structures, for single channel active noise control with ill conditioned signal case. Computer simulations were performed to show the effectiveness of a proposed algorithm.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.654-656
• /
• 1998

This paper presents an optimal identification method of nonlinear and complex system that is based on fuzzy-neural network(FNN). The FNN used simplified inference as fuzzy inference method and Error Back Propagation Algorithm as learning rule. And we use a HCM Algorithm to find initial parameters of membership function. And then to obtain optimal parameters, we use the genetic algorithm. Genetic algorithm is a random search algorithm which can find the global optimum without converging to local optimum. The parameters such as membership functions, learning rates and momentum coefficients are easily adjusted using the genetic algorithms. Also, the performance index with weighted value is introduced to achieve a meaningful balance between approximation and generalization abilities of the model. To evaluate the performance of the FNN, we use the time series data for 9as furnace and the sewage treatment process.

• Steel and Composite Structures
• /
• v.30 no.1
• /
• pp.47-55
• /
• 2019

The aim of this paper is to present new and an efficient optimization algorithm called Jaya for the optimum mass of braced dome structures with natural frequency constraints. Design variables of the bar cross-section area and coordinates of the structure nodes were used for size and shape optimization, respectively. The effectiveness of Jaya algorithm is demonstrated through three benchmark braced domes (52-bar, 120-bar, and 600-bar). The algorithm applied is an effective tool for finding the optimum design of structures with frequency constraints. The Jaya algorithm has been programmed in MATLAB to optimize braced dome.