论文信息 - A greedy genetic algorithm for continuous variables electromagnetic optimization problems

A greedy genetic algorithm for continuous variables electromagnetic optimization problems

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 optimizer, 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 the performance obtained implementing several strategies is presented, using an electromagnetic design test problem.

[1] M. Marchesi. A new class of optimization algorithms for circuit design and modelling , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[2] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[3] U. Brammer,et al. Optimization of ferromagnetic shields for solenoidal SMES , 1996 .

[4] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5] John A. Nelder,et al. A Simplex Method for Function Minimization , 1965, Comput. J..

[6] Jean-Michel Renders,et al. Hybrid methods using genetic algorithms for global optimization , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[7] D. E. Goldberg,et al. Genetic Algorithms in Search , 1989 .

[8] M. Repetto,et al. A combined strategy for optimization in nonlinear magnetic problems using simulated annealing and search techniques , 1992 .

[9] M. Repetto,et al. Multiobjective optimization in magnetostatics: a proposal for benchmark problems , 1996 .

[10] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..