A nested decomposition approach for solving the paratransit vehicle scheduling problem
- 18 October 2008
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 43 (4) , 448-465
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Solving the Dial-a-Ride problem using genetic algorithmsJournal of the Operational Research Society, 2007
- A rejected-reinsertion heuristic for the static Dial-A-Ride ProblemTransportation Research Part B: Methodological, 2007
- Modeling and optimizing transportation decisions in a manufacturing supply chainTransportation Research Part E: Logistics and Transportation Review, 2007
- The dial-a-ride problem: models and algorithmsAnnals of Operations Research, 2007
- A dial-a-ride problem for client transportation in a health-care organizationComputers & Operations Research, 2007
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windowsEuropean Journal of Operational Research, 2006
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraintsEuropean Journal of Operational Research, 2006
- An effective and fast heuristic for the Dial-a-Ride problem4OR, 2006
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- Routing with time windows by column generationNetworks, 1984