How efficient are genetic algorithms to solve high epistasis deceptive problems?

2008 IEEE Congress on Evolutionary Computation, CEC 2008

Volumn , Issue , 2008, Pages 242-249

  Gras, Robin ^a  

^a UNIVERSITY OF WINDSOR   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; GLOBAL OPTIMIZATION; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION PROBLEMS; DECEPTIVE PROBLEMS; STATISTICAL APPROACHES;

PROBLEM SOLVING;

EID: 55749097958     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2008.4630806     Document Type: Conference Paper

References (37)

1. Davidor Y. (1990), "Epistasis variance: a viewpoint on representations, GA hardness, and deception." In Complex Systems 4, 369-383.
2. Kauffman S.A. (1989), "Adaptation on rugged fitness landscapes." Lecture in Sciences of Complexity, 1:527-618.
3. Barnett L. (1998), "Ruggedness and neutrality - the NKp family of fitness landscapes," In Proceedings of the sixth international conference on artificial life. 18-27.
4. Newman M., Engelhardt R. (1998), "Effect of neutral selection on the evolution of molecular species." In Proc. R. Soc. London, 256:1333-1338.
5. Thompson R.K., Wright A.H. (1996), Additively decomposable fitness functions. Report, University of Montana, Computer Science department.
6. Ackley D.H. (1987), "An empirical study of bit vector function optimization." In Genetic Algorithms and Simulated Annealing. Morgan Kaufmann, 170-204.
7. Goldberg D.E.: (2002), The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Kluwer Academic Publishers.
8. Gras R., Hernandez D., Hernandez P., Zangger N., Mescam Y., Frey J., Martin O., Nicolas J., Appel R.D. (2004), "Cooperative metaheuristics for exploring proteomic data." In Artificial Intelligence Methods and Tools for Systems Biology.
9. th International Workshop on Frontiers in Evolutionary Algorithms. North Carolina. 291-294.
10. Novkovic, S. and Sverko, D. (2003), "A genetic algorithm with selfgenerated random parameters." In Journal of Computing and Information Technology, CIT 11, 4: 271-283
11. Pelikan M. (2002), Bayesian Optimization Algorithm: From Single Level to Hierarchy. University of Illinois. PhD Thesis.
12. Pelikan M., Sastry K. (2004), "Fitness Inheritance in the Baysian Optimization Algorithm." In Proceedings of the Genetic and Evolutionary Computation Conference, 48-59.
13. Mitchell M., Forrest S., Holland J.H. (1992), "The royal road for genetic algorithms: Fitness landscapes and GA performance." In Proceedings of the First European Conference on Artificial Life. Edited by Varela F.J., Bourgine P. 245-254. MIT Press.
14. Yagiura M., Ibaraki T. (2001), "On Metaheuristic Algorithms for Combinatorial Optimization Problems." In Systems and Computers in Japan, 32:33-55.
15. Jones T. (1995), Evolutionary Algorithms, Fitness Landscapes and Search. University of New Mexico. PhD Thesis.
16. Baluja S. (1996), "An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics," In Proceedings of the Eleventh International Conference on Systems Engineering,
17. Sharpe O.J. (2000), Towards a Rational Methodology for Using Evolutionary Search Algorithms. University of Sussex. PhD Thesis.
18. Thierens D., Goldberg D.E. (1994), "Convergence models of genetic algorithm selection schemes," In Parallel Problem Solving from Nature, 116-121.
19. Sastry K., Goldberg D.E. (2002), Analysis of Mixing in Genetic Algorithms: A survey. 2002017. IlliGAL report.
20. Muhlenbein H., Mahnig T. (2001), "Evolutionary Algoritms: From Recombination to Search Distributions." In Theoretical Aspects of Evolutionary Computing. Edited by Kallel L., Naudts B., Rogers A, Springer, 135-173,
21. Larranaga P., Lozano J.A. (2002), Estimation of Distribution Algorithms: A new tool for evolutionary computation, Kluwer Academic Publishers
22. Syswerda G. (1993), "Simulated Crossover in genetic algorithms." In Foundations of Genetic Algorithms 2. Edited by L.D., Whitley, Morgan Kaufmann, 239-255.
23. Baluja S. (1994), Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning. CMU-CS-94-163, Carnegie Mellon University.
24. Muhlenbein H., Voigt H.M. (1996), "Gene pool recombination in genetic algorithms," In Metaheuritics: Theory and Applications. Edited by Kelly J.P., Osman I.H. Kluwer Academic, 53-62.
25. Muhlenbein H., Mahnig T., Rodriguez A.O. (1999), "Schemata, distributions and graphical models in evolutionary optimization." Journal of Heuristics, 5:215-47.
26. Frez B.J. (1998), Graphical Models for Machine Learning and Digital Communication. MIT Press.
27. Harik G.R. (1997), Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. University of Michigan, PhD Thesis.
28. Pelikan M., Goldberg D.E., Cantu-PazE. BOA (1999), "The Bayesian Optimization Algorithm." In Proceedings of the Genetic and Evolutionary Computation Conference I, 525-532. San Francisco, CA, Morgan Kaufmann.
29. Chickering D.M., Heckerman D., Meek C. (1997), Learning Bayesian Network is NP-Hard. MSR-TR-97-07, Redmond, Microsoft Research.
30. Schwarz G. (1978) "Estimating the dimension of a model." In The Annals of Statistics, 6:461-464.
31. Pelikan M., Goldberg D.E., Cantu-PazE. (2000), "Linkage Problem, Distribution Estimation, and Bayesian Networks." In Evolutionary Computation, 8:311-340.
32. Sastry K., Goldberg D.E., Pelikan M. (2004), "Efficiency Enhancement of Probabilistic Model Building Genetic Algorithms." In Genetic and Evolutionary Computation Conference.
33. Sastry K., Goldberg D.E. (2004a), "Designing Competent Mutation Operators via Probabilistic Model Building of Neighborhoods." In Proceedings of the Genetic and Evolutionary Computation Conference.
34. Lima C., Pelikan M., Sastry K., Butz M., Goldberg D.E. (2006), Structural neighborhoods for local search in Bayesian optimization algorithm, In proceeding of the Parallel Problem Solving from Nature, 232-241.
35. Wolpert D.H., MacReady W.G. (1995), No Free Lunch Theorems for Search, Technical Report SFI-TR-95-02-010. Sante Fe, NM, USA: Santa Fe Institute.
36. Gras R., Hernandez D., Hernandez P., Zangger N., Mescam Y., Frey J., Martin O., Nicolas J., Appel R.D., (2003), "Cooperative metaheuristics for exploring proteomic data." In Artificial Intelligence Review, vol 20 (1-2), 95-120.
37. Hernandez D., Gras R., Appel R. (2008) "Neighborhood Functions and Hill-Climbing Strategies dedicated to the Generalized Ungapped Local Multiple Alignment." In European Journal of Operational Research, 185(3), 1276-1284.