Skip to main content
SpringerLink
Log in
Book cover

Genetic and Evolutionary Computation Conference

GECCO 2003: Genetic and Evolutionary Computation — GECCO 2003 pp 862–873Cite as

Normalization in Genetic Algorithms

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2723))

Abstract

Normalization is an approach that transforms the genotype of one parent to be consistent with that of the other parent. It is a method for alleviating difficulties caused by redundant encodings in genetic algorithms. We show that normalization plays a role of reducing the search space to another one of less size. We provide insight into normalization through theoretical arguments, performance tests, and examination of fitness-distance correlations.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. J. Radcliffe. Forma analysis and random respectful recombination. In Fourth International Conference on Genetic Algorithms, pages 222–230, 1991.

    Google Scholar 

  2. E. Falkenauer. Genetic Algorithms and Grouping Problems. Wiley, 1998.

    Google Scholar 

  3. J. Yang, J. Horng, and C. Kao. A continuous genetic algorithm for global optimization. In Seventh International Conference on Genetic Algorithms, pages 230–237. Morgan Kaufmann, 1997.

    Google Scholar 

  4. Y. K. Kwon and B. R. Moon. A genetic hybrid for CHF function approximation. In Genetic and Evolutionary Computation Conference, pages 1119–1125, 2002.

    Google Scholar 

  5. M. J. Martin-Bautista and M. A. Vila. A survey of genetic feature selection in mining issues. In Congress on Evolutionary Computation, pages 1314–1321, 1999.

    Google Scholar 

  6. G. Laszewski. Intelligent structural operators for the k-way graph partitioning problem. In Fourth International Conference on Genetic Algorithms, pages 45–52, 1991.

    Google Scholar 

  7. T. N. Bui and B. R. Moon. Genetic algorithm and graph partitioning. IEEE Trans. on Computers, 45(7):841–855, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  8. S. J. Kang and B. R. Moon. A hybrid genetic algorithm for multiway graph paritioning. In Genetic and Evolutionary Computation Conference, pages 159–166, 2000.

    Google Scholar 

  9. 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–334, 2002.

    Google Scholar 

  10. C. Igel and P. Stagge. Effects of phenotypic redundancy in structure optimization. IEEE Trans. on Evolutionary Computation, 6(1):74–85, 2002.

    Article  Google Scholar 

  11. P. Schuster. Molecular insights into evolution of phenotypes. In J. P. Crutchfield and P. Schuster, editors, Evolutionary Dynamics — Exploring the Interplay of Accident, Selection, Neutrality and Function. Oxford Univ. Press, 2002.

    Google Scholar 

  12. R. Shipman. Genetic redundancy: Desirable or problematic for evolutionary adaptation. In Fourth International Conference on Artificial Neural Networks and Genetic Algorithms, pages 337–344. Springer-Verlag, 1999.

    Google Scholar 

  13. 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–500, 2000.

    Google Scholar 

  14. K. Weicker and N. Weicker. Burden and benefits of redundancy. In Foundations of Genetic Algorithms, volume 6, pages 313–333. Morgan Kaufmann, 2001.

    Article  Google Scholar 

  15. H. Mühlenbein. Parallel genetic algorithms in combinatorial optimization. In Computer Science and Operations Research: New Developments in Their Interfaces, pages 441–453, 1992.

    Google Scholar 

  16. R. Dorne and J. K. Hao. A new genetic local search algorithm for graph coloring. In Parallel Problem Solving from Nature, pages 745–754. Springer-Verlag, 1998.

    Google Scholar 

  17. C. Van Hoyweghen, B. Naudts, and D. E. Goldberg. Spin-flip symmetry and synchronization. Evolutionary Computation, 10(4):317–344, 2002.

    Article  Google Scholar 

  18. S. Chen. Is the Common Good? A New Perspective Developed in Genetic Algorithms. PhD thesis, Robotics Institute, Carnegie Mellon University, 1999.

    Google Scholar 

  19. G. Syswerda. Uniform crossover in genetic algorithms. In Third International Conference on Genetic Algorithms, pages 2–9, 1989.

    Google Scholar 

  20. S. Chen and S. Smith. Commonality and genetic algorithms. Technical Report CMU-RI-TR-96-27, Robotics Institute, Carnegie Mellon University, 1996.

    Google Scholar 

  21. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, 1989.

    Google Scholar 

  22. L. Davis. Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.

    Google Scholar 

  23. 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.

    Google Scholar 

  24. S. Forrest and M. Mitchell. Relative building-block fitness and the building-block hypothesis. In Foundations of Genetic Algorithms, volume 2, pages 109–126. Morgan Kaufmann, 1993.

    Google Scholar 

  25. J. Horn and D. E. Goldberg. Genetic algorithm difficulty and the modality of fitness landscapes. In Foundations of Genetic Algorithms, volume 3, pages 243–270. Morgan Kaufmann, 1995.

    Google Scholar 

  26. S. A. Kauffman. Adaptation on rugged fitness landscapes. In D. Stein, editor, Lectures in the Sciences of Complexity, pages 527–618. Addison Wesley, 1989.

    Google Scholar 

  27. 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–192. Morgan Kaufmann, 1995.

    Google Scholar 

  28. P. Merz and B. Freisleben. Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning. Evolutionary Computation, 8(1):61–91, 2000.

    Article  Google Scholar 

  29. P. Merz and B. Freisleben. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. on Evolutionary Computation, 4(4):337–352, 2000.

    Article  Google Scholar 

  30. M. Huynen. Exploring phenotype space through neutral evolution. Journal of Molecular Evolution, 43:165–169, 1996.

    Article  Google Scholar 

  31. 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–415, 2001.

    Google Scholar 

  32. 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.

    Google Scholar 

  33. G. L. Drescher. Evolution of 16-number sorting networks revisited. Unpublished manuscript, 1994.

    Google Scholar 

  34. 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–265, 2001.

    Google Scholar 

  35. S. S. Choi and B. R. Moon. A graph-based approach to the sorting network problem. In Congress on Evolutionary Computation, pages 457–464, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Seoul National University, Seoul, 151-742, Korea

    Sung-Soon Choi & Byung-Ro Moon

Authors
  1. Sung-Soon Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Byung-Ro Moon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lawrence Livermore National Laboratory, Center for Applied Scientific Computing (CASC), 7000 East Avenue, L-561, Livermore, CA, 94550, USA

    Erick Cantú-Paz

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Choi, SS., Moon, BR. (2003). Normalization in Genetic Algorithms. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_99

Download citation

  • DOI: https://doi.org/10.1007/3-540-45105-6_99

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40602-0

  • Online ISBN: 978-3-540-45105-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation