Generalized asymmetric partition crossover (GAPX) for the asymmetric TSP

Abstract

The Generalized Partition Crossover (GPX) constructs new solutions for the Traveling Salesman Problem (TSP) by finding recombining partitions with one entry and one exit in the graph composed by the union of two parent solutions. If there are k recombining partitions in the union graph, 2^k-2 solutions are simultaneously exploited by GPX. Generalized… (More)
DOI: 10.1145/2576768.2598245

Topics

5 Figures and Tables

Statistics

02040201520162017
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.