{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T07:55:32Z","timestamp":1779350132093,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T00:00:00Z","timestamp":1558137600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T00:00:00Z","timestamp":1558137600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s00500-019-04072-6","type":"journal-article","created":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T10:02:37Z","timestamp":1558173757000},"page":"2941-2953","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A multi-start ILS\u2013RVND algorithm with adaptive solution acceptance for the CVRP"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7604-8647","authenticated-orcid":false,"given":"Osman","family":"Gokalp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aybars","family":"Ugur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,18]]},"reference":[{"issue":"17","key":"4072_CR1","doi-asserted-by":"publisher","first-page":"5159","DOI":"10.1007\/s00500-016-2112-3","volume":"21","author":"V Agrawal","year":"2017","unstructured":"Agrawal V, Lightner C, Lightner-Laws C, Wagner N (2017) A bi-criteria evolutionary algorithm for a constrained multi-depot vehicle routing problem. Soft Comput 21(17):5159\u20135178","journal-title":"Soft Comput"},{"issue":"7","key":"4072_CR2","doi-asserted-by":"publisher","first-page":"8990","DOI":"10.1016\/j.eswa.2011.01.116","volume":"38","author":"C Alabas-Uslu","year":"2011","unstructured":"Alabas-Uslu C, Dengiz B (2011) A self-adaptive local search algorithm for the classical vehicle routing problem. Expert Syst Appl 38(7):8990\u20138998","journal-title":"Expert Syst Appl"},{"key":"4072_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.cie.2015.02.002","volume":"83","author":"M Avci","year":"2015","unstructured":"Avci M, Topaloglu S (2015) An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries. Comput Ind Eng 83:15\u201329","journal-title":"Comput Ind Eng"},{"key":"4072_CR4","first-page":"315","volume-title":"Combinatorial optimization","author":"N Christofides","year":"1979","unstructured":"Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, Chichester, pp 315\u2013338"},{"issue":"4","key":"4072_CR5","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","journal-title":"Oper Res"},{"issue":"1","key":"4072_CR6","doi-asserted-by":"publisher","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"},{"issue":"1","key":"4072_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/PL00013346","volume":"23","author":"J Dethloff","year":"2001","unstructured":"Dethloff J (2001) Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR-Spektrum 23(1):79\u201396","journal-title":"OR-Spektrum"},{"issue":"1","key":"4072_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G Dueck","year":"1990","unstructured":"Dueck G, Scheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90(1):161\u2013175","journal-title":"J Comput Phys"},{"issue":"3","key":"4072_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1057\/palgrave.jors.2601817","volume":"56","author":"Z Fu","year":"2005","unstructured":"Fu Z, Eglese R, Li LYO (2005) A new tabu search heuristic for the open vehicle routing problem. J Oper Res Soc 56(3):267\u2013274","journal-title":"J Oper Res Soc"},{"issue":"9","key":"4072_CR10","doi-asserted-by":"publisher","first-page":"3443","DOI":"10.1007\/s00500-015-1830-2","volume":"20","author":"SB Gee","year":"2016","unstructured":"Gee SB, Arokiasami WA, Jiang J, Tan KC (2016) Decomposition-based multi-objective evolutionary algorithm for vehicle routing problem with stochastic demands. Soft Comput 20(9):3443\u20133453","journal-title":"Soft Comput"},{"issue":"3","key":"4072_CR11","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","journal-title":"Eur J Oper Res"},{"issue":"8","key":"4072_CR12","doi-asserted-by":"publisher","first-page":"2405","DOI":"10.1016\/j.cor.2005.02.020","volume":"33","author":"S Irnich","year":"2006","unstructured":"Irnich S, Funke B, Gr\u00fcnert T (2006) Sequential search and its application to vehicle-routing problems. Comput Oper Res 33(8):2405\u20132429","journal-title":"Comput Oper Res"},{"issue":"4598","key":"4072_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"2","key":"4072_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"JK Lenstra","year":"1981","unstructured":"Lenstra JK, Kan AR (1981) Complexity of vehicle routing and scheduling problems. Networks 11(2):221\u2013227","journal-title":"Networks"},{"key":"4072_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, Dubois-Lacoste J, C\u00e1ceres LP, Birattari M, St\u00fctzle T (2016) The irace package: iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43\u201358","journal-title":"Oper Res Perspect"},{"key":"4072_CR16","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.cor.2013.07.025","volume":"41","author":"J Michallet","year":"2014","unstructured":"Michallet J, Prins C, Amodeo L, Yalaoui F, Vitry G (2014) Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. Comput Oper Res 41:196\u2013207","journal-title":"Comput Oper Res"},{"issue":"2","key":"4072_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10732-017-9360-y","volume":"24","author":"J Molina","year":"2018","unstructured":"Molina J, L\u00f3pez-S\u00e1nchez A, Hern\u00e1ndez-D\u00edaz AG, Mart\u00ednez-Salazar I (2018) A multi-start algorithm with intelligent neighborhood selection for solving multi-objective humanitarian vehicle routing problems. J Heuristics 24(2):111\u2013133","journal-title":"J Heuristics"},{"issue":"6","key":"4072_CR18","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1007\/s00500-015-1642-4","volume":"20","author":"J Nalepa","year":"2016","unstructured":"Nalepa J, Blocho M (2016) Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput 20(6):2309\u20132327","journal-title":"Soft Comput"},{"issue":"2","key":"4072_CR19","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10732-011-9186-y","volume":"19","author":"PHV Penna","year":"2013","unstructured":"Penna PHV, Subramanian A, Ochi LS (2013) An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. J Heuristics 19(2):201\u2013232","journal-title":"J Heuristics"},{"key":"4072_CR20","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-319-68640-0_20","volume-title":"Optimization Methods and Applications","author":"Iraklis-Dimitrios Psychas","year":"2017","unstructured":"Psychas ID, Marinaki M, Marinakis Y, Migdalas A (2017) Parallel multi-start nondominated sorting particle swarm optimization algorithms for the minimization of the route-based fuel consumption of multiobjective vehicle routing problems. In: Butenko S, Pardalos PM, Shylo V (eds) Optimization methods and applications. Springer, Berlin, pp 425\u2013456"},{"issue":"1","key":"4072_CR21","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10589-014-9713-5","volume":"61","author":"JC Rivera","year":"2015","unstructured":"Rivera JC, Afsar HM, Prins C (2015) A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem. Comput Optim Appl 61(1):159\u2013187","journal-title":"Comput Optim Appl"},{"key":"4072_CR22","doi-asserted-by":"crossref","unstructured":"Sassi O, Cherif-Khettaf WR, Oulamara A (2015) Multi-start iterated local search for the mixed fleet vehicle routing problem with heterogenous electric vehicles. In: European conference on evolutionary computation in combinatorial optimization. Springer, pp 138\u2013149","DOI":"10.1007\/978-3-319-16468-7_12"},{"key":"4072_CR23","unstructured":"St\u00fctzle T (1998) Local search algorithms for combinatorial problems. Dissertation, Darmstadt University of Technology"},{"issue":"10","key":"4072_CR24","doi-asserted-by":"publisher","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":"2","key":"4072_CR25","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E Taillard","year":"1997","unstructured":"Taillard E, Badeau P, Gendreau M, Guertin F, Potvin JY (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31(2):170\u2013186","journal-title":"Transp Sci"},{"issue":"5","key":"4072_CR26","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1080\/716067183","volume":"42","author":"C Tarantilis","year":"2002","unstructured":"Tarantilis C, Kiranoudis C, Vassiliadis V (2002) A backtracking adaptive threshold accepting algorithm for the vehicle routing problem. Syst Anal Model Simul 42(5):631\u2013664","journal-title":"Syst Anal Model Simul"},{"issue":"3","key":"4072_CR27","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"},{"issue":"3","key":"4072_CR28","doi-asserted-by":"publisher","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"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04072-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04072-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04072-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T23:27:56Z","timestamp":1589671676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04072-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,18]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["4072"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04072-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,18]]},"assertion":[{"value":"18 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}