Convergence enhanced genetic algorithm with successive zooming method for solving continuous optimization problems

Young-Doo Kwon

doi:10.1016/S0045-7949(03)00183-4

Convergence enhanced genetic algorithm with successive zooming method for solving continuous optimization problems

2003-08-01

82

PRE

AI

DOI：10.1016/S0045-7949(03)00183-4

原文链接

原文求助

摘要

En 中文

A dynamic parameter encoding method was previously presented by Schraudolph and Belew [J Mach Learn 9 (1992) 9] for solving optimizing problems using discrete zooming factors. In contrast, the current paper proposes a successive zooming genetic algorithm (SZGA) for identifying global solutions using continuous zooming factors. To improve the local fine-tuning capability of a genetic algorithm (GA), a new method is introduced whereby the search space is zoomed around the design point with the best fitness per 100 generations. Furthermore, the reliability of the optimized solution is determined based on a theory of probability. To demonstrate the superiority of the proposed algorithm, a simple genetic algorithm, micro-genetic algorithm, and the proposed algorithm were compared as regards their ability to minimize multi-modal continuous functions and simple continuous functions. The results confirmed that the proposed SZGA significantly improved the ability of a GA to identify a precise global minimum. As an example of structural optimization, 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 conventional GAs. (C) 2003 Elsevier Science Ltd. All rights reserved.

Keyword:

successive zooming genetic algorithm (SZGA)

probability

zooming factor

Convergence enhanced genetic algorithm with successive zooming method for solving continuous optimization problems

摘要

AI总结

期刊

机构

引用论文