{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T18:10:40Z","timestamp":1791396640283,"version":"4.3.3"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,4]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.14778\/3204028.3204030","type":"journal-article","created":{"date-parts":[[2018,5,22]],"date-time":"2018-05-22T19:56:10Z","timestamp":1527018970000},"page":"853-865","source":"Crossref","is-referenced-by-count":105,"title":["Order dispatch in price-aware ridesharing"],"prefix":"10.14778","volume":"11","author":[{"given":"Libin","family":"Zheng","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jieping","family":"Ye","sequence":"additional","affiliation":[{"name":"Didi Research Institute, Didi, Chuxing, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1611675114"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996913.2996974"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2003.12.001"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.538"},{"key":"e_1_2_1_5_1","volume-title":"An effective and fast heuristic for the dial-a-ride problem. 4OR - A Quarterly Journal of Operations Research, 5(1):61--73","author":"Calvo R. W.","year":"2007","unstructured":"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 . 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."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064008"},{"key":"e_1_2_1_7_1","volume-title":"International transactions in operational research, 8(2):155--166","author":"Colorni A.","year":"2001","unstructured":"A. Colorni and G. Righini . Modeling and optimizing dynamic dial-a-ride problems . International transactions in operational research, 8(2):155--166 , 2001 . A. Colorni and G. Righini. Modeling and optimizing dynamic dial-a-ride problems. International transactions in operational research, 8(2):155--166, 2001."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0283"},{"key":"e_1_2_1_9_1","volume-title":"The dial-a-ride problem (darp): Variants, modeling issues and algorithms. 4OR - A Quarterly Journal of Operations Research, 1(2):89--101","author":"Cordeau J.-F.","year":"2003","unstructured":"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 . 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."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(02)00045-0"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/6462.6502"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353425"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0968-090X(01)00003-1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733106"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v49:4"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27848-8"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40450-4_50"},{"key":"e_1_2_1_19_1","volume-title":"An overview of exact and approximate algorithms. European journal of operational research, 59(3):345--358","author":"Laporte G.","year":"1992","unstructured":"G. Laporte . The vehicle routing problem : An overview of exact and approximate algorithms. European journal of operational research, 59(3):345--358 , 1992 . G. Laporte. The vehicle routing problem: An overview of exact and approximate algorithms. European journal of operational research, 59(3):345--358, 1992."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544843"},{"key":"e_1_2_1_21_1","volume-title":"Algorithms for the assignment and transportation problems. Journal of the society for industrial and applied mathematics, 5(1):32--38","author":"Munkres J.","year":"1957","unstructured":"J. Munkres . Algorithms for the assignment and transportation problems. Journal of the society for industrial and applied mathematics, 5(1):32--38 , 1957 . J. Munkres. Algorithms for the assignment and transportation problems. Journal of the society for industrial and applied mathematics, 5(1):32--38, 1957."},{"key":"e_1_2_1_22_1","article-title":"An efficient ride-sharing framework for maximizing shared route","author":"Na T.","year":"2017","unstructured":"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 . 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.","journal-title":"IEEE Transactions on Knowledge & Data Engineering, PP(99):1--1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/321850.321854"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.05.032"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994523"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498228"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137643"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996913.2997002"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47672-7_87"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098138"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2676771"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3204028.3204030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:20:34Z","timestamp":1672222834000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3204028.3204030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":31,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["10.14778\/3204028.3204030"],"URL":"https:\/\/doi.org\/10.14778\/3204028.3204030","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,4]]}}}