Traveling Salesman Problems with Additional Ordering Constraints

Achim Hildenbrandt ()
Additional contact information
Achim Hildenbrandt: INF 205

A chapter in Operations Research Proceedings 2017, 2018, pp 221-227 from Springer

Abstract: Abstract In the field of disaster logistics one often faces tasks which can be modeled as a TSP with additional ordering constraints. In this paper we therefore want to consider four different variants of the TSP. In detail we consider the Clustered TSP, the Ordered Clustered TSP, the Precedence Constraint TSP and the Target Visitation Problem. For each of these four problems we discuss IP models and examine the connections between them. We also present a branch-and-cut algorithm which can solve these problems to optimality.

Keywords: Combinatorial optimization; TSP; Branch-and-cut (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:oprchp:978-3-319-89920-6_31

Ordering information: This item can be ordered from
http://www.springer.com/9783319899206

DOI: 10.1007/978-3-319-89920-6_31

Access Statistics for this chapter

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