{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T13:13:19Z","timestamp":1779887599270,"version":"3.53.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:00:00Z","timestamp":1626134400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:00:00Z","timestamp":1626134400000},"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":["Cluster Comput"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10586-021-03354-9","type":"journal-article","created":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T04:03:03Z","timestamp":1626148983000},"page":"3671-3692","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Parallel Version of Local Search Heuristic Algorithm to Solve Capacitated Vehicle Routing Problem"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2288-1895","authenticated-orcid":false,"given":"Pramod","family":"Yelmewad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Basavaraj","family":"Talawar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,7,13]]},"reference":[{"issue":"1","key":"3354_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.H.: The truck dispatching problem. Manag. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"issue":"4","key":"3354_CR2","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(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"3354_CR3","volume-title":"The Vehicle Routing Problem","year":"2001","unstructured":"Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2001)"},{"issue":"4","key":"3354_CR4","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":"3354_CR5","doi-asserted-by":"publisher","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.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"3354_CR6","doi-asserted-by":"publisher","first-page":"106411","DOI":"10.1016\/j.asoc.2020.106411","volume":"93","author":"M Adhikari","year":"2020","unstructured":"Adhikari, M., Amgoth, T., Srirama, S.N.: Multi-objective scheduling strategy for scientific workflows in cloud environment: a firefly-based approach. Appl. Soft Comput. 93, 106411 (2020)","journal-title":"Appl. Soft Comput."},{"key":"3354_CR7","doi-asserted-by":"crossref","unstructured":"Laporte, G., Nobert, Y.: Exact algorithms for the vehicle routing problem. In Surveys in Combinatorial Optimization. North-Holland Mathematics Studies, vol. 132. North-Holland, pp. 147\u2013184 (1987)","DOI":"10.1016\/S0304-0208(08)73235-3"},{"key":"3354_CR8","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, London (2009)"},{"key":"3354_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathe. Programm. 100, 423\u2013445 (2004)","journal-title":"Mathe. Programm."},{"key":"3354_CR10","doi-asserted-by":"publisher","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 Arag\u00e3o, M.P., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programm. 106, 491\u2013511 (2006)","journal-title":"Math. Programm."},{"key":"3354_CR11","first-page":"661","volume-title":"A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem","author":"C Rego","year":"1996","unstructured":"Rego, C., Roucairol, C.: A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem, pp. 661\u2013675. Springer, US, Boston, MA (1996)"},{"key":"3354_CR12","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.future.2017.10.035","volume":"81","author":"M Adhikari","year":"2018","unstructured":"Adhikari, M., Amgoth, T.: Heuristic-based load-balancing algorithm for iaas cloud. Future Gener. Comput. Syst. 81, 156\u2013165 (2018)","journal-title":"Future Gener. Comput. Syst."},{"issue":"3","key":"3354_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1008768313174","volume":"16","author":"V Campos","year":"2000","unstructured":"Campos, V., Mota, E.: Heuristic procedures for the capacitated vehicle routing problem. Comput. Optim. Appl. 16(3), 265\u2013277 (2000)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"3354_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","volume":"7","author":"G Laporte","year":"2000","unstructured":"Laporte, G., Gendreau, M., Potvin, J.-Y., Semet, F.: Classical and modern heuristics for the vehicle routing problem. Int. Trans. Oper. Res. 7(4), 285\u2013300 (2000)","journal-title":"Int. Trans. Oper. Res."},{"issue":"8","key":"3354_CR15","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":"4","key":"3354_CR16","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: Tsplib-a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"3354_CR17","volume-title":"Combinatorial Optimization","author":"N Christofides","year":"1979","unstructured":"Christofides, N., Mingozzi, A., Tooth, P., Sandi, C.: Combinatorial Optimization. Wiley Publication, Chichester (1979)"},{"issue":"4","key":"3354_CR18","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42","author":"ML Fisher","year":"1994","unstructured":"Fisher, M.L.: Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. 42(4), 626\u2013642 (1994)","journal-title":"Oper. Res."},{"key":"3354_CR19","doi-asserted-by":"publisher","first-page":"107403","DOI":"10.1016\/j.asoc.2021.107403","volume":"108","author":"AM Altabeeb","year":"2021","unstructured":"Altabeeb, A.M., Mohsen, A.M., Abualigah, L., Ghallab, A.: Solving capacitated vehicle routing problem using cooperative firefly algorithm. Appl. Soft Comput. 108, 107403 (2021)","journal-title":"Appl. Soft Comput."},{"key":"3354_CR20","doi-asserted-by":"crossref","unstructured":"M\u00e1ximo, V.R., Nascimento, M.C.V.: A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem. Eur. J. Oper. Res. (2021)","DOI":"10.1016\/j.ejor.2021.02.024"},{"issue":"9","key":"3354_CR21","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1016\/j.cor.2005.10.010","volume":"34","author":"J Kyt\u00f6joki","year":"2007","unstructured":"Kyt\u00f6joki, J., Nuortio, T., Br\u00e4ysy, O., Gendreau, M.: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput. Oper. Res. 34(9), 2743\u20132757 (2007)","journal-title":"Comput. Oper. Res."},{"key":"3354_CR22","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cor.2019.03.006","volume":"107","author":"F Arnold","year":"2019","unstructured":"Arnold, F., Gendreau, M., S\u00f6rensen, K.: Efficiently solving very large-scale routing problems. Comput. Oper. Res. 107, 32\u201342 (2019)","journal-title":"Comput. Oper. Res."},{"key":"3354_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10586-018-02901-1","volume":"23","author":"P Carvalho","year":"2020","unstructured":"Carvalho, P., Cruz, R., Drummond, L.M.A., Bentes, C., Clua, E., Cataldo, E., Marzulo, L.A.J.: Kernel concurrency opportunities based on GPU benchmarks characterization. Clust. Comput. 23, 177\u2013188 (2020)","journal-title":"Clust. Comput."},{"key":"3354_CR24","unstructured":"Pramod, Y., Basavaraj, T.: Parallel deterministic local search heuristic for minimum latency problem. Clust. Comput. (2020)"},{"issue":"7","key":"3354_CR25","doi-asserted-by":"publisher","first-page":"e4974","DOI":"10.1002\/cpe.4974","volume":"31","author":"P Yelmewad","year":"2019","unstructured":"Yelmewad, P., Talawar, B.: Parallel iterative hill climbing algorithm to solve tsp on gpu. Concurr. Comput. 31(7), e4974 (2019)","journal-title":"Concurr. Comput."},{"key":"3354_CR26","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.cor.2013.10.004","volume":"44","author":"J Jin","year":"2014","unstructured":"Jin, J., Crainic, T.G., L\u00f8kketangen, A.: A cooperative parallel metaheuristic for the capacitated vehicle routing problem. Comput. Oper. Res. 44, 33\u201341 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"3354_CR27","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.jpdc.2012.02.020","volume":"73","author":"C Schulz","year":"2013","unstructured":"Schulz, C.: Efficient local search on the gpu- investigations on the vehicle routing problem. J. Parallel Distrib. Comput. 73(1), 14\u201331 (2013). (Metaheuristics on GPUs)","journal-title":"J. Parallel Distrib. Comput."},{"key":"3354_CR28","doi-asserted-by":"crossref","unstructured":"Abdelatti, M.F., Sodhi, M.S.: An improved gpu-accelerated heuristic technique applied to the capacitated vehicle routing problem. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, GECCO \u201920. Association for Computing Machinery, New York, NY, pp. 663\u2013671 (2020)","DOI":"10.1145\/3377930.3390159"},{"key":"3354_CR29","doi-asserted-by":"crossref","unstructured":"Yelmewad, P., Talawar, B.: Gpu-based parallel heuristics for capacited vehicle routing problem. In: 2020 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT), pp. 1\u20136, (July 2020)","DOI":"10.1109\/CONECCT50063.2020.9198667"},{"issue":"5","key":"3354_CR30","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J-F Cordeau","year":"2002","unstructured":"Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., Semet, F.: A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53(5), 512\u2013522 (2002)","journal-title":"J. Oper. Res. Soc."},{"key":"3354_CR31","doi-asserted-by":"crossref","unstructured":"Golden, B.L., Wasil, E.A., Kelly, J.P., Chao, I.-M.: The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. Springer US, Boston, MA pp. 33\u201356 (1998)","DOI":"10.1007\/978-1-4615-5755-5_2"},{"issue":"5","key":"3354_CR32","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1016\/j.cor.2003.10.002","volume":"32","author":"F Li","year":"2005","unstructured":"Li, F., Golden, B., Wasil, E.: Very large-scale vehicle routing: new test problems, algorithms, and results. Comput. Oper. Res. 32(5), 1165\u20131179 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"3354_CR33","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ejor.2016.09.050","volume":"258","author":"MA Boschetti","year":"2017","unstructured":"Boschetti, M.A., Maniezzo, V., Strappaveccia, F.: Route relaxations on gpu for vehicle routing problems. Eur. J. Oper. Res. 258(2), 456\u2013466 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"3354_CR34","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.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3), 845\u2013858 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"3354_CR35","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, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10), 2519\u20132531 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"3354_CR36","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611\u2013624 (2012)","journal-title":"Oper. Res."},{"issue":"3","key":"3354_CR37","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."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-021-03354-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-021-03354-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-021-03354-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T18:24:34Z","timestamp":1635618274000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-021-03354-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,13]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["3354"],"URL":"https:\/\/doi.org\/10.1007\/s10586-021-03354-9","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,13]]},"assertion":[{"value":"18 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent statement"}},{"value":"The authors declare that they have no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest\/Competing interests"}},{"value":"The source code of proposed work is made publicly available at link","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}