{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T02:21:28Z","timestamp":1784946088453,"version":"3.55.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"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":["Cluster Comput"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10586-024-04643-9","type":"journal-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T05:24:26Z","timestamp":1719897866000},"page":"13583-13606","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A hybrid approach of ALNS with alternative initialization and acceptance mechanisms for capacitated vehicle routing problems"],"prefix":"10.1007","volume":"27","author":[{"given":"Yi\u011fit \u00c7a\u011fatay","family":"Kuyu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fahri","family":"Vatansever","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,1]]},"reference":[{"key":"4643_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.: The truck dispatching problem. Manag. Sci. 6, 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"4643_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri, F., Cotta, C.: Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol. Comput. 2, 1\u201314 (2012)","journal-title":"Swarm Evol. Comput."},{"key":"4643_CR3","unstructured":"Boyd, S., Mattingley, J.: Branch and Bound Methods. Notes for EE364b, Stanford University, 07 (2007)"},{"key":"4643_CR4","unstructured":"Augerat, P., Naddef, D., Belenguer, J., Benavent, E., Corberan, A., Rinaldi, G.: Computational results with a branch and cut code for the capacitated vehicle routing problem. U.S. Department of Energy Office of Scientific and Technical Information, Technical Report (1995)"},{"issue":"1","key":"4643_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01681344","volume":"9","author":"JE Graver","year":"1975","unstructured":"Graver, J.E.: On the foundations of linear and integer linear programming I. Math. Program. 9(1), 207\u2013226 (1975)","journal-title":"Math. Program."},{"issue":"1","key":"4643_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s12293-021-00352-7","volume":"14","author":"Q Shang","year":"2022","unstructured":"Shang, Q., Huang, Y., Wang, Y., Li, M., Feng, L.: Solving vehicle routing problem by memetic search with evolutionary multitasking. Memetic Comput. 14(1), 31\u201344 (2022)","journal-title":"Memetic Comput."},{"key":"4643_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s12293-020-00322-5","volume":"13","author":"L Sun","year":"2021","unstructured":"Sun, L., Pan, Q.K., Jing, X.L., Huang, J.P.: A light-robust-optimization model and an effective memetic algorithm for an open vehicle routing problem under uncertain travel times. Memetic Comput. 13, 149\u2013167 (2021)","journal-title":"Memetic Comput."},{"issue":"1","key":"4643_CR8","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.cie.2008.06.012","volume":"56","author":"TJ Ai","year":"2009","unstructured":"Ai, T.J., Kachitvichyanukul, V.: Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Comput. Ind. Eng. 56(1), 380\u2013387 (2009)","journal-title":"Comput. Ind. Eng."},{"key":"4643_CR9","unstructured":"Harmanani, H.M., Azar, D., Helal, N., Keirouz, W.: A simulated annealing algorithm for the capacitated vehicle routing problem. In: 26th International Conference on Computers and Their Applications, pp. 96\u2013101 (2011)"},{"issue":"5","key":"4643_CR10","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.apm.2011.08.010","volume":"36","author":"H Nazif","year":"2012","unstructured":"Nazif, H., Lee, L.S.: Optimised crossover genetic algorithm for capacitated vehicle routing problem. Appl. Math. Model. 36(5), 380\u2013387 (2012)","journal-title":"Appl. Math. Model."},{"issue":"4","key":"4643_CR11","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1080\/0305215X.2013.791813","volume":"46","author":"Y Xiao","year":"2014","unstructured":"Xiao, Y., Zhao, Q., Kaku, I., Mladenovic, N.: Variable neighbourhood simulated annealing algorithm for capacitated vehicle routing problems. Eng. Optim. 46(4), 562\u2013579 (2014)","journal-title":"Eng. Optim."},{"issue":"5","key":"4643_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1504\/IJBIC.2015.072260","volume":"7","author":"BE Teoh","year":"2015","unstructured":"Teoh, B.E., Ponnambalam, S.G., Kanagaraj, G.: Differential evolution algorithm with local search for capacitated vehicle routing problem. Int. J. Bio-Inspir. Comput. 7(5), 321\u2013342 (2015)","journal-title":"Int. J. Bio-Inspir. Comput."},{"key":"4643_CR13","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.eswa.2016.05.023","volume":"61","author":"S Akpinar","year":"2016","unstructured":"Akpinar, S.: Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem. Expert Syst. Appl. 61, 28\u201338 (2016)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"4643_CR14","first-page":"323","volume":"13","author":"S K\u0131r","year":"2017","unstructured":"K\u0131r, S., Yazgan, H.R., Tuncel, E.: A novel heuristic algorithm for capacitated vehicle routing problem. J. Ind. Eng. Comput. 13(3), 323\u2013330 (2017)","journal-title":"J. Ind. Eng. Comput."},{"issue":"3","key":"4643_CR15","first-page":"212","volume":"4","author":"A Faiz","year":"2018","unstructured":"Faiz, A., Subiyanto, S., Arief, U.M.: An efficient meta-heuristic algorithm for solving capacitated vehicle routing problem. Int. J. Adv. Intell. Inform. 4(3), 212\u2013225 (2018)","journal-title":"Int. J. Adv. Intell. Inform."},{"key":"4643_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105728","volume":"84","author":"A Altabeeb","year":"2019","unstructured":"Altabeeb, A., Mohsen, A., Ghallab, A.: An improved hybrid firefly algorithm for capacitated vehicle routing problem. Appl. Soft Comput. 84, 105728 (2019)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"4643_CR17","first-page":"41","volume":"4","author":"JS Pan","year":"2020","unstructured":"Pan, J.S., Wang, X., Chu, S.C., Nguyen, T.T.: A multi-group grasshopper optimisation algorithm for application in capacitated vehicle routing problem. Data Sci. Pattern Recognit. 4(1), 41\u201356 (2020)","journal-title":"Data Sci. Pattern Recognit."},{"key":"4643_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106242","volume":"140","author":"R Elshaer","year":"2020","unstructured":"Elshaer, R., Hadeer, A.: A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Comput. Ind. Eng. 140, 106242 (2020)","journal-title":"Comput. Ind. Eng."},{"key":"4643_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104987","volume":"122","author":"C Koc","year":"2020","unstructured":"Koc, C., Laporte, G., Tukenmez, I.: A review on vehicle routing with simultaneous pickup and delivery. Comput. Oper. Res. 122, 104987 (2020)","journal-title":"Comput. Oper. Res."},{"key":"4643_CR20","doi-asserted-by":"crossref","unstructured":"Zhang, H., Ge, H., Yang, J., Tong, Y.: Review of vehicle routing problems: models, classification and solving algorithms. Arch. Comput. Methods Eng. 1\u201327 (2021)","DOI":"10.1007\/s11831-021-09574-x"},{"issue":"4","key":"4643_CR21","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"issue":"2","key":"4643_CR22","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.ejor.2012.06.044","volume":"223","author":"E Demir","year":"2012","unstructured":"Demir, E., Bekta\u015f, T., Laporte, G.: An adaptive large neighborhood search heuristic for the pollution-routing problem. Eur. J. Oper. Res. 223(2), 346\u2013359 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"4643_CR23","doi-asserted-by":"publisher","first-page":"3215","DOI":"10.1016\/j.cor.2012.04.007","volume":"39","author":"VC Hemmelmayr","year":"2012","unstructured":"Hemmelmayr, V.C., Cordeau, J.F., Crainic, T.G.: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. 39(12), 3215\u20133228 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"4643_CR24","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","volume":"234","author":"T Vidal","year":"2014","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3), 658\u2013673 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"4643_CR25","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.trc.2012.03.007","volume":"24","author":"LC Coelho","year":"2012","unstructured":"Coelho, L.C., Cordeau, J.F., Laporte, G.: A unified solution framework for multi-attribute vehicle routing problems. Transp. Res. Part C 24, 270\u2013287 (2012)","journal-title":"Transp. Res. Part C"},{"key":"4643_CR26","unstructured":"Shaw, P.: A new local search algorithm providing high quality solutions to vehicle routing problems. Technical Report, University of Strathclyde, Glasgow, pp. 270\u2013287 (1997)"},{"issue":"4598","key":"4643_CR27","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, C.D., Jr., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"4643_CR28","doi-asserted-by":"crossref","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: International Conference on Principles and Practice of Constraint Programming, pp. 417\u2013431 (1998)","DOI":"10.1007\/3-540-49481-2_30"},{"issue":"8","key":"4643_CR29","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403\u20132435 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"4643_CR30","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"4643_CR31","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, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568\u2013581 (1964)","journal-title":"Oper. Res."},{"issue":"3","key":"4643_CR32","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1287\/opre.39.3.456","volume":"39","author":"K Altinkemer","year":"1991","unstructured":"Altinkemer, K., Gavish, B.: Parallel savings based heuristics for the delivery problem. Oper. Res. 39(3), 456\u2013469 (1991)","journal-title":"Oper. Res."},{"issue":"2","key":"4643_CR33","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1057\/jors.1976.95","volume":"27","author":"RH Mole","year":"1976","unstructured":"Mole, R.H., Jameson, S.R.: A sequential route-building algorithm employing a generalised savings criterion. J. Oper. Res. Soc. 27(2), 503\u2013511 (1976)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"4643_CR34","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1057\/jors.1972.53","volume":"23","author":"A Wren","year":"1972","unstructured":"Wren, A., Holliday, A.: Computer scheduling of vehicles from one or more depots to a number of delivery points. J. Oper. Res. Soc. 23(3), 333\u2013344 (1972)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"4643_CR35","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/0377-2217(84)90050-X","volume":"15","author":"WR Stewart","year":"1984","unstructured":"Stewart, W.R., Golden, B.L.: A lagrangean relaxation heuristic for vehicle routing. Eur. J. Oper. Res. 15(1), 84\u201388 (1984)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"4643_CR36","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","volume":"11","author":"J Beasley","year":"1983","unstructured":"Beasley, J.: Route first-cluster second methods for vehicle routing. Omega 11(4), 403\u2013408 (1983)","journal-title":"Omega"},{"key":"4643_CR37","volume-title":"Artificial Intelligence: A Modern Approach","author":"S Russell","year":"2010","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, Saddle River (2010)"},{"issue":"2","key":"4643_CR38","first-page":"2231","volume":"3","author":"R Kumar","year":"2013","unstructured":"Kumar, R., Tyagi, S., Sharma, M.: Memetic algorithm: hybridization of hill climbing with selection operator. Int. J. Soft Comput. Eng. 3(2), 2231\u20132307 (2013)","journal-title":"Int. J. Soft Comput. Eng."},{"key":"4643_CR39","unstructured":"Alyasseri, Z.A.A., Al-Betar, M.A., Awadallah, M.A., Makhadmeh, S.N., Abasi, A.K., Doush, I.A., Alomari, O.A.: A hybrid flower pollination with b-hill climbing algorithm for global optimization. J. King Saud Univ.-Comput. Inf. Sci. (2021)"},{"key":"4643_CR40","unstructured":"Augrat, P.: Approche poly\u00e8drale du probl\u00e8me de tourn\u00e9es de v\u00e9hicules. Doctoral dissertation, Institut National Polytechnique de Grenoble-INPG (1995)"},{"key":"4643_CR41","first-page":"55","volume":"10","author":"N Christofides","year":"1979","unstructured":"Christofides, N.: The vehicle routing problem. Comb. Optim. 10, 55\u201370 (1979)","journal-title":"Comb. Optim."},{"issue":"1","key":"4643_CR42","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1(1), 147\u2013167 (1995)","journal-title":"J. Heuristics"},{"issue":"20","key":"4643_CR43","first-page":"10302","volume":"219","author":"M Stanojevi\u0107","year":"2013","unstructured":"Stanojevi\u0107, M., Stanojevi\u0107, B., Vujo\u0161evi\u0107, M.: Enhanced savings calculation and its applications for solving capacitated vehicle routing problem. Appl. Math. Comput. 219(20), 10302\u201310312 (2013)","journal-title":"Appl. Math. Comput."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-024-04643-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-024-04643-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-024-04643-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T22:03:41Z","timestamp":1727474621000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-024-04643-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,1]]},"references-count":43,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["4643"],"URL":"https:\/\/doi.org\/10.1007\/s10586-024-04643-9","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,1]]},"assertion":[{"value":"21 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"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 performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}