A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover
We present a hybrid genetic algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for the Traveling Salesman Problem (TSP). GPX is respectful, transmits alleles and is capable of tunneling directly to new local optima. Our results show that the hybrid genetic algorithm quickly finds optimal and near optimal solution on problems ranging from 500 to 1817 cities using a population size of 10. It is also superior to Chained-LK given similar computational effort. Additional analysis shows that all the edges found in the globally optimal solution are present in a population after only a few generations in almost every run. Furthermore the number of unique edges in the population is also less than twice the problem size.
KeywordsTraveling Salesman Problem Generalized Partition Crossover Hybrid Genetic Algorithm Chained-LK
Unable to display preview. Download preview PDF.
- 3.Radcliffe, N., Surry, P.: Fitness variance of formae and performance predictions. In: Whitley, D., Vose, M. (eds.) FOGA - 3, pp. 51–72. Morgan Kaufmann, San Francisco (1995)Google Scholar
- 4.Croes, G.: A method for solving traveling-salesman problems. Operations Research, 791–812 (1958)Google Scholar
- 5.Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 498–516 (1973)Google Scholar
- 7.Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: A case study in local optimization. In: Aarts, E.H.L., Lenstra, J. (eds.) Local Search in Combinatorial Optimization, pp. 215–310. John Wiley and Sons Ltd., Chichester (1997)Google Scholar