{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T19:38:22Z","timestamp":1773085102455,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"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":[[1994,11]]},"DOI":"10.1016\/0305-0548(94)90073-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"1025-1033","source":"Crossref","is-referenced-by-count":94,"title":["A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints"],"prefix":"10.1016","volume":"21","author":[{"given":"Bruno-Laurent","family":"Garcia","sequence":"first","affiliation":[]},{"given":"Jean-Yves","family":"Potvin","sequence":"additional","affiliation":[]},{"given":"Jean-Marc","family":"Rousseau","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90073-6_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 Ops Res."},{"key":"10.1016\/0305-0548(94)90073-6_BIB2","series-title":"Vehicle Routing: Methods and Studies","first-page":"65","article-title":"Vehicle routing with time windows: optimization and approximation","author":"Desrochers","year":"1988"},{"key":"10.1016\/0305-0548(94)90073-6_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.22.1.1","article-title":"Time window constrained routing and scheduling problems","volume":"22","author":"Solomon","year":"1988","journal-title":"Transport. Sci."},{"key":"10.1016\/0305-0548(94)90073-6_BIB4","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","article-title":"A new optimization algorithm for the vehicle routing problem with time windows","volume":"40","author":"Desrochers","year":"1992","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90073-6_BIB5","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problem with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90073-6_BIB6","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","article-title":"A parallel route building algorithm for the vehicle routing and scheduling problem with time windows","volume":"66","author":"Potvin","year":"1993","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(94)90073-6_BIB7","article-title":"Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking","author":"Or","year":"1976"},{"key":"10.1016\/0305-0548(94)90073-6_BIB8","series-title":"Vehicle Routing: Methods and Studies","first-page":"85","article-title":"Vehicle routing and scheduling problems with time window constraints: efficient implementations of solution improvement procedures","author":"Solomon","year":"1988"},{"key":"10.1016\/0305-0548(94)90073-6_BIB9","article-title":"A new exchange heuristic for routing problems with time windows","author":"Potvin","year":"1990"},{"key":"10.1016\/0305-0548(94)90073-6_BIB10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0377-2217(90)90091-O","article-title":"An efficient implementation of local search algorithms for constrained routing problems","volume":"47","author":"Savelsbergh","year":"1990","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(94)90073-6_BIB11","article-title":"A tabu search heuristic for the vehicle routing problem","author":"Gendreau","year":"1991"},{"key":"10.1016\/0305-0548(94)90073-6_BIB12","article-title":"Vehicle routing problems via tabu search metaheuristic","author":"Purenza","year":"1991"},{"key":"10.1016\/0305-0548(94)90073-6_BIB13","article-title":"Parallel iterative search methods for vehicle routing problems","author":"Taillard","year":"1992"},{"key":"10.1016\/0305-0548(94)90073-6_BIB14","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":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(94)90073-6_BIB15","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":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(94)90073-6_BIB16","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1016\/0305-0548(93)90060-V","article-title":"Implementing an insertion heuristic for vehicle routing on parallel hardware","volume":"20","author":"Foisy","year":"1993","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(94)90073-6_BIB17","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":"1964","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0305-0548(94)90073-6_BIB18","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search\u2014Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0305-0548(94)90073-6_BIB19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search\u2014Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900736?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900736?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:27:56Z","timestamp":1552915676000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900736"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":19,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0305054894900736"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90073-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}