Hybrid Algorithms for Electromagnetic Problems and the No-Free-Lunch Framework

A popular approach to electromagnetic design is based on generic optimization algorithms which mimic natural phenomena. These algorithms have been proved feasible through multiple experiments even though there is no standard procedure to their design for a particular problem. Hybrid schemes allow an insightful and quite efficient approach towards their design. Furthermore, an intrinsic characteristic of this class of algorithms is their randomness, which is precisely the base the no-free-lunch theorem exploits to measure their fit to a particular problem. This characterization permits a reproducible comparison between algorithms through their fitness density functions

[1]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

[2]  James Smith,et al.  A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.

[3]  D. Marcano,et al.  Synthesis of antenna arrays using genetic algorithms , 1995, Proceedings of First International Caracas Conference on Devices, Circuits and Systems.

[4]  Kate Smith-Miles,et al.  On learning algorithm selection for classification , 2006, Appl. Soft Comput..

[5]  S. Rengarajan,et al.  Genetic algorithms in the design and optimization of antenna array patterns , 1999 .

[6]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[7]  Yu-Bo Tian,et al.  Improve the performance of a linear array by changing the spaces among array elements in terms of genetic algorithm , 2005 .

[8]  P. Stadler.  Spectral Landscape Theory , 1999 .

[9]  Yilong Lu,et al.  Sidelobe reduction in array-pattern synthesis using genetic algorithm , 1997 .

[10]  P.L. Werner,et al.  The design of miniature three-element stochastic Yagi-Uda arrays using particle swarm optimization , 2006, IEEE Antennas and Wireless Propagation Letters.

[11]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[12]  Assaf Naor,et al.  Rigorous location of phase transitions in hard optimization problems , 2005, Nature.

[13]  C. Christodoulou,et al.  Linear array geometry synthesis with minimum sidelobe level and null control using particle swarm optimization , 2005, IEEE Transactions on Antennas and Propagation.

[14]  Eric Michielssen,et al.  The control of adaptive antenna arrays with genetic algorithms using dominance and diploidy , 2001 .

[15]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[16]  L. D. Whitley,et al.  Complexity Theory and the No Free Lunch Theorem , 2005 .

[17]  David B. Davidson.  Genetic Design of Linear Antenna Arrays , 2000 .

[18]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[19]  Y. Rahmat-Samii,et al.  Particle swarm optimization in electromagnetics , 2004, IEEE Transactions on Antennas and Propagation.