A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Understanding TSP Difficulty by Learning from Evolved Instances
[chapter]
2010
Lecture Notes in Computer Science
Whether the goal is performance prediction, or insights into the relationships between algorithm performance and instance characteristics, a comprehensive set of meta-data from which relationships can be learned is needed. This paper provides a methodology to determine if the meta-data is sufficient, and demonstrates the critical role played by instance generation methods. Instances of the Travelling Salesman Problem (TSP) are evolved using an evolutionary algorithm to produce distinct classes
doi:10.1007/978-3-642-13800-3_29
fatcat:mgowrkd2ibgajfvhrn4bx2hf64