{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T12:02:16Z","timestamp":1777377736878,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":[[2002,8]]},"DOI":"10.1016\/s0377-2217(01)00227-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:23:30Z","timestamp":1027639410000},"page":"606-617","source":"Crossref","is-referenced-by-count":173,"title":["An efficient genetic algorithm for the traveling salesman problem with precedence constraints"],"prefix":"10.1016","volume":"140","author":[{"given":"Chiung","family":"Moon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jongsoo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gyunghyun","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoonho","family":"Seo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00227-2_BIB1","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","article-title":"Some new branching and bounding criteria for the asymmetric traveling salesman problem","volume":"26","author":"Carpaneto","year":"1980","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB2","unstructured":"M. Gen, R. Cheng, Interval programming using genetic algorithms, in: Proceedings of the First International Symposium on Soft Computing for Industry, 1996, pp. 113\u2013116"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB3","series-title":"Genetic Algorithms and Engineering Design","author":"Gen","year":"1997"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1111\/j.1475-3995.2000.tb00196.x","article-title":"A travelling salesman problem with allocation time window and precedence constraints an application to ship scheduling","volume":"7","author":"Fagerholt","year":"2000","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.37.2.319","article-title":"An additive bounding procedure for combinatorial optimization problems","volume":"37","author":"Fischetti","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB6","first-page":"167","article-title":"A two-commodity network flow approach to the traveling salesman problem","volume":"41","author":"Finke","year":"1984","journal-title":"Congressus Numerantium"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB7","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/mde.4090110512","article-title":"Artificial intelligence, heuristic frameworks and tabu search","volume":"11","author":"Glover","year":"1990","journal-title":"Managerial & Decision Economics"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB8","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\/S0377-2217(01)00227-2_BIB9","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1051\/jphys:019850046080127700","article-title":"Configuration space analysis of travelling salesman problem","volume":"46","author":"Kirkpatrick","year":"1985","journal-title":"Journal Physique"},{"issue":"1","key":"10.1016\/S0377-2217(01)00227-2_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/03052158708941080","article-title":"Modeling and solving the flexible forging module scheduling problem","volume":"12","author":"Kusiak","year":"1987","journal-title":"Engineering Optimization"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-6377(90)90052-7","article-title":"Classification of travelling salesman problem formulation","volume":"9","author":"Langevin","year":"1990","journal-title":"Operational Research Letters"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB12","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for travelling salesman problem","author":"Lin","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB13","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/S0377-2217(99)00133-2","article-title":"Cluster based branching for the asymmetric traveling salesman problem","volume":"119","author":"Lysgaard","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01609016","article-title":"Using cutting planes to solve the symmetric travelling salesman problem","volume":"15","author":"Miliotis","year":"1978","journal-title":"Mathematical programming"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB15","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1287\/opre.45.3.365","article-title":"Dynamic programming strategies for the TSP with time windows and precedence constraints","volume":"45","author":"Mingozzi","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB16","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02125403","article-title":"Genetic algorithms for the travelling salesman problem","volume":"63","author":"Potvin","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB17","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/S0305-0548(99)00066-0","article-title":"A heuristic for the pickup and delivery traveling salesman problem","volume":"27","author":"Renaud","year":"2000","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB18","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","article-title":"The general pickup and delivery problem","volume":"29","author":"Savelsbergh","year":"1995","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB19","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.1109\/12.257714","article-title":"A boolean neural network approach for the travelling salesman problem","volume":"42","author":"Shirrish","year":"1993","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB20","series-title":"Data Structures and Algorithm Analysis","author":"Weiss","year":"1993"},{"key":"10.1016\/S0377-2217(01)00227-2_BIB21","unstructured":"R. Wong, Integer programming formulations of the travelling salesman problem, in: Proceedings of the IEEE International Conference of Circuits and Computers, 1980, pp. 149\u2013152"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002272?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002272?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:20:57Z","timestamp":1555154457000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701002272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0377221701002272"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00227-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}