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;USAI, MARIANGELA
1997

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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11584/95398
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 15
social impact