{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T06:25:17Z","timestamp":1766298317527,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031774317"},{"type":"electronic","value":"9783031774324"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-77432-4_13","type":"book-chapter","created":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T08:23:30Z","timestamp":1735115010000},"page":"184-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Allocation and\u00a0Sequencing of\u00a0Missions on\u00a0Autonomous Vehicles"],"prefix":"10.1007","author":[{"given":"Paulo","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"Andr\u00e9","family":"Pardal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8320-7346","authenticated-orcid":false,"given":"Sara","family":"Martins","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,26]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1002\/net.3230220408","volume":"22","author":"S Anily","year":"1992","unstructured":"Anily, S., Hassin, R.: The swapping problem. Networks 22(4), 419\u2013433 (1992)","journal-title":"Networks"},{"issue":"5","key":"13_CR2","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/opre.1040.0111","volume":"52","author":"R Baldacci","year":"2004","unstructured":"Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper. Res. 52(5), 723\u2013738 (2004)","journal-title":"Oper. Res."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Battarra, M., Cordeau, J.F., Iori, M.: Chapter 6: pickup-and-delivery problems for goods transportation. In: Vehicle Routing: Problems, Methods, and Applications, Second Edition, pp. 161\u2013191. SIAM (2014)","DOI":"10.1137\/1.9781611973594.ch6"},{"key":"13_CR4","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"},{"issue":"1","key":"13_CR5","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(1), 8\u201315 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O Braysy","year":"2005","unstructured":"Braysy, O., Gendreau, M.: Vehicle routing problem with time windows, part i: route construction and local search algorithms. Transp. Sci. 39(1), 104\u2013118 (2005)","journal-title":"Transp. Sci."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.cor.2018.07.013","volume":"100","author":"N Danloup","year":"2018","unstructured":"Danloup, N., Allaoui, H., Goncalves, G.: A comparison of two meta-heuristics for the pickup and delivery problem with transshipment. Comput. Oper. Res. 100, 155\u2013171 (2018)","journal-title":"Comput. Oper. Res."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Doerner, K.F., Salazar-Gonz\u00e1lez, J.J.: Chapter 7: pickup-and-delivery problems for people transportation. In: Vehicle Routing: Problems, Methods, and Applications, Second Edition, pp. 193\u2013212. SIAM (2014)","DOI":"10.1137\/1.9781611973594.ch7"},{"key":"13_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104805","volume":"113","author":"P Factorovich","year":"2020","unstructured":"Factorovich, P., M\u00e9ndez-D\u00edaz, I., Zabala, P.: Pickup and delivery problem with incompatibility constraints. Comput. Oper. Res. 113, 104805 (2020). https:\/\/doi.org\/10.1016\/j.cor.2019.104805","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0191-2615(86)90020-2","volume":"20","author":"JJ Jaw","year":"1986","unstructured":"Jaw, J.J., Odoni, A.R., Psaraftis, H.N., Wilson, N.H.: A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transp. Res. Part B: Methodol. 20(3), 243\u2013257 (1986)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1080\/00207549608904911","volume":"34","author":"J Kim","year":"1996","unstructured":"Kim, J., Klein, C.: Location of departmental pickup and delivery points for an agv system. Int. J. Prod. Res. 34(2), 407\u2013420 (1996)","journal-title":"Int. J. Prod. Res."},{"key":"13_CR12","unstructured":"Li, B., Lim, A.: PDPTW Li-Lim Benchmark (2024). https:\/\/www.sintef.no\/projectweb\/top\/pdptw\/li-lim-benchmark\/. Accessed 30 Apr 2024"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Min, J., Jin, C.: A two-phase greedy strategy in one to many pdvrp. In: 2016 International Conference on Logistics, Informatics and Service Sciences (LISS), pp.\u00a01\u20135. IEEE (2016)","DOI":"10.1109\/LISS.2016.7854420"},{"key":"13_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.123691","volume":"279","author":"R Moghdani","year":"2021","unstructured":"Moghdani, R., Salimifard, K., Demir, E., Benyettou, A.: The green vehicle routing problem: a systematic literature review. J. Clean. Prod. 279, 123691 (2021). https:\/\/doi.org\/10.1016\/j.jclepro.2020.123691","journal-title":"J. Clean. Prod."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Ngo, H.Q.T., Nguyen, T.P., Nguyen, H.: Research and develop of agv platform for the logistics warehouse environment. In: Proceedings of the Future Technologies Conference (FTC) 2018: Volume 2, pp. 455\u2013465. Springer (2019)","DOI":"10.1007\/978-3-030-02683-7_32"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00291-004-0173-7","volume":"27","author":"G Pankratz","year":"2005","unstructured":"Pankratz, G.: A grouping genetic algorithm for the pickup and delivery problem with time windows. OR Spectrum 27, 21\u201341 (2005)","journal-title":"OR Spectrum"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"SN Parragh","year":"2006","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery models part ii: transportation between pickup and delivery locations. Journal f\u00fcr Betriebswirtschaft 58, 81\u2013117 (2006)","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"MW Savelsbergh","year":"1995","unstructured":"Savelsbergh, M.W., Sol, M.: The general pickup and delivery problem. Transp. Sci. 29(1), 17\u201329 (1995)","journal-title":"Transp. Sci."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Tam, V., Tseng, L.C.: Effective heuristics to solve pickup and delivery problems with time windows. In: Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence, pp. 184\u2013188. IEEE (2003)","DOI":"10.1109\/TAI.2003.1250188"},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1287\/trsc.37.3.347.16044","volume":"37","author":"H Xu","year":"2003","unstructured":"Xu, H., Chen, Z.L., Rajagopal, S., Arunapuram, S.: Solving a practical pickup and delivery problem. Transp. Sci. 37(3), 347\u2013364 (2003)","journal-title":"Transp. Sci."},{"issue":"9","key":"13_CR21","doi-asserted-by":"publisher","first-page":"4607","DOI":"10.3390\/app12094607","volume":"12","author":"X Zang","year":"2022","unstructured":"Zang, X., Zhu, Y., Zhong, Y., Chu, T.: Citespace-based bibliometric review of pickup and delivery problem from 1995 to 2021. Appl. Sci. 12(9), 4607 (2022). https:\/\/doi.org\/10.3390\/app12094607","journal-title":"Appl. Sci."}],"container-title":["Communications in Computer and Information Science","Optimization, Learning Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77432-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T09:02:28Z","timestamp":1735117348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77432-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031774317","9783031774324"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77432-4_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"OL2A","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization, Learning Algorithms and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tenerife","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ol2a2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ol2a.ipb.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}