Validity Constraints and the TSP - GeneRepair of Genetic Algorithms

In this paper we present the outcome of a sets of experiments to evaluate the effectiveness of a new adjunct genetic operator GeneRepair. This operator was developed to correct invlaid tours which may be generated following crossover or mutation of our particular implementation of the genetic algorithm. Following implementation and testing of our genetic algotihm with GeneRepair we found a significant positive side in our results. Using GeneRepair along side traditional crossover and mutation operators we have been able to travers the search space of a problem and generate very good results in an extremely efficent manner, in both time and number of evaluations required.

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

[2]  D. Fogel.  Applying evolutionary programming to selected traveling salesman problems , 1993 .

[3]  Balamurali Krishna Ambati,et al.  Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem , 2004, Biological Cybernetics.

[4]  D. Fogel.  An evolutionary approach to the traveling salesman problem , 1988, Biological Cybernetics.

[5]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

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

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

[8]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[9]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[10]  Penousal Machado,et al.  GVR: A New Genetic Representation for the Vehicle Routing Problem , 2002, AICS.

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

[12]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

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

[14]  D. O'Donoghue,et al.  GeneRepair - A Repair Operator for Genetic Algorithms , 2003 .

[15]  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 .