{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T06:02:36Z","timestamp":1784959356371,"version":"3.55.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":[[1997,5]]},"DOI":"10.1016\/s0305-0548(96)00065-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"445-452","source":"Crossref","is-referenced-by-count":75,"title":["An adaptive memory heuristic for a class of vehicle routing problems with minmax objective"],"prefix":"10.1016","volume":"24","author":[{"given":"Bruce L.","family":"Golden","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u00c9ric D.","family":"Taillard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00065-2_BIB1","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\/S0305-0548(96)00065-2_BIB2","series-title":"The vehicle routing problem with multiple use of vehicles","author":"Fleischmann","year":"1990"},{"key":"10.1016\/S0305-0548(96)00065-2_BIB3","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1057\/jors.1996.133","article-title":"Vehicle routing with multiple use of vehicles","volume":"47","author":"Taillard","year":"1996","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0305-0548(96)00065-2_BIB4","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","article-title":"Approximation algorithms for some routing problems","volume":"7","author":"Frederickson","year":"1978","journal-title":"SIAM Journal Comp."},{"key":"10.1016\/S0305-0548(96)00065-2_BIB5","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.29.3.267","article-title":"The m-travelling salesman problem with minmax objective","volume":"29","author":"Fran\u00e7a","year":"1995","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(96)00065-2_BIB6","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","article-title":"Parallel iterative search methods for vehicle routing problems","volume":"23","author":"Taillard","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(96)00065-2_BIB7","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":"Management Science"},{"key":"10.1016\/S0305-0548(96)00065-2_BIB8","series-title":"Meta-Heuristics: Theory and Application","first-page":"661","article-title":"A parallel tabu search algorithm using ejection chains for the vehicle routing problem","author":"Rego","year":"1996"},{"key":"10.1016\/S0305-0548(96)00065-2_BIB9","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\/S0305-0548(96)00065-2_BIB10","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00065-2_BIB11","series-title":"Combinatorial Optimization","first-page":"313","article-title":"The vehicle routing problem","author":"Christofides","year":"1979"},{"key":"10.1016\/S0305-0548(96)00065-2_BIB12","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"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000652?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000652?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:27:31Z","timestamp":1556396851000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0305054896000652"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00065-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}