{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T18:55:20Z","timestamp":1780340120896,"version":"3.54.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,5,10]],"date-time":"2014-05-10T00:00:00Z","timestamp":1399680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10732-014-9247-0","type":"journal-article","created":{"date-parts":[[2014,5,9]],"date-time":"2014-05-09T02:21:52Z","timestamp":1399602112000},"page":"483-509","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":99,"title":["A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem"],"prefix":"10.1007","volume":"20","author":[{"given":"John Willmer","family":"Escobar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rodrigo","family":"Linfati","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maria G.","family":"Baldoquin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,5,10]]},"reference":[{"issue":"2","key":"9247_CR1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10107-008-0218-9","volume":"120","author":"R Baldacci","year":"2009","unstructured":"Baldacci, R., Mingozzi, A.: A unified exact method for solving different classes of vehicle routing problems. Math. Program. 120(2), 347\u2013380 (2009)","journal-title":"Math. Program."},{"issue":"3","key":"9247_CR2","first-page":"371","volume":"13","author":"I Chao","year":"1993","unstructured":"Chao, I., Golden, B., Wasil, E.: A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. Am. J. Math. Manag. Sci. 13(3), 371\u2013406 (1993)","journal-title":"Am. J. Math. Manag. Sci."},{"issue":"3","key":"9247_CR3","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.: An algorithm for the vehicle-dispatching problem. Oper. Res. Q. 20(3), 309\u2013318 (1969)","journal-title":"Oper. Res. Q."},{"key":"9247_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo, C., Martinelli, R.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discret. Optim. 12, 129\u2013146 (2014)","journal-title":"Discret. Optim."},{"issue":"9","key":"9247_CR5","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.cor.2011.09.021","volume":"39","author":"J Cordeau","year":"2012","unstructured":"Cordeau, J., Maischberger, M.: A parallel iterated tabu search heuristic for vehicle routing problems. Comput. Oper. Res. 39(9), 2033\u20132050 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9247_CR6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J Cordeau","year":"1997","unstructured":"Cordeau, J., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105\u2013119 (1997)","journal-title":"Networks"},{"issue":"1","key":"9247_CR7","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G Dueck","year":"1993","unstructured":"Dueck, G.: New optimization heuristics. J. Comput. Phys. 104(1), 86\u201392 (1993)","journal-title":"J. Comput. Phys."},{"issue":"1","key":"9247_CR8","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.cor.2012.05.008","volume":"40","author":"J Escobar","year":"2013","unstructured":"Escobar, J., Linfati, R., Toth, P.: A two-phase hybrid metaheuristic algorithm for the capacitated location-routing problem. Comput. Oper. Res 40(1), 70\u201379 (2013)","journal-title":"Comput. Oper. Res"},{"issue":"6","key":"9247_CR9","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40(6), 1086\u20131094 (1992)","journal-title":"Oper. Res."},{"issue":"10","key":"9247_CR10","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.: A tabu search heuristic for the vehicle routing problem. Manage. Sci. 40(10), 1276\u20131290 (1994)","journal-title":"Manage. Sci."},{"issue":"6","key":"9247_CR11","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/0305-0483(76)90097-9","volume":"4","author":"B Gillett","year":"1976","unstructured":"Gillett, B., Johnson, J.: Multi-terminal vehicle-dispatch algorithm. Omega 4(6), 711\u2013718 (1976)","journal-title":"Omega"},{"issue":"2","key":"9247_CR12","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"B Gillett","year":"1974","unstructured":"Gillett, B., Miller, L.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2), 340\u2013349 (1974)","journal-title":"Oper. Res."},{"issue":"2","key":"9247_CR13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230070203","volume":"7","author":"B Golden","year":"1977","unstructured":"Golden, B., Magnanti, T., Nguyen, H.: Implementing vehicle routing algorithms. Networks 7(2), 113\u2013148 (1977)","journal-title":"Networks"},{"issue":"2","key":"9247_CR14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s12532-010-0013-5","volume":"2","author":"C Groer","year":"2010","unstructured":"Groer, C., Golden, B., Wasil, E.: A library of local search heuristics for the vehicle routing problem. Math. Program. Comput. 2(2), 79\u2013101 (2010)","journal-title":"Math. Program. Comput."},{"key":"9247_CR15","first-page":"287","volume-title":"Heuristics: Theory and Applications","author":"D Gulczynski","year":"2013","unstructured":"Gulczynski, D., Golden, B., Savelsbergh, M., Wasil, E.: The multi-depot vehicle routing problem: an integer programming-based heuristic and computational results. In: Siarry, P. (ed.) Heuristics: Theory and Applications, pp. 287\u2013309. Nova Science Publishers Inc, New York (2013)"},{"key":"9247_CR16","first-page":"247","volume":"38","author":"I Heller","year":"1956","unstructured":"Heller, I., Tompkins, C.: An extension of a theorem of dantzig. Ann. Math. Stud. 38, 247\u2013254 (1956)","journal-title":"Ann. Math. Stud."},{"issue":"1","key":"9247_CR17","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the lin-kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9247_CR18","first-page":"283","volume":"44","author":"G Laporte","year":"1984","unstructured":"Laporte, G., Nobert, Y., Arpin, D.: Optimal solutions to capacitated multi-depot vehicle routing problems. Congressus Numerantium 44, 283\u2013292 (1984)","journal-title":"Congressus Numerantium"},{"issue":"3","key":"9247_CR19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/trsc.22.3.161","volume":"22","author":"G Laporte","year":"1988","unstructured":"Laporte, G., Nobert, Y., Taillefer, S.: Solving a family of multi-depot vehicle routing and location-routing problems. Trans. Sci. 22(3), 161\u2013172 (1988)","journal-title":"Trans. Sci."},{"issue":"2","key":"9247_CR20","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"9247_CR21","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-540-85152-3_4","volume":"161","author":"B Ombuki-Berman","year":"2009","unstructured":"Ombuki-Berman, B., Hanshar, F.: Using genetic algorithms for multi-depot vehicle routing. Stud. Comput. Intell. 161, 77\u201399 (2009)","journal-title":"Stud. Comput. Intell."},{"key":"9247_CR22","unstructured":"PassMark: PassMark Performance Test. http:\/\/www.passmark.com (2012). Accessed 14-May-2012"},{"key":"9247_CR23","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403\u20132435 (2007)"},{"issue":"1","key":"9247_CR24","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0377-2217(82)80011-8","volume":"11","author":"O Raft","year":"1982","unstructured":"Raft, O.: A modular algorithm for an extended vehicle scheduling problem. Eur. J. Oper. Res. 11(1), 67\u201376 (1982)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9247_CR25","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1057\/jors.1996.29","volume":"47","author":"J Renaud","year":"1996","unstructured":"Renaud, J., Boctor, F., Laporte, G.: An improved petal heuristic for the vehicle routing problem. J. Oper. Res. Soc. 47(2), 329\u2013336 (1996a)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"9247_CR26","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","volume":"23","author":"J Renaud","year":"1996","unstructured":"Renaud, J., Laporte, G., Boctor, F.: A tabu search heuristic for the multi-depot vehicle routing problem. Computers and Operations Research 23(3), 229\u2013235 (1996b)","journal-title":"Computers and Operations Research"},{"issue":"2","key":"9247_CR27","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. 159(2), 139\u2013171 (2000)","journal-title":"J. Comput. Phys."},{"key":"9247_CR28","first-page":"417","volume":"1520","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. Princ. Pract. Constraint Program. 1520, 417\u2013431 (1998)","journal-title":"Princ. Pract. Constraint Program."},{"issue":"10","key":"9247_CR29","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, 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":"8","key":"9247_CR30","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9 Taillard","year":"1993","unstructured":"Taillard, \u00c9.: Parallel iterative search methods for vehicle routing problems. Networks 23(8), 661\u2013673 (1993)","journal-title":"Networks"},{"issue":"4","key":"9247_CR31","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1080\/08839510151087293","volume":"15","author":"S Thangiah","year":"2001","unstructured":"Thangiah, S., Salhi, S.: Genetic clustering: an adaptive heuristic for the multidepot vehicle routing problem. Appl. Artif. Intell. 15(4), 361\u2013383 (2001)","journal-title":"Appl. Artif. Intell."},{"issue":"4","key":"9247_CR32","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P Toth","year":"2003","unstructured":"Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle-routing problem. INF. J. Comput. 15(4), 333\u2013346 (2003)","journal-title":"INF. J. Comput."},{"issue":"3","key":"9247_CR33","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems. Oper. Res. 60(3), 611\u2013624 (2012)","journal-title":"Oper. Res."},{"key":"9247_CR34","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Implicit depot assignments and rotations in vehicle routing heuristics. Eur. J. Oper. Res. (2014). doi: 10.1016\/jejor201312044"},{"issue":"1","key":"9247_CR35","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1057\/palgrave.jors.2601957","volume":"57","author":"N Wassan","year":"2005","unstructured":"Wassan, N.: A reactive tabu search for the vehicle routing problem. J. Oper. Res. Soc. 57(1), 111\u2013116 (2005)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"9247_CR36","doi-asserted-by":"crossref","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. Oper. Res. Q. 23(3), 333\u2013344 (1972)","journal-title":"Oper. Res. Q."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9247-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9247-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9247-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:34Z","timestamp":1559256874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9247-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,10]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9247"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9247-0","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,10]]}}}