{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T05:36:42Z","timestamp":1769837802663,"version":"3.49.0"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:00Z","timestamp":1765497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:00Z","timestamp":1765497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu","doi-asserted-by":"publisher","award":["2017M578"],"award-info":[{"award-number":["2017M578"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s00500-025-10955-8","type":"journal-article","created":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T09:54:05Z","timestamp":1765533245000},"page":"327-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An enhanced variable neighborhood search algorithm for rich multi-compartment vehicle routing problems"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2642-0233","authenticated-orcid":false,"given":"Olcay","family":"Polat","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2355-7015","authenticated-orcid":false,"given":"Can B.","family":"Kalayci","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5653-1199","authenticated-orcid":false,"given":"Duygu","family":"Topalo\u011flu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,12]]},"reference":[{"key":"10955_CR1","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.asoc.2015.08.020","volume":"37","author":"MMS Abdulkader","year":"2015","unstructured":"Abdulkader MMS, Gajpal Y, ElMekkawy TY (2015) Hybridized ant colony algorithm for the multi compartment vehicle routing problem. Appl Soft Comput 37:196\u2013203. https:\/\/doi.org\/10.1016\/j.asoc.2015.08.020","journal-title":"Appl Soft Comput"},{"key":"10955_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.omega.2017.05.002","volume":"76","author":"M Alinaghian","year":"2018","unstructured":"Alinaghian M, Shokouhi N (2018) Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search. Omega 76:85\u201399. https:\/\/doi.org\/10.1016\/j.omega.2017.05.002","journal-title":"Omega"},{"issue":"4","key":"10955_CR3","doi-asserted-by":"publisher","DOI":"10.3390\/math12040527","volume":"12","author":"G Baptista","year":"2024","unstructured":"Baptista G, Vieira M, Pinto T (2024) An exact approach to the multi-compartment vehicle routing problem: the case of a fuel distribution company. Mathematics 12(4):527","journal-title":"Mathematics"},{"issue":"1","key":"10955_CR4","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s12159-016-0133-z","volume":"9","author":"A Benantar","year":"2016","unstructured":"Benantar A, Ouafi R, Boukachour J (2016) A petrol station replenishment problem: new variant and formulation [journal article]. Logist Res 9(1):6. https:\/\/doi.org\/10.1007\/s12159-016-0133-z","journal-title":"Logist Res"},{"issue":"2","key":"10955_CR5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/inte.1090.0475","volume":"40","author":"M Caramia","year":"2010","unstructured":"Caramia M, Guerriero F (2010) A milk collection problem with incompatibility constraints. Interfaces 40(2):130\u2013143. https:\/\/doi.org\/10.1287\/inte.1090.0475","journal-title":"Interfaces"},{"issue":"1","key":"10955_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1023067016014","volume":"26","author":"ED Chajakis","year":"2003","unstructured":"Chajakis ED, Guignard M (2003) Scheduling deliveries in vehicles with multiple compartments. J Glob Optim 26(1):43\u201378. https:\/\/doi.org\/10.1023\/A:1023067016014","journal-title":"J Glob Optim"},{"key":"10955_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.123932","volume":"277","author":"J Chen","year":"2020","unstructured":"Chen J, Dan B, Shi J (2020) A variable neighborhood search approach for the multi-compartment vehicle routing problem with time windows considering carbon emission. J Clean Prod 277:123932. https:\/\/doi.org\/10.1016\/j.jclepro.2020.123932","journal-title":"J Clean Prod"},{"key":"10955_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.cie.2019.05.008","volume":"133","author":"J Chen","year":"2019","unstructured":"Chen J, Shi J (2019) A multi-compartment vehicle routing problem with time windows for urban distribution\u2014a comparison study on particle swarm optimization algorithms. Comput Ind Eng 133:95\u2013106. https:\/\/doi.org\/10.1016\/j.cie.2019.05.008","journal-title":"Comput Ind Eng"},{"key":"10955_CR9","unstructured":"Christofides N (1979) The vehicle routing problem. Combinatorial optimization"},{"issue":"4","key":"10955_CR10","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581. https:\/\/doi.org\/10.1287\/opre.12.4.568","journal-title":"Oper Res"},{"issue":"3","key":"10955_CR11","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.ejor.2014.10.059","volume":"242","author":"LC Coelho","year":"2015","unstructured":"Coelho LC, Laporte G (2015) Classification, models and exact algorithms for multi-compartment delivery problems. Eur J Oper Res 242(3):854\u2013864. https:\/\/doi.org\/10.1016\/j.ejor.2014.10.059","journal-title":"Eur J Oper Res"},{"issue":"4","key":"10955_CR12","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. Journal of the Operations Research Society of America 2(4):393\u2013410","journal-title":"Journal of the Operations Research Society of America"},{"issue":"4","key":"10955_CR13","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00291-010-0194-3","volume":"33","author":"U Derigs","year":"2011","unstructured":"Derigs U, Gottlieb J, Kalkoff J, Piesche M, Rothlauf F, Vogel U (2011) Vehicle routing with compartments: applications, modelling and heuristics. OR Spectr 33(4):885\u2013914. https:\/\/doi.org\/10.1007\/s00291-010-0194-3","journal-title":"OR Spectr"},{"key":"10955_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.scs.2022.103785","volume":"80","author":"M Erdem","year":"2022","unstructured":"Erdem M (2022) Optimisation of sustainable urban recycling waste collection and routing with heterogeneous electric vehicles. Sustain Cities Soc 80:103785. https:\/\/doi.org\/10.1016\/j.scs.2022.103785","journal-title":"Sustain Cities Soc"},{"key":"10955_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104859","volume":"115","author":"R Eshtehadi","year":"2020","unstructured":"Eshtehadi R, Demir E, Huang Y (2020) Solving the vehicle routing problem with multi-compartment vehicles for city logistics. Comput Oper Res 115:104859. https:\/\/doi.org\/10.1016\/j.cor.2019.104859","journal-title":"Comput Oper Res"},{"issue":"5","key":"10955_CR16","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1016\/j.cor.2006.10.006","volume":"35","author":"AE Fallahi","year":"2008","unstructured":"Fallahi AE, Prins C, Wolfler Calvo R (2008) A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comput Oper Res 35(5):1725\u20131741. https:\/\/doi.org\/10.1016\/j.cor.2006.10.006","journal-title":"Comput Oper Res"},{"issue":"18","key":"10955_CR17","doi-asserted-by":"publisher","DOI":"10.3390\/app131810304","volume":"13","author":"X Fan","year":"2023","unstructured":"Fan X, Yao G, Yang Y (2023) Multi-compartment vehicle routing problem considering traffic congestion under the mixed carbon policy. Appl Sci 13(18):10304","journal-title":"Appl Sci"},{"issue":"2","key":"10955_CR18","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.ejor.2020.12.033","volume":"293","author":"M Frank","year":"2021","unstructured":"Frank M, Ostermeier M, Holzapfel A, H\u00fcbner A, Kuhn H (2021) Optimizing routing and delivery patterns with multi-compartment vehicles. Eur J Oper Res 293(2):495\u2013510. https:\/\/doi.org\/10.1016\/j.ejor.2020.12.033","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10955_CR19","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"Gillett BE, Miller LR (1974) A heuristic algorithm for the vehicle-dispatch problem. Oper Res 22(2):340\u2013349. https:\/\/doi.org\/10.1287\/opre.22.2.340","journal-title":"Oper Res"},{"issue":"2","key":"10955_CR20","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.ejor.2014.09.031","volume":"241","author":"JC Goodson","year":"2015","unstructured":"Goodson JC (2015) A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands. Eur J Oper Res 241(2):361\u2013369. https:\/\/doi.org\/10.1016\/j.ejor.2014.09.031","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10955_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2023.11.032","volume":"317","author":"W Gu","year":"2024","unstructured":"Gu W, Archetti C, Cattaruzza D, Ogier M, Semet F, Speranza MG (2024) Vehicle routing problems with multiple commodities: a survey. Eur J Oper Res 317(1):1\u201315. https:\/\/doi.org\/10.1016\/j.ejor.2023.11.032","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10955_CR22","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449\u2013467. https:\/\/doi.org\/10.1016\/S0377-2217(00)00100-4","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10955_CR23","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.ejor.2015.05.020","volume":"246","author":"T Henke","year":"2015","unstructured":"Henke T, Speranza MG, W\u00e4scher G (2015) The multi-compartment vehicle routing problem with flexible compartment sizes. Eur J Oper Res 246(3):730\u2013743. https:\/\/doi.org\/10.1016\/j.ejor.2015.05.020","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10955_CR24","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10479-018-2938-4","volume":"275","author":"T Henke","year":"2019","unstructured":"Henke T, Speranza MG, W\u00e4scher G (2019) A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes [journal article]. Ann Oper Res 275(2):321\u2013338. https:\/\/doi.org\/10.1007\/s10479-018-2938-4","journal-title":"Ann Oper Res"},{"issue":"1","key":"10955_CR25","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.ejor.2021.01.037","volume":"294","author":"K He\u00dfler","year":"2021","unstructured":"He\u00dfler K (2021) Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes. Eur J Oper Res 294(1):188\u2013205. https:\/\/doi.org\/10.1016\/j.ejor.2021.01.037","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10955_CR26","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1287\/ijoc.2022.1255","volume":"35","author":"K He\u00dfler","year":"2023","unstructured":"He\u00dfler K, Irnich S (2023) Partial dominance in branch-price-and-cut for the basic multicompartment vehicle-routing problem. INFORMS J Comput 35(1):50\u201365. https:\/\/doi.org\/10.1287\/ijoc.2022.1255","journal-title":"INFORMS J Comput"},{"issue":"1","key":"10955_CR27","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10479-018-3042-5","volume":"294","author":"YC Hsu","year":"2020","unstructured":"Hsu YC, Walteros JL, Batta R (2020) Solving the petroleum replenishment and routing problem with variable demands and time windows. Ann Oper Res 294(1):9\u201346. https:\/\/doi.org\/10.1007\/s10479-018-3042-5","journal-title":"Ann Oper Res"},{"issue":"1","key":"10955_CR28","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1287\/trsc.2017.0775","volume":"53","author":"A H\u00fcbner","year":"2019","unstructured":"H\u00fcbner A, Ostermeier M (2019) A multi-compartment vehicle routing problem with loading and unloading costs. Transp Sci 53(1):282\u2013300. https:\/\/doi.org\/10.1287\/trsc.2017.0775","journal-title":"Transp Sci"},{"issue":"8","key":"10955_CR29","doi-asserted-by":"publisher","first-page":"3748","DOI":"10.1016\/j.eswa.2013.11.029","volume":"41","author":"J Jiang","year":"2014","unstructured":"Jiang J, Ng KM, Poh KL, Teo KM (2014) Vehicle routing problem with a heterogeneous fleet and time windows. Expert Syst Appl 41(8):3748\u20133760","journal-title":"Expert Syst Appl"},{"key":"10955_CR30","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.measurement.2019.04.019","volume":"141","author":"I Kaabachi","year":"2019","unstructured":"Kaabachi I, Yahyaoui H, Krichen S, Dekdouk A (2019) Measuring and evaluating hybrid metaheuristics for solving the multi-compartment vehicle routing problem. Measurement 141:407\u2013419. https:\/\/doi.org\/10.1016\/j.measurement.2019.04.019","journal-title":"Measurement"},{"issue":"5","key":"10955_CR31","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1016\/j.cor.2004.11.002","volume":"33","author":"B Kallehauge","year":"2006","unstructured":"Kallehauge B, Larsen J, Madsen OBG (2006) Lagrangian duality applied to the vehicle routing problem with time windows. Comput Oper Res 33(5):1464\u20131487. https:\/\/doi.org\/10.1016\/j.cor.2004.11.002","journal-title":"Comput Oper Res"},{"issue":"1","key":"10955_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/03155986.2017.1303960","volume":"56","author":"L Kiilerich","year":"2018","unstructured":"Kiilerich L, W\u00f8hlk S (2018) New large-scale data instances for CARP and new variations of CARP. INFOR Inf Syst Oper Res 56(1):1\u201332. https:\/\/doi.org\/10.1080\/03155986.2017.1303960","journal-title":"INFOR Inf Syst Oper Res"},{"key":"10955_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.omega.2014.08.007","volume":"51","author":"R Lahyani","year":"2015","unstructured":"Lahyani R, Coelho LC, Khemakhem M, Laporte G, Semet F (2015) A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia. Omega 51:1\u201310. https:\/\/doi.org\/10.1016\/j.omega.2014.08.007","journal-title":"Omega"},{"issue":"1","key":"10955_CR34","doi-asserted-by":"publisher","first-page":"38","DOI":"10.26599\/IJCS.2023.9100017","volume":"8","author":"Z Liu","year":"2024","unstructured":"Liu Z, Li Y, Xu J, Bai D (2024a) Multi-compartment electric vehicle routing problem for perishable products. Int J Crowd Sci 8(1):38\u201348. https:\/\/doi.org\/10.26599\/IJCS.2023.9100017","journal-title":"Int J Crowd Sci"},{"issue":"3","key":"10955_CR35","doi-asserted-by":"publisher","first-page":"130","DOI":"10.26599\/IJCS.2023.9100030","volume":"8","author":"Z Liu","year":"2024","unstructured":"Liu Z, Sun L, Zuo X, Li H (2024b) Heterogeneous electric vehicle routing problem with multiple compartments and multiple trips for the collection of classified waste. Int J Crowd Sci 8(3):130\u2013139. https:\/\/doi.org\/10.26599\/IJCS.2023.9100030","journal-title":"Int J Crowd Sci"},{"issue":"3","key":"10955_CR36","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1016\/j.ejor.2019.01.053","volume":"276","author":"S Martins","year":"2019","unstructured":"Martins S, Ostermeier M, Amorim P, H\u00fcbner A, Almada-Lobo B (2019) Product-oriented time window assignment for a multi-compartment vehicle routing problem. Eur J Oper Res 276(3):893\u2013909","journal-title":"Eur J Oper Res"},{"issue":"11","key":"10955_CR37","doi-asserted-by":"publisher","first-page":"1886","DOI":"10.1016\/j.cor.2009.06.015","volume":"37","author":"JE Mendoza","year":"2010","unstructured":"Mendoza JE, Castanier B, Gu\u00e9ret C, Medaglia AL, Velasco N (2010) A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Comput Oper Res 37(11):1886\u20131898","journal-title":"Comput Oper Res"},{"issue":"3","key":"10955_CR38","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/trsc.1100.0353","volume":"45","author":"JE Mendoza","year":"2011","unstructured":"Mendoza JE, Castanier B, Gu\u00e9ret C, Medaglia AL, Velasco N (2011) Constructive heuristics for the multicompartment vehicle routing problem with stochastic demands. Transp Sci 45(3):346\u2013363. https:\/\/doi.org\/10.1287\/trsc.1100.0353","journal-title":"Transp Sci"},{"issue":"1","key":"10955_CR39","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ejor.2010.02.020","volume":"206","author":"L Muyldermans","year":"2010","unstructured":"Muyldermans L, Pang G (2010) On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm. Eur J Oper Res 206(1):93\u2013103. https:\/\/doi.org\/10.1016\/j.ejor.2010.02.020","journal-title":"Eur J Oper Res"},{"issue":"10","key":"10955_CR40","doi-asserted-by":"publisher","first-page":"3213","DOI":"10.1016\/j.cor.2007.02.021","volume":"35","author":"J Oppen","year":"2008","unstructured":"Oppen J, L\u00f8kketangen A (2008) A tabu search approach for the livestock collection problem. Comput Oper Res 35(10):3213\u20133229","journal-title":"Comput Oper Res"},{"issue":"3","key":"10955_CR41","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.ejor.2020.11.009","volume":"292","author":"M Ostermeier","year":"2021","unstructured":"Ostermeier M, Henke T, H\u00fcbner A, W\u00e4scher G (2021) Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions. Eur J Oper Res 292(3):799\u2013817","journal-title":"Eur J Oper Res"},{"key":"10955_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105759","volume":"142","author":"O Polat","year":"2022","unstructured":"Polat O, Berk Kalayci C, Topalo\u011flu D (2022) Modelling and solving the milk collection problem with realistic constraints. Comput Oper Res 142:105759","journal-title":"Comput Oper Res"},{"issue":"1","key":"10955_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-021-00598-x","volume":"30","author":"O Polat","year":"2022","unstructured":"Polat O, Topalo\u011flu D (2022) Collection of different types of milk with multi-tank tankers under uncertainty: a real case study. TOP 30(1):1\u201333. https:\/\/doi.org\/10.1007\/s11750-021-00598-x","journal-title":"TOP"},{"issue":"18","key":"10955_CR44","doi-asserted-by":"publisher","first-page":"13390","DOI":"10.1016\/j.eswa.2012.05.064","volume":"39","author":"D Popovi\u0107","year":"2012","unstructured":"Popovi\u0107 D, Vidovi\u0107 M, Radivojevi\u0107 G (2012) Variable neighborhood search heuristic for the inventory routing problem in fuel delivery. Expert Syst Appl 39(18):13390\u201313398. https:\/\/doi.org\/10.1016\/j.eswa.2012.05.064","journal-title":"Expert Syst Appl"},{"key":"10955_CR45","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.asoc.2013.10.017","volume":"15","author":"M Reed","year":"2014","unstructured":"Reed M, Yiannakou A, Evering R (2014) An ant colony algorithm for the multi-compartment vehicle routing problem. Appl Soft Comput 15:169\u2013176","journal-title":"Appl Soft Comput"},{"key":"10955_CR46","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.compag.2015.12.021","volume":"121","author":"K Sethanan","year":"2016","unstructured":"Sethanan K, Pitakaso R (2016) Differential evolution algorithms for scheduling raw milk transportation. Comput Electron Agric 121:245\u2013259. https:\/\/doi.org\/10.1016\/j.compag.2015.12.021","journal-title":"Comput Electron Agric"},{"key":"10955_CR47","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.cor.2016.12.023","volume":"81","author":"PV Silvestrin","year":"2017","unstructured":"Silvestrin PV, Ritt M (2017) An iterated tabu search for the multi-compartment vehicle routing problem. Comput Oper Res 81:192\u2013202. https:\/\/doi.org\/10.1016\/j.cor.2016.12.023","journal-title":"Comput Oper Res"},{"issue":"2","key":"10955_CR48","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265. https:\/\/doi.org\/10.1287\/opre.35.2.254","journal-title":"Oper Res"},{"key":"10955_CR49","doi-asserted-by":"publisher","unstructured":"Sukhpal, Kumar K (2024) Multi-trip multi-compartment vehicle routing problem with backhauls. Int J Syst Assur Eng Manage 15(5):1717\u20131734. https:\/\/doi.org\/10.1007\/s13198-023-02040-w","DOI":"10.1007\/s13198-023-02040-w"},{"key":"10955_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2021.102223","volume":"147","author":"L Sun","year":"2021","unstructured":"Sun L, Zhang Y, Hu X (2021) Economical-traveling-distance-based fleet composition with fuel costs: an application in petrol distribution. Transp Res Part E Logist Transp Rev 147:102223. https:\/\/doi.org\/10.1016\/j.tre.2021.102223","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"3","key":"10955_CR51","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa E, Pecin D, Pessoa A, Poggi M, Vidal T, Subramanian A (2017) New benchmark instances for the capacitated vehicle routing problem. Eur J Oper Res 257(3):845\u2013858","journal-title":"Eur J Oper Res"},{"key":"10955_CR52","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.ijpe.2013.04.034","volume":"147","author":"M Vidovi\u0107","year":"2014","unstructured":"Vidovi\u0107 M, Popovi\u0107 D, Ratkovi\u0107 B (2014) Mixed integer and heuristics model for the inventory routing problem in fuel delivery. Int J Prod Econ 147:593\u2013604. https:\/\/doi.org\/10.1016\/j.ijpe.2013.04.034","journal-title":"Int J Prod Econ"},{"key":"10955_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104904","volume":"118","author":"L Wang","year":"2020","unstructured":"Wang L, Kinable J, van Woensel T (2020) The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips. Comput Oper Res 118:104904. https:\/\/doi.org\/10.1016\/j.cor.2020.104904","journal-title":"Comput Oper Res"},{"key":"10955_CR54","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120974","volume":"233","author":"X Wang","year":"2023","unstructured":"Wang X, Liang Y, Tang X, Jiang X (2023) A multi-compartment electric vehicle routing problem with time windows and temperature and humidity settings for perishable product delivery. Expert Syst Appl 233:120974. https:\/\/doi.org\/10.1016\/j.eswa.2023.120974","journal-title":"Expert Syst Appl"},{"issue":"4","key":"10955_CR55","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.1007\/s12351-018-0403-4","volume":"20","author":"H Yahyaoui","year":"2020","unstructured":"Yahyaoui H, Kaabachi I, Krichen S, Dekdouk A (2020) Two metaheuristic approaches for solving the multi-compartment vehicle routing problem. Oper Res 20(4):2085\u20132108. https:\/\/doi.org\/10.1007\/s12351-018-0403-4","journal-title":"Oper Res"},{"issue":"8","key":"10955_CR56","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1177\/0734242x211069738","volume":"40","author":"J Yang","year":"2022","unstructured":"Yang J, Tao F, Zhong Y (2022) Dynamic routing for waste collection and transportation with multi-compartment electric vehicle using smart waste bins. Waste Manag Res 40(8):1199\u20131211. https:\/\/doi.org\/10.1177\/0734242x211069738","journal-title":"Waste Manag Res"},{"key":"10955_CR57","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111482","volume":"156","author":"VF Yu","year":"2024","unstructured":"Yu VF, Salsabila NY, Gunawan A, Handoko AN (2024) An adaptive large neighborhood search for the multi-vehicle profitable tour problem with flexible compartments and mandatory customers. Appl Soft Comput 156:111482. https:\/\/doi.org\/10.1016\/j.asoc.2024.111482","journal-title":"Appl Soft Comput"},{"key":"10955_CR58","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104994","volume":"122","author":"H Zbib","year":"2020","unstructured":"Zbib H, Laporte G (2020) The commodity-split multi-compartment capacitated arc routing problem. Comput Oper Res 122:104994. https:\/\/doi.org\/10.1016\/j.cor.2020.104994","journal-title":"Comput Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10955-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10955-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10955-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T15:55:04Z","timestamp":1769788504000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10955-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,12]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10955"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10955-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,12]]},"assertion":[{"value":"8 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}