{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:36:13Z","timestamp":1772757373995,"version":"3.50.1"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T00:00:00Z","timestamp":1578096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T00:00:00Z","timestamp":1578096000000},"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":["Oper Res Int J"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s12351-019-00543-8","type":"journal-article","created":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T03:02:54Z","timestamp":1578106974000},"page":"507-549","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Two meta-heuristics for solving the capacitated vehicle routing problem: the case of the Tunisian Post Office"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4163-9869","authenticated-orcid":false,"given":"Ines","family":"Sbai","sequence":"first","affiliation":[]},{"given":"Saoussen","family":"Krichen","sequence":"additional","affiliation":[]},{"given":"Olfa","family":"Limam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,4]]},"reference":[{"issue":"1","key":"543_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s13198-016-0493-4","volume":"9","author":"AO Adewumi","year":"2018","unstructured":"Adewumi AO, Adeleke OJ (2018) A survey of recent advances in vehicle routing problems. Int J Syst Assur Eng Manag 9(1):155\u2013172","journal-title":"Int J Syst Assur Eng Manag"},{"key":"543_CR2","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.eswa.2016.05.023","volume":"61","author":"S Akpinar","year":"2016","unstructured":"Akpinar S (2016) Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem. Exp Syst Appl 61:28\u201338","journal-title":"Exp Syst Appl"},{"key":"543_CR3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.endm.2017.03.030","volume":"58","author":"M Amous","year":"2017","unstructured":"Amous M, Toumi S, Jarboui B, Eddaly M (2017) A variable neighborhood search algorithm for the capacitated vehicle routing problem. Electron Notes Discrete Math 58:231\u2013238","journal-title":"Electron Notes Discrete Math"},{"key":"543_CR4","unstructured":"Augerat P, Belenguer JM, Benavent E, Corberan A, Naddef D, Rinaldi G (1998) Computational results with a branch-and-cut code for the capacitated vehicle routing problem. Technical report 949-M, Universit Joseph Fourier, Grenoble, France"},{"key":"543_CR5","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.asoc.2016.03.005","volume":"46","author":"S Babaie-Kafaki","year":"2016","unstructured":"Babaie-Kafaki S, Ghanbari R, Mahdavi-Amiri N (2016) Hybridizations of genetic algorithms and neighborhood search metaheuristics for fuzzy bus terminal location problems. Appl Soft Comput 46:220\u2013229","journal-title":"Appl Soft Comput"},{"issue":"5","key":"543_CR6","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","volume":"30","author":"BM Baker","year":"2003","unstructured":"Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 30(5):787\u2013800","journal-title":"Comput Oper Res"},{"issue":"2","key":"543_CR7","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","volume":"115","author":"R Baldacci","year":"2008","unstructured":"Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math Program Ser A 115(2):351\u2013385","journal-title":"Math Program Ser A"},{"key":"543_CR8","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.cor.2016.02.009","volume":"78","author":"MC Bouzid","year":"2016","unstructured":"Bouzid MC, Haddadene HA, Salhi S (2016) An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem. Comput Oper Res 78:513\u2013525","journal-title":"Comput Oper Res"},{"key":"543_CR9","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers K, Ramaekers K, Van Nieuwenhuyse I (2016) The vehicle routing problem: state of the art classification and review. Comput Ind Eng 99:300\u2013313","journal-title":"Comput Ind Eng"},{"issue":"2","key":"543_CR10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s002910050106","volume":"22","author":"A Bruns","year":"2000","unstructured":"Bruns A, Klose A, Stahly P (2000) Restructuring of Swiss parcel delivery services. OR-Spectrum 22(2):285\u2013302","journal-title":"OR-Spectrum"},{"issue":"1","key":"543_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10479-010-0705-2","volume":"181","author":"S Cetiner","year":"2010","unstructured":"Cetiner S, Sepil C, Sural H (2010) Hubbing and routing in postal delivery systems. Ann Oper Res 181(1):109\u2013124","journal-title":"Ann Oper Res"},{"issue":"3","key":"543_CR12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides N, Eilon S (1969) An algorithm for the vehicle-dispatching problem. J Oper Res Soc 20(3):309\u2013318","journal-title":"J Oper Res Soc"},{"issue":"5","key":"543_CR13","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"JF Cordeau","year":"2002","unstructured":"Cordeau JF, Gendreau M, Laporte G, Potvin JY, Semet F (2002) A guide to vehicle routing heuristics. J Oper Res Soc 53(5):512\u2013522","journal-title":"J Oper Res Soc"},{"key":"543_CR14","first-page":"17","volume":"2013","author":"L Cui","year":"2013","unstructured":"Cui L, Wang L, Deng J, Zhang J (2013) A new improved quantum evolution algorithm with local search procedure for capacitated vehicle routing problem. Math Probl Eng 2013:17","journal-title":"Math Probl Eng"},{"issue":"1","key":"543_CR15","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6(1):80\u201391","journal-title":"Manag Sci"},{"key":"543_CR16","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.cor.2015.11.010","volume":"78","author":"O Dib","year":"2017","unstructured":"Dib O, Manier MA, Moalic L, Caminada A (2017a) Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks. Comput Oper Res 78:420\u2013430","journal-title":"Comput Oper Res"},{"key":"543_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.eswa.2016.12.009","volume":"72","author":"O Dib","year":"2017","unstructured":"Dib O, Moalic L, Manier MA, Caminada A (2017b) An advanced GA-VNS combination for multicriteria route planning in public transit networks. Exp Syst Appl 72:67\u201382","journal-title":"Exp Syst Appl"},{"issue":"4","key":"543_CR18","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57(4):1472\u20131483","journal-title":"Comput Ind Eng"},{"issue":"3","key":"543_CR19","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R Fukasawa","year":"2006","unstructured":"Fukasawa R, Longo H, Lysgaard J, de Arago MP, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program 106(3):491\u2013511","journal-title":"Math Program"},{"issue":"1","key":"543_CR20","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.cor.2010.05.004","volume":"38","author":"A Garcia-Najera","year":"2011","unstructured":"Garcia-Najera A, Bullinaria JA (2011) An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Comput Oper Res 38(1):287\u2013300","journal-title":"Comput Oper Res"},{"issue":"10","key":"543_CR21","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40(10):1276\u20131290","journal-title":"Manag Sci"},{"key":"543_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00500-018-3530-1","volume":"23","author":"O Gokalp","year":"2019","unstructured":"Gokalp O, Ugur A (2019) A multi-start ILS\u2013RVND algorithm with adaptive solution acceptance for the CVRP. Soft Comput 23:1\u201313","journal-title":"Soft Comput"},{"key":"543_CR23","unstructured":"Goldberg DE, Lingle R (1985) Alleles, loci, and the traveling salesman problem. In: Proceedings of an international conference on genetic algorithms and their applications. Lawrence Erlbaum, Hillsdale, vol 154, pp 154\u2013159"},{"issue":"2","key":"543_CR24","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0377-2217(99)00234-9","volume":"122","author":"T Grunert","year":"2000","unstructured":"Grunert T, Sebastian HJ (2000) Planning models for long-haul operations of postal and express shipment compaines. Eur J Oper Res 122(2):289\u2013309","journal-title":"Eur J Oper Res"},{"key":"543_CR25","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.eswa.2016.09.002","volume":"66","author":"SRA Haddadene","year":"2016","unstructured":"Haddadene SRA, Labadie N, Prodhon C (2016) A GRASP$$\\ast $$ILS for the vehicle routing problem with time windows, synchronization and precedence constraints. Exp Syst Appl 66:274\u2013294","journal-title":"Exp Syst Appl"},{"issue":"3","key":"543_CR26","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovic N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449\u2013467","journal-title":"Eur J Oper Res"},{"key":"543_CR27","first-page":"183","volume-title":"Adaptations in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptations in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. The University of Michigan Press, Ann Arbor, p 183"},{"issue":"3","key":"543_CR28","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1504\/IJOR.2016.078938","volume":"27","author":"K Joshi","year":"2016","unstructured":"Joshi K, Jain K, Bilolikar V (2016) A VNS-GA-based hybrid metaheuristics for resource constrained project scheduling problem. Int J Oper Res 27(3):437\u2013449","journal-title":"Int J Oper Res"},{"key":"543_CR29","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-3-642-35638-4_5","volume":"465","author":"Y Kao","year":"2013","unstructured":"Kao Y, Chen M (2013) Solving the CVRP problem using a hybrid PSO approach. Comput Intell 465:59\u201367","journal-title":"Comput Intell"},{"issue":"3","key":"543_CR30","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s40092-017-0187-9","volume":"13","author":"S Kir","year":"2017","unstructured":"Kir S, Yazgan HR, Tuncel E (2017) A novel heuristic algorithm for capacitated vehicle routing problem. J Ind Eng Int 13(3):323\u2013330","journal-title":"J Ind Eng Int"},{"issue":"2","key":"543_CR31","first-page":"98","volume":"1","author":"N Kumar","year":"2012","unstructured":"Kumar N, Karambir RK (2012) A comparative analysis of pmx, cx and ox crossover operators for solving traveling salesman problem. Int J Latest Res Sci Technol 1(2):98\u2013101","journal-title":"Int J Latest Res Sci Technol"},{"issue":"3","key":"543_CR32","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1051\/ro:2008021","volume":"42","author":"N Labadi","year":"2008","unstructured":"Labadi N, Prins C, Reghioui M (2008) A memetic algorithm for the vehicle routing problem with time windows. RAIRO Oper Res 42(3):415\u2013431","journal-title":"RAIRO Oper Res"},{"issue":"4","key":"543_CR33","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408\u2013416","journal-title":"Transp Sci"},{"issue":"2","key":"543_CR34","first-page":"75","volume":"24","author":"P Lappas","year":"2018","unstructured":"Lappas P, Kritikos E, Ioannou G (2018) A hybrid evolutionary optimization algorithm for the inventory routing problem. Int J Oper Quant Manag 24(2):75\u2013115","journal-title":"Int J Oper Quant Manag"},{"issue":"2\u20133","key":"543_CR35","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10107-005-0652-x","volume":"105","author":"AN Letchford","year":"2006","unstructured":"Letchford AN, Salazar-Gonzlez JJ (2006) Projection results for vehicle routing. Math Program 105(2\u20133):251\u2013274","journal-title":"Math Program"},{"issue":"1","key":"543_CR36","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-002-0336-8","volume":"94","author":"AN Letchford","year":"2002","unstructured":"Letchford AN, Eglese RW, Lysgaard J (2002) Multistars, partial multistars and the capacitated vehicle routing problem. Math Program 94(1):21\u201340","journal-title":"Math Program"},{"issue":"2","key":"543_CR37","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1016\/j.eswa.2007.11.060","volume":"36","author":"SW Lin","year":"2009","unstructured":"Lin SW, Lee ZJ, Ying KC, Lee CY (2009) Applying hybrid meta-heuristics for capacitated vehicle routing problem. Exp Syst Appl 36(2):1505\u20131512","journal-title":"Exp Syst Appl"},{"key":"543_CR38","doi-asserted-by":"crossref","first-page":"560","DOI":"10.2174\/1874110X01408010560","volume":"8","author":"C LinHui","year":"2014","unstructured":"LinHui C, Luo Z (2014) An improved immune genetic algorithm for capacitated vehicle routing problem. Open Cybern Syst J 8:560\u2013565","journal-title":"Open Cybern Syst J"},{"issue":"2","key":"543_CR39","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s00291-012-0289-0","volume":"36","author":"R Liu","year":"2014","unstructured":"Liu R, Jiang Z, Geng N (2014) A hybrid genetic algorithm for the multi-depot open vehicle routing problem. OR Spectrum 36(2):401\u2013421","journal-title":"OR Spectrum"},{"issue":"2","key":"543_CR40","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program 100(2):423\u2013445","journal-title":"Math Program"},{"issue":"11","key":"543_CR41","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"5","key":"543_CR42","doi-asserted-by":"crossref","first-page":"2110","DOI":"10.1016\/j.apm.2011.08.010","volume":"36","author":"H Nazif","year":"2012","unstructured":"Nazif H, Lee LS (2012) Optimised crossover genetic algorithm for capacitated vehicle routing problem. Appl Math Model 36(5):2110\u20132117","journal-title":"Appl Math Model"},{"key":"543_CR43","unstructured":"Nygard Kendall E, Ficek Rhonda K, Sharda Ramesh (1992) Genetic algorithms: biologically inspired search method borrows mechanisms of inheritance to find solutions. OR\/MS Today, pp 28\u201334"},{"issue":"4","key":"543_CR44","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41(4):421\u2013451","journal-title":"Ann Oper Res"},{"key":"543_CR45","first-page":"393","volume":"8494","author":"D Pecin","year":"2014","unstructured":"Pecin D, Pessoa A, Poggi M, Uchoa E (2014) Improved branch-cut-and-price for capacitated vehicle routing. Integer Program Comb Optim 8494:393\u2013403","journal-title":"Integer Program Comb Optim"},{"issue":"1","key":"543_CR46","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s12532-016-0108-8","volume":"9","author":"D Pecin","year":"2017","unstructured":"Pecin D, Pessoa A, Poggi M, Uchoa E (2017) Improved branch-cut-and-price for capacitated vehicle routing. Math Program Comput 9(1):61\u2013100","journal-title":"Math Program Comput"},{"issue":"4","key":"543_CR47","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/ijoc.1080.0312","volume":"21","author":"JY Potvin","year":"2009","unstructured":"Potvin JY (2009) State-of-the art review-evolutionary algorithms for vehicle routing. INFORMS J Comput 21(4):518\u2013548","journal-title":"INFORMS J Comput"},{"issue":"12","key":"543_CR48","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31(12):1985\u20132002","journal-title":"Comput Oper Res"},{"key":"543_CR49","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/3-540-32363-5_4","volume-title":"Recent advances in memetic algorithms","author":"C Prins","year":"2005","unstructured":"Prins C, Bouchenoua S (2005) A memetic algorithm solving the VRP, the CARP and general routing problems with nodes, edges and arcs. Recent advances in memetic algorithms. Springer, Berlin, pp 65\u201385"},{"issue":"3","key":"543_CR50","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.cor.2008.07.010","volume":"37","author":"V Schmid","year":"2010","unstructured":"Schmid V, Doerner KF, Hartl RF, Salazar-Gonzlez JJ (2010) Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. Comput Oper Res 37(3):559\u2013574","journal-title":"Comput Oper Res"},{"issue":"3","key":"543_CR51","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.ejor.2012.08.014","volume":"224","author":"V Schmid","year":"2013","unstructured":"Schmid V, Doerner KF, Laporte G (2013) Rich routing problems arising in supply chain management. Eur J Oper Res 224(3):435\u2013448","journal-title":"Eur J Oper Res"},{"issue":"10","key":"543_CR52","doi-asserted-by":"crossref","first-page":"2519","DOI":"10.1016\/j.cor.2013.01.013","volume":"40","author":"A Subramanian","year":"2013","unstructured":"Subramanian A, Uchoa E, Ochi LS (2013) A hybrid algorithm for a class of vehicle routing problems. Comput Oper Res 40(10):2519\u20132531","journal-title":"Comput Oper Res"},{"issue":"1","key":"543_CR53","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.ejor.2011.06.006","volume":"215","author":"WY Szeto","year":"2011","unstructured":"Szeto WY, Wu Y, Ho SC (2011) An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur J Oper Res 215(1):126\u2013135","journal-title":"Eur J Oper Res"},{"issue":"1","key":"543_CR54","first-page":"1","volume":"10","author":"M Tahmasebi","year":"2017","unstructured":"Tahmasebi M, Khalili-Damghani K, Ghezavati V (2017) A customized bi-objective location-routing problem for locating post offices and delivery of post parcels. J Ind Syst Eng 10(1):1\u201317","journal-title":"J Ind Syst Eng"},{"issue":"8","key":"543_CR55","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Parallel iterative search methods for vehicle routing problems. Networks 23(8):661\u2013673","journal-title":"Networks"},{"issue":"3","key":"543_CR56","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1016\/j.ejor.2005.03.059","volume":"179","author":"CD Tarantilis","year":"2007","unstructured":"Tarantilis CD, Kiranoudis CT (2007) A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector. Eur J Oper Res 179(3):806\u2013822","journal-title":"Eur J Oper Res"},{"issue":"5","key":"543_CR57","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1504\/IJBIC.2015.072260","volume":"7","author":"BE Teoh","year":"2015","unstructured":"Teoh BE, Ponnambalam SG, Kanagaraj G (2015) Differential evolution algorithm with local search for capacitated vehicle routing problem. Int J Bio-Inspired Comput 7(5):321\u2013342","journal-title":"Int J Bio-Inspired Comput"},{"issue":"3","key":"543_CR58","doi-asserted-by":"crossref","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"},{"issue":"04","key":"543_CR59","doi-asserted-by":"crossref","first-page":"156","DOI":"10.4236\/ojop.2015.44015","volume":"4","author":"MS Uddin","year":"2015","unstructured":"Uddin MS (2015) Hybrid genetic algorithm and variable neighborhood search for dynamic facility layout problem. Open J Optim 4(04):156","journal-title":"Open J Optim"},{"issue":"3","key":"543_CR60","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper Res 60(3):611\u2013624","journal-title":"Oper Res"},{"key":"543_CR61","first-page":"1","volume":"18","author":"H Yahyaoui","year":"2018","unstructured":"Yahyaoui H, Kaabachi I, Krichen S, Dekdouk A (2018) Two metaheuristic approaches for solving the multi-compartment vehicle routing problem. Oper Res 18:1\u201324","journal-title":"Oper Res"},{"key":"543_CR62","doi-asserted-by":"crossref","unstructured":"Yeh CC, Liu DY, Liao YK (2016) Two-stage iterated local search for solving capacitated vehicle routing problems. In: 2016 international symposium on computer, consumer and control (IS3C) IEEE, pp 45\u201348","DOI":"10.1109\/IS3C.2016.22"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00543-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-019-00543-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00543-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T06:17:47Z","timestamp":1645769867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-019-00543-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,4]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["543"],"URL":"https:\/\/doi.org\/10.1007\/s12351-019-00543-8","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,4]]},"assertion":[{"value":"5 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}