Our human society is experiencing complex problems nowadays, which require large amounts of computing resources, fast algorithms and efficient implementations. These real-world problems generate new instances for the classical, academic problems as well as new data collections that can be used for assessing the available solving packages. This paper focuses on the Traveling Salesman Problem, which is one of the most studied combinatorial optimization problems, with many variants and broad applications. In order to allow a smooth integration with the current Geographic Information Systems (GIS) technologies, the instances described in this work are specified by geographic coordinates, and they use the orthodromic distance. A sequence of similar instances is defined, and the characteristics of the state-of-the-art exact solver results on these instances are presented and discussed.
|Title of host publication||Advances in Combining Intelligent Methods|
|Editors||Ioannis Hatzilygeroudis, Vasile Palade, Jim Prentzas|
|Place of Publication||Switzerland|
|ISBN (Print)||978-3-319-46200-4, 978-3-319-46199-1|
|Publication status||Published - 20 Nov 2016|
Bibliographical noteThe full text is not available on the repository.
- Combinatorial optimization
- Traveling Salesman Problem
- Exact algorithms
- Orthodromic distance
Crişan, G. C., Nechita, E., & Palade, V. (2016). On the Effect of Adding Nodes to TSP Instances: An Empirical Analysis. In I. Hatzilygeroudis, V. Palade, & J. Prentzas (Eds.), Advances in Combining Intelligent Methods (Vol. 116, pp. 25-45). Switzerland: Springer Verlag. https://doi.org/10.1007/978-3-319-46200-4_2