Genetic algorithms for the travelling salesman problem: a crossover comparison

This paper addresses an application of genetic algorithms (GA) for solving the travelling salesman problem (TSP), it compares the results of implementing two different types of two-point (1 order) genes crossover, the static and the dynamic approaches, which are used to produce new offspring. By changing three factors; the number of cities, the number of generations and the population size, the goal is to show which approach is better in terms of finding the optimal solution (the shortest path) in as short time as possible as a result of these changes. Besides, it will explore the effect of changing the above factors on finding the optimal solution.

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

[2]  G. Laporte The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[3]  Jyotishree Knowledge based operation and problems representation in genetic algorithms , 2012 .

[4]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.

[5]  Asiya Abdus Salam,et al.  Travelling Salesman Problem using Dynamic Approach , 2014 .

[6]  N. Biggs,et al.  Graph Theory 1736-1936 , 1976 .

[7]  Jie Zhang,et al.  An Improved Genetic Algorithm for TSP , 2007 .

[8]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

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

[10]  Antonio Sartal,et al.  Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: An application to fish aggregating devices , 2015, Comput. Oper. Res..

[11]  Camelia Chira,et al.  Best-order crossover for permutation-based evolutionary algorithms , 2014, Applied Intelligence.

[12]  Z H Ahmed,et al.  GENETIC ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM USING SEQUENTIAL CONSTRUCTIVE CROSSOVER , 2010 .

[13]  Jaafar Abouchabaka,et al.  A Comparative Study of Adaptive Crossover Operators for Genetic Algorithms to Resolve the Traveling Salesman Problem , 2011, ArXiv.

[14]  Kanchan Rani,et al.  SOLVING TRAVELLING SALESMAN PROBLEM USING GENETIC A LGORITHM BASED ON HEURISTIC CROSSOVER AND MUTATION OPERATOR , 2014 .

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

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

[17]  L. Darrell Whitley,et al.  Functions as Permutations: Regarding No Free Lunch, Walsh Analysis and Summary Statistics , 2000, PPSN.

[18]  James E. Baker,et al.  Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.

[19]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[20]  P. Moscato On Genetic Crossover Operators for Relative Order Preservation , 1989 .

[21]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.