{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T08:53:56Z","timestamp":1782982436082,"version":"3.54.5"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1016\/s0377-2217(03)00238-8","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T15:12:00Z","timestamp":1062601920000},"page":"552-564","source":"Crossref","is-referenced-by-count":192,"title":["A tabu search algorithm for the open vehicle routing problem"],"prefix":"10.1016","volume":"157","author":[{"given":"Jos\u00e9","family":"Brand\u00e3o","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0377-2217(03)00238-8_BIB1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","article-title":"Routing and scheduling of vehicles and crews: The state of the art","volume":"10","author":"Bodin","year":"1983","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB2","series-title":"Essays and Surveys in Metaheuristics","first-page":"151","article-title":"A lower bound based meta-heuristic for the vehicle routing problem","author":"Brand\u00e3o","year":"2001"},{"issue":"1","key":"10.1016\/S0377-2217(03)00238-8_BIB3","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/S0377-2217(97)00010-6","article-title":"A tabu search algorithm for the multi-trip vehicle routing and scheduling problem","volume":"100","author":"Brand\u00e3o","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB4","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1057\/palgrave.jors.2600595","article-title":"The multi-trip vehicle routing problem","volume":"49","author":"Brand\u00e3o","year":"1998","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB5","series-title":"Combinatorial Optimization","first-page":"313","article-title":"The vehicle routing problem","author":"Christofides","year":"1979"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","article-title":"Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relations","volume":"20","author":"Christofides","year":"1981","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB7","series-title":"Fleet Management and Logistics","author":"Crainic","year":"1998"},{"issue":"4","key":"10.1016\/S0377-2217(03)00238-8_BIB8","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","article-title":"Optimal solution of vehicle routing problems using minimum k-trees","volume":"42","author":"Fisher","year":"1994","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/S0377-2217(03)00238-8_BIB9","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1287\/opre.42.4.775","article-title":"A polynomial algorithm for the degree-constrained minimum k-tree problem","volume":"42","author":"Fisher","year":"1994","journal-title":"Operations Research"},{"issue":"6","key":"10.1016\/S0377-2217(03)00238-8_BIB10","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","article-title":"New insertion and post-optimization procedures for the traveling salesman problem","volume":"40","author":"Gendreau","year":"1992","journal-title":"Operations Research"},{"issue":"10","key":"10.1016\/S0377-2217(03)00238-8_BIB11","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","article-title":"A tabu search heuristic for the vehicle routing","volume":"40","author":"Gendreau","year":"1994","journal-title":"Management Science"},{"issue":"3","key":"10.1016\/S0377-2217(03)00238-8_BIB12","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"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB13","first-page":"421","article-title":"Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem","volume":"vol. 41","author":"Osman","year":"1993"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","article-title":"Probabilistic diversification and intensification in local search for vehicle routing","volume":"1","author":"Rochat","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB15","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1057\/palgrave.jors.2600924","article-title":"A heuristic method for the open vehicle routing problem","volume":"51","author":"Sariklis","year":"2000","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/net.3230110212","article-title":"Formulation and structure of more complex\/realistic routing and scheduling problems","volume":"11","author":"Schrage","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB17","series-title":"Discrete Optimization Algorithms with Pascal Programs","author":"Syslo","year":"1983"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB18","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","article-title":"Parallel iterative search methods for the vehicle routing problems","volume":"23","author":"Taillard","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB19","unstructured":"Toth, P., Vigo, D., submitted. The granular tabu search (and its application to the vehicle routing problem). INFORMS Journal on Computing, submitted for publication"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB20","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0305-0548(99)00101-X","article-title":"Comparing descent heuristics and metaheuristics for the vehicle routing problem","volume":"28","author":"Van Breedam","year":"2001","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(03)00238-8_BIB21","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.30.4.379","article-title":"A network flow-based tabu search heuristic for the vehicle routing problem","volume":"30","author":"Xu","year":"1996","journal-title":"Transportation Science"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002388?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002388?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T12:50:43Z","timestamp":1551099043000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703002388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["S0377221703002388"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00238-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}