Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.