Darrell Whitley
ABSTRACT
A new recombination operator is introduced for the Traveling Salesman Problem called partition crossover. Theoretical and empirical results indicate that when two local optima are recombined using partition crossover, two offspring are produced that are highly likely to also be local optima. Thus, the operator is capable of jumping or tunneling from two local optima to two new and distinct local optima without searching intermediate solutions. The operator is respectful and it transmits alleles which means that 1) all common edges from the two parents are inherited and 2) the offspring are constructed using only edges inherited from the two parents. Partition crossover is not always feasible: sometimes two new Hamiltonian circuits cannot be constructed by the operator using only edges inherited from the two parents. But empirical results indicate that partition crossover is feasible 95 percent of the time when recombining randomly selected local optima. Furthermore, from a sample of local optima that are within a short random walk of the global optimum, partition crossover typically relocates the global optimum in a single move when crossover is feasible.
- K. Boese. Cost versus distance in the traveling salesman problem. Technical report, Computer Science Department, UCLA 1995.Google Scholar
- T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. McGraw Hill, New York, 1990. Google ScholarDigital Library
- Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979. Google ScholarDigital Library
- David Goldberg and Jr. Robert Lingle. Alleles, Loci, and the Traveling Salesman Problem. In International Conf. on GAs, pages 154--159, 1985. Google ScholarDigital Library
- J. Grefensette. Incorporating Problem Specific Knowledge in Genetic Algorithms. In L. Davis, ed, Genetic Algorithms and Simulated Annealing, pages 42--60. Morgan Kaufmann, 1987.Google Scholar
- D. S. Johnson and L. A. McGeoch. The Traveling Salesman Problem: A Case Study in Local Optimization. In E. H. L. Aarts and J.K. Lenstra, eds, Local Search in Combinatorial Optimization, pages 215--310. Wiley, 1997.Google Scholar
- Keith E. Mathias and L. Darrell Whitley. Genetic Operators, the Fitness Landscape and the Traveling Salesman Problem. In Parallel Problem Solving from Nature, 2, pages 219--228. Elsevier, 1992.Google Scholar
- H. Mühlenbein. Evolution in Time and Space: The Parallel Genetic Algorithm. In G. Rawlins, ed, FOGA -1, pages 316--337. Morgan Kaufmann, 1991.Google Scholar
- Yuichi Nagata and Shigenobu Kobayashi. Edge Assembly Crossover: A High--Power Genetic Algorithm for the Traveling Salesman Problem. In T. Bäck, editor, 7th International Conf. on GAs, pages 450--457. Morgan Kaufmann, 1997.Google Scholar
- I. Oliver, D. Smith, and J. Holland. A Study of Permutation Crossover Operators on the Traveling Salesman Problem. In GAs and Their Applications: ICGA 2 Erlbaum, 1987. Google ScholarDigital Library
- W. Padberg and G. Rinaldi. Optimization of a 532 City Symmetric TSP. Optimization Research Letters, 6(1):1--7, 1987.Google ScholarDigital Library
- Nicholas J. Radcliffe. The Algebra of Genetic Algorithms. Annals of Maths and Artificial Intelligence, 10:339--384, 1994.Google ScholarCross Ref
- N. J. Radcliffe and P. D. Surry. Fitness Variance of Formae and Performance Predictions. In D. Whitley and M. Vose, eds, FOGA -- 3, pages 51--72. Morgan Kaufmann, 1995.Google Scholar
- L. Darrell Whitley, Timothy Starkweather, and Daniel Shaner. The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination. In L. Davis, ed, Handbook of Genetic Algorithms, pages 350--372. Van Nostrand Reinhold, NY, 1991.Google Scholar
Index Terms
- Tunneling between optima: partition crossover for the traveling salesman problem
Recommendations
Radical epistasis and the genotype-phenotype relationship
Models of evolution often assume that the offspring of two genotypes, which are genetically intermediate by definition, are also phenotypically intermediate. The continuity between genotype and phenotype interferes with the process of evolution on ...
Self-feedback differential evolution adapting to fitness landscape characteristics
Differential evolution (DE) is one of the most powerful and versatile evolutionary algorithms for efficiently solving complex real-world optimization problems in recent years. Since its introduction in 1995, the research focus in DE has mostly been on ...
Escaping Local Optima with Diversity Mechanisms and Crossover
GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016Population diversity is essential for the effective use of any crossover operator. We compare seven commonly used diversity mechanisms and prove rigorous run time bounds for the (μ+1) GA using uniform crossover on the fitness function Jumpk. All ...
Comments