{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T12:43:48Z","timestamp":1763037828222,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031206108"},{"type":"electronic","value":"9783031206115"}],"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-031-20611-5_19","type":"book-chapter","created":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T00:14:47Z","timestamp":1669162487000},"page":"222-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hybrid ILS-VND Algorithm for\u00a0the\u00a0Vehicle Routing Problem with\u00a0Release Times"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5874-3091","authenticated-orcid":false,"given":"William","family":"Torres-Tapia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6251-3667","authenticated-orcid":false,"given":"Jairo","family":"Montoya-Torres","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9155-5612","authenticated-orcid":false,"given":"Jos\u00e9","family":"Ruiz-Meza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,23]]},"reference":[{"issue":"5","key":"19_CR1","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1016\/j.trc.2009.12.006","volume":"19","author":"C Archetti","year":"2011","unstructured":"Archetti, C., Feillet, D., Gendreau, M., Grazia Speranza, M.: Complexity of the VRP and SDVRP. Transp. Res. Part C: Emerg. Technol. 19(5), 741\u2013750 (2011)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"19_CR2","volume-title":"Log\u00edstica","author":"R Ballou","year":"2004","unstructured":"Ballou, R.: Log\u00edstica. Administraci\u00f3n de la cadena de suministro, Pearson Educaci\u00f3n (2004)"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1), 29\u201346 (2007)","journal-title":"Ann. Oper. Res."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/j.apm.2017.08.009","volume":"52","author":"M D\u00edaz-Madro\u00f1ero","year":"2017","unstructured":"D\u00edaz-Madro\u00f1ero, M., Mula, J., Peidro, D.: A mathematical programming model for integrating production and procurement transport decisions. Appl. Math. Model. 52, 527\u2013543 (2017)","journal-title":"Appl. Math. Model."},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu, B., Vural, A.V., Reisman, A.: The vehicle routing problem: a taxonomic review. Comput. Ind. Eng. 57(4), 1472\u20131483 (2009)","journal-title":"Comput. Ind. Eng."},{"key":"19_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, Mathematical Sciences Series (1979)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Laporte, G., Potvin, J.Y.: Metaheuristics for the capacitated vrp. Discrete Mathematics and Applications, pp. 129\u2013154 (2002)","DOI":"10.1137\/1.9780898718515.ch6"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Irnich, S., Toth, P., Vigo, D.: Chapter 1: The family of vehicle routing problems. Vehicle Routing, pp. 1\u201333","DOI":"10.1137\/1.9781611973594.ch1"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3), 345\u2013358 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Martins, L.d.C., Gonzalez-Neira, E.M., Hatami, S., Juan, A.A., Montoya-Torres, J.R.: Combining production and distribution in supply chains: The hybrid flow-shop vehicle routing problem. Comput. Ind. Eng. 159, 107486 (2021)","DOI":"10.1016\/j.cie.2021.107486"},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1509\/jmkg.65.4.82.18390","volume":"65","author":"JT Mentzer","year":"2001","unstructured":"Mentzer, J.T., Flint, D.J., Hult, G.T.M.: Logistics service quality as a segment-customized process. J. Mark. 65(4), 82\u2013104 (2001)","journal-title":"J. Mark."},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0360-8352(02)00066-9","volume":"43","author":"H Min","year":"2002","unstructured":"Min, H., Zhou, G.: Supply chain modeling: past, present and future. Comput. Ind. Eng. 43(1), 231\u2013249 (2002)","journal-title":"Comput. Ind. Eng."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.cie.2014.10.029","volume":"79","author":"JR Montoya-Torres","year":"2015","unstructured":"Montoya-Torres, J.R., L\u00f3pez Franco, J., Nieto Isaza, S., Felizzola Jim\u00e9nez, H., Herazo-Padilla, N.: A literature review on the vehicle routing problem with multiple depots. Comput. Ind. Eng. 79, 115\u2013129 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Mourgaya, M., Vanderbeck, F.: The periodic vehicle routing problem: classification and heuristic. RAIRO - Oper. Res. 40(2), 169\u2013194 (2006)","DOI":"10.1051\/ro:2006015"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"HN Psaraftis","year":"1995","unstructured":"Psaraftis, H.N.: Dynamic vehicle routing: status and prospects. Ann. Oper. Res. 61(1), 143\u2013164 (1995)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1111\/j.1747-9991.2007.00064.x","volume":"2","author":"L Shapiro","year":"2007","unstructured":"Shapiro, L.: The embodied cognition research programme. Philos Compass 2(2), 338\u2013346 (2007)","journal-title":"Philos Compass"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.procs.2021.01.355","volume":"180","author":"V Solina","year":"2021","unstructured":"Solina, V., Mirabelli, G.: Integrated production-distribution scheduling with energy considerations for efficient food supply chains. Procedia Comput. Sci. 180, 797\u2013806 (2021)","journal-title":"Procedia Comput. Sci."},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(96)00098-7","volume":"94","author":"DJ Thomas","year":"1996","unstructured":"Thomas, D.J., Griffin, P.M.: Coordinated supply chain management. Eur. J. Oper. Res. 94(1), 1\u201315 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Torres-Tapia, W., Montoya-Torres, J.R., Ruiz-Meza, J., Belmokhtar-Berraf, S.: A matheuristic based on ant colony system for the combined flexible jobshop scheduling and vehicle routing problem. In: 10th IFAC Conference on Manufacturing Modelling, Management and Control. Elsevier, Nantes, France (2022)","DOI":"10.1016\/j.ifacol.2022.09.621"}],"container-title":["Communications in Computer and Information Science","Applied Computer Sciences in Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20611-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T20:11:40Z","timestamp":1671567100000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20611-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206108","9783031206115"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20611-5_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Engineering Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bogot\u00e1","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","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":"30 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"woea2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ieee.udistrital.edu.co\/wea2022","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"143","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":"39","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":"0","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":"27% - 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":"2.83","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.73","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}