Dynamic programming for the minimum tour duration problem
Year of publication: |
May 2017
|
---|---|
Authors: | Tilk, Christian ; Irnich, Stefan |
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. 51.2017, 2, p. 549-565
|
Subject: | traveling salesman problem | time windows | tour duration | dynamic programming | state-space relaxation | Dynamische Optimierung | Dynamic programming | Tourenplanung | Vehicle routing problem | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Dauer | Duration |
-
Dynamic programming for the time-dependent traveling salesman problem with time windows
Lera-Romero, Gonzalo, (2022)
-
The electric traveling salesman problem with time windows
Roberti, R., (2016)
-
A large neighborhood search for the vehicle routing problem with multiple time windows
Schaap, Hendrik, (2022)
- More ...
-
The last-mile vehicle routing problem with delivery options
Tilk, Christian, (2021)
-
Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
Gschwind, Timo, (2020)
-
Tilk, Christian, (2019)
- More ...