We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
CONVERGENCE RATE OF THE SUCCESSIVE ZOOMING GENETIC ALGORITHM FOR BAND-WIDTHS OF EQUALITY CONSTRAINT.
- Authors
KWON, Y. D.; HAN, S. W.; DO, J.W.
- Abstract
Modern optimization techniques, such as the steepest descent method, Newton's method, Rosen's gradient projection method, genetic algorithms, etc., have been developed and quickly improved with the progress of digital computers. The steepest descent method and Newton's method are applied efficiently to unconstrained problems. For many engineering problems involving constraints, the genetic algorithm and SUMT1are applied with relative ease. Genetic algorithms2have global search characteristics and relatively good convergence rates. Recently, a Successive Zooming Genetic Algorithm (SZGA)3,4 was introduced that can search the precise optimal solution at any level of desired accuracy. In the case of engineering problems involving an equality constraint, even if good optimization techniques are applied to the constraint problems, a proper constraint range can lead to a more rapid convergence and precise solution. This study investigated the proper band-width of an equality constraint using the Successive Zooming Genetic Algorithm (SZGA) technique both theoretically and numerically. We were able to find a certain band-width range of the rapid convergence for each problem, and a broad but more general one too.
- Subjects
STOCHASTIC convergence; GENETIC algorithms; NEWTON-Raphson method; COMPUTERS; BANDWIDTHS; CONSTRAINTS (Physics)
- Publication
International Journal of Modern Physics B: Condensed Matter Physics; Statistical Physics; Applied Physics, 2010, Vol 24, Issue 15/16, p2731
- ISSN
0217-9792
- Publication type
Article
- DOI
10.1142/S0217979210065544