{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T10:08:38Z","timestamp":1743329318474},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":[[2000,7]]},"DOI":"10.1016\/s0377-2217(99)00125-3","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"15-27","source":"Crossref","is-referenced-by-count":13,"title":["A computational study of smoothing heuristics for the traveling salesman problem"],"prefix":"10.1016","volume":"124","author":[{"given":"Steven P.","family":"Coy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce L.","family":"Golden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward A.","family":"Wasil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00125-3_BIB1","unstructured":"Bentley, J., Johnson, D., McGeoch, L., Rothberg, E., 1994. Near optimal solutions to very large traveling salesman problems (unpublished manuscript)"},{"key":"10.1016\/S0377-2217(99)00125-3_BIB2","unstructured":"Coy, S., 1998. Fine-tuned learning: A new approach to improving the performance of local search heuristics. Ph.D., dissertation. Robert H. Smith School of Business, University of Maryland, College Park, MD"},{"issue":"4","key":"10.1016\/S0377-2217(99)00125-3_BIB3","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1109\/3468.686706","article-title":"See the forest before the trees: Fine-tuned learning and its application to the traveling salesman problem","volume":"28","author":"Coy","year":"1998","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"10.1016\/S0377-2217(99)00125-3_BIB4","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"},{"issue":"5","key":"10.1016\/S0377-2217(99)00125-3_BIB5","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1109\/21.293486","article-title":"Efficient local search with search space smoothing: A case study of the traveling salesman problem","volume":"24","author":"Gu","year":"1994","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"10.1016\/S0377-2217(99)00125-3_BIB6","doi-asserted-by":"crossref","unstructured":"Johnson, D., McGeoch, L., 1997. The traveling salesman problem: A case study in optimization. In: Aarts, E., Lenstra, J.K., (Eds.), Local Search in Combinatorial Optimization, Wiley, New York, pp. 215\u2013310","DOI":"10.2307\/j.ctv346t9c.13"},{"key":"10.1016\/S0377-2217(99)00125-3_BIB7","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Reinelt, G., Rinaldi, G., 1995. The traveling salesman problem. In: Ball, M., Magnanti, T., Monma, C., Nemhauser, G. (Eds.), Network Models, North-Holland, Amsterdam, pp. 225\u2013330","DOI":"10.1016\/S0927-0507(05)80121-5"},{"issue":"1\/2","key":"10.1016\/S0377-2217(99)00125-3_BIB8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0378-4371(97)00207-0","article-title":"Search-space smoothing for combinatorial optimization problems","volume":"243","author":"Schneider","year":"1997","journal-title":"Physica A, Statistical and Theoretical Physics"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001253?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001253?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T22:12:32Z","timestamp":1580854352000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799001253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0377221799001253"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00125-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}