A k-level data structure for large-scale traveling salesman problems

Colin Osterman and César Rego ()
Additional contact information
Colin Osterman: University of Mississippi
César Rego: University of Mississippi

Annals of Operations Research, 2016, vol. 244, issue 2, No 15, 583-601

Abstract: Abstract The problem of data representation is fundamental to the efficiency of search algorithms for the traveling salesman problem (TSP). The computational effort required to perform such tour operations as traversal and subpath reversal considerably influence algorithm design and performance. We propose a new data structure—the k-level satellite tree—for representing a TSP tour with a discussion of properties in the framework of general tour operations. The k-level satellite tree representation is shown to be significantly more efficient than its predecessors for large-scale instances.

Keywords: Algorithms; Data structures; Combinatorial optimization; Ejection chains; Traveling salesman problem (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-016-2159-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:244:y:2016:i:2:d:10.1007_s10479-016-2159-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-016-2159-7

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().