Generalized asymmetric partition crossover (GAPX) for the asymmetric TSP

@inproceedings{Tins2014GeneralizedAP,
  title={Generalized asymmetric partition crossover (GAPX) for the asymmetric TSP},
  author={Renato Tin{\'o}s and L. Darrell Whitley and Gabriela Ochoa},
  booktitle={GECCO},
  year={2014}
}
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 Asymmetric Partition Crossover (GAPX) is introduced; it finds more recombining partitions and can also find partitions for the asymmetric TSP… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

A Fusion Mechanism for the Generalized Asymmetric Partition Crossover

2018 IEEE Congress on Evolutionary Computation (CEC) • 2018
View 7 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-6 of 6 references

TSPLIB 95

G. Reinelt
http://www.iwr.uniheidelberg.de/groups/comopt/software/TSPLIB95/ • 1995
View 6 Excerpts
Highly Influenced

A new genetic algorithm for the asymmetric traveling salesman problem

Expert Syst. Appl. • 2012
View 10 Excerpts
Highly Influenced

An effective implementation of the Lin-Kernighan traveling salesman heuristic

European Journal of Operational Research • 2000
View 4 Excerpts
Highly Influenced