Paper Info
Title
Roo - Route Planning Algorithm for Ride Sharing Systems on Large-Scale Road Networks.
Abstract
Ride sharing has been widely studied in academia and applied in mobility-on-demand (MoD) systems as a means of reducing the number of cars, congestion, and pollution by sharing empty seats. Solving this problem is challenging on large-scale road networks for the following two reasons: distance calculation on large-scale road networks is time consuming; and multi-request allocation and multi-point planning have been proved to be NP-hard problems. In this paper, we propose a clustering-based request matching and route planning algorithm Roo that considers spatial-temporal distances between ride requests on road networks. The Roo algorithm is evaluated with real-world taxi trajectory data and road networks from New York City and Beijing. The results show that Roo can save up to 50% of mileage by 1000 vehicles serving around 7000 trip requests in New York City between 7:40 am to 8:00 am with average waiting time of 4 minutes.
Year
DOI
Venue
2019
10.1109/BIGCOMP.2019.8679187
BigComp
Keywords
Field
DocType
Roads,Planning,Clustering algorithms,Trajectory,Public transportation,Computer science,Urban areas
Route planning,Road networks,Computer science,Algorithm,Public transport,Cluster analysis,Beijing,Trajectory
Conference
ISSN
ISBN
Citations 
2375-933X
978-1-5386-7789-6
0
PageRank 
References 
Authors
0.34
0
6
Name
Order
Citations
PageRank
Bilong Shen192.23
Bo Cao212.06
Ying Zhao390249.19
Haojia Zuo400.34
Weimin Zheng51889182.48
Yan Huang67323.12