{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:48:32Z","timestamp":1777128512088,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,11,9]],"date-time":"2006-11-09T00:00:00Z","timestamp":1163030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,11,9]],"date-time":"2006-11-09T00:00:00Z","timestamp":1163030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s10489-006-0018-y","type":"journal-article","created":{"date-parts":[[2006,11,8]],"date-time":"2006-11-08T15:04:45Z","timestamp":1162998285000},"page":"183-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":52,"title":["Genetic operators for combinatorial optimization in TSP and microarray gene ordering"],"prefix":"10.1007","volume":"26","author":[{"given":"Shubhra Sankar","family":"Ray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanghamitra","family":"Bandyopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sankar K.","family":"Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,9]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larranaga","year":"1999","unstructured":"Larranaga P, Kuijpers C, Murga R, Inza I, Dizdarevic S (1999) Genetic algorithms for the traveling salesman problem: a review of representations and operators. Artificial Intell Rev 13:129\u2013170","journal-title":"Artificial Intell Rev"},{"key":"18_CR2","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson, DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Co., San Francisco"},{"key":"18_CR3","unstructured":"Goldberg DE (1989) Genetic algorithm in search, optimization and machine learning, Machine Learning, Addison-Wesley, New York"},{"key":"18_CR4","unstructured":"Tsai CF, Tsai CW, Yang T (2002) A modified multiple-searching method to genetic algorithms for solving traveling salesman problem. In: IEEE int conf systems, Man and cybernetics, vol. 3, pp 6\u20139"},{"issue":"5","key":"18_CR5","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1109\/3468.867862","volume":"30","author":"L Jiao","year":"2000","unstructured":"Jiao L, Wang L (2000) A novel genetic algorithm based on immunity. IEEE Transactions on Systems, Man and Cybernetics, Part A 30(5):552\u2013561","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part A"},{"key":"18_CR6","first-page":"497","volume":"2","author":"SS Ray","year":"2004","unstructured":"Ray SS, Bandyopadhyay S, Pal SK (2004) New operators of genetic algorithms for traveling salesman problem. Cambridge, UK, ICPR-04 2:497\u2013500","journal-title":"Cambridge, UK, ICPR-04"},{"key":"18_CR7","first-page":"243","volume":"51","author":"CN Fiechter","year":"1994","unstructured":"Fiechter CN (1994) A parallel tabu search algorithm for large traveling salesman problems. Discrete Appl Math Combin Oper Res Comput Sci 51:243\u2013267","journal-title":"Discrete Appl Math Combin Oper Res Comput Sci"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Zachariasen M, Dam M (1995) Tabu search on the geometric traveling salesman problem. In: Proc. of int conf on metaheuristics, pp 571\u2013587","DOI":"10.1007\/978-1-4613-1361-8_34"},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1287\/ijoc.5.4.328","volume":"5","author":"JY Potvin","year":"1993","unstructured":"Potvin JY (1993) The traveling salesman problem: a neural network perspective. ORSA J Comput 5:328\u2013348","journal-title":"ORSA J Comput"},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1016\/j.chaos.2005.08.114","volume":"28","author":"Y Bai","year":"2006","unstructured":"Bai Y, Zhang W, Jin Z (2006) An new self-organizing maps strategy for solving the traveling salesman problem. Chaos, Solitons & Fractals 28(4):1082\u20131089","journal-title":"Chaos, Solitons & Fractals"},{"key":"18_CR11","unstructured":"Stutzle T, Dorigo M (1999) ACO algorithms for the traveling salesman problem, evolutionary algorithms in engineering and computer science. John Wiley and Sons"},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic for the traveling salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"1","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun K (2000) An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur J Oper Res 1:106\u2013130","journal-title":"Eur J Oper Res"},{"key":"18_CR14","unstructured":"Applegate D, Cook W, Rohe A (2000) Chained Lin-Kernighan for large traveling salesman problems. Tech Rep Dept Comput Appl Math Rice Univ"},{"issue":"4","key":"18_CR15","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1016\/j.cor.2005.06.014","volume":"33","author":"D Gamboa","year":"2006","unstructured":"Gamboa D, Rego C, Glover F (2006) Implementation analysis of efficient heuristic algorithms for the traveling salesman problem. Computers & Operations Res 33(4):1154\u20131172","journal-title":"Computers & Operations Res"},{"issue":"4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1109\/TSMCB.2004.828283","volume":"34","author":"HK Tsai","year":"2004","unstructured":"Tsai HK, Yang JM, Tsai YF, Kao CY (2004) An evolutionary algorithm for large traveling salesman problems. IEEE Transactions on Systems, Man and Cybernetics, Part B: Cyebernetics 34(4):1718\u20131729","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part B: Cyebernetics"},{"key":"18_CR17","unstructured":"Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Lecture notes in computer science, Springer-Verlag 840"},{"issue":"4","key":"18_CR18","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JL Bentley","year":"1992","unstructured":"Bentley JL (1992) Fast algorithms for geometric traveling salesman problems. ORSA J Computing 4(4):387\u2013411","journal-title":"ORSA J Computing"},{"key":"18_CR19","unstructured":"Johnson DS, McGeoch LA (1996) The traveling salesman problem: a case study in local optimization. Local search in combinatorial optimization. Wiley and Sons, New York"},{"key":"18_CR20","unstructured":"Davis L (1985) Applying adapting algorithms to epistatic domains. In: Proc. int. joint conf. artificial intelligence, Quebec, canada"},{"key":"18_CR21","unstructured":"Oliver I, Smith D, Holland J (1987) A study of permutation crossover operators on the traveling salesman problem. Second int. conf. genetic algorithms, pp 224\u2013230"},{"key":"18_CR22","unstructured":"Starkweather T, McDaniel S, Mathias K, Whitley D, Whitley C (1991) A comparison of genetic sequencing operators. 4th Int. conf. genetic algorithms, pp 69\u201376"},{"key":"18_CR23","unstructured":"Whitley D, Starkweather T, Fuquay D (1989) Scheduling problems and traveling salesman: the genetic edge recombination operator. 3rd Int. conf. genetic algorithms, pp. 133\u2013140"},{"key":"18_CR24","unstructured":"Homaifar A, Guan S, Liepins G (1993) A new approach on the traveling salesman problem by genetic algorithms. 5th Int conf genetic algorithms, pp 460\u2013466"},{"key":"18_CR25","unstructured":"Biedl T, Brejov B, Demaine ED, Hamel AM, Vinar T (2001) Optimal arrangement of leaves in the tree representing hierarchical clustering of gene expression data. Tech Rep 2001\u201314, Dept Computer Sci., Univ. Waterloo"},{"key":"18_CR26","doi-asserted-by":"crossref","first-page":"3273","DOI":"10.1091\/mbc.9.12.3273","volume":"9","author":"PT Spellman","year":"1998","unstructured":"Spellman PT, Sherlock G, Zhang MQ, Iyer VR, Anders K, Eisen MB, Brown PO, Botstein D, Futcher B (1998) Comprehensive identification of cell cycle-regulated genes of the yeast saccharomyces cerevisia by microarray hybridization. Molecular Biology Cell 9:3273\u20133297","journal-title":"Molecular Biology Cell"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Eisen MB, Spellman PT, Brown PO, Botstein D (1998) Cluster analysis and display of genome-wide expression patterns. In: Proc. national academy of sciences, vol. 95, pp 14863\u201314867","DOI":"10.1073\/pnas.95.25.14863"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Tamayo P, Slonim D, Mesirov J, Zhu Q, Kitareewan S, Dmitrovsky E, Lander ES, Golub TR (1999) Interpreting patterns of gene expression with self-organizing maps: methods and application to hematopoietic differentiation. In: Proc. national academy of sciences, pp 2907\u20132912","DOI":"10.1073\/pnas.96.6.2907"},{"key":"18_CR29","unstructured":"Tsai HK, Yang JM, Kao CY (2002) Applying genetic algorithms to finding the optimal gene order in displaying the microarray data. GECCO, pp. 610\u2013617"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Lee SK, Kim YH, Moon BR, (2003) Finding the Optimal Gene Order in Displaying Microarray Data. GECCO, pp. 2215\u20132226","DOI":"10.1007\/3-540-45110-2_116"},{"key":"18_CR31","unstructured":"Applegate D, Bixby R, Chvtal V, Cook W (2003) Concorde package. [online]. www.tsp.gatech.edu\/concorde\/downloads\/codes\/src\/co031219.tgz."},{"key":"18_CR32","unstructured":"TSPLIB, http:\/\/www.iwr.uniheidelberg.de\/groups\/comopt\/software\/TSPLIB95\/."},{"key":"18_CR33","unstructured":"Website, http:\/\/www.psrg.lcs.mit.edu\/clustering\/ismb01\/optimal.html."}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-0018-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-006-0018-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-0018-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-0018-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T21:45:42Z","timestamp":1652823942000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-006-0018-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,9]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["18"],"URL":"https:\/\/doi.org\/10.1007\/s10489-006-0018-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,9]]},"assertion":[{"value":"9 November 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}