Abstract
The scope of this paper is to introduce two novel TSP instances based on the freely available geographic coordinates of the main cities from Spain and Portugal. We analyze in the case of the described instances the hardness, the quality of the provided solutions and the corresponding running times, using the Lin-Kernighan heuristic algorithm with different starting solutions and Applegate et al’s branch and cut algorithm.
Author supplied keywords
Cite
CITATION STYLE
Crişan, G. C., Pintea, C. M., Pop, P., & Matei, O. (2016). An analysis of the hardness of novel TSP Iberian instances. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9648, pp. 353–364). Springer Verlag. https://doi.org/10.1007/978-3-319-32034-2_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
