Anisotropic selection in cellular genetic algorithms

In this paper we introduce a new selection scheme in cellular genetic algorithms (cGAs). Anisotropic Selection (AS) promotes diversity and allows accurate control of the selective pressure. First we compare this new scheme with the classical rectangular grid shapes solution according to the selective pressure: we can obtain the same takeover time with the two techniques although the spreading of the best individual is different. We then give experimental results that show to what extent AS promotes the emergence of niches that support low coupling and high cohesion. Finally, using a cGA with anisotropic selection on a Quadratic Assignment Problem we show the existence of an anisotropic optimal value for which the best average performance is observed. Further work will focus on the selective pressure self-adjustment ability provided by this new selection scheme.

[1]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[2]  Enrique Alba,et al.  The exploration/exploitation tradeoff in dynamic cellular genetic algorithms , 2005, IEEE Transactions on Evolutionary Computation.

[3]  Marco Tomassini,et al.  Modeling Selection Intensity for Linear Cellular Evolutionary Algorithms , 2003, Artificial Evolution.

[4]  V. V. Miagkikh,et al.  Hybrid genetic and local search heuristic for the Quadratic Assignment problem , 1996 .

[5]  Kenneth A. De Jong,et al.  An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms , 1996, PPSN.

[6]  Thomas E. Vollmann,et al.  An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[7]  Enrique Alba,et al.  Modeling Selection Intensity for Toroidal Cellular Evolutionary Algorithms , 2004, GECCO.

[8]  Kenneth A. De Jong,et al.  On Decentralizing Selection Algorithms , 1995, ICGA.

[9]  Enrique Alba,et al.  Cellular Evolutionary Algorithms: Evaluating the Influence of Ratio , 2000, PPSN.

[10]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[11]  Alexander P. Topchy,et al.  COMBINED GENETIC AND LOCAL SEARCH ALGORITHM FOR THE QUADRATIC ASSIGNMENT PROBLEM , 2000 .

[12]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[13]  Bernard Manderick,et al.  A Massively Parallel Genetic Algorithm: Implementation and First Analysis , 1991, ICGA.

[14]  W. Cedeno,et al.  On the use of niching for dynamic landscapes , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[15]  Bruno Sareni,et al.  Fitness sharing and niching methods revisited , 1998, IEEE Trans. Evol. Comput..