{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:17:43Z","timestamp":1781885863161,"version":"3.54.5"},"reference-count":14,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0167-6377(92)90028-2","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"219-224","source":"Crossref","is-referenced-by-count":152,"title":["Large-step markov chains for the TSP incorporating local search heuristics"],"prefix":"10.1016","volume":"11","author":[{"given":"Olivier","family":"Martin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steve W","family":"Otto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edward W","family":"Felten","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90028-2_BIB1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","article-title":"Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm","volume":"45","author":"Cerny","year":"1985","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/0167-6377(92)90028-2_BIB2","unstructured":"W. Cook, V. Chvatal and D. Applegate, private communication."},{"key":"10.1016\/0167-6377(92)90028-2_BIB3","doi-asserted-by":"crossref","unstructured":"H. Crowder and M.W. Padberg, \u201cSolving large-scale symmetric travelling salesman problems to optimality\u201d, Management Sci. 26, 495\u2013509. A discussion of this also appears in Chapter 9 of the book by Lawler et al.","DOI":"10.1287\/mnsc.26.5.495"},{"key":"10.1016\/0167-6377(92)90028-2_BIB4","unstructured":"D. Johnson, C. Aragon, L. McGeoch and C. Schevon, \u201cOptimization by simulated annealing: An experimental evaluation\u201d, Part III (The traveling salesman problem), in preparation."},{"key":"10.1016\/0167-6377(92)90028-2_BIB5","unstructured":"D. Johnson, C. Aragon, L. McGeoch and C. Schevon, \u201cOptimization by simulated annealing: An experimental evaluation\u201d, Part II (Graph coloring and number partitioning), to appear in Oper. Res.."},{"key":"10.1016\/0167-6377(92)90028-2_BIB6","unstructured":"D. Johnson, C. Aragon, L. McGeoch and C. Schevon, \u201cOptimization by simulated annealing: An experimental evaluation\u201d, Part I (Graph partitioning), to appear in Oper. Res."},{"key":"10.1016\/0167-6377(92)90028-2_BIB7","series-title":"17th Colloquium on Automata, Languages, and Programming","article-title":"Local optimization and the traveling salesman problem","author":"Johnson","year":"1990"},{"key":"10.1016\/0167-6377(92)90028-2_BIB8","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0167-6377(92)90028-2_BIB9","series-title":"The Traveling Salesman Problem","year":"1984"},{"key":"10.1016\/0167-6377(92)90028-2_BIB10","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":"1965","journal-title":"Bell. Syst. Tech. J."},{"key":"10.1016\/0167-6377(92)90028-2_BIB11","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(92)90028-2_BIB12","unstructured":"O. Martin, S. Otto and E. Felten, \u201clarge-step markov chains for the traveling salesman problem\u201d, preprint."},{"key":"10.1016\/0167-6377(92)90028-2_BIB13","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","article-title":"Evolution algorithms in combinatorial optimization","volume":"7","author":"Muhlenbein","year":"1988","journal-title":"Parallel Comput."},{"issue":"1","key":"10.1016\/0167-6377(92)90028-2_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","article-title":"Optimization of a 532-city symmetric traveling salesman problem by branch and cut","volume":"6","author":"Padberg","year":"1987","journal-title":"Oper. Res. Lett."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900282?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900282?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T16:31:43Z","timestamp":1585067503000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637792900282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["0167637792900282"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90028-2","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}