The Introduction of Asymmetry on Traditional 2-Parent Crossover Operators for Crowding and Its Effects

This paper proposes a novel crowding method, which we call "Crowding with Asymmetric Crossover CAX" that can be applied to traditional 2-parent crossover operators. The asymmetric crossover operator begins with two parents. Then two offspring individuals are created, each offspring taking more characteristics from one of the two parents. This is an easy method to perform replacement between parents and offspring individuals. Experimental results showed that CAX can increases the performance of traditional 2-parent crossover operators in finding global optimal solutions. CAX is also useful to find multiple solutions niching.

[1]  Franz Rendl,et al.  QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..

[2]  Shigeyoshi Tsutsui,et al.  Forking Genetic Algorithms: GAs with Search Space Division Schemes , 1997, Evolutionary Computation.

[3]  David E. Goldberg,et al.  Probabilistic Crowding: Deterministic Crowding with Probabilistic Replacement , 1999 .

[4]  Ole J Mengshoel,et al.  The Crowding Approach to Niching in Genetic Algorithms , 2008, Evolutionary Computation.

[5]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[6]  Isao Ono,et al.  A Real Coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distributed Crossover , 1997, ICGA.

[7]  Shigeyoshi Tsutsui,et al.  ACO with tabu search on a GPU for solving QAPs using move-cost adjusted thread assignment , 2011, GECCO '11.

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

[9]  S. E. Karisch,et al.  QAPLIB-A quadratic assignment problem library , 1991 .

[10]  David Pisinger,et al.  A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..

[11]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[12]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

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

[14]  Shigeyoshi Tsutsui.  cAS: Ant Colony Optimization with Cunning Ants , 2006, PPSN.

[15]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[16]  Edmund K. Burke,et al.  Parallel Problem Solving from Nature - PPSN IX: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Proceedings , 2006, PPSN.

[17]  Ole J. Mengshoel,et al.  Generalized crowding for genetic algorithms , 2010, GECCO '10.

[18]  Samir W. Mahfoud.  Niching methods for genetic algorithms , 1996 .