Multi-offspring genetic algorithm and its application to the traveling salesman problem

The paper provides a multi-offspring genetic algorithm (MO-GA) in accordance with biological evolutionary and mathematical ecological theory, and illustrates its application in the traveling salesman problem (TSP) in comparison to the basic genetic algorithm (BGA). In MO-GA, the number of offsprings is significantly increased as compared to the BGA. MO-GA increases the probability of producing excellent individuals, and also makes the population more competitive, thus yielding considerable improvement. Test results with six TSP examples show that MO-GA has faster speed, and the number and time of iterations are significantly reduced as compared to the BGA.

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

[2]  Wu Qiu-feng.  The Improved Research on Actual Number Genetic Algorithms , 2006 .

[3]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[4]  Shalini S Singh,et al.  Study of Variation in TSP using Genetic Algorithm and Its Operator Comparison , 2013 .

[5]  Augustine O. Esogbue,et al.  Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach , 1974 .

[6]  Lee Aaron Newberg,et al.  Physical mapping of chromosomes: A combinatorial problem in molecular biology , 1995, SODA '93.

[7]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[8]  L. Darrell Whitley,et al.  Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.

[9]  Gao Hai-chang.  Reviews of the Meta-heuristic Algorithms for TSP , 2006 .

[10]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[11]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[12]  Liang Dao-lei.  A greedy GA of traveling salesman problem , 2013 .

[13]  Gaston H. Gonnet,et al.  Using traveling salesman problem algorithms for evolutionary tree construction , 2000, Bioinform..

[14]  Dai Qiao-yan.  Genetic Algorithm for TSP , 2004 .

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

[16]  Adewole Philip,et al.  A Genetic Algorithm for Solving Travelling Salesman Problem , 2011 .

[17]  Constantino Tsallis,et al.  Optimization by Simulated Annealing: Recent Progress , 1995 .

[18]  John J. Grefenstette,et al.  Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

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

[20]  Darrell Whitley,et al.  Scheduling problems and traveling salesman: the genetic edge recombination , 1989 .

[21]  Hu Yulan.  A Novel Greedy Genetic Algorithm for Traveling Salesman Problem , 2004 .