Mixed integer programming formulations for the generalized traveling salesman problem with time windows

The generalized traveling salesman problem with time windows (GTSPTW) is defined on a directed graph where the vertex set is partitioned into clusters. One cluster contains only the depot. Each vertex is associated with a time window, during which the visit must take place if the vertex is visited....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:4OR Ročník 19; číslo 4; s. 571 - 592
Hlavní autoři: Yuan, Yuan, Cattaruzza, Diego, Ogier, Maxime, Rousselot, Cyriaque, Semet, Frédéric
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2021
Springer Nature B.V
Springer Verlag
Témata:
Business and Management
Clusters
Computer Science
Discrete Mathematics
Graph theory
Graphs
Industrial and Production Engineering
Integer programming
Linear programming
Minimum cost
Mixed integer
Operations Research
Operations Research/Decision Theory
Optimization
Polynomials
Research Paper
Traveling salesman problem
Vertex sets
Windows (intervals)
Time windows
Generalized traveling salesman problem
Last mile delivery
90-10
Mixed integer programming formulations
ISSN:1619-4500, 1614-2411
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The generalized traveling salesman problem with time windows (GTSPTW) is defined on a directed graph where the vertex set is partitioned into clusters. One cluster contains only the depot. Each vertex is associated with a time window, during which the visit must take place if the vertex is visited. The objective is to find a minimum cost tour starting and ending at the depot such that each cluster is visited exactly once and time constraints are respected, i.e., for each cluster, a single vertex is visited during its time window. In this paper, four mixed integer linear programming formulations for the GTSPTW are proposed and compared. They are based on different definitions of variables. All the formulations are compact, which means the number of decision variables and constraints is polynomial with respect to the size of the instance. Dominance relations between their linear relaxations are established theoretically. Computational experiments are conducted to compare the linear relaxations and branch-and-bound performances of the four formulations. The results show that two formulations are better than the other ones.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1619-4500
1614-2411
DOI:10.1007/s10288-020-00461-y