Comparison of anticipatory algorithms for a dial-a-ride problem
Open Access
- 1 September 2022
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 301 (2) , 591-608
Abstract
No abstract availableKeywords
Funding Information
- Republic of Austria Federal Ministry for Climate Action Environment Energy Mobility Innovation and Technology
This publication has 73 references indexed in Scilit:
- Hybrid column generation and large neighborhood search for the dial-a-ride problemComputers & Operations Research, 2013
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transportsComputers & Operations Research, 2011
- Dynamic pickup and delivery problemsEuropean Journal of Operational Research, 2010
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windowsComputers & Operations Research, 2010
- What you should know about the vehicle routing problemNaval Research Logistics (NRL), 2007
- The dial-a-ride problem: models and algorithmsAnnals of Operations Research, 2007
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003
- Partially dynamic vehicle routing—models and algorithmsJournal of the Operational Research Society, 2002
- Dynamic vehicle routing: Status and prospectsAnnals of Operations Research, 1995
- A new extension of local search applied to the Dial-A-Ride ProblemEuropean Journal of Operational Research, 1995