Validity Constraints and the TSP – GeneRepair of Genetic Algorithms

G.G. Mitchell (Ireland)


Genetic Algorithms, TSP, Optimisation, Problem Constraints, GeneRepair.


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.

Important Links:

Go Back