Robustness Tools in Dynamic Dial-a-Ride Problems
- 2 December 2014
- book chapter
- Published by Springer Nature
- p. 35-51
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Constraint Propagation for the Dial-a-Ride Problem with Split Loads2013
- Variable neighborhood search for the dial-a-ride problemComputers & Operations Research, 2010
- The dial-a-ride problem: models and algorithmsAnnals of Operations Research, 2007
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problemEuropean Journal of Operational Research, 2006
- A Branch-and-Cut Algorithm for the Dial-a-Ride ProblemOperations Research, 2006
- Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problemParallel Computing, 2004
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003
- Dynamic Vehicle Routing and Dispatching1998
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectivesAnnals of Operations Research, 1995
- A new extension of local search applied to the Dial-A-Ride ProblemEuropean Journal of Operational Research, 1995