A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system

•An optimal, real-time algorithm for the multi-hop P2P ride-matching problem.•Serving requests as soon as they arrive on a first-come, first-served (FCFS) basis.•Numerical experiments quantify the impact of intersecting rider and driver sets.•Introducing P2P exchange mechanism to reverse the adverse...

Celý popis

Podrobná bibliografia

Vydané v:	Transportation research. Part B: methodological Ročník 106; s. 218 - 236
Hlavní autori:	Masoud, Neda, Jayakrishnan, R.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.12.2017
Predmet:	Multi-modal transportation On-demand transportation Ride-matching Ridesharing Multi-modal transportation On-demand transportation Ride-matching Ridesharing
ISSN:	0191-2615, 1879-2367
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!