Normalization for genetic algorithms with nonsynonymously redundant encodings

IEEE Transactions on Evolutionary Computation

Volumn 12, Issue 5, 2008, Pages 604-616

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

^a Yonsei University   (South Korea)

^b Seoul National University   (South Korea)

Author keywords

Crossover; Fitness distance analysis; Genetic algorithm (GA); Nonsynonymous encoding; Normalization; Redundant encoding; Synonymous encoding

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); GENETIC ALGORITHMS; KETONES;

CROSSOVER; FITNESS DISTANCE ANALYSIS; GENETIC ALGORITHM (GA); NONSYNONYMOUS ENCODING; NORMALIZATION; REDUNDANT ENCODING; SYNONYMOUS ENCODING;

MATHEMATICAL TRANSFORMATIONS;

EID: 53349165220     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2007.913699     Document Type: Article

References (54)

1. N.J. Radcliffe, "Forma analysis and random respectful recombination," in Proc. 4th Int. Conf. Genetic Algorithms, 1991, pp. 222-230.
2. E. Falkenauer, Genetic Algorithms and Grouping Problems. New York: Wiley, 1998.
3. N. Y. Nikolaev and H. Iba, "Regularization approach to inductive genetic programming," IEEE Trans. Evol. Comput., vol. 5, no. 4, pp. 359-375, Aug. 2001.
4. Y. S. Yeun, W. S. Ruy, Y. S. Yang, and N. J. Kim, "Implementing linear models in genetic programming," IEEE Trans. Evol. Comput., vol. 8, no. 6, pp. 542-566, Aug. 2004.
5. M. J. Martin-Bautista and M. A. Vila, "A survey of genetic feature selection in mining issues," In Congr. Evol. Comput., pp. 1314-1321, 1999.
6. G. Laszewski, "Intelligent structural operators for the k-way graph partitioning problem," in Proc. 4th Int. Conf. Genetic Algorithms, 1991, pp. 45-52.
7. T. N. Bui and B. R. Moon, "Genetic algorithm and graph partitioning," IEEE Trans. Comput., vol. 45, no. 7, pp. 841-855, 1996.
8. S. J. Kang and B. R. Moon, "A hybrid genetic algorithm for multiway graph paritioning," in Proc. Genetic Evol. Comput. Conf., 2000, pp. 159-166.
9. S. S. Choi and B. R. Moon, "Isomorphism, normalization, and a genetic algorithm for sorting network optimization," in Proc. Genetic Evol. Comput. Conf., 2002, pp. 327-334.
10. C. Igel and P. Stagge, "Effects of phenotypic redundancy in structure optimization," IEEE Trans. Evol. Comput., vol. 6, no. 1, pp. 74-85, Feb. 2002.
11. P. Schuster, "Molecular insights into evolution of phenotypes," in Evolutionary Dynamics - Exploring the Interplay of Accident, Selection, Neutrality and Function, J. P. Crutchfield and P. Schuster, Eds. Cambridge, U.K.: Oxford Univ. Press, 2002.
12. M. Gerrits and P. Hogeweg, "Redundant coding of an NP-complete problem allows effective genetic algorithm search," Parallel Problem Solving from Nature, pp. 70-74, 1990.
13. B. A. Julstrom, "Redundant genetic encodings may not be harmful," in Proc. Genetic Evol. Comput. Conf., 1999, pp. 791-00.
14. M. Kimura, The Neutral Theory of Molecular Evolution. Cambridge, U.K.: Cambridge Univ. Press, 1983.
15. R. Shipman, "Genetic redundancy: Desirable or problematic for evolutionary adaptation," in Proc. 4th Int. Conf. Artif. Neural Networks Genetic Algorithms, 1999, pp. 337-344.
16. M. A. Shackleton, R. Shipman, and M. Ebner, "An investigation of redundant genotype-phenotype mappings and their role in evolutionary search," Congr. Evol. Comput., pp. 493-500, 2000.
17. M. Ebner, M. Shackleton, and R. Shipman, "How neutral networks influence evolv-ability," Complexity, vol. 7, no. 2, pp. 19-33, 2002.
18. J. D. Knowles and R. A. Watson, "On the utility of redundant encodings in mutation-based evolutionary search," Parallel Problem Solving from Nature, pp. 88-98, 2002.
19. C. Van Hoyweghen and B. Naudts, "Symmetry in the search space," Congr. Evol. Comput., pp. 1072-1079, 2000.
20. C. Van Hoyweghen, D. E. Goldberg, and B. Naudts, "Building block superiority, multimodality and synchronization problems," in Proc. Genetic Evol. Comput. Conf., 2001, pp. 694-701.
21. C. Van Hoyweghe, n. B. Naudts, and D. E. Goldberg, "Spin-flip symmetry and synchronization," Evol. Comput., vol. 10, no. 4, pp. 317-344, 2002.
22. K. Weicker and N. Weicker, "Burden and benefits of redundancy," Foundations of Genetic Algorithms, vol. 6, pp. 313-333, 2001.
23. F. Rothlauf and D. E. Goldberg, "Redundant representations in evolutionary computation," Evol. Commutation, vol. 11, no. 4, pp. 381-415, 2003.
24. H. Muhlenbein, "Parallel genetic algorithms in combinatorial optimization," Computer Science and Operations Research: New Developments in Their Interfaces, pp. 441-453, 1992.
25. R. Dome and J. K. Hao, "A new genetic local search algorithm for graph coloring," Parallel Problem Solving from Nature, pp. 745-754, 1998.
26. J. H. Kim, S. S. Choi, and B. R. Moon, "Neural network normalization for genetic search," in Proc. Genetic Evol. Comput. Conf., 2004, pp. 398-399.
27. S. Chen, "Is the common good? A new perspective developed in genetic algorithms," Ph.D. dissertation, Robotics Institute, Carnegie Mellon Univ., Philadelphia, PA, 1999.
28. G. Syswerda, "Uniform crossover in genetic algorithms," in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 2-9.
29. S. Chen and S. Smith, "Commonality and genetic algorithms," Robotics Institute, Carnegie Mellon Univ., Philadelphia, PA, Tech. Rep. CMU-RI-TR-96-27, 1996.
30. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison Wesley, 1989.
31. L. Davis, Handbook of Genetic Algorithms. : Van Nostrand Reinhold, 1991.
32. R. A. Watson and J. B. Pollack, "Recombination without respect: Schema combination and disruption in genetic algorithm crossover," in Proc. Genetic Evol. Comput. Conf., 2000, pp. 112-119.
33. S. Forrest and M. Mitchell, "Relative building-block fitness and the building-block hypothesis," Foundations of Genetic Algorithms, vol. 2, pp. 109-126, 1993.
34. J. Horn and D. E. Goldberg, "Genetic algorithm difficulty and the modality of fitness landscapes," Foundations of Genetic Algorithms vol. 3, pp. 243-270, 1995.
35. S. A. Kauffman, "Adaptation on rugged fitness landscapes," in Lectures in the Sciences of Complexity, D. Stein, Ed. Reading, MA: Addison Wesley, 1989, pp. 527-618.
36. E. D. Weinberger, "Correlated and uricorrelated fitness landscapes and how to tell the difference," Biol. Cybern., vol. 63, pp. 325-336, 1990.
37. P. F. Stadler, "Landscapes and their correlation functions," J. Math. Chem., vol. 20, pp. 1-45, 1996.
38. T. Jones and S. Forrest, "Fitness distance correlation as a measure of problem difficulty for genetic algorithms," in Proc. 6th Int. Conf. Genetic Algorithms, 1995, pp. 184-192.
39. K. D. Boese, A. B. Kahrig, and S. Muddu, "A new adaptive multi-start technique for combinatorial global optimizations," Oper. Res. Lett. vol. 16, pp. 101-113, 1994.
40. P. Merz and B. Freisleben, "Fitness landscapes, memetic algorithms and greedy operators for graph bipartitioning," Evol. Comput., vol. 8, no. 1, pp. 61-91, 2000.
41. P. Merz and B. Freisleben, "Fitness landscape analysis and memetic algorithms for the quadratic assignment problem," IEEE Trans. Evol. Comput., vol. 4, no. 4, pp. 337-352, Feb. 2000.
42. G. H. Hardy, J. E. Littlewood, and G. Polya, Inequalities, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 1952, 1999, Reprinted.
43. M. Garcy and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
44. J. P. Kim and B. R. Moon, "A hybrid genetic search for multi-way graph partitioning based on direct partitioning," in Proc. Genetic Evol. Comput. Conf., 2001, pp. 408-415.
45. R. A. Watson, G. S. Hornby, and J. B. Pollack, "Modeling building block interde-pendency," Parallel Problem Solving from Nature, pp. 97-106, 1998.
46. M. Dietzfelbinger, B. Naudts, C. Van Hoyweghen, and I. Wegener, "The analysis of a recombinative hill-climber on H-IFF," IEEE Trans. Evol. Comput., vol. 7, no. 5, pp. 417-423, Oct. 2003.
47. F. Rothlauf, Representations for Genetic and Evolutionary Algorithms 2nd ed. New York: Springer, 2006.
48. P. Merz and B. Freisleben, "Genetic local search for the TSP: New results," in Proc. IEEE Conf. Evol. Comput., 1997, pp. 159-164.
49. Y. Nagata and S. Kobayashi, "Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem," in Proc. 7th Int. Conf. Genetic Algorithms, 1997, pp. 450-457.
50. S. Jung and B. R. Moon, "Toward minimal restriction of genetic encoding and crossovers for the 2D-Euclidean TSP," IEEE Trans. Evol. Comput. vol. 6, no. 6, pp. 557-565, Oct. 2002.
51. D. I. Seo and B. R. Moon, "Voronoi quantized crossover for traveling salesman problem," in Proc. Genetic Evol. Comput. Conf., 2002, pp. 544-552.
52. N. J. Radcliffe and P. D. Surry, "Fitness variance of formae and performance prediction," Foundations of Genetic Algorithms, vol. 3, pp. 51-72, 1995.
53. TSPLIB, [Online]. Available: http://www.iwr.uni-heidelberg.de/ groups/comopt/software/TSPLIB95/
54. Local Search in Combinatorial Optimization, E. Aarts and J. K. Lenstra, Eds. New York: Wiley, 1997.