{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T06:39:36Z","timestamp":1769841576561,"version":"3.49.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"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":[[2003,2]]},"DOI":"10.1016\/s0377-2217(02)00206-0","type":"journal-article","created":{"date-parts":[[2002,11,11]],"date-time":"2002-11-11T14:49:31Z","timestamp":1037026171000},"page":"72-84","source":"Crossref","is-referenced-by-count":28,"title":["Solving the shortest route cut and fill problem using simulated annealing"],"prefix":"10.1016","volume":"145","author":[{"given":"Darrall","family":"Henderson","sequence":"first","affiliation":[]},{"given":"Diane E","family":"Vaughan","sequence":"additional","affiliation":[]},{"given":"Sheldon H","family":"Jacobson","sequence":"additional","affiliation":[]},{"given":"Ron R","family":"Wakefield","sequence":"additional","affiliation":[]},{"given":"Edward C","family":"Sewell","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00206-0_BIB1","series-title":"Local Search in Combinatorial Optimization","author":"Aarts","year":"1997"},{"key":"10.1016\/S0377-2217(02)00206-0_BIB2","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1002\/(SICI)1520-6750(199909)46:6<654::AID-NAV4>3.0.CO;2-A","article-title":"Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries","volume":"46","author":"Anily","year":"1999","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(02)00206-0_BIB3","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1002\/net.3230220408","article-title":"The swapping problem","volume":"22","author":"Anily","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00206-0_BIB4","series-title":"Estimating and Bidding for Heavy Construction","author":"Bartholomew","year":"2000"},{"key":"10.1016\/S0377-2217(02)00206-0_BIB5","unstructured":"P. Chalasani and R. Motwani, Approximating capacitated routing and delivery problems, Working Paper, Department of Computer Science, Stanford University, Palo Alto, CA, 1995"},{"key":"10.1016\/S0377-2217(02)00206-0_BIB6","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90001-R","article-title":"Simulated annealing: A tool for operational research","volume":"46","author":"Eglese","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00206-0_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(02)00206-0_BIB8","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00206-0_BIB9","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1971","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00206-0_BIB10","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00206-0_BIB11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1009679413948","article-title":"Metaheuristics for a flexible assembly system design problem","volume":"3","author":"Jacobson","year":"1997","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(02)00206-0_BIB12","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1080\/03052159808941372","article-title":"Discrete manufacturing process design optimization using computer simulation and generalized hill climbing algorithms","volume":"31","author":"Jacobson","year":"1998","journal-title":"Engineering Optimization"},{"key":"10.1016\/S0377-2217(02)00206-0_BIB13","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulations and traveling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002060?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002060?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T09:25:58Z","timestamp":1556702758000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702002060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0377221702002060"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00206-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}