{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:06:42Z","timestamp":1743001602168,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030953836"},{"type":"electronic","value":"9783030953843"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95384-3_21","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:20:55Z","timestamp":1645518055000},"page":"319-335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Adjustment Policy of\u00a0Search Driver Matching Distance via\u00a0Markov Decision Process"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6038-8292","authenticated-orcid":false,"given":"Suiming","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8435-8138","authenticated-orcid":false,"given":"Pengcheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5796-1107","authenticated-orcid":false,"given":"Qianrong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/juec.1996.0035","volume":"40","author":"R Arnott","year":"1996","unstructured":"Arnott, R.: Taxi travel should be subsidized. J. Urban Econ. 40(3), 316\u2013333 (1996)","journal-title":"J. Urban Econ."},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1512\/iumj.1957.6.56038","volume":"6","author":"R Bellman","year":"1957","unstructured":"Bellman, R.: A Markovian decision process. Indiana Univ. Math. J. 6(4), 679\u2013684 (1957)","journal-title":"Indiana Univ. Math. J."},{"key":"21_CR3","unstructured":"Stoyan, D., Kendall, W.S., Chiu, S.N., Mecke, J.: Stochastic Geometry and its Applications. Wiley, Hoboken (2013)"},{"key":"21_CR4","unstructured":"Data source: Didi Chuxing GAIA Initiative.: Data source: Didi Chuxing GAIA Initiative. https:\/\/outreach.didichuxing.com\/research\/opendata\/en\/"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Duan, Y., et al.: Optimizing order dispatch for ride-sharing systems. In: Proceedings of International Conference on Computer Communication and Networks, ICCCN. 2019-July (2019)","DOI":"10.1109\/ICCCN.2019.8847177"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Guo, S., et al.: A simple but quantifiable approach to dynamic price prediction in ride-on-demand services leveraging multi-source urban data. In: Proceedings of ACM Interactive, Mobile, Wearable Ubiquitous Technologies, vol. 2, no. 3, pp. 1\u201324 (2018)","DOI":"10.1145\/3264922"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Guo, S., et al.: Modelling passengers reaction to dynamic prices in ride-on-demand services. In: Proceedings of ACM Interactive, Mobile, Wearable Ubiquitous Technologies, vol. 1, no. 4, pp. 1\u201323 (2017)","DOI":"10.1145\/3161194"},{"issue":"9","key":"21_CR8","doi-asserted-by":"publisher","first-page":"2202","DOI":"10.1109\/TMC.2019.2921959","volume":"19","author":"S Guo","year":"2019","unstructured":"Guo, S., et al.: ROD-revenue: seeking strategies analysis and revenue prediction in ride-on-demand service using multi-source urban data. IEEE Trans. Mob. Comput. 19(9), 2202\u20132220 (2019)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Ke, J., et al.: Data-driven analysis on matching probability, routing distance and detour distance in ride-pooling services. Transp. Res. Part C Emerg. Technol. 124, 102922 (2021)","DOI":"10.1016\/j.trc.2020.102922"},{"issue":"5","key":"21_CR10","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1287\/inte.2020.1047","volume":"50","author":"Z Qin","year":"2020","unstructured":"Qin, Z., et al.: Ride-hailing order dispatching at DiDi via reinforcement learning. Interfaces (Providence) 50(5), 272\u2013286 (2020)","journal-title":"Interfaces (Providence)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Shou, Z., et al.: Optimal passenger-seeking policies on e-hailing platforms using Markov decision process and imitation learning. Transp. Res. Part C Emerg. Technol. 111, 91\u2013113 (2019)","DOI":"10.1016\/j.trc.2019.12.005"},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.trb.2020.10.001","volume":"142","author":"L Sun","year":"2020","unstructured":"Sun, L., et al.: Taxi-hailing platforms: inform or assign drivers? Transp. Res. Part B Methodol. 142(3), 197\u2013212 (2020)","journal-title":"Transp. Res. Part B Methodol."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Wang, G., et al.: On-demand ride-matching in a spatial model with abandonment and cancellation. SSRN Electron. J. 3414716, 1\u201340 (2019)","DOI":"10.2139\/ssrn.3414716"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Wang, X. et al.: Customer behavioural modelling of order cancellation in coupled ride-sourcing and taxi markets. Transp. Res. Part B Methodol. 132, 358\u2013378 (2019)","DOI":"10.1016\/j.trb.2019.05.016"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Xu, Z., et al.: Large-scale order dispatch in on-demand ride-hailing platforms: a learning and planning approach. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery Data Mining, pp. 905\u2013913 (2018)","DOI":"10.1145\/3219819.3219824"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.trb.2017.10.003","volume":"105","author":"Z Xu","year":"2017","unstructured":"Xu, Z., et al.: Optimal parking provision for ride-sourcing services. Transp. Res. Part B Methodol. 105, 559\u2013578 (2017)","journal-title":"Transp. Res. Part B Methodol."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.trb.2019.11.005","volume":"131","author":"H Yang","year":"2019","unstructured":"Yang, H., et al.: Optimizing matching time interval and matching radius in on-demand ride-sourcing markets. Transp. Res. Part B Methodol. 131, 84\u2013105 (2019)","journal-title":"Transp. Res. Part B Methodol."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.trb.2018.12.013","volume":"121","author":"X Yu","year":"2019","unstructured":"Yu, X., et al.: A Markov decision process approach to vacant taxi routing with e-hailing. Transp. Res. Part B Methodol. 121, 114\u2013134 (2019)","journal-title":"Transp. Res. Part B Methodol."},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, L. et al.: A taxi order dispatch model based on combinatorial optimization. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Part F1296, pp. 2151\u20132159 (2017)","DOI":"10.1145\/3097983.3098138"},{"issue":"8","key":"21_CR20","doi-asserted-by":"publisher","first-page":"853","DOI":"10.14778\/3204028.3204030","volume":"11","author":"L Zheng","year":"2018","unstructured":"Zheng, L., et al.: Order dispatch in priceaware ridesharing. Proc. VLDB Endow. 11(8), 853\u2013865 (2018)","journal-title":"Proc. VLDB Endow."},{"key":"21_CR21","unstructured":"Xiao, Z.: Reinforcement Learning: Theory and Python Implementation. China Machine Press, Beijing (2019)"}],"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-030-95384-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:23:31Z","timestamp":1645518211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95384-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953836","9783030953843"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95384-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","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":"403","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":"145","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":"0","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.12","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":"2.27","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)"}}]}}