Publication Type
Journal Article
Version
publishedVersion
Publication Date
7-2018
Abstract
There has been a dramatic growth of shared mobility applications such as ride-sharing, food delivery and crowdsourced parcel delivery. Shared mobility refers to transportation services that are shared among users, where a central issue is route planning. Given a set of workers and requests, route planning finds for each worker a route, i.e., a sequence of locations to pick up and drop off passengers/parcels that arrive from time to time, with different optimization objectives. Previous studies lack practicability due to their conflicted objectives and inefficiency in inserting a new request into a route, a basic operation called insertion. In this paper, we present a unified formulation of route planning called URPSM. It has a well-defined parameterized objective function which eliminates the contradicted objectives in previous studies and enables flexible multi-objective route planning for shared mobility. We prove the problem is NP-hard and there is no polynomial-time algorithm with constant competitive ratio for the URPSM problem and its variants. In response, we devise an effective and efficient solution to address the URPSM problem approximately. We design a novel dynamic programming (DP) algorithm to accelerate the insertion operation from cubic or quadric time in previous work to only linear time. On basis of the DP algorithm, we propose a greedy based solution to the URPSM problem. Experimental results on real datasets show that our solution outperforms the state-of-the-arts by 1.2 to 12.8 times in effectiveness, and also runs 2.6 to 20.7 times faster.
Discipline
Digital Communications and Networking | Software Engineering
Research Areas
Software and Cyber-Physical Systems
Publication
Proceedings of the VLDB Endowment
Volume
11
Issue
11
First Page
1633
Last Page
1646
ISSN
2150-8097
Identifier
10.14778/3236187.3236211
Publisher
VLDB Endowment
Citation
TONG, Yongxin; ZENG, Yuxiang; ZHOU, Zimu; CHEN, Lei; YE, Jieping; and XU, Ke.
A unified approach to route planning for shared mobility. (2018). Proceedings of the VLDB Endowment. 11, (11), 1633-1646.
Available at: https://ink.library.smu.edu.sg/sis_research/4886
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.14778/3236187.3236211