How efficient are genetic algorithms to solve high epistasis deceptive problems?
- 1 June 2008
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 242-249
- https://doi.org/10.1109/cec.2008.4630806
Abstract
We present an overview of the properties that are involved in the complexity of global combinatorial optimization problems with a focus on epistasis and deceptiveness. As the complexity of a problem is linked to the exploration operators and algorithm used, we propose at first a bibliography of genetic algorithms. We discuss their efficiency to solve global combinatorial optimization problems following the canonical and the statistical approaches. We propose two strategies to handle such problems. In order to evaluate the capabilities and limitations of each of them, we undertake a comparison on a set of problems with varying levels of epistasis and deceptiveness.Keywords
This publication has 13 references indexed in Scilit:
- Neighborhood functions and hill-climbing strategies dedicated to the generalized ungapped local multiple alignmentEuropean Journal of Operational Research, 2008
- Substructural Neighborhoods for Local Search in the Bayesian Optimization AlgorithmLecture Notes in Computer Science, 2006
- A Genetic Algorithm With Self-Generated Random ParametersJournal of Computing and Information Technology, 2003
- Cooperative Metaheuristics for Exploring Proteomic DataArtificial Intelligence Review, 2003
- Estimation of Distribution AlgorithmsGenetic Algorithms and Evolutionary Computation, 2002
- On metaheuristic algorithms for combinatorial optimization problemsSystems and Computers in Japan, 2001
- Schemata, Distributions and Graphical Models in Evolutionary OptimizationJournal of Heuristics, 1999
- Gene Pool Recombination in Genetic AlgorithmsPublished by Springer Science and Business Media LLC ,1996
- Simulated Crossover in Genetic AlgorithmsPublished by Elsevier BV ,1993
- Estimating the Dimension of a ModelThe Annals of Statistics, 1978