A Study of Multi-parent Crossover Operators in a Memetic Algorithm

Using unconstrained binary quadratic programming problem as a case study, we investigate the role of multi-parent crossover operators within the memetic algorithm framework. We evaluate the performance of four multi-parent crossover operators (called MSX, Diagonal, U-Scan and OB-Scan) and provide evidences and insights as to why one particular multi-parent crossover operator leads to better computational results than another one. For this purpose, we employ several indicators like population entropy and average solution distance in the population.

[1]  Andrea Lodi,et al.  An evolutionary heuristic for quadratic 0-1 programming , 1999, Eur. J. Oper. Res..

[2]  F. Glover,et al.  A Study of Memetic Search with Multi-Parent Crossover for UBQP , 2010 .

[3]  Gintaras Palubeckis,et al.  Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem , 2004, Ann. Oper. Res..

[4]  A. E. Eiben,et al.  Genetic algorithms with multi-parent recombination , 1994, PPSN.

[5]  F. Glover,et al.  Adaptive Memory Tabu Search for Binary Quadratic Programs , 1998 .

[6]  Kengo Katayama,et al.  Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm , 2000, GECCO.

[7]  Pablo Moscato,et al.  Memetic algorithms: a short introduction , 1999 .

[8]  P. Merz,et al.  Memetic algorithms for the unconstrained binary quadratic programming problem. , 2004, Bio Systems.

[9]  Charles Fleurent,et al.  Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique, and Satisfiability , 1993, Cliques, Coloring, and Satisfiability.

[10]  Fred W. Glover,et al.  A unified modeling and solution framework for combinatorial optimization problems , 2004, OR Spectr..

[11]  Jens Gottlieb,et al.  Evolutionary Computation in Combinatorial Optimization , 2006, Lecture Notes in Computer Science.

[12]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[13]  Reinhard Männer,et al.  Parallel Problem Solving from Nature — PPSN III , 1994, Lecture Notes in Computer Science.

[14]  István Borgulya.  An Evolutionary Algorithm for the Unconstrained Binary Quadratic Problems , 2004, Fuzzy Days.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  I. Borgulya.  An Evolutionary Algorithm for the , 2005 .

[17]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[18]  Fred W. Glover,et al.  A Study of Memetic Search with Multi-parent Combination for UBQP , 2010, EvoCOP.