{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T15:49:23Z","timestamp":1776440963273,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540406020","type":"print"},{"value":"9783540451051","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45105-6_99","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T12:49:42Z","timestamp":1188218982000},"page":"862-873","source":"Crossref","is-referenced-by-count":9,"title":["Normalization in Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"Sung-Soon","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung-Ro","family":"Moon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"99_CR1","unstructured":"N. J. Radcliffe. Forma analysis and random respectful recombination. In Fourth International Conference on Genetic Algorithms, pages 222\u2013230, 1991."},{"key":"99_CR2","unstructured":"E. Falkenauer. Genetic Algorithms and Grouping Problems. Wiley, 1998."},{"key":"99_CR3","unstructured":"J. Yang, J. Horng, and C. Kao. A continuous genetic algorithm for global optimization. In Seventh International Conference on Genetic Algorithms, pages 230\u2013237. Morgan Kaufmann, 1997."},{"key":"99_CR4","unstructured":"Y. K. Kwon and B. R. Moon. A genetic hybrid for CHF function approximation. In Genetic and Evolutionary Computation Conference, pages 1119\u20131125, 2002."},{"key":"99_CR5","doi-asserted-by":"crossref","unstructured":"M. J. Martin-Bautista and M. A. Vila. A survey of genetic feature selection in mining issues. In Congress on Evolutionary Computation, pages 1314\u20131321, 1999.","DOI":"10.1109\/CEC.1999.782599"},{"key":"99_CR6","unstructured":"G. Laszewski. Intelligent structural operators for the k-way graph partitioning problem. In Fourth International Conference on Genetic Algorithms, pages 45\u201352, 1991."},{"issue":"7","key":"99_CR7","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1109\/12.508322","volume":"45","author":"T. N. Bui","year":"1996","unstructured":"T. N. Bui and B. R. Moon. Genetic algorithm and graph partitioning. IEEE Trans. on Computers, 45(7):841\u2013855, 1996.","journal-title":"IEEE Trans. on Computers"},{"key":"99_CR8","unstructured":"S. J. Kang and B. R. Moon. A hybrid genetic algorithm for multiway graph paritioning. In Genetic and Evolutionary Computation Conference, pages 159\u2013166, 2000."},{"key":"99_CR9","unstructured":"S. S. Choi and B. R. Moon. Isomorphism, normalization, and a genetic algorithm for sorting network optimization. In Genetic and Evolutionary Computation Conference, pages 327\u2013334, 2002."},{"issue":"1","key":"99_CR10","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/4235.985693","volume":"6","author":"C. Igel","year":"2002","unstructured":"C. Igel and P. Stagge. Effects of phenotypic redundancy in structure optimization. IEEE Trans. on Evolutionary Computation, 6(1):74\u201385, 2002.","journal-title":"IEEE Trans. on Evolutionary Computation"},{"key":"99_CR11","unstructured":"P. Schuster. Molecular insights into evolution of phenotypes. In J. P. Crutchfield and P. Schuster, editors, Evolutionary Dynamics \u2014 Exploring the Interplay of Accident, Selection, Neutrality and Function. Oxford Univ. Press, 2002."},{"key":"99_CR12","doi-asserted-by":"crossref","unstructured":"R. Shipman. Genetic redundancy: Desirable or problematic for evolutionary adaptation. In Fourth International Conference on Artificial Neural Networks and Genetic Algorithms, pages 337\u2013344. Springer-Verlag, 1999.","DOI":"10.1007\/978-3-7091-6384-9_57"},{"key":"99_CR13","doi-asserted-by":"crossref","unstructured":"M. A. Shackleton, R. Shipman, and M. Ebner. An investigation of redundant genotype-phenotype mappings and their role in evolutionary search. In Congress on Evolutionary Computation, pages 493\u2013500, 2000.","DOI":"10.1109\/CEC.2000.870337"},{"key":"99_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/B978-155860734-7\/50100-1","volume":"6","author":"K. Weicker","year":"2001","unstructured":"K. Weicker and N. Weicker. Burden and benefits of redundancy. In Foundations of Genetic Algorithms, volume 6, pages 313\u2013333. Morgan Kaufmann, 2001.","journal-title":"Foundations of Genetic Algorithms"},{"key":"99_CR15","doi-asserted-by":"crossref","unstructured":"H. M\u00fchlenbein. Parallel genetic algorithms in combinatorial optimization. In Computer Science and Operations Research: New Developments in Their Interfaces, pages 441\u2013453, 1992.","DOI":"10.1016\/B978-0-08-040806-4.50034-4"},{"key":"99_CR16","doi-asserted-by":"crossref","unstructured":"R. Dorne and J. K. Hao. A new genetic local search algorithm for graph coloring. In Parallel Problem Solving from Nature, pages 745\u2013754. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0056916"},{"issue":"4","key":"99_CR17","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1162\/106365602760972749","volume":"10","author":"C. Hoyweghen Van","year":"2002","unstructured":"C. Van Hoyweghen, B. Naudts, and D. E. Goldberg. Spin-flip symmetry and synchronization. Evolutionary Computation, 10(4):317\u2013344, 2002.","journal-title":"Evolutionary Computation"},{"key":"99_CR18","unstructured":"S. Chen. Is the Common Good? A New Perspective Developed in Genetic Algorithms. PhD thesis, Robotics Institute, Carnegie Mellon University, 1999."},{"key":"99_CR19","unstructured":"G. Syswerda. Uniform crossover in genetic algorithms. In Third International Conference on Genetic Algorithms, pages 2\u20139, 1989."},{"key":"99_CR20","unstructured":"S. Chen and S. Smith. Commonality and genetic algorithms. Technical Report CMU-RI-TR-96-27, Robotics Institute, Carnegie Mellon University, 1996."},{"key":"99_CR21","unstructured":"D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, 1989."},{"key":"99_CR22","unstructured":"L. Davis. Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991."},{"key":"99_CR23","unstructured":"R. A. Watson and J. B. Pollack. Recombination without respect: Schema combination and disruption in genetic algorithm crossover. In Genetic and Evolutionary Computation Conference, 2000."},{"key":"99_CR24","first-page":"109","volume":"2","author":"S. Forrest","year":"1993","unstructured":"S. Forrest and M. Mitchell. Relative building-block fitness and the building-block hypothesis. In Foundations of Genetic Algorithms, volume 2, pages 109\u2013126. Morgan Kaufmann, 1993.","journal-title":"Foundations of Genetic Algorithms"},{"key":"99_CR25","first-page":"243","volume":"3","author":"J. Horn","year":"1995","unstructured":"J. Horn and D. E. Goldberg. Genetic algorithm difficulty and the modality of fitness landscapes. In Foundations of Genetic Algorithms, volume 3, pages 243\u2013270. Morgan Kaufmann, 1995.","journal-title":"Foundations of Genetic Algorithms"},{"key":"99_CR26","unstructured":"S. A. Kauffman. Adaptation on rugged fitness landscapes. In D. Stein, editor, Lectures in the Sciences of Complexity, pages 527\u2013618. Addison Wesley, 1989."},{"key":"99_CR27","unstructured":"T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In Sixth International Conference on Genetic Algorithms, pages 184\u2013192. Morgan Kaufmann, 1995."},{"issue":"1","key":"99_CR28","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1162\/106365600568103","volume":"8","author":"P. Merz","year":"2000","unstructured":"P. Merz and B. Freisleben. Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning. Evolutionary Computation, 8(1):61\u201391, 2000.","journal-title":"Evolutionary Computation"},{"issue":"4","key":"99_CR29","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P. Merz","year":"2000","unstructured":"P. Merz and B. Freisleben. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. on Evolutionary Computation, 4(4):337\u2013352, 2000.","journal-title":"IEEE Trans. on Evolutionary Computation"},{"key":"99_CR30","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02338823","volume":"43","author":"M. Huynen","year":"1996","unstructured":"M. Huynen. Exploring phenotype space through neutral evolution. Journal of Molecular Evolution, 43:165\u2013169, 1996.","journal-title":"Journal of Molecular Evolution"},{"key":"99_CR31","unstructured":"J. P. Kim and B. R. Moon. A hybrid genetic search for multi-way graph partitioning based on direct partitioning. In Genetic and Evolutionary Computation Conference, pages 408\u2013415, 2001."},{"key":"99_CR32","unstructured":"W. D. Hillis. Co-evolving parasites improve simulated evolution as an optimization procedure. In C. Langton, C. Taylor, J. D. Farmer, and S. Rasmussen, editors, Artificial Life II. Addison Wesley, 1992."},{"key":"99_CR33","unstructured":"G. L. Drescher. Evolution of 16-number sorting networks revisited. Unpublished manuscript, 1994."},{"key":"99_CR34","unstructured":"S. S. Choi and B. R. Moon. A hybrid genetic search for the sorting network problem with evolving parallel layers. In Genetic and Evolutionary Computation Conference, pages 258\u2013265, 2001."},{"key":"99_CR35","unstructured":"S. S. Choi and B. R. Moon. A graph-based approach to the sorting network problem. In Congress on Evolutionary Computation, pages 457\u2013464, 2001."}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2014 GECCO 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45105-6_99","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T16:29:58Z","timestamp":1548347398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45105-6_99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406020","9783540451051"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-45105-6_99","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}