From Robin's Wiki

MastersWork: RefWatsonEtAl1998

The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt

J. Watson, C. Ross, V. Eisele, J. Denton, J. Bins, C. Guerra, L. Darrell Whitley and A. Howe

Abstract:

Optimal results for the Traveling Salesrep Problem have been reported on problems with up to 3038 cities using a GA with Edge Assembly Crossover (EAX). This paper first attempts to independently replicate these results on Padberg's 532 city problem. We then evaluate the performance contribution of the various algorithm components. The incorporation of 2-opt into the EAX GA is also explored. Finally, comparative results are presented for a population-based form of 2-opt that uses partial restarts.

Bibliographical:

 
@inproceedings{ watson98traveling,
    author = "J. Watson and C. Ross and V. Eisele and J. Denton and J. Bins and C. Guerra and L. Darrell Whitley and A. Howe",
    title = "The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt",
    booktitle = "Proceedings of {theFifthConference} on Parallel Problem Solving from Nature({PPSN}\enskip V)",
    month = "27--30",
    publisher = "Springer",
    address = "Amsterdam",
    editor = "Agoston E. Eiben and Thomas B{\"a}ck and Marc Schoenauer and Hans-Paul Schwefel",
    pages = "823--832",
    year = "1998",
    url = "citeseer.ist.psu.edu/watson98traveling.html" }

URL:

http://citeseer.ist.psu.edu/watson98traveling.html

Notes:

Details using the Edge Assembly Crossover system, along with heuristic-type local optimisations. Probably not so useful for what I'm doing, but interesting nonetheless.