Convergence Enhanced Successive Zooming Genetic Algorithm far Continuous Optimization Problems

연속 최적화 문제에 대한 수렴성이 개선된 순차적 주밍 유전자 알고리듬

  • Published : 2002.02.01


A new approach, referred to as a successive zooming genetic algorithm (SZGA), is Proposed for identifying a global solution for continuous optimization problems. In order to improve the local fine-tuning capability of GA, we introduced a new method whereby the search space is zoomed around the design point with the best fitness per 100 generation. Furthermore, the reliability of the optimized solution is determined based on the theory of probability. To demonstrate the superiority of the proposed algorithm, a simple genetic algorithm, micro genetic algorithm, and the proposed algorithm were tested as regards for the minimization of a multiminima function as well as simple functions. The results confirmed that the proposed SZGA significantly improved the ability of the algorithm to identify a precise global minimum. As an example of structural optimization, the SZGA was applied to the optimal location of support points for weight minimization in the radial gate of a dam structure. The proposed algorithm identified a more exact optimum value than the standard genetic algorithms.


  1. Holland, J.H., 1975, Adaptation in Natural and Artificial systems, University of Michigan, Ann Arbor, MI, Internal reports
  2. Goldberg, D.E, 1989, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley
  3. Goldberg, D.E. and Kuo, C.H., 1987, 'Genetic Algorithm in Pipeline Optimization,' Journal of Computers in Civil Engineering, Vol 1, No. 2, pp. 128-141
  4. Chu, K.C. and Gang, F., 1995, 'Accelerated Genetic Algorithms: Combined with Local Search Techniques for Fast and Accurate Global Search,' IEEE International Conference On Evolutionary Computation, Vol. 1, p. 378
  5. Heistermann, J, 'Different Learning Algorithms for Neural Networks-A Comparative Study,' In Schwefel and Manner
  6. 이재관, 신효철, 2000, '민감도가 고려된 유전 알고리듬을 이용한 최적화 방법에 관한 연구,' 대한기계학회논문집 A 권, 제 24 권 제 6 호, pp. 1529-1539
  7. Andre, J., Siarry, P. and Dognon, T., 2001, 'An Improvement of the Standard Genetic Algorithm Fighting Premature Convergence in Continuous Optimization,'Advances in Engineering Software, Vol. 32, pp. 49-60
  8. Wong, K.P. and Wong, Y.W., 1993, Proc. ANZIIS-93 Perth, Western Australia, pp. 512-516
  9. Wong, K.P. and Wong, Y.W., 1994, IEE. Proc. Gen, Gransm. DIstrib, Vol. 141, p. 507
  10. Goldberg, D.E., 1991, Complex Systems, 5, p. 139
  11. Janikow, C.Z. and Michalewicz. Z., 1991, An Eexperimental Comparsion of Binary and Floating Point Representation in Genetic Algorithm, Proceedings of the Fourth Inetrnational Conference on Genetic Algorithm, San Francisco, Morgan Kaufman, pp. 31-36
  12. Davis, L, 1991, Handbook of Genetic Algorithm, New York
  13. De Jong, K.A., 1975, 'An Analysis of the Behavior of a Class of Gentic Adaptive Systems,' Doctoral Dissertation, The University of Michigan, Ann Arbor, Michigan
  14. Krishnakumar, K., 1989, 'Micro-genetic Algorithms for Stationary and Non-stationary Function Optimization,' SPIE, Intelligent Control and Adaptive Systems, Vol. 1196, pp. 289-296
  15. Carroll, D.L., 1996, 'Genetic Algorithms and Optimizing Chemical Oxygen-Iodine Lasers,' Developments in Theoretical and Applied Mechanics, Vol 18, pp. 411-424
  16. Belegundu, A.D. and Chandrupatla, T. R., 1999, Optimization concepts and applications in enginerring, Prentice Hall
  17. Michalewicz, Z., 1996, Evolution Programs, Springer-Verlag. Berlin
  18. 권영두, 권순범, 박창규, 윤영중, 2001, '회전식 수문의 최적설계,' 한국전산구조공학회 논문집, 제 14 권 제 3호, pp. 267-276