Abstract
David Goldberg has defined a competent genetic algorithm as one which “can solve hard problems, quickly, accurately, and reliably.” Among other competent genetic algorithms that have been developed are the Bayesian optimization algorithm (BOA), the fast messy genetic algorithm (fmGA), and the linkage learning genetic algorithm (LLGA). These algorithms have been tested on problems of bounded difficulty that are additive separable formed by deceptive subproblems of order not greater than k, where k < ℓ. BOA, fmGA, LLGA, and other competent genetic algorithms are stochastic, and thus, can only be assured of attaining optimality in a probabilistic sense. In this paper, we develop a deterministic algorithm that solves to optimality all linearly decomposable problems in a polynomial number of function evaluations with respect to the maximum size of the subproblems, k. The algorithm presented does not rely on a population, does not recombine individuals or apply any other genetic operator. Furthermore, because it is deterministic, the number of function evaluations required to find the optimum can be known in advance. The algorithm presented solves both the linkage and the optimization problems by finding the disjoint sets of related variables and the optimal values of these variables at the same time. The fact that such an algorithm can be devised has important implications for the design of GA-hard problems, and the development and evaluation of genetic optimization algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goldberg, D.E.: The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Kluwer, Boston (2002)
Pelikan, M.: Bayesian Optimization Algorithm: From Single Level to Hierarchy. PhD thesis, University of Illinois, Urbana-Champaign, IlliGAL Report No. 2002023 (2002)
Goldberg, D.E., Deb, K., Karagupta, H., Harik, G.: Rapid, accurate optimization of difficult problems using fast messy genetic algorithms. In: Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 56–64 (1993)
Harik, G.: Linkage learning via probabilistic modeling in the ECGA. IlliGAL Report No. 99010, Illinois Genetic Algorithm Laboratory, University of Illinois, Urbana-Champaign, IL (1999)
Munetomo, M., Goldberg, D.E.: Identifying linkage by nonlinearity check. IlliGAL Report No. 98012, Illinois Genetic Algorithm Laboratory, University of Illinois, Urbana-Champaign, IL (1998)
Heckendorn, R.B., Wright, A.H.: Efficient linkage learning discovery by limited probing. Evolutionary Computation 12, 517–545 (2005)
Munetomo, M., Goldberg, D.E.: Designing a genetic algorithm using the linkage identification by nonlinearity check. IlliGAL Report No. 98014, Illinois Genetic Algorithm Laboratory, University of Illinois, Urbana-Champaign, IL (1998)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. In: Whitley, D.L. (ed.) Foundations of Genetic Algorithms 2, pp. 93–108. Morgan Kaufmann, San Mateo (1994)
Pelikan, M., Goldberg, D.E.: Hierarchical problem solving by the Bayesian optimization algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), 511–518 IlliGAL Report No. 2000020 (2000)
Watson, R.A., Hornby, G.S., Pollack, J.B.: Modeling building-block interdependency. Parallel Problem Solving from Nature, 97–106 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valenzuela-Rendón, M., Martínez-Alfaro, H., Terashima-Marín, H. (2005). A Deterministic Alternative to Competent Genetic Algorithms That Solves to Optimality Linearly Decomposable Non-overlapping Problems in Polynomial Time. In: Gelbukh, A., de Albornoz, Á., Terashima-Marín, H. (eds) MICAI 2005: Advances in Artificial Intelligence. MICAI 2005. Lecture Notes in Computer Science(), vol 3789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11579427_70
Download citation
DOI: https://doi.org/10.1007/11579427_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29896-0
Online ISBN: 978-3-540-31653-4
eBook Packages: Computer ScienceComputer Science (R0)