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.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | A greedy genetic algorithm for continuous variables electromagnetic optimization problems | |
Autori: | ||
Data di pubblicazione: | 1997 | |
Rivista: | ||
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. | |
Handle: | http://hdl.handle.net/11584/95398 | |
Tipologia: | 1.1 Articolo in rivista |