{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:57:56Z","timestamp":1743134276133,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031159305"},{"type":"electronic","value":"9783031159312"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15931-2_8","type":"book-chapter","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T05:03:47Z","timestamp":1662440627000},"page":"87-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reinforcement Learning for\u00a0the\u00a0Pickup and\u00a0Delivery Problem"],"prefix":"10.1007","author":[{"given":"Fagui","family":"Liu","sequence":"first","affiliation":[]},{"given":"Chengqi","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Lvshengbiao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G Berbeglia","year":"2007","unstructured":"Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. TOP 15, 1\u201331 (2007)","journal-title":"TOP"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G Berbeglia","year":"2010","unstructured":"Berbeglia, G., Cordeau, J.F., Laporte, G.: Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202, 8\u201315 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Li, H., Lim, A.: A Metaheuristic for the Pickup and Delivery Problem with Time Windows 12(02), 173\u2013186 (2003)","DOI":"10.1142\/S0218213003001186"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.ejor.2020.07.032","volume":"289","author":"D Wolfinger","year":"2021","unstructured":"Wolfinger, D., Salazar-Gonz\u00e1lez, J.J.: The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach. Eur. J. Oper. Res. 289, 470\u2013484 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/opre.1100.0881","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Bartolini, E., Mingozzi, A.: An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 59, 414\u2013426 (2011)","journal-title":"Oper. Res."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1016\/j.cie.2008.10.014","volume":"56","author":"F Zhao","year":"2009","unstructured":"Zhao, F., Li, S., Sun, J., Mei, D.: Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. Comput. Ind. Eng. 56, 1642\u20131648 (2009)","journal-title":"Comput. Ind. Eng."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.eswa.2011.07.022","volume":"39","author":"C D\u2019Souza","year":"2012","unstructured":"D\u2019Souza, C., Omkar, S.N., Senthilnath, J.: Pickup and delivery problem using metaheuristics techniques. Expert Syst. Appl. 39, 328\u2013334 (2012)","journal-title":"Expert Syst. Appl."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.trc.2012.04.014","volume":"27","author":"M \u015eahin","year":"2013","unstructured":"\u015eahin, M., \u00c7avu\u015elar, G., \u00d6ncan, T., \u015eahin, G., T\u00fcz\u00fcn Aksu, D.: An efficient heuristic for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads. Transp. Res. Part C Emerg. Technol. 27, 169\u2013188 (2013)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"8_CR9","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. Adv. Neural Inf. Process. Syst. 2692\u20132700 (2015)"},{"key":"8_CR10","unstructured":"Bello, I., Pham, H., Le, Q. V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: 5th International Conference Learning Represent. ICLR 2017 - Work. Track Proc., pp. 1\u201315 (2019)"},{"key":"8_CR11","unstructured":"Nazari, M., Oroojlooy, A., Tak\u00e1\u010d, M., Snyder, L. V.: Reinforcement learning for solving the vehicle routing problem. Adv. Neural Inf. Process. Syst., 9839\u20139849 (2018)"},{"key":"8_CR12","unstructured":"Kool, W., Van Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: 7th International Conference Learning Represention ICLR 2019, pp. 1\u201325 (2019)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Zhao, J., Mao, M., Zhao, X., Zou, J.: A hybrid of deep reinforcement learning and local search for the vehicle routing problems. IEEE Trans. Intell. Transp. Syst. (2020)","DOI":"10.1109\/TITS.2020.3003163"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Xu, Z., Li, Z., Guan, Q., Zhang, D., Li, Q., Nan, J., Liu, C., Bian, W., Ye, J.: Large-scale order dispatch in on-demand ride-hailing platforms: a learning and planning approach. In: Proceedings of ACM SIGKDD International Conference Knowledge Discovery Data Mining, pp. 905\u2013913 (2018)","DOI":"10.1145\/3219819.3219824"},{"key":"8_CR15","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 ACM SIGKDD International Conference Knowledge Discovery Data Mining, pp. 1774\u20131783 (2018)","DOI":"10.1145\/3219819.3219993"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Lopes Silva, M.A., de Souza, S.R., Freitas Souza, M.J., Bazzan, A.L.C.: A reinforcement learning-based multi-agent framework applied for solving routing and scheduling problems. Expert Syst. Appl. 131, 148\u2013171 (2019)","DOI":"10.1016\/j.eswa.2019.04.056"},{"key":"8_CR17","unstructured":"Dai, H., Khalil, E.B., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. Advances Neural Information Processing Systems, pp. 6349\u20136359 (2017)"},{"key":"8_CR18","unstructured":"Li, J., Xin, L., Cao, Z., Lim, A., Song, W., Zhang, J.: Heterogeneous attentions for solving pickup and delivery problem via deep reinforcement learning. IEEE Trans. Intell. Transp. Syst., 1\u201310 (2021)"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"4784","DOI":"10.1109\/TITS.2019.2946711","volume":"21","author":"D Liang","year":"2020","unstructured":"Liang, D., Zhan, Z.H., Zhang, Y., Zhang, J.: An efficient ant colony system approach for new energy vehicle dispatch problem. IEEE Trans. Intell. Transp. Syst. 21, 4784\u20134797 (2020)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"8_CR20","unstructured":"Pfau, D., Vinyals, O.: Connecting Generative Adversarial Networks and Actor-Critic Methods. arXiv preprint arXiv:1610.01945 (2016)"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks and Machine Learning \u2013 ICANN 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15931-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T18:05:28Z","timestamp":1680631528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15931-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159305","9783031159312"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15931-2_8","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":"7 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICANN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Neural Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bristol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"6 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icann2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/e-nns.org\/icann2022\/","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":"561","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":"255","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}