Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

Order dispatch in price-aware ridesharing

Published: 01 April 2018 Publication History

Abstract

With the prevalence of car-hailing applications, ridesharing becomes more and more popular because of its great potential in monetary saving and environmental protection. Order dispatch is the key problem in ridesharing, which has a strong impact on riders' experience and platform's performance. Existing order dispatch research works fail to consider the price of the orders, which can be an important reference because it directly relates to the platform's profit. Our work takes the order price into concern, and formulates a constrained optimization problem, which takes platform's profit as the optimization objective and performs controls on riders' detour distance and waiting time. We prove the problem is NP-hard, thus, we propose approximation methods. We further develop a simulation framework based on real ridesharing order and vehicle data. We conduct experiments with this simulation framework to evaluate the effectiveness and efficiency of the proposed methods.

References

[1]
J. Alonso-Mora, S. Samaranayake, A. Wallar, E. Frazzoli, and D. Rus. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proc. of the NAS, page 201611675, 2017.
[2]
M. Asghari, D. Deng, C. Shahabi, U. Demiryurek, and Y. Li. Price-aware real-time ride-sharing at scale: an auction-based approach. In Proc. of the SIGSPATIAL GIS, page 3. ACM, 2016.
[3]
A. Attanasio, J.-F. Cordeau, G. Ghiani, and G. Laporte. Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing, 30(3):377--387, 2004.
[4]
M. Bellmore and G. L. Nemhauser. The traveling salesman problem: a survey. Operations Research, 16(3):538--558, 1968.
[5]
R. W. Calvo and A. Colorni. An effective and fast heuristic for the dial-a-ride problem. 4OR - A Quarterly Journal of Operations Research, 5(1):61--73, 2007.
[6]
P. Cheng, H. Xin, and L. Chen. Utility-aware ridesharing on road networks. In Proc. of the SIGMOD, pages 1197--1210, 2017.
[7]
A. Colorni and G. Righini. Modeling and optimizing dynamic dial-a-ride problems. International transactions in operational research, 8(2):155--166, 2001.
[8]
J.-F. Cordeau. A branch-and-cut algorithm for the dial-a-ride problem. Operations Research, 54(3):573--586, 2006.
[9]
J.-F. Cordeau and G. Laporte. The dial-a-ride problem (darp): Variants, modeling issues and algorithms. 4OR - A Quarterly Journal of Operations Research, 1(2):89--101, 2003.
[10]
J.-F. Cordeau and G. Laporte. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37(6):579--594, 2003.
[11]
Z. Galil. Efficient algorithms for finding maximum matching in graphs. ACM Computing Surveys, 18(1):23--38, 1986.
[12]
R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. Experimental Algorithms, pages 319--333, 2008.
[13]
G. Gidofalvi, T. B. Pedersen, T. Risch, and E. Zeitler. Highly scalable trip grouping for large-scale collective transportation systems. In Proc. of the EDBT, pages 678--689, 2008.
[14]
M. E. Horn. Fleet scheduling and dispatching for demand-responsive passenger services. Transportation Research Part C: Emerging Technologies, 10(1):35--63, 2002.
[15]
Y. Huang, F. Bastani, R. Jin, and X. S. Wang. Large scale real-time ridesharing with service guarantee on road networks. PVLDB, 7(14):2017--2028, 2014.
[16]
L. M. Hvattum, A. Løkketangen, and G. Laporte. A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems. Networks, 49(4):330--340, 2007.
[17]
M.-Y. Kao. Weighted bipartite matching. Encyclopedia of Algorithms, pages 1020--1020, 2008.
[18]
T. Kesselheim, K. Radke, A. Tönnis, and B. Vöcking. An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions. In European Symposium on Algorithms, pages 589--600, 2013.
[19]
G. Laporte. The vehicle routing problem: An overview of exact and approximate algorithms. European journal of operational research, 59(3):345--358, 1992.
[20]
S. Ma, Y. Zheng, and O. Wolfson. T-share: A large-scale dynamic taxi ridesharing service. In Proc. of the ICDE, pages 410--421, 2013.
[21]
J. Munkres. Algorithms for the assignment and transportation problems. Journal of the society for industrial and applied mathematics, 5(1):32--38, 1957.
[22]
T. Na, G. Li, T. Zhao, J. Feng, H. Ma, and Z. Gong. An efficient ride-sharing framework for maximizing shared route. IEEE Transactions on Knowledge & Data Engineering, PP(99):1--1, 2017.
[23]
F. Rubin. A search procedure for hamilton paths and circuits. Journal of the ACM (JACM), 21(4):576--580, 1974.
[24]
H.-F. Ting and X. Xiang. Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching. Theoretical Computer Science, 607:247--256, 2015.
[25]
Y. Tong, J. She, B. Ding, L. Chen, T. Wo, and K. Xu. Online minimum matching in real-time spatial data: experiments and analysis. PVLDB, 9(12):1053--1064, 2016.
[26]
Y. Tong, J. She, B. Ding, L. Wang, and L. Chen. Online mobile micro-task allocation in spatial crowdsourcing. In Proc. of the ICDE, pages 49--60, 2016.
[27]
Y. Tong, L. Wang, Z. Zhou, B. Ding, L. Chen, J. Ye, and K. Xu. Flexible online task assignment in real-time spatial data. PVLDB, 10(11):1334--1345, 2017.
[28]
Y. Wang, R. Kutadinata, and S. Winter. Activity-based ridesharing: increasing flexibility by time geography. In Proc. of the SIGSPATIAL GIS, page 1. ACM, 2016.
[29]
Y. Wang and S. C.-w. Wong. Two-sided online bipartite matching and vertex cover: Beating the greedy algorithm. In Proc. of the ICALP, pages 1070--1081, 2015.
[30]
L. Zhang, T. Hu, Y. Min, G. Wu, J. Zhang, P. Feng, P. Gong, and J. Ye. A taxi order dispatch model based on comnatorial optimization. In Proc of the SIGKDD, pages 2151--2159, 2017.
[31]
L. Zheng and L. Chen. Maximizing acceptance in rejection-aware spatial crowdsourcing. IEEE Transactions on Knowledge and Data Engineering, 2017.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment  Volume 11, Issue 8
April 2018
94 pages
ISSN:2150-8097
Issue’s Table of Contents

Publisher

VLDB Endowment

Publication History

Published: 01 April 2018
Published in PVLDB Volume 11, Issue 8

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)55
  • Downloads (Last 6 weeks)3
Reflects downloads up to 16 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Real-Time Insertion Operator for Shared Mobility on Time-Dependent Road NetworksProceedings of the VLDB Endowment10.14778/3654621.365463317:7(1669-1682)Online publication date: 1-Mar-2024
  • (2024)Efficient Task Planning for Heterogeneous AGVs in WarehousesIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2024.335651425:8(10005-10019)Online publication date: 1-Aug-2024
  • (2024)A Survey of Machine Learning-Based Ride-Hailing PlanningIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2023.334517425:6(4734-4753)Online publication date: 10-May-2024
  • (2024)A vehicle value based ride-hailing order matching and dispatching algorithmEngineering Applications of Artificial Intelligence10.1016/j.engappai.2024.107954132:COnline publication date: 18-Jul-2024
  • (2023)Using simple incentives to improve two-sided fairness in ridesharing systemsProceedings of the Thirty-Third International Conference on Automated Planning and Scheduling10.1609/icaps.v33i1.27199(227-235)Online publication date: 8-Jul-2023
  • (2023)Future aware pricing and matching for sustainable on-demand ride poolingProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i12.26710(14628-14636)Online publication date: 7-Feb-2023
  • (2023)A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride ProblemProceedings of the VLDB Endowment10.14778/3579075.357909116:5(1195-1207)Online publication date: 6-Mar-2023
  • (2023)FairCod: A Fairness-aware Concurrent Dispatch System for Large-scale Instant Delivery ServicesProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599824(4229-4238)Online publication date: 6-Aug-2023
  • (2022)Online Ridesharing with Meeting PointsProceedings of the VLDB Endowment10.14778/3565838.356584915:13(3963-3975)Online publication date: 1-Sep-2022
  • (2022)Bipartite MatchingACM SIGMOD Record10.1145/3542700.354271351:1(51-58)Online publication date: 1-Jun-2022
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media