Dynamic programming for the time-dependent traveling salesman problem with time windows
Year of publication: |
2022
|
---|---|
Authors: | Lera-Romero, Gonzalo ; Miranda Bront, Juan José ; Soulignac, Francisco J. |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 6, p. 3292-3308
|
Subject: | dynamic programming | time windows | traveling salesman problem | completion bounds | state-space relaxation | time-dependent travel times | Tourenplanung | Vehicle routing problem | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Dynamische Optimierung | Dynamic programming | Transportzeit | Travel time | Mathematische Optimierung | Mathematical programming |
-
Dynamic programming for the minimum tour duration problem
Tilk, Christian, (2017)
-
Duc Minh Vu, (2020)
-
Decremental state-space relaxations for the basic traveling salesman problem with a drone
Blufstein, Marcos, (2024)
- More ...
-
Lera-Romero, Gonzalo, (2024)
-
Decremental state-space relaxations for the basic traveling salesman problem with a drone
Blufstein, Marcos, (2024)
-
A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
Lera-Romero, Gonzalo, (2021)
- More ...