A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system
Authors:
- Neda MasoudNMNeda Masoud
- R. JayakrishnanRJR. Jayakrishnan
Top Cited Papers
- 1 December 2017
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 106, 218-236
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Mathematical Programming Guides Air-Ambulance Routing at OrngeInterfaces, 2013
- Optimization of Dynamic Ridesharing SystemsTransportation Research Record: Journal of the Transportation Research Board, 2013
- Dynamic ride-sharing: A simulation study in metro AtlantaTransportation Research Part B: Methodological, 2011
- Feeder transit services: Choosing between fixed and demand responsive policyTransportation Research Part C: Emerging Technologies, 2010
- Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraintsEuropean Journal of Operational Research, 2008
- 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
- Design and Operational Concepts of High-Coverage Point-to-Point Transit SystemTransportation Research Record: Journal of the Transportation Research Board, 2002
- 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