Effective handling of dynamic time windows and its application to solving the dial-a-ride problem
Year of publication: |
2015
|
---|---|
Authors: | Gschwind, Timo ; 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. 49.2015, 2, p. 335-354
|
Subject: | transportation | vehicle routing | dynamic time windows | dial-a-ride problem | labeling algorithm | ride-time constraints | time synchronization | branch-and-price | Terminplanung | Time scheduling | Heuristik | Heuristics | Tourenplanung | Vehicle routing problem | USA | United States | Theorie | Theory |
-
Exact approaches for the pickup and delivery problem with loading cost
Xue, Li, (2016)
-
Branch-and-price-based algorithms for the two-echelon vehicle routing problem with time windows
Dellaert, Nico, (2019)
-
Haddad, Matheus Nohra, (2018)
- More ...
-
A note on symmetry reduction for circular traveling tournament problems
Gschwind, Timo, (2011)
-
Dual inequalities for stabilized column generation revisited
Gschwind, Timo, (2016)
-
A branch-and-price framework for decomposing graphs into relaxed cliques
Gschwind, Timo, (2021)
- More ...