{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:29:24Z","timestamp":1743074964713,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030497774"},{"type":"electronic","value":"9783030497781"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-49778-1_29","type":"book-chapter","created":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T02:32:35Z","timestamp":1593570755000},"page":"363-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Multi-agent Service Area Adaptation for\u00a0Ride-Sharing Using Deep Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Naoki","family":"Yoshida","sequence":"first","affiliation":[]},{"given":"Itsuki","family":"Noda","sequence":"additional","affiliation":[]},{"given":"Toshiharu","family":"Sugawara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Yaraghi, N., Ravi, S.: The current and future state of the sharing economy. SSRN Electron. J. (2017)","DOI":"10.2139\/ssrn.3041207"},{"issue":"5","key":"29_CR2","doi-asserted-by":"publisher","first-page":"Kindly provide","DOI":"10.1126\/sciadv.aau2670","volume":"5","author":"GD Erhardt","year":"2019","unstructured":"Erhardt, G.D., et al.: Do transportation network companies decrease or increase congestion? Sci. Adv. 5(5), Kindly provide volume and page number for Ref. [9], if applicable. (2019)","journal-title":"Sci. Adv."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Ke, J., Zheng, H., Yang, H., Chen, X.(Michael): Short-term forecasting of passenger demand under on-demand ride services: a spatio-temporal deep learning approach. Transp. Res. Part C: Emerg. Technol. 85, 591\u2013608 (2017)","DOI":"10.1016\/j.trc.2017.10.016"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Miao, F., et al.: Taxi dispatch with real-time sensing data in metropolitan areas: a receding horizon control approach. CoRR, abs\/1603.04418 (2016)","DOI":"10.1145\/2735960.2735961"},{"issue":"6","key":"29_CR5","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"J-F Cordeau","year":"2003","unstructured":"Cordeau, J.-F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp. Res. Part B: Methodol. 37(6), 579\u2013594 (2003)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1287\/ijoc.1110.0454","volume":"24","author":"G Berbeglia","year":"2012","unstructured":"Berbeglia, G., Cordeau, J.-F., Laporte, G.: A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. INFORMS J. Comput. 24, 343\u2013355 (2012)","journal-title":"INFORMS J. Comput."},{"key":"29_CR7","unstructured":"Nakashima, H., et al.: Design of the smart access vehicle system with large scale ma simulation. In: Proceedings of the 1st International Workshop on Multiagent-Based Societal Systems (2013)"},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1073\/pnas.1611675114","volume":"114","author":"J Alonso-Mora","year":"2017","unstructured":"Alonso-Mora, J., Samaranayake, S., Wallar, A., Frazzoli, E., Rus, D.: On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proc. Natl. Acad. Sci. 114(3), 462\u2013467 (2017)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Oda, T., Joe-Wong, C.: MOVI: a model-free approach to dynamic fleet management. In: IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, pp. 2708\u20132716, April 2018","DOI":"10.1109\/INFOCOM.2018.8485988"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Lin, K., Zhao, R., Xu, Z., Zhou, J.: Efficient large-scale fleet management via multi-agent deep reinforcement learning. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, USA, pp. 1774\u20131783. ACM (2018)","DOI":"10.1145\/3219819.3219993"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"van Hasselt, H., Guez, A., Silver, D.: Deep reinforcement learning with double Q-learning. In: Proceedings of the 30th Conference on Artificial Intelligence. AAAI 2016, pp. 2094\u20132100. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"29_CR12","unstructured":"Tokyo Hire-Taxi Association. Result of taxi research in 2018 (2018). http:\/\/taxi-tokyo.or.jp\/enquete\/pdf\/research2018.pdf"}],"container-title":["Lecture Notes in Computer Science","Advances in Practical Applications of Agents, Multi-Agent Systems, and Trustworthiness. The PAAMS Collection"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-49778-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:44:18Z","timestamp":1710233058000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-49778-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030497774","9783030497781"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-49778-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAAMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Practical Applications of Agents and Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L\u2019Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"paams2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.paams.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"64","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":"29","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":"17","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":"45% - 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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}