{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:50:50Z","timestamp":1742964650116,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031265037"},{"type":"electronic","value":"9783031265044"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26504-4_31","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"436-448","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Decision Support for\u00a0Agri-Food Supply Chains in\u00a0the\u00a0E-Commerce Era: The Inbound Inventory Routing Problem with\u00a0Perishable Products"],"prefix":"10.1007","author":[{"given":"D.","family":"Cuellar-Usaqu\u00e9n","sequence":"first","affiliation":[]},{"given":"C.","family":"Gomez","sequence":"additional","affiliation":[]},{"given":"M.","family":"Ulmer","sequence":"additional","affiliation":[]},{"given":"D.","family":"\u00c1lvarez-Mart\u00ednez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"issue":"16","key":"31_CR1","doi-asserted-by":"publisher","first-page":"6492","DOI":"10.3390\/su12166492","volume":"12","author":"M Viu-Roig","year":"2020","unstructured":"Viu-Roig, M., Alvarez-Palau, E.J.: The impact of E-Commerce-related last-mile logistics on cities: a systematic literature review. Sustainability 12(16), 6492 (2020)","journal-title":"Sustainability"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"107793","DOI":"10.1016\/j.cie.2021.107793","volume":"163","author":"W Gu","year":"2022","unstructured":"Gu, W., Archetti, C., Cattaruzza, D., Ogier, M., Semet, F., Speranza, M.G.: A sequential approach for a multi-commodity two-echelon distribution problem. Comput. Industr. Eng. 163, 107793 (2022)","journal-title":"Comput. Industr. Eng."},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Prajapati, D., Chan, F.T., Daultani, Y., Pratap, S.: Sustainable vehicle routing of agro-food grains in the e-commerce industry. Int. J. Prod. Res. 60, 7319\u20137344 (2022)","DOI":"10.1080\/00207543.2022.2034192"},{"key":"31_CR4","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-030-76310-7_17","volume-title":"Production Research","author":"\u00c1M Majluf-Manzur","year":"2021","unstructured":"Majluf-Manzur, \u00c1.M., Gonz\u00e1lez-Ramirez, R.G., Velasco-Paredes, R.A., Villalobos, J.R.: An operational planning model to support first mile logistics for small fresh-produce growers. In: Rossit, D.A., Tohm\u00e9, F., Mej\u00eda Delgadillo, G. (eds.) ICPR-Americas 2020. CCIS, vol. 1408, pp. 205\u2013219. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76310-7_17"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"124481","DOI":"10.1016\/j.physa.2020.124481","volume":"548","author":"Y Ji","year":"2020","unstructured":"Ji, Y., Du, J., Han, X., Wu, X., Huang, R., Wang, S., Liu, Z.: A mixed integer robust programming model for two-echelon inventory routing problem of perishable products. Phys. A 548, 124481 (2020)","journal-title":"Phys. A"},{"issue":"9","key":"31_CR6","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1016\/j.cor.2009.11.009","volume":"37","author":"H Andersson","year":"2010","unstructured":"Andersson, H., Hoff, A., Christiansen, M., Hasle, G., L\u00f8kketangen, A.: Industrial aspects and literature survey: combined inventory management and routing. Comput. Oper. Res. 37(9), 1515\u20131536 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.2013.0472","volume":"48","author":"LC Coelho","year":"2014","unstructured":"Coelho, L.C., Cordeau, J.F., Laporte, G.: Thirty years of inventory routing. Transp. Sci. 48(1), 1\u201319 (2014)","journal-title":"Transp. Sci."},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.ijpe.2010.06.012","volume":"133","author":"NH Moin","year":"2011","unstructured":"Moin, N.H., Salhi, S., Aziz, N.A.B.: An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem. Int. J. Prod. Econ. 133(1), 334\u2013343 (2011)","journal-title":"Int. J. Prod. Econ."},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.cor.2013.06.006","volume":"52","author":"A Mjirda","year":"2014","unstructured":"Mjirda, A., Jarboui, B., Macedo, R., Hanafi, S., Mladenovi\u0107, N.: A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. 52, 291\u2013299 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1287\/ijoc.2018.0817","volume":"31","author":"M Chitsaz","year":"2019","unstructured":"Chitsaz, M., Cordeau, J.F., Jans, R.: A unified decomposition matheuristic for assembly, production, and inventory routing. INFORMS J. Comput. 31(1), 134\u2013152 (2019)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"31_CR11","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1016\/j.ejor.2019.10.007","volume":"282","author":"M Chitsaz","year":"2020","unstructured":"Chitsaz, M., Cordeau, J.F., Jans, R.: A branch-and-cut algorithm for an assembly routing problem. Eur. J. Oper. Res. 282(3), 896\u2013910 (2020)","journal-title":"Eur. J. Oper. Res."},{"issue":"17","key":"31_CR12","doi-asserted-by":"publisher","first-page":"3480","DOI":"10.3390\/app9173480","volume":"9","author":"S \u00c7abuk","year":"2019","unstructured":"\u00c7abuk, S., Erol, R.: Modeling and analysis of multiple-supplier selection problem with price discounts and routing decisions. Appl. Sci. 9(17), 3480 (2019)","journal-title":"Appl. Sci."},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.cor.2019.03.015","volume":"107","author":"SUK Rohmer","year":"2019","unstructured":"Rohmer, S.U.K., Claassen, G.D.H., Laporte, G.: A two-echelon inventory routing problem for perishable products. Comput. Oper. Res. 107, 156\u2013172 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"31_CR14","doi-asserted-by":"publisher","first-page":"4735","DOI":"10.3390\/su12114735","volume":"12","author":"M Wei","year":"2020","unstructured":"Wei, M., Guan, H., Liu, Y., Gao, B., Zhang, C.: Production, replenishment and inventory policies for perishable products in a two-echelon distribution network. Sustainability 12(11), 4735 (2020)","journal-title":"Sustainability"},{"issue":"1","key":"31_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.12.017","volume":"259","author":"D Manerba","year":"2017","unstructured":"Manerba, D., Mansini, R., Riera-Ledesma, J.: The traveling purchaser problem and its variants. Eur. J. Oper. Res. 259(1), 1\u201318 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.dam.2020.08.014","volume":"288","author":"N Bianchessi","year":"2021","unstructured":"Bianchessi, N., Irnich, S., Tilk, C.: A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. Discret. Appl. Math. 288, 152\u2013170 (2021)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"31_CR17","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1287\/opre.1070.0432","volume":"55","author":"R Baldacci","year":"2007","unstructured":"Baldacci, R., Dell\u2019Amico, M., Gonz\u00e1lez, J.S.: The capacitated m-ring-star problem. Oper. Res. 55(6), 1147\u20131162 (2007)","journal-title":"Oper. Res."},{"issue":"1","key":"31_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ejor.2013.10.018","volume":"235","author":"N Bianchessi","year":"2014","unstructured":"Bianchessi, N., Mansini, R., Speranza, M.G.: The distance constrained multiple vehicle traveling purchaser problem. Eur. J. Oper. Res. 235(1), 73\u201387 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Choi, M.J., Lee, S.H.: The multiple traveling purchaser problem. In: Proceedings of the Fortieth International Conference on Computers and Industrial Engineering (CIE), pp. 1\u20135 (2010)","DOI":"10.1109\/ICCIE.2010.5668314"},{"issue":"1","key":"31_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ejor.2015.06.073","volume":"248","author":"M Gendreau","year":"2016","unstructured":"Gendreau, M., Manerba, D., Mansini, R.: The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach. Eur. J. Oper. Res. 248(1), 59\u201371 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"18","key":"31_CR21","doi-asserted-by":"publisher","first-page":"2728","DOI":"10.1016\/j.dam.2011.11.029","volume":"160","author":"EA Hoshino","year":"2012","unstructured":"Hoshino, E.A., De Souza, C.C.: A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Discret. Appl. Math. 160(18), 2728\u20132741 (2012)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"31_CR22","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/net.21588","volume":"65","author":"D Manerba","year":"2015","unstructured":"Manerba, D., Mansini, R.: A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks 65(2), 139\u2013154 (2015)","journal-title":"Networks"},{"issue":"12","key":"31_CR23","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1016\/j.ifacol.2016.07.670","volume":"49","author":"D Manerba","year":"2016","unstructured":"Manerba, D., Mansini, R.: The nurse routing problem with workload constraints and incompatible services. IFAC-PapersOnLine 49(12), 1192\u20131197 (2016)","journal-title":"IFAC-PapersOnLine"},{"issue":"2","key":"31_CR24","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.cor.2011.04.015","volume":"39","author":"J Riera-Ledesma","year":"2012","unstructured":"Riera-Ledesma, J., Salazar-Gonz\u00e1lez, J.J.: Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach. Comput. Oper. Res. 39(2), 391\u2013404 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"31_CR25","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1016\/j.cor.2012.08.011","volume":"40","author":"J Riera-Ledesma","year":"2013","unstructured":"Riera-Ledesma, J., Salazar-Gonz\u00e1lez, J.J.: A column generation approach for a school bus routing problem with resource constraints. Comput. Oper. Res. 40(2), 566\u2013583 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"31_CR26","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM (JACM) 7(4), 326\u2013329 (1960)","journal-title":"J. ACM (JACM)"},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"Cuellar-Usaqu\u00e9n, D., Gomez, C., \u00c1lvarez-Mart\u00ednez, D.: A GRASP\/Path-Relinking algorithm for the traveling purchaser problem. Int. Trans. Oper. Res. 30(2), 831\u2013857 (2021)","DOI":"10.1111\/itor.12985"},{"issue":"12","key":"31_CR28","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985\u20132002 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"31_CR29","first-page":"99","volume":"2","author":"K Magzhan","year":"2013","unstructured":"Magzhan, K., Jani, H.M.: A review and evaluations of shortest path algorithms. Int. J. Sci. Technol. Res. 2(6), 99\u2013104 (2013)","journal-title":"Int. J. Sci. Technol. Res."}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:05:11Z","timestamp":1688198711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","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":"72","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":"48","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":"67% - 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":"3","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)"}}]}}