{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:54:11Z","timestamp":1771487651154,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0305-0548(95)o0026-p","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"229-235","source":"Crossref","is-referenced-by-count":245,"title":["A tabu search heuristic for the multi-depot vehicle routing problem"],"prefix":"10.1016","volume":"23","author":[{"given":"Jacques","family":"Renaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fayez F.","family":"Boctor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(95)O0026-P_BIB1","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1057\/jors.1972.26","article-title":"TRAMP\u2014a multi-depot vehicle scheduling system","volume":"23","author":"Cassidy","year":"1972","journal-title":"Opl Res. Q."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1111\/j.1540-5915.1983.tb00172.x","article-title":"Planning for truck fleet size in the presence of a common-carrier option","volume":"14","author":"Ball","year":"1983","journal-title":"Decis. Sci."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB3","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1287\/opre.35.1.6","article-title":"Computerized vehicle routing in the soft drink industry","volume":"35","author":"Golden","year":"1987","journal-title":"Opns Res."},{"issue":"4","key":"10.1016\/0305-0548(95)O0026-P_BIB4","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/inte.12.4.42","article-title":"A computerized vehicle routing application","volume":"12","author":"Fisher","year":"1982","journal-title":"Interfaces"},{"key":"10.1016\/0305-0548(95)O0026-P_BIB5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/inte.13.6.4","article-title":"Improving the distribution of industrial gases with an on-line computerized routing and scheduling system","volume":"13","author":"Bell","year":"1983","journal-title":"Interfaces"},{"issue":"1","key":"10.1016\/0305-0548(95)O0026-P_BIB6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1287\/inte.17.1.107","article-title":"Real-time wide area dispatch of mobil tank trucks","volume":"17","author":"Brown","year":"1987","journal-title":"Interfaces"},{"key":"10.1016\/0305-0548(95)O0026-P_BIB7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/inte.24.4.113","article-title":"Integrated production and distribution facility planning at Ault Foods","volume":"24","author":"Pooley","year":"1994","journal-title":"Interfaces"},{"key":"10.1016\/0305-0548(95)O0026-P_BIB8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0305-0548(86)90062-6","article-title":"A vehicle routing improvement algorithm-comparison of a \u201cgreedy\u201d and a \u201cmatching\u201d implementation for inventory routing","volume":"23","author":"Dror","year":"1986","journal-title":"Computers Opns Res."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","article-title":"The vehicle routing problem: an overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB10","first-page":"283","article-title":"Optimal solutions to capacitated multidepot vehicle routing problems","volume":"44","author":"Laporte","year":"1984","journal-title":"Congressus Numerantium"},{"key":"10.1016\/0305-0548(95)O0026-P_BIB11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/trsc.22.3.161","article-title":"Solving a family of multi-depot vehicle routing and location-routing problems","volume":"22","author":"Laporte","year":"1988","journal-title":"Transp. Sci."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB12","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/trsc.3.3.192","article-title":"The multiple terminal delivery problem with probabilistic demands","volume":"3","author":"Tillman","year":"1969","journal-title":"Transp. Sci."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB13","first-page":"93","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"46","author":"Clarke","year":"1964","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0041-1647(71)90023-2","article-title":"A study of a look-ahead procedure for solving the multiterminal delivery problem","volume":"5","author":"Tillman","year":"1971","journal-title":"Transp. Res."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB15","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1287\/mnsc.18.11.664","article-title":"An upperbound algorithm for the single and multiple terminal delivery problem","volume":"18","author":"Tillman","year":"1972","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB16","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1057\/jors.1972.53","article-title":"Computer scheduling of vehicles from one or more depots to a number of delivery points","volume":"23","author":"Wren","year":"1972","journal-title":"Opns Res. Q."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB17","doi-asserted-by":"crossref","unstructured":"B. E. Gillett and J. G. Johnson, Multi-terminal vehicle-dispatch algorithm. Omega 4, 711\u2013718.","DOI":"10.1016\/0305-0483(76)90097-9"},{"key":"10.1016\/0305-0548(95)O0026-P_BIB18","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","article-title":"A heuristic algorithm for the vehicle-dispatch problem","volume":"22","author":"Gillett","year":"1974","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB19","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","article-title":"An algorithm for one vehicle-dispatching problem","volume":"20","author":"Christofides","year":"1969","journal-title":"Opl Res. Q."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB20","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230070203","article-title":"Implementing vehicle routing algorithms","volume":"7","author":"Golden","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0305-0548(95)O0026-P_BIB21","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1057\/jors.1970.52","article-title":"A Computational modification to the savings method of vehicle scheduling","volume":"21","author":"Yellow","year":"1970","journal-title":"Opl Res. Q."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB22","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0377-2217(82)80011-8","article-title":"A modular algorithm for an extended vehicle scheduling problem","volume":"11","author":"Raft","year":"1982","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB23","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solution of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell Syst. Comput. J."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB24","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1080\/01966324.1993.10737363","article-title":"A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions","volume":"13","author":"Chao","year":"1993","journal-title":"Am. J. Math. Mgmt Sci."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB25","article-title":"New optimization heuristics, the great deluge algorithm and the record-to-record travel","author":"Dueck","year":"1990"},{"key":"10.1016\/0305-0548(95)O0026-P_BIB26","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/ijoc.2.1.64","article-title":"Worst-case analysis of heuristics for multidepot capacitated vehicle routing problems","volume":"2","author":"Li","year":"1990","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB27","first-page":"259","article-title":"The multiple depot vehicle routing problem with backhauling","volume":"13","author":"Min","year":"1992","journal-title":"J. Business Logist."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB28","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","article-title":"Heuristic for integer programming using surrogate constraints","volume":"8","author":"Glover","year":"1977","journal-title":"Decision Sci."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB29","unstructured":"J. Renaud, F. F. Boctor and G. Laporte, An improved petal heuristic for the vehicle routing problem. J. Opl Res. Soc. In press."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB30","article-title":"A fast composite heuristic for the symmetric traveling salesman problem","author":"Renaud","year":"1994"},{"key":"10.1016\/0305-0548(95)O0026-P_BIB31","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem","volume":"41","author":"Osman","year":"1993","journal-title":"Annls Opns Res."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB32","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/S0167-8191(05)80147-4","article-title":"Robust taboo search for the quadratic assignment problem","volume":"17","author":"Taillard","year":"1991","journal-title":"Parallel Comput."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB33","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","article-title":"A tabu search heuristic for the vehicle routing problem","volume":"40","author":"Gendreau","year":"1994","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)O0026-P_BIB34","article-title":"A tabu search heuristic for the multi-depot vehicle routing problem","author":"Renaud","year":"1994"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895O0026P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895O0026P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T23:27:32Z","timestamp":1556148452000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054895O0026P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0305054895O0026P"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(95)o0026-p","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}