Hybrid column generation and large neighborhood search for the dial-a-ride problem
Open Access
- 1 January 2013
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 40 (1) , 490-497
Abstract
No abstract availableKeywords
Funding Information
- FFG (826151)
- Austrian Science Fund (FWF) (T-514-N13)
This publication has 19 references indexed in Scilit:
- Demand Responsive Transportation2011
- Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization ProblemsINFORMS Journal on Computing, 2010
- Variable neighborhood search for the dial-a-ride problemComputers & Operations Research, 2010
- A branch‐and‐price‐based large neighborhood search algorithm for the vehicle routing problem with time windowsNetworks, 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 unified heuristic for a large class of Vehicle Routing Problems with BackhaulsEuropean Journal of Operational Research, 2006
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- Variable neighborhood searchComputers & Operations Research, 1997