Properties of symmetric fitness functions

IEEE Transactions on Evolutionary Computation

Volumn 11, Issue 6, 2007, Pages 743-757

  Choi, Sung Soon ^a   Kwon, Yung Keun ^a   Moon, Byung Ro ^a  

^a Seoul National University   (South Korea)

Author keywords

Additive separability; Epistasis variance; Fitness distance analysis; Fitness function analysis; Multary alphabets; Symmetric fitness functions; Walsh analysis

Indexed keywords

ALGORITHMS; EVOLUTIONARY ALGORITHMS; NUMERICAL ANALYSIS; WALSH TRANSFORMS;

EPISTASIS VARIANCE; FITNESS DISTANCE ANALYSIS; FITNESS FUNCTION ANALYSIS; MULTARY ALPHABETS; SYMMETRIC FITNESS FUNCTIONS; WALSH ANALYSIS;

FUNCTIONS;

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

References (53)

1. L. J. Eshelman and J. D. Schaffer, "Crossover's niche," in Proc. 5th Int. Conf. Genetic Algorithms, 1993, pp. 9-14.
2. C. Van Hoyweghen, D. E. Goldberg, and B. Naudts, "From TwoMax to the Ising model: Easy and hard symmetrical problems," in Proc. Genetic Evol. Comput. Conf., 2002, pp. 626-633.
3. R. A. Watson, G. S. Hornby, and J. B. Pollack, "Modeling building block interdependency," in Parallel Problem Solving From Nature. Berlin, Germany: Springer-Verlag, 1998, pp. 97-106.
4. C. Van Hoyweghen, B. Naudts, and D. E. Goldberg, "Spin-flip symmetry and synchronization," Evol. Comput., vol. 10, no. 4, pp.317-344, 2002.
5. E. Falkenauer, Genetic Algorithms and Grouping Problems. New York: Wiley, 1998.
6. S. H. Kim, Y. H. Kim, and B. R. Moon, "A hybrid genetic algorithm for the max cut problem," in Proc. Genetic Evol. Comput. Conf., 2001, pp.416-423.
7. G. Laszewski, "Intelligent structural operators for the k-way graph partitioning problem," in Proc. 4th Int. Conf. Genetic Algorithms, 1991, pp. 45-52.
8. T. N. Bui and B. R. Moon, "Genetic algorithm and graph partitioning," IEEE Trans. Comput., vol. 45, no. 7, pp. 841-855, Jul. 1996.
9. S. J. Kang and B. R. Moon, "A hybrid genetic algorithm for multiway graph partitioning," in Proc. Genetic Evol. Comput. Conf., 2000, pp. 159-166.
10. S. Fischer and I. Wegener, "The Ising model on the ring: Mutation versus recombination," in Proc. Genetic Evol. Comput. Conf., 2004, pp. 1113-1124.
11. C. Van Hoyweghen and B. Naudts, "Symmetry in the search space," in Proc. Congr. Evol. Comput., 2000, pp. 1072-1079.
12. 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.
13. H. Mühlenbein, "Parallel genetic algorithms in combinatorial optimization," in Proc. Computer Science and Operations Research: New Developments in Their Interfaces, 1992, pp. 441-453.
14. R. Dorne and J. K. Hao, "A new genetic local search algorithm for graph coloring," in Parallel Problem Solving From Nature. Berlin, Germany: Springer-Verlag, 1998, pp. 745-754.
15. 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.
16. 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.
17. S. S. Choi and B. R. Moon, "Normalization in genetic algorithms," IEEE Trans. Evol. Comput., 2006, accepted for publication.
18. M. Dietzfelbinger, B. Naudts, C. Van Hoyweghen, and I. Wegener, "The analysis of a re-combinative hill-climber on H-IFF," IEEE Trans. Evol. Comput., vol. 7, no. 5, pp. 417-423, Oct. 2003.
19. D. Sudholt, "Crossover is provably essential for the Ising model on trees," in Proc. Genetic Evol. Comput. Conf., 2005, pp. 1161-1167.
20. M. T. Iglesias, B. Naudts, A. Verschoren, and C. Vidal, "Walsh transforms, balanced sum theorems and partition coefficients over multary alphabets," in Proc. Genetic Evol. Comput. Conf., 2005, pp. 1303-1308.
21. Y. Davidor, "Epistasis variance: A viewpoint on GA-hardness," in Foundations of Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1991, vol. 1, pp. 23-35.
22. M. Manela and J. A. Campbell, "Harmonic analysis, epistasis and genetic algorithms," in Parallel Problem Solving From Nature. Amsterdam, The Netherlands: Elsevier, 1992, pp. 59-66.
23. C. Reeves and C. Wright, "An experimental design perspective on genetic algorithms," in Foundations of Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1995, vol. 3, pp. 7-22.
24. S. Rochet, G. Venturini, M. Slimane, and E. M. El Kharoubi, "A critical and empirical study of epistasis measures for predicting GA performances: A summary," in Proc. Artif. Evol., 1997, pp. 287-299.
25. 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.
26. M. Ebner, M. Shackleton, and R. Shipman, "How neutral networks influence evolvability," Complexity, vol. 7, no. 2, pp. 19-33, 2002.
27. J. D. Knowles and R. A. Watson, "On the utility of redundant encodings in mutation-based evolutionary search," in Parallel Problem Solving From Nature. London, U.K.: Springer-Verlag, 2002, pp. 88-98.
28. J. L. Walsh, "A closed set of orthogonal functions," Amer. J. Math. vol. 55, pp. 5-24, 1923.
29. R. B. Heckendorn and D. Whitley, "Predicting epistasis directly from mathematical models," Evol. Comput., vol. 7, no. 1, pp. 69-101, 1999.
30. C. K. Oei, "Walsh function analysis of genetic algorithms of non-binary strings," M.S. thesis, Univ. Illinois at Urbana-Champaign, Urbana, IL, 1992.
31. G. J. Koehler, M. D. Vose, and S. Bhattacharyya, "General cardinality genetic algorithms," Evol. Comput., vol. 5, no. 4, pp. 439-459, 1997.
32. M. D. Vose and A. H. Wright, "The simple genetic algorithm and the Walsh transform: Part I, Theory," Evol. Comput., vol. 6, no. 3, pp. 253-273, 1998.
33. M. D. Vose and A. H. Wright, "The simple genetic algorithm and the Walsh transform: Part II, The inverse," Evol. Comput., vol. 6, no. 3, pp. 275-289, 1998.
34. M. T. Iglesias, C. Vidal, D. Suys, and A. Verschoren, "Military epistasis," Bulletin of the Belgian Mathematical Society, Simon Stevin, vol. 8, pp. 651-671, 2001.
35. E. D. Weinberger, "Correlated and uncorrelated fitness landscapes and how to tell the difference," Biol. Cybern., vol. 63, pp. 325-336, 1990.
36. P. F. Stadler, "Landscapes and their correlation functions," J. Math. Chem., vol. 20, pp. 1-45, 1996.
37. 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.
38. K. D. Boese, A. B. Kahng, and S. Muddu, "A new adaptive multi-start technique for combinatorial global optimizations," Oper. Res. Lett. vol. 16, pp. 101-113, 1994.
39. P. Merz and B. Freisleben, "Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning," Evol. Comput., vol. 8, no. 1, pp. 61-91, 2000.
40. 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, Nov. 2000.
41. S. Rochet, M. Slimane, and G. Venturini, "Epistasis for real encoding in genetic algorithms," in Proc. IEEE Australian New Zealand Conf. Intell. Inf. Syst., Nov. 1996, pp. 268-271.
42. B. Naudts, D. Suys, and A. Verschoren, "Epistasis as a basic concept in formal landscape analysis," in Proc. 7th Int. Conf. Genetic Algorithms, 1997, pp. 65-72.
43. W. Rudin, Real and Complex Analysis. New York: McGraw-Hill, 1987.
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. T. Jansen, "On classifications of fitness functions," in Theoretical Aspects of Evolutionary Computing, L. Kallel, B. Naudts, and A. Rogers, Eds. New York: Springer, 2001, pp. 371-386.
46. M. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
47. A. Frieze and M. Jerrum, "Improved approximation algorithms for MAX k-CVT and MAX BISECTION," Algorithmica, vol. 18, pp. 61-77, 1997.
48. C. H. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," J. Comput. Syst. Sci., vol. 43, no. 3, pp. 425-440, 1991.
49. C. H. Papadimitriou, Computational Complexity. Reading, MA: Addison-Wesley, 1994.
50. A. H. Wright, R. K. Thompson, and J. Zhang, "The computational complexity of NK fitness functions," IEEE Trans. Evol. Comput., vol. 4, no. 4, pp. 373-379, 2000.
51. R. B. Heckendorn and A. H. Wright, "Efficient linkage discovery by limited probing," Evol. Comput., vol. 12, no. 4, pp. 517-545, 2004.
52. M. J. Streeter, "Upper bounds on the time and space complexity of optimizing additively separable functions," in Proc. Genetic Evol. Comput. Conf., 2004, pp. 186-197.
53. Y. Gao and J. Culberson, "Space complexity of estimation of distribution algorithms," Evol. Comput., vol. 13, no. 1, pp. 125-143, 2005.