• 대한안전경영과학회지
• /
• 제3권3호
• /
• pp.191-200
• /
• 2001

Parallel Genetic Algorithms partition the whole population into several sub-populations and search the optimal solution by exchanging the information each others periodically. Distributed Genetic Algorithm, one of Parallel Genetic Algorithms, divides a large population into several sub-populations and executes the traditional Genetic Algorithm on each sub-population independently. And periodically promising individuals selected from sub-populations are migrated by following the migration interval and migration rate to different sub-populations. In this paper, for the Travelling Salesman Problems, we analyze and compare with Distributed Genetic Algorithms using different Genetic Algorithms and using same Genetic Algorithms on each separated sub-population The simulation result shows that using different Genetic Algorithms obtains better results than using same Genetic Algorithms in Distributed Genetic Algorithms. This results look like the property of rapidly searching the approximated optima and keeping the variety of solution make interaction in different Genetic Algorithms.

• Architectural research
• /
• 제4권1호
• /
• pp.33-38
• /
• 2002

The objective of this study is the development of discrete optimum design algorithms which is based on the genetic algorithms. The developed algorithms was implemented in a computer program. For the optimum design, the objective function is the weight of space trusses structures and the constraints are stresses and displacements. This study solves the problem by introducing the genetic algorithms. The genetic algorithms consists of genetic process and evolutionary process. The genetic process selects the next design points based on the survivability of the current design points. The evolutionary process evaluates the survivability of the design points selected from the genetic process. The efficiency and validity of the developed discrete optimum design algorithms was verified by applying the algorithms to optimum design examples.

• 한국지능시스템학회논문지
• /
• 제17권1호
• /
• pp.86-93
• /
• 2007

A new operation termed competitive generation in the processes of genetic algorithms is proposed for accelerating the optimization speed of genetic algorithms. The competitive generation devised by considering the competition of sperms for fertilization provides a good opportunity for the genetic algorithms to approach global optimum without falling into local optimum. Experimental results with typical problems showed that the genetic algorithms with competitive generation are superior to those without the competitive generation.

• 제어로봇시스템학회논문지
• /
• 제7권10호
• /
• pp.819-826
• /
• 2001

Genetic algorithms are becoming more popular because of their relative simplicity and robustness. Genetic algorithms are global search techniques for nonlinear optimization. However, traditional genetic algorithms, though robust, are generally not the most successful optimization algorithm on any particular domain because they are poor at hill-climbing, whereas simulated annealing has the ability of probabilistic hill-climbing. Therefore, hybridizing a genetic algorithm with other algorithms can produce better performance than using the genetic algorithm or other algorithms independently. In this paper, we propose an efficient hybrid optimization algorithm named the adaptive random signal-based learning. Random signal-based learning is similar to the reinforcement learning of neural networks. This paper describes the application of genetic algorithms and simulated annealing to a random signal-based learning in order to generate the parameters and reinforcement signal of the random signal-based learning, respectively. The validity of the proposed algorithm is confirmed by applying it to two different examples.

• 대한전기학회논문지
• /
• 제41권9호
• /
• pp.1095-1103
• /
• 1992

An approach to fuse the fuzzy inference system which is able to deal with imprecise and uncertain information and genetic algorithms which display the excellent robustness in complex optimization problems is presented in this paper. In order to combine genetic algorithms and fuzzy inference engine effectively the new reasoning method is suggested. The efficient identification method of fuzzy rules is proposed through the adjustment of search areas of genetic algorithms. The feasibilty of the proposed approach is evaluated through simulation.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.625-628
• /
• 1998

This paper presents an application of genetic algorithms(GAs) for optimal configuration of distribution network. Three problems have been used to show how genetic algorithms are modified and applied. Solutions to the problems are found by minimizing the cost function which is directly related with balancing the loads. Simulation results show that genetic algorithms are technically feasible if they are tailored to meet the needs of real problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.968-971
• /
• 1996

In this paper, feedback controller is designed for ball-beam system using genetic algorithms. A genetic algorithms are implemented for optimizing gain parameters of feedback controller. We can find optimal point in multi-dimensional search space by using genetic algorithms. Performance of controller is tested by simulation of ball-beam system.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제5권1호
• /
• pp.21-28
• /
• 2005

This paper proposes a new method for accelerating the search speed of genetic algorithms by taking derivative evaluation and conditional random selection into account in their evolution process. Derivative evaluation makes genetic algorithms focus on the individuals whose fitness is rapidly increased. This accelerates the search speed of genetic algorithms by enhancing exploitation like steepest descent methods but also increases the possibility of a premature convergence that means most individuals after a few generations approach to local optima. On the other hand, derivative evaluation under a premature convergence helps genetic algorithms escape the local optima by enhancing exploration. If GAs fall into a premature convergence, random selection is used in order to help escaping local optimum, but its effects are not large. We experimented our method with one combinatorial problem and five complex function optimization problems. Experimental results showed that our method was superior to the simple genetic algorithm especially when the search space is large.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제5권4호
• /
• pp.310-315
• /
• 2005

This paper proposes a fast optimization method by combining queen-bee evolution and derivative evaluation in genetic algorithms. These two operations make it possible for genetic algorithms to focus on highly fitted individuals and rapidly evolved individuals, respectively. Even though the two operations can also increase the probability that genetic algorithms fall into premature convergence phenomenon, that can be controlled by strong mutation rates. That is, the two operations and the strong mutation strengthen exploitation and exploration of the genetic algorithms, respectively. As a result, the genetic algorithm employing queen-bee evolution and derivative evaluation finds optimum solutions more quickly than those employing one of them. This was proved by experiments with one pattern matching problem and two function optimization problems.

• 한국해양공학회지
• /
• 제17권6호
• /
• pp.53-57
• /
• 2003

Optimum design of most structural system requires that design variables are regarded as discrete quantities. This paper presents the use of Genetic Algorithm for determining the optimum design for truss with discrete variables. Genetic Algorithm are know as heuristic search algorithms, and are effective global search methods for discrete optimization. In this paper, Elitism and the method of conferring penalty parameters in the design variables, in order to achieve improved fitness in the reproduction process, is used in the Genetic Algorithm. A 10-Bar plane truss and a 25-Bar space truss are used for discrete optimization. These structures are designed for stress and displacement constraints, but buckling is not considered. In particular, we obtain continuous solution using Genetic Algorithms for a 10-bar truss, compared with other results. The effectiveness of Genetic Algorithms for global optimization is demonstrated through two truss examples.