{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T13:53:28Z","timestamp":1774965208119,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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,10]]},"DOI":"10.1016\/0305-0548(94)90016-7","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"867-876","source":"Crossref","is-referenced-by-count":90,"title":["Tabu search performance on the symmetric traveling salesman problem"],"prefix":"10.1016","volume":"21","author":[{"given":"John","family":"Knox","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90016-7_BIB1","series-title":"The Traveling Salesman Problem","author":"Lawler","year":"1985"},{"key":"10.1016\/0305-0548(94)90016-7_BIB2","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0305-0548(94)90016-7_BIB3","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0305-0548(94)90016-7_BIB4","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 System tech. J."},{"key":"10.1016\/0305-0548(94)90016-7_BIB5","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","article-title":"Solving large-scale symmetric traveling salesman problems to optimality","volume":"26","author":"Crowder","year":"1980","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90016-7_BIB6","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":"Ops Res."},{"key":"10.1016\/0305-0548(94)90016-7_BIB7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(94)90016-7_BIB8","article-title":"Tabu search","author":"Glover","year":"1988"},{"key":"10.1016\/0305-0548(94)90016-7_BIB9","series-title":"Proceedings of the Third Annual Rocky Mountain Conference on Artificial Intelligence","first-page":"306","article-title":"Tabu search: an effective heuristic for combinatorial optimization problems","author":"Knox","year":"1988"},{"key":"10.1016\/0305-0548(94)90016-7_BIB10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","article-title":"An algorithm for the vehicle dispatching problem","volume":"20","author":"Christofides","year":"1969","journal-title":"Opl Res. Q."},{"key":"10.1016\/0305-0548(94)90016-7_BIB11","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","article-title":"Solution of a large-scale traveling salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90016-7_BIB12","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","article-title":"A dynamic programming approach to sequencing problems","volume":"10","author":"Held","year":"1962","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"10.1016\/0305-0548(94)90016-7_BIB13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/mnsc.10.2.225","article-title":"A heuristic approach to solving traveling salesman problems","volume":"10","author":"Karg","year":"1964","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90016-7_BIB14","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/362588.362593","article-title":"A man-machine approach toward solving the traveling salesman problem","volume":"14","author":"Krolak","year":"1971","journal-title":"Commun. ACM"},{"key":"10.1016\/0305-0548(94)90016-7_BIB15","series-title":"Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms","first-page":"224","article-title":"A study of permutation crossover operators on the traveling salesman problem","author":"Oliver","year":"1987"},{"key":"10.1016\/0305-0548(94)90016-7_BIB16","article-title":"The application of tabu search to the symmetric traveling salesman problem","author":"Knox","year":"1989"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900167?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900167?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:27:46Z","timestamp":1552930066000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":16,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0305054894900167"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90016-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}