Multi-Hop Ride Sharing
@inproceedings{Drews2013MultiHopRS, title={Multi-Hop Ride Sharing}, author={Florian Drews and Dennis Luxen}, booktitle={SOCS}, year={2013} }
We study the problem of ride sharing in road networks. [...] Key Result The algorithm achieves about an order of magnitude higher speedups over Dijkstra’s algorithm than what could be expected from previous work.Expand Abstract
Figures, Tables, and Topics from this paper
43 Citations
Sharing Rides with Friends: A Coalition Formation Algorithm for Ridesharing
- Computer Science
- AAAI
- 2015
- 31
- PDF
Optimal Multi-Meeting-Point Route Search
- Computer Science
- IEEE Transactions on Knowledge and Data Engineering
- 2016
- 9
- PDF
Highly Efficient and Scalable Multi-hop Ride-sharing
- Computer Science
- SIGSPATIAL/GIS
- 2020
- Highly Influenced
- PDF
A cooperative game-theoretic approach to the social ridesharing problem
- Computer Science
- Artif. Intell.
- 2017
- 25
- PDF
Mutually Beneficial Confluent Routing
- Computer Science
- IEEE Transactions on Knowledge and Data Engineering
- 2016
- 6
Mutually Beneficial Confluent Routing
- Computer Science
- IEEE Trans. Knowl. Data Eng.
- 2016
- 4
- Highly Influenced
References
SHOWING 1-10 OF 19 REFERENCES
Candidate Sets for Alternative Routes in Road Networks
- Computer Science
- ACM J. Exp. Algorithmics
- 2014
- 46
- PDF
Exact Routing in Large Road Networks Using Contraction Hierarchies
- Computer Science
- Transp. Sci.
- 2012
- 249
Experimental Comparison of Shortest Path Approaches for Timetable Information
- Computer Science
- ALENEX/ANALC
- 2004
- 39
- PDF
Computing Many-to-Many Shortest Paths Using Highway Hierarchies
- Mathematics, Computer Science
- ALENEX
- 2007
- 99
- PDF
14. Experimental Study on Speed-Up Techniques for Timetable Information Systems
- Computer Science
- 2007
- 29
- Highly Influential
Minimum time-dependent travel times with contraction hierarchies
- Computer Science
- JEAL
- 2013
- 75
- Highly Influential