On the Effect of Adding Nodes to TSP Instances: An Empirical Analysis

G. C. Crişan, Elena Nechita, Vasile Palade

    Research output: Chapter in Book/Report/Conference proceedingChapter

    2 Citations (Scopus)


    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.
    Original languageEnglish
    Title of host publicationAdvances in Combining Intelligent Methods
    EditorsIoannis Hatzilygeroudis, Vasile Palade, Jim Prentzas
    Place of PublicationSwitzerland
    PublisherSpringer Verlag
    ISBN (Print)978-3-319-46200-4, 978-3-319-46199-1
    Publication statusPublished - 20 Nov 2016

    Bibliographical note

    The full text is not available on the repository.


    • Combinatorial optimization
    • Traveling Salesman Problem
    • Exact algorithms
    • Metaheuristics
    • Orthodromic distance


    Dive into the research topics of 'On the Effect of Adding Nodes to TSP Instances: An Empirical Analysis'. Together they form a unique fingerprint.

    Cite this