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...
Saved in:
| Published in: | Transportation research. Part B: methodological Vol. 106; pp. 218 - 236 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.12.2017
|
| Subjects: | |
| ISSN: | 0191-2615, 1879-2367 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!