{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T00:34:42Z","timestamp":1778373282351,"version":"3.51.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031226762","type":"print"},{"value":"9783031226779","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-22677-9_40","type":"book-chapter","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T09:04:32Z","timestamp":1673341472000},"page":"737-751","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Ordis: A Dynamic Order-Dispatch Algorithm for\u00a0Ridehailing and\u00a0Ridesharing in\u00a0a\u00a0Large Region"],"prefix":"10.1007","author":[{"given":"Ming","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juanjuan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengzhong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Li B, Zhang D, Sun L, et al. Hunting or waiting? Discovering passenger-finding strategies from a large-scale real-world ride-hailing dataset, 2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops). IEEE, 2011: 63\u201368","DOI":"10.1109\/PERCOMW.2011.5766967"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Miao F, Han S, Lin S, et al. Taxi dispatch with real-time sensing data in metropolitan areas: A receding horizon control approach. IEEE Trans. on Automation Science and Engineering, 2016, 13(2): 463\u2013478","DOI":"10.1109\/TASE.2016.2529580"},{"issue":"1","key":"40_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1109\/TITS.2014.2328231","volume":"16","author":"D Zhang","year":"2014","unstructured":"Zhang, D., Sun, L., Li, B., et al.: Understanding taxi service strategies from taxi GPS traces. IEEE Trans. on Intelligent Transportation Systems 16(1), 123\u2013135 (2014)","journal-title":"IEEE Trans. on Intelligent Transportation Systems"},{"key":"40_CR4","unstructured":"D. Chuxing. [Online]. Available: http:\/\/www.didichuxing.com\/"},{"key":"40_CR5","unstructured":"Uber. [Online]. Available: https:\/\/www.uber.com\/"},{"key":"40_CR6","unstructured":"Lyft. [Online]. Available: https:\/\/www.lyft.com\/"},{"key":"40_CR7","volume-title":"GPS taxi dispatch system based on A* shortest path algorithm[J]","author":"LC Chung","year":"2005","unstructured":"Chung, L.C.: GPS taxi dispatch system based on A* shortest path algorithm[J]. Malausia University of Science and Technology, Kuala Lumpur, Malaysia (2005)"},{"issue":"1","key":"40_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.3141\/1882-23","volume":"1882","author":"DH Lee","year":"2004","unstructured":"Lee, D.H., Wang, H., Cheu, R.L., et al.: Taxi dispatch system based on current demands and real-time traffic conditions. Transportation Research Record 1882(1), 193\u2013200 (2004)","journal-title":"Transportation Research Record"},{"issue":"21","key":"40_CR9","doi-asserted-by":"publisher","first-page":"2653","DOI":"10.3390\/electronics10212653","volume":"10","author":"Y Kim","year":"2021","unstructured":"Kim, Y., Yoon, Y.: Zone-Agnostic Greedy Taxi Dispatch Algorithm Based on Contextual Matching Matrix for Efficient Maximization of Revenue and Profit. Electronics 10(21), 2653 (2021)","journal-title":"Electronics"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Efficient Maximization of Revenue and Profit. Electronics, 2021, 10(21): 2653.Lees-Miller J, Hammersley J, Davenport N. Ride sharing in personal rapid transit capacity planning, Automated People Movers 2009: Connecting People, Connecting Places, Connecting Modes. 2009: 321-332.","DOI":"10.1061\/41038(343)27"},{"key":"40_CR11","unstructured":"Coltin B J, Veloso M. Towards ridesharing with passenger transfers, Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems. 2013: 1299\u20131300"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Wang D, Cao W, Li J, et al. DeepSD: Supply-demand prediction for online car-hailing services using deep neural networks, 2017 IEEE 33rd international conference on data engineering (ICDE). IEEE, 2017: 243-254.","DOI":"10.1109\/ICDE.2017.83"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Jindal I, Qin Z T, Chen X, et al. Optimizing taxi carpool policies via reinforcement learning and spatio-temporal mining, 2018 IEEE International Conference on Big Data (Big Data). IEEE, 2018: 1417\u20131426","DOI":"10.1109\/BigData.2018.8622481"},{"issue":"2","key":"40_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/atr.5670400207","volume":"40","author":"KI Wong","year":"2006","unstructured":"Wong, K.I., Bell, M.G.H.: The optimal dispatching of taxis under congestion: A rolling horizon approach. Journal of advanced transportation 40(2), 203\u2013220 (2006)","journal-title":"Journal of advanced transportation"},{"key":"40_CR15","unstructured":"Santos D O, Xavier E C. Dynamic taxi and ridesharing: A framework and heuristics for the optimization problem, 23rd International Joint Conference on Artificial Intelligence. 2013"},{"issue":"3","key":"40_CR16","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1086\/704761","volume":"128","author":"M Akbarpour","year":"2020","unstructured":"Akbarpour, M., Li, S., Gharan, S.O.: Thickness and information in dynamic matching markets. Journal of Political Economy 128(3), 783\u2013815 (2020)","journal-title":"Journal of Political Economy"},{"issue":"3","key":"40_CR17","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1109\/TASE.2009.2028577","volume":"7","author":"KT Seow","year":"2009","unstructured":"Seow, K.T., Dang, N.H., Lee, D.H.: A collaborative multiagent taxi-dispatch system. IEEE Transactions on Automation science and engineering 7(3), 607\u2013616 (2009)","journal-title":"IEEE Transactions on Automation science and engineering"},{"key":"40_CR18","unstructured":"Ke J, Xiao F, Yang H, et al. Optimizing online matching for ride-sourcing services with multi-agent deep reinforcement learning. arXiv:1902.06228, 2019"},{"issue":"9","key":"40_CR19","first-page":"2","volume":"2","author":"D Fanding","year":"1994","unstructured":"Fanding, D.: A faster algorithm for shortest-path-SPFA. Journal of Southwest Jiaotong University 2(9), 2 (1994)","journal-title":"Journal of Southwest Jiaotong University"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"Krishna K, Murty M N. Genetic K-means algorithm. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1999, 29(3): 433\u2013439","DOI":"10.1109\/3477.764879"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22677-9_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T22:41:48Z","timestamp":1728686508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22677-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031226762","9783031226779"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22677-9_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}