Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
Open Access
- 9 November 2010
- journal article
- research article
- Published by Springer Nature in OR Spectrum
- Vol. 34 (3) , 593-633
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Variable neighborhood search for the dial-a-ride problemComputers & Operations Research, 2010
- Dynamic pickup and delivery problemsEuropean Journal of Operational Research, 2010
- A heuristic two‐phase solution approach for the multi‐objective dial‐a‐ride problemNetworks, 2009
- The dial-a-ride problem: models and algorithmsAnnals of Operations Research, 2007
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windowsNetworks, 2007
- A dial-a-ride problem for client transportation in a health-care organizationComputers & Operations Research, 2007
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003
- Variable neighborhood searchComputers & Operations Research, 1997
- Ejection chains, reference structures and alternating path methods for traveling salesman problemsDiscrete Applied Mathematics, 1996
- Optimization by Simulated AnnealingScience, 1983