earticle

논문검색

An Improved Evolutionary Strategy of Genetic Algorithm and a New Method on Generation of Initial Population When Using Genetic Algorithms for Solving Constrained Optimization Problems

초록

영어

The paper provides an improved evolutionary strategy (ES) of genetic algorithm (GA) on the basis of the existing literature. The ES overcomes the shortage of traditional GA whose excellent child individuals obtained in the crossover process may not survive in the process of mutation. In addition, the crossover probability and mutation probability which is hard to determine in traditional GA is removed for this proposed strategy. At the same time, it increases the number of individuals produced in process of crossover. This may increase the possibility of producing excellent individuals, thus lead to better improvement of the traditional GA. The test result of finding the optimal values of four functions using transitional GA and the proposed GA is presented in this paper. The result shows that the improved ES presented in this paper has faster calculation speed and significantly smaller number of iterations than the traditional GA. Thus, the improvement of improved ES is powerfully illustrated. Based on articles in the existing research literature, the initial population generation methods were further explored when using the genetic algorithm(GA) for solving constrained optimization problem. Through the research we present a new method about initial interior point’s generation. Firstly, construct a constraint posed by the objective function, which is based on the characteristics of constrained optimization problems. Then translate the problem of evaluating the initial interior point into a problem of solving a series of unconstrained optimization. By solving the unconstrained optimization problem, we achieve the solution of the initial interior point. Based on this idea, the research has given a method on the generation of the rest initial population individuals. In addition, through the research we concluded that the key to generate the initial population is to obtain an initial point. The production of other individuals will take less time after the initial internal point is obtained. Finally, we verified by examples that the initial population generation method given by this paper is a fast and reliable method. Thus the shortage of the GA of which the initial population is difficult to be produced in some constrained optimization problem is overcome

목차

Abstract
 1. Introduction
 2. Analysis of Traditional GA and ES
 3. Main Title
 4. Testing and Analysis of the ES
  4.1. The Selection of the Testing Functions and Parameters
  4.2. Testing Result and Analysis
 5. Overview of Methods for Solving Constrained Optimization Problems Using Genetic Algorithm
 6. A New Method of Finding the Initial Population
 7. The Method to Generate the Other Individuals in the Initial Population
 8. A Calculation Example
 9. Conclusion
 References

저자정보

  • Xu Sun1 Heilongjiang Institute of Technology, Northeast Agricultural University Harbin, China
  • Fulin Wang Northeast Agricultural University Harbin, China
  • Shifa Wen Northeast Agricultural University Harbin, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.