Multi-parent extension of partially mapped crossover for combinatorial optimization problems

This paper proposes the multi-parent partially mapped crossover (MPPMX), which generalizes the partially mapped crossover (PMX) to a multi-parent crossover. The mapping list and legalization of PMX are modified to deal with the issues that arise from the increase of parents in PMX. Experimental results on five traveling salesman problems show that MPPMX significantly improves PMX by up to 13.95% in mean tour length. These preferable results not only demonstrate the advantage of the proposed MPPMX over PMX, but also confirm the merit of using more than two parents in crossover.

[1]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[2]  S. Tsutsui,et al.  On the Effect of ulti-parents ecombination in Genetic Algorithms , 1998 .

[3]  Iouliia Skliarova,et al.  FPGA-Based Implementation of Genetic Algorithm for the Traveling Salesman Problem and Its Industrial Application , 2002, IEA/AIE.

[4]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[5]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[6]  Shigeyoshi Tsutsui,et al.  A study on the effect of multi-parent recombination in real coded genetic algorithms , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[7]  A. E. Eiben,et al.  Diagonal Crossover in Genetic Algorithms for Numerical Optimization , 1997 .

[8]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[9]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[10]  A. E. Eiben,et al.  Multiparent recombination in evolutionary computing , 2002 .

[11]  William Ho,et al.  An integrated scheduling problem of PCB components on sequential pick-and-place machines: Mathematical models and heuristic solutions , 2009, Expert Syst. Appl..

[12]  Zoheir Ezziane,et al.  Applications of artificial intelligence in bioinformatics: A review , 2006, Expert Syst. Appl..

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

[14]  M. Yamamura,et al.  Multi-parent recombination with simplex crossover in real coded genetic algorithms , 1999 .

[15]  Shigeyoshi Tsutsui,et al.  Advances in evolutionary computing: theory and applications , 2003 .

[16]  A. E. Eiben,et al.  Orgy in the Computer: Multi-Parent Reproduction in Genetic Algorithms , 1995, ECAL.

[17]  Hwai-En Tseng,et al.  Using memetic algorithms with guided local search to solve assembly sequence planning , 2007, Expert Syst. Appl..

[18]  Shigenobu Kobayashi,et al.  Multi-Parental Extension of the Unimodal Normal Distribution Crossover for Real-Coded Genetic Algorithms , 2000 .

[19]  David E. Goldberg,et al.  AllelesLociand the Traveling Salesman Problem , 1985, ICGA.

[20]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[21]  Xiaogang Ruan,et al.  A new Multi-parent Recombination Genetic Algorithm , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[22]  Heinz Mühlenbein,et al.  The parallel genetic algorithm as function optimizer , 1991, Parallel Comput..

[23]  Jason Chao-Hsien Pan,et al.  A hybrid genetic algorithm for no-wait job shop scheduling problems , 2009, Expert Syst. Appl..

[24]  H. Muhlenbein,et al.  Gene pool recombination and utilization of covariances for the Breeder Genetic Algorithm , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[25]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[26]  Rolf Drechsler,et al.  A genetic algorithm for RKRO minimization , 1997 .