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 | Tourenplanung | Vehicle routing problem | Theorie | Theory | Algorithmus | Algorithm | Heuristik | Heuristics | Terminplanung | Time scheduling |
-
The time-dependent capacitated profitable tour problem with time windows and precedence constraints
Sun, Peng, (2018)
-
Branch-and-price algorithm for the location-routing problem with time windows
Ponboon, Sattrawut, (2016)
-
An exact method for a first-mile ridesharing problem
Wang, Sihan, (2023)
- More ...
-
Dual Inequalities for Stabilized Column Generation Revisited
Gschwind, Timo, (2014)
-
Stabilized Column Generation for the Temporal Knapsack Problem using Dual- Optimal Inequalities
Gschwind, Timo, (2014)
-
A note on symmetry reduction for circular traveling tournament problems
Gschwind, Timo, (2011)
- More ...