A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem
Authors:
- Neda MasoudNMNeda Masoud
- R. JayakrishnanRJR. Jayakrishnan
Top Cited Papers
Open Access
- 1 May 2017
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 99, 1-29
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- The Dial-A-Ride Problem with TransfersComputers & Operations Research, 2014
- Ridesharing: The state-of-the-art and future directionsTransportation Research Part B: Methodological, 2013
- Mathematical Programming Guides Air-Ambulance Routing at OrngeInterfaces, 2013
- Optimization for dynamic ride-sharing: A reviewEuropean Journal of Operational Research, 2012
- Dynamic ride-sharing: A simulation study in metro AtlantaTransportation Research Part B: Methodological, 2011
- The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution methodEuropean Journal of Operational Research, 2010
- The dial-a-ride problem: models and algorithmsAnnals of Operations Research, 2007
- A distributed geographic information system for the daily car pooling problemComputers & Operations Research, 2004
- A decision support system for the bimodal dial-a-ride problemIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 1996
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 1986