Normalization in genetic algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2723, Issue , 2003, Pages 862-873

  Choi, Sung Soon ^a   Moon, Byung Ro ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; GENETIC ALGORITHMS;

ENCODINGS; FITNESS-DISTANCE CORRELATION; PERFORMANCE TESTS; SEARCH SPACES; THEORETICAL ARGUMENTS;

EVOLUTIONARY ALGORITHMS;

EID: 35248886751     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45105-6_99     Document Type: Article

References (35)

1. N. J. Radcliffe. Forma analysis and random respectful recombination. In Fourth International Conference on Genetic Algorithms, pages 222-230, 1991.
2. E. Falkenauer. Genetic Algorithms and Grouping Problems. Wiley, 1998.
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.
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.
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.
6. G. Laszewski. Intelligent structural operators for the k-way graph partitioning problem. In Fourth International Conference on Genetic Algorithms, pages 45-52, 1991.
7. T. N. Bui and B. R. Moon. Genetic algorithm and graph partitioning. IEEE Trans. on Computers, 45(7):841-855, 1996.
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.
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.
10. C. Igel and P. Stagge. Effects of phenotypic redundancy in structure optimization. IEEE Trans. on Evolutionary Computation, 6(1):74-85, 2002.
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.
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.
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.
14. K. Weicker and N. Weicker. Burden and benefits of redundancy. In Foundations of Genetic Algorithms, volume 6, pages 313-333. Morgan Kaufmann, 2001.
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.
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.
17. C. Van Hoyweghen, B. Naudts, and D. E. Goldberg. Spin-flip symmetry and synchronization. Evolutionary Computation, 10(4):317-344, 2002.
18. S. Chen. Is the Common Good ? A New Perspective Developed in Genetic Algorithms. PhD thesis, Robotics Institute, Carnegie Mellon University, 1999.
19. G. Syswerda. Uniform crossover in genetic algorithms. In Third International Conference on Genetic Algorithms, pages 2-9, 1989.
20. S. Chen and S. Smith. Commonality and genetic algorithms. Technical Report CMU-RI-TR-96-27, Robotics Institute, Carnegie Mellon University, 1996.
21. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, 1989.
22. L. Davis. Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.
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.
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.
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.
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.
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.
28. P. Merz and B. Freisleben. Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning. Evolutionary Computation, 8(1):61-91, 2000.
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.
30. M. Huynen. Exploring phenotype space through neutral evolution. Journal of Molecular Evolution, 43:165-169, 1996.
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.
32. W. D. Hillis. Co-evolving parasites improve simulated evolution as an optimization procedure. In C. Langton, G. Taylor, J. D. Farmer, and S. Rasmussen, editors, Artificial Life II. Addison Wesley, 1992.
33. G. L. Drescher. Evolution of 16-number sorting networks revisited. Unpublished manuscript, 1994.
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.
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.