{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:51:57Z","timestamp":1743025917867,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030976712"},{"type":"electronic","value":"9783030976729"}],"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-97672-9_44","type":"book-chapter","created":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:03:10Z","timestamp":1648699390000},"page":"485-497","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Solving Delivery Assignment in\u00a0Hybrid-Transit Network Using Multi-agent Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Joshua Julian","family":"Damanik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Kasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han-Lim","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,1]]},"reference":[{"issue":"4","key":"44_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/inte.20.4.133","volume":"20","author":"DP Bertsekas","year":"1990","unstructured":"Bertsekas, D.P.: The auction algorithm for assignment and other network flow problems: a tutorial. Interfaces 20(4), 133\u2013149 (1990)","journal-title":"Interfaces"},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00247653","volume":"1","author":"DP Bertsekas","year":"1992","unstructured":"Bertsekas, D.P.: Auction algorithms for network flow problems: a tutorial introduction. Comput. Optim. Appl. 1, 7\u201366 (1992)","journal-title":"Comput. Optim. Appl."},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Campbell, T., Johnson, L., How, J.P.: Multiagent allocation of Markov decision process tasks. In: 2013 American Control Conference, pp. 2356\u20132361 (2013)","DOI":"10.1109\/ACC.2013.6580186"},{"key":"44_CR4","unstructured":"Damanik, J.J., Choi, H.: Decentralized delivery task allocation for hybrid-transit logistics network system. In: Korean Society for Aeronautical and Space Sciences (KSAS) 2020 Fall Conference, pp. 673\u2013674 (2020)"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Damanik, J.J., Choi, H.L.: Vehicle routing problem with pickup, relay, and delivery: delivery task assignment in hybrid-transit logistics network (2021)","DOI":"10.2514\/6.2021-2341"},{"key":"44_CR6","unstructured":"Jiang, J., Dun, C., Lu, Z.: Attention is all you need. In: 31st Conference on Neural Information Processing Systems (NIPS) (2017)"},{"key":"44_CR7","unstructured":"Jiang, J., Dun, C., Lu, Z.: Graph convolutional reinforcement learning. In: 2020 International Conference on Learning Representations (2020)"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Kim, I., Morrison, J.R.: Learning based framework for joint task allocation and system design in stochastic multi-UAV systems. In: 2018 International Conference on Unmanned Aircraft Systems (ICUAS), pp. 324\u2013334 (2018)","DOI":"10.1109\/ICUAS.2018.8453318"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"issue":"1","key":"44_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"MWP Savelsbergh","year":"1995","unstructured":"Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transp. Sci. 29(1), 17\u201329 (1995)","journal-title":"Transp. Sci."},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Whitten, A.K., Choi, H., Johnson, L.B., How, J.P.: Decentralized task allocation with coupled constraints in complex missions. In: Proceedings of the 2011 American Control Conference, pp. 1642\u20131649 (2011)","DOI":"10.1109\/ACC.2011.5990917"}],"container-title":["Lecture Notes in Networks and Systems","Robot Intelligence Technology and Applications 6"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-97672-9_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T06:12:15Z","timestamp":1663135935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97672-9_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030976712","9783030976729"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97672-9_44","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RiTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Robot Intelligence Technology and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Daejeon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rita2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}