Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem
Year of publication: |
2019
|
---|---|
Authors: | Gschwind, Timo ; Drexl, Michael |
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. 53.2019, 2, p. 480-491
|
Subject: | dial-a-ride problem | adaptive large neighborhood search | feasibility testing |
-
Perfect periodic scheduling for three basic cycles
Kim, Eun-seok, (2014)
-
Route feasibility testing and forward time slack for the synchronized pickup and delivery problem
Gschwind, Timo, (2019)
-
Vehicle-based interactive management with multi-agent approach
Chen, Yee Ming, (2009)
- More ...
-
A note on symmetry reduction for circular traveling tournament problems
Gschwind, Timo, (2011)
-
Contributions to exact approaches in combinatorial optimization
Gschwind, Timo, (2014)
-
Effective handling of dynamic time windows and its application to solving the dial-a-ride problem
Gschwind, Timo, (2015)
- More ...