Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
Open Access
- 1 October 2014
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 238 (1) , 18-30
Abstract
No abstract availableKeywords
Funding Information
- Austrian Research Promotion Agency (FFG, ModSim) (#822739)
- Austrian Science Fund (FWF, Translational Research) (#L510-N13)
This publication has 35 references indexed in Scilit:
- A variable neighborhood search algorithm for the optimization of a dial-a-ride problem in a large cityExpert Systems with Applications, 2013
- Vehicle routing problem with stochastic travel times including soft time windows and service costsComputers & Operations Research, 2013
- 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
- Ambulance location and relocation problems with time-dependent travel timesEuropean Journal of Operational Research, 2010
- A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaksFlexible Services and Manufacturing Journal, 2010
- Vehicle routing and scheduling with time-varying data: A case studyJournal of the Operational Research Society, 2010
- The dial-a-ride problem: models and algorithmsAnnals of Operations Research, 2007
- Improving Paratransit Scheduling by Accounting for Dynamic and Stochastic Variations in Travel TimeTransportation Research Record: Journal of the Transportation Research Board, 1999
- Variable neighborhood searchComputers & Operations Research, 1997