1998
DOI: 10.1287/trsc.32.1.12
|View full text |Cite
|
Sign up to set email alerts
|

An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows

Abstract: This paper presents a constraint logic programming model for the traveling salesman problem with time windows which yields an exact branch-and-bound optimization algorithm without any restrictive assumption on the time windows. Unlike dynamic programming approaches whose performance relies heavily on the degree of discretization applied to the data, our algorithm does not suffer from such space-complexity issues. The data-driven mechanism at its core more fully exploits pruning rules developed in operations re… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
93
0
3

Year Published

2000
2000
2014
2014

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 138 publications
(96 citation statements)
references
References 17 publications
0
93
0
3
Order By: Relevance
“…In the first step, a Hamiltonian circuit successor variable is imposed. This is achieved by using the classical circuit [7] constraint on successor variables for dynamic subtour filtering. The date and successor variables are linked with the element constraint by imposing that the production date of p is before the production date of its successors:…”
Section: A Constraint Programming Modelmentioning
confidence: 99%
“…In the first step, a Hamiltonian circuit successor variable is imposed. This is achieved by using the classical circuit [7] constraint on successor variables for dynamic subtour filtering. The date and successor variables are linked with the element constraint by imposing that the production date of p is before the production date of its successors:…”
Section: A Constraint Programming Modelmentioning
confidence: 99%
“…The Pesant class consists of 27 symmetric instances proposed by Pesant et al [1998] with 21 to 46 vertices. Travel costs and times are the Euclidean distances truncated to four decimal places.…”
Section: Pesant Instancesmentioning
confidence: 99%
“…First, small TSPTW instances were solved as subproblems of a large task assignment by Caseau and Koppstein [43]. Lately, the problem was instead the main focus of a paper by Pesant et al [138] where the authors solved it by enriching a simple CP model with redundant constraints. A variant of the TSPTW, called TSP with multiple Time Windows, has been solved by the same authors (Pesant et al [139]) with basically the same algorithmic approach (and slightly adapting the model), thus showing the flexibility of the CP paradigm.…”
Section: Literature Reviewmentioning
confidence: 99%