An optimization model and a solution algorithm for the many-to-many car pooling problem
- 26 August 2011
- journal article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 191 (1), 37-71
- https://doi.org/10.1007/s10479-011-0948-6
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- The dial-a-ride problem: models and algorithmsAnnals of Operations Research, 2007
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problemEuropean Journal of Operational Research, 2006
- A Branch-and-Cut Algorithm for the Dial-a-Ride ProblemOperations Research, 2006
- A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windowsTransportation Research Part B: Methodological, 2004
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column GenerationOperations Research, 2004
- The car pooling problem: Heuristic algorithms based on savings functionsJournal of Advanced Transportation, 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
- Modeling and Optimizing Dynamic Dial‐a‐Ride ProblemsInternational Transactions in Operational Research, 2001
- A Fair Carpool Scheduling AlgorithmIBM Journal of Research and Development, 1983