Abstract
Recently, the linkage problem has attracted attention from researchers and users of genetic algorithms and many efforts have been undertaken to learn linkage. Especially, (1) perturbation methods (PMs) and (2) estimation of distribution algorithms (EDAs) are well known and frequently employed for linkage identification. In our previous work [TMA04], we have proposed a novel approach called Dependency Detection for Distribution Derived from df (D5) which inherits characteristics from both EDAs and PMs. It detects dependencies of loci by estimating the distributions of strings classified according to fitness differences and can solve EDA difficult problems requiring a smaller number of fitness evaluations. In this paper, we estimate population size for the D5 and its computation cost. The computation cost slightly exceeds O(l), which is less than the PMs and some of EDAs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: Rawlins, G.J.E. (ed.) Foundations of Genetic Algorithms, pp. 69–93. Morgan Kaufmann Publishers, San Francisco (1991)
Goldberg, D.E., Korb, B., Deb, K.: Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems 3(5), 415–444 (1989)
Harik, G., Cantú-Paz, E., Goldberg, D.E., Miller, B.L.: The gambler’s ruin problem, genetic algorithms, and the sizing of populations. In: IEEECEP: Proceedings of The IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, pp. 7–12 (1997)
Heckendorn, R.B., Wright, A.H.: Efficient linkage discovery by limited probing. In: Proceedings of the 2003 Genetic and Evolutionary Computation Conference, July 12-16, pp. 1003–1014. Morgan Kaufmann Publishers, San Francisco (2003)
Kargupta, H.: SEARCH, polynomial complexity, and the fast messy genetic algorithm. Technical Report 95008, University of Illinois at Urbana- Champaign, Urbana, IL (October 1995)
Lobo, F.G., Goldberg, D.E., Pelikan, M.: Time complexity of genetic algorithms on exponentially scaled problems. In: Proceedings of the 2000 Genetic and Evolutionary Computation Conference, July 10-12, pp. 151–158. Morgan Kaufmann Publishers, San Francisco (2000)
Munetomo, M., Goldberg, D.E.: Identifying linkage groups by nonlinearity/non-monotonicity detection. In: Proceedings of the 1999 Genetic and Evolutionary Computation Conference, vol. 7, pp. 433–440 (1999)
Pelikan, M., Goldberg, D.E., Cantú-Paz, E.: BOA: The bayesian optimization algorithm. In: Proceedings of the 1999 Genetic and Evolutionary Computation Conference, pp. 525–532. Morgan Kaufmann Publishers, San Francisco (1999)
Pelikan, M., Sastry, K., Goldberg, D.E.: Scalability of the bayesian optimization algorithm. International Journal of Approximate Reasoning 31(3), 221–258 (2002)
Streeter, M.J.: Upper bounds on the time and space complexity of optimizing additively separable functions. In: Proceedings of the 2004 Genetic and Evolutionary Computation Conference, pp. 186–197 (2004)
Thierens, D., Goldberg, D.E., Pereira, Â.G.: Domino convergence, drift and the temporalsalience structure of problems. In: Proceedings of the IEEE International Conference of Evolutionary Computation, pp. 535–540 (1998)
Tsuji, M., Munetomo, M., Akamae, K.: Modeling dependencies of loci with string classification according to fitness differences. In: Proceedings of the 2004 Genetic and Evolutionary Computation Conference, June 26-30, pp. 246–257 (2004)
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
Tsuji, M., Munetomo, M., Akama, K. (2005). Population Sizing of Dependency Detection by Fitness Difference Classification. In: Wright, A.H., Vose, M.D., De Jong, K.A., Schmitt, L.M. (eds) Foundations of Genetic Algorithms. FOGA 2005. Lecture Notes in Computer Science, vol 3469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11513575_15
Download citation
DOI: https://doi.org/10.1007/11513575_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27237-3
Online ISBN: 978-3-540-32035-7
eBook Packages: Computer ScienceComputer Science (R0)