A new tool in electrostatics using a really-coded multipopulation genetic algorithm tuned through analytical test problems

Abstract We describe a new genetic algorithm (GA) to optimize multimodal continuous functions. It is based on a splitting of the traditional GA into a sequence of three processes. The first process creates several sub-populations using the information entropy theory. The second process applies the genetic operators on every sub-population. We then determine the best point s∗ among the best solutions issued from each of the preceding sub-populations. In the neighborhood of this point s∗ is generated a population used to initialize a traditional GA in the third process. Other features of our program must be pointed out: in particular, we use a real-value coding, more adapted to optimization handling continuous variables; the variety of the initial population is ensured by controlling its entropy. A comparison of performances with competitive metaheuristics is presented, using analytical test functions of which local and global minimums are known. Finally the tool is successfully applied to an electrode benchmark problem.

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

[2]  Thomas Back Proceedings of the Seventh International Conference on Genetic Algorithms: Michigan State University, East Lansing, MI, July 19-23, 1997 , 1997 .

[3]  J. Chun,et al.  Shape optimization of electromagnetic devices using immune algorithm , 1997 .

[4]  Patrick Siarry,et al.  A Continuous Genetic Algorithm Designed for the Global Optimization of Multimodal Functions , 2000, J. Heuristics.

[5]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[6]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[7]  H. Singer,et al.  A Charge Simulation Method for the Calculation of High Voltage Fields , 1974 .

[8]  Bruno Sareni,et al.  Niching genetic algorithms for optimization in electromagnetics. II. Shape optimization of electrodes using the CSM , 1998 .

[9]  Wesley E. Snyder,et al.  Optimization of functions with many minima , 1991, IEEE Trans. Syst. Man Cybern..

[10]  Patrick Siarry,et al.  Enhanced simulated annealing for globally minimizing functions of many-continuous variables , 1997, TOMS.

[11]  Roberto Battiti,et al.  The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization , 1996, Ann. Oper. Res..

[12]  Jacek Klinowski,et al.  Taboo Search: An Approach to the Multiple Minima Problem , 1995, Science.

[13]  C. B. Lucasius,et al.  Understanding and using genetic algorithms Part 1. Concepts, properties and context , 1993 .

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