{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:50:50Z","timestamp":1767034250647},"reference-count":29,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":[[2003,4]]},"DOI":"10.1016\/s0305-0548(02)00050-3","type":"journal-article","created":{"date-parts":[[2003,1,10]],"date-time":"2003-01-10T18:08:14Z","timestamp":1042222094000},"page":"773-786","source":"Crossref","is-referenced-by-count":73,"title":["A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem"],"prefix":"10.1016","volume":"30","author":[{"given":"In-Chan","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seong-In","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hak-Soo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00050-3_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(02)00050-3_BIB2","doi-asserted-by":"crossref","first-page":"1837","DOI":"10.1080\/00207548908942657","article-title":"IC insertion: an application of the traveling salesman problem","volume":"27","author":"Chan","year":"1989","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB3","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1145\/2135.2141","article-title":"An improved solution to the traveling salesman problem with thousands of nodes","volume":"27","author":"Litke","year":"1984","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB4","series-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"Lawler","year":"1985"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB5","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":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB6","unstructured":"Or I. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D. thesis, Evanston, IL: Northwestern University, 1976."},{"key":"10.1016\/S0305-0548(02)00050-3_BIB7","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/0305-0548(94)90016-7","article-title":"Tabu search performance on the symmetric traveling salesman problem","volume":"21","author":"Knox","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB8","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0305-0548(97)00030-0","article-title":"Optimizing tabu list size for the traveling salesman problem","volume":"25","author":"Tsubakitani","year":"1998","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1109\/ICEC.1994.350051","article-title":"A new genetic approach for the traveling salesman problem","volume":"2","author":"Bui","year":"1994","journal-title":"Proceedings of the First IEEE Conference on Evolution Computation"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0305-0548(93)E0024-N","article-title":"Genetic algorithm crossover operations for ordering applications","volume":"22","author":"Poon","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02125403","article-title":"Genetic algorithm for the traveling salesman problem","volume":"63","author":"Potvin","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB12","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0377-2217(95)00077-1","article-title":"Genetic algorithms and traveling salesman problems","volume":"93","author":"Chatterjee","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB13","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/S0377-2217(97)00206-3","article-title":"Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: an empirical study","volume":"108","author":"Schmitt","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB14","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1023\/A:1018918003761","article-title":"Job shop scheduling with separable sequence-dependent setups","volume":"70","author":"Choi","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB15","first-page":"59","article-title":"An approximation algorithm for the asymmetric traveling salesman problem","volume":"28","author":"Brest","year":"1998","journal-title":"Ricerca Operativa"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB16","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","article-title":"A patching algorithm for the nonsymmetric traveling-salesman problem","volume":"8","author":"Karp","year":"1979","journal-title":"SIAM Journal Computing"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB17","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","article-title":"An algorithm for the traveling salesman problem","volume":"11","author":"Little","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB18","unstructured":"Balas E, Toth P. Branch and bound methods. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB, editors. The traveling salesman problem. New York: Wiley, 1985. p. 361\u2013402."},{"key":"10.1016\/S0305-0548(02)00050-3_BIB19","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-6377(89)90038-2","article-title":"Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem","volume":"8","author":"Miller","year":"1989","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB20","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1287\/mnsc.43.11.1520","article-title":"A polyhedral approach to the asymmetric traveling salesman problem","volume":"43","author":"Fischetti","year":"1997","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB21","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0377-2217(97)00358-5","article-title":"The asymmetric travelling salesman problem and a reformulation of the Miller\u2013Tucker\u2013Zemlin constraints","volume":"112","author":"Gouveia","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB22","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1137\/S089548019122232X","article-title":"The graphical asymmetric traveling salesman polyhedron: symmetric inequalities","volume":"9","author":"Chopra","year":"1996","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB23","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/0377-2217(94)00010-A","article-title":"A worst-case analysis of two approximate algorithms for the asymmetric traveling salesman problem","volume":"81","author":"Righini","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0167-6377(96)00037-5","article-title":"A note on the complexity of the asymmetric traveling salesman problem","volume":"20","author":"Zhang","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB25","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1287\/opre.19.2.278","article-title":"Pathology of traveling-salesman subtour-elimination algorithms","volume":"19","author":"Bellmore","year":"1971","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB26","unstructured":"TSPLIB, http:\/\/www.iwr.uni-heidelber.de\/iwr\/comopt\/software\/TSPLIB95\/atsp"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB27","series-title":"Linear network optimization: algorithms and codes","author":"Bertsekas","year":"1991"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB28","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1145\/212066.212084","article-title":"Algorithm 750; CDT: a subroutine for the exact solution of large-scale, asymmetric traveling salesman problems","volume":"21","author":"Carpaneto","year":"1995","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1016\/S0305-0548(02)00050-3_BIB29","unstructured":"NETLIB, http:\/\/www.netlib.org\/toms\/750"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000503?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000503?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T13:31:16Z","timestamp":1556717476000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802000503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0305054802000503"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00050-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}