In this paper, a greedy Genetic Algorithm for continuous variables electromagnetic optimization problems is presented, The presented algorithm is characterized by the use of a nonlinear simplex method as a principal optimizator, and of a greedy genetic algorithm to explore the search space, realizing a balance between diversity and a bias toward fitter individuals. The resulting algorithm merges the efficiency typical of calculus-based search with the robustness typical of random methods, A detailed comparison of performances obtained implementing several strategies is eventually presented, using an electromagnetic design test problem.
A greedy genetic algorithm for continuous variables electromagnetic optimization problems
FANNI, ALESSANDRA;MARCHESI, MICHELE;Serri A;USAI, MARIANGELA
1997-01-01
Abstract
In this paper, a greedy Genetic Algorithm for continuous variables electromagnetic optimization problems is presented, The presented algorithm is characterized by the use of a nonlinear simplex method as a principal optimizator, and of a greedy genetic algorithm to explore the search space, realizing a balance between diversity and a bias toward fitter individuals. The resulting algorithm merges the efficiency typical of calculus-based search with the robustness typical of random methods, A detailed comparison of performances obtained implementing several strategies is eventually presented, using an electromagnetic design test problem.
I metadati presenti in IRIS UNICA sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono protetti da diritto d'autore, salvo diversa indicazione.
