Dynamic discretization discovery for solving the time-dependent traveling salesman problem with time windows
Year of publication: |
2020
|
---|---|
Authors: | Vu, Duc Minh ; Hewitt, Mike ; Boland, Natashia ; Savelsbergh, Martin W. P. |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 54.2020, 3, p. 703-720
|
Subject: | traveling salesman problem | time windows | time dependent travel times | dynamic discretization discovery | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem |
-
Vu, Duc Minh, (2022)
-
Perspectives on integer programming for time-dependent models
Boland, Natashia L., (2019)
-
Dynamic programming for the minimum tour duration problem
Tilk, Christian, (2017)
- More ...
-
The price of discretizing time : a study in service network design
Boland, Natashia, (2019)
-
The continuous-time service network design problem
Boland, Natashia, (2017)
-
Marshall, Luke, (2021)
- More ...