Vehicle routing problems with alternative paths: An application to on-demand transportation
Authors:
- Thierry GaraixTGThierry Garaix
- Christian ArtiguesCAChristian Artigues
- Dominique FeilletDFDominique Feillet
- Didier JosselinDJDidier Josselin
- 1 July 2010
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 204 (1) , 62-75
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- Object modeling and path computation for multimodal travel systemsEuropean Journal of Operational Research, 2006
- The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problemComputers & Operations Research, 2006
- A Branch-and-Cut Algorithm for the Dial-a-Ride ProblemOperations Research, 2006
- Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hullsComputers & Operations Research, 2006
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windowsComputers & Operations Research, 2006
- Solving the Convex Cost Integer Dual Network Flow ProblemManagement Science, 2003
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003
- The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms4OR, 2003
- Heuristics from Nature for Hard Combinatorial Optimization ProblemsInternational Transactions in Operational Research, 1996
- An algorithm for the resource constrained shortest path problemNetworks, 1989