{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T10:32:34Z","timestamp":1777804354068,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002,1]]},"DOI":"10.1016\/s0305-0548(00)00056-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:07:21Z","timestamp":1027616841000},"page":"33-51","source":"Crossref","is-referenced-by-count":203,"title":["A tabu search method for the truck and trailer routing problem"],"prefix":"10.1016","volume":"29","author":[{"given":"I-Ming","family":"Chao","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00056-3_BIB1","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB2","series-title":"Network routing, handbooks in operations research and management science, vol. 8","author":"Ball","year":"1995"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB3","series-title":"Vehicle routing: methods and studies, studies in management science and systems, vol. 16","author":"Golden","year":"1988"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB4","series-title":"Fleet management and logistics","first-page":"33","article-title":"The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results","author":"Golden","year":"1998"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB5","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":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0305-0548(00)00056-3_BIB6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1080\/03155986.1999.11732387","article-title":"A computational study of a new heuristic for the site-dependent vehicle routing problem","volume":"37","author":"Chao","year":"1999","journal-title":"Information Systems and Operational Research"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB7","series-title":"Advances in computational and stochastic optimization, logic programming, and heuristic search","first-page":"301","article-title":"A new algorithm for the site-dependent vehicle routing problem","author":"Chao","year":"1998"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB8","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":"American Journal of Mathematical and Management Sciences"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230260104","article-title":"An improved heuristic for the period vehicle routing problem","volume":"26","author":"Chao","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0377-2217(95)00175-1","article-title":"Vehicle routing problem with trailers","volume":"93","author":"Gerdessen","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB11","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/BF02023006","article-title":"Solving real-life vehicle routing problems efficiently using tabu search","volume":"41","author":"Semet","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB12","series-title":"Vehicle routing: methods and studies, studies in management science and systems, vol. 16","first-page":"149","article-title":"Vehicle routing with site dependencies","author":"Nag","year":"1988"},{"issue":"11","key":"10.1016\/S0305-0548(00)00056-3_BIB13","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1057\/jors.1994.197","article-title":"A tabu search approach for delivering pet food and flour in Switzerland","volume":"45","author":"Rochat","year":"1994","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF02098281","article-title":"A two-phase algorithm for the partial accessibility constrained vehicle routing problem","volume":"61","author":"Semet","year":"1995","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A generalized assignment heuristic for the vehicle routing","volume":"11","author":"Fisher","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB16","series-title":"Optimization theory for large systems","author":"Lasdon","year":"1970"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB17","first-page":"62","article-title":"Routing and scheduling of vehicles and crews: the state of the art","volume":"10","author":"Bodin","year":"1983","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB18","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB19","first-page":"3","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"41","author":"Glover","year":"1986","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB20","unstructured":"Hansen P. The steepest ascent mildest descent heuristic for combinatorial programming. Talk presented at the Congress on numerical methods in combinatorial optimization, Capri, Italy, 1986."},{"key":"10.1016\/S0305-0548(00)00056-3_BIB21","series-title":"Tabu search","author":"Glover","year":"1997"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB22","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","article-title":"New optimization heuristics: the great deluge algorithm and the record-to-record travel","volume":"104","author":"Dueck","year":"1993","journal-title":"Journal of Computational Physics"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB23","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","article-title":"Threshold accepting: a general purpose optimization algorithm","volume":"90","author":"Dueck","year":"1990","journal-title":"Journal of Computational Physics"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB24","series-title":"Combinatorial optimization","first-page":"315","article-title":"The vehicle routing problem","author":"Christofides","year":"1979"},{"key":"10.1016\/S0305-0548(00)00056-3_BIB25","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/355972.355976","article-title":"The design of the XMP linear programming library","volume":"7","author":"Marsten","year":"1981","journal-title":"ACM Transactions on Mathematical Software"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000563?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000563?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T13:52:32Z","timestamp":1555768352000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0305054800000563"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00056-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}