Abstract
Conventional evolutionary algorithms (EAs) cannot solve given optimization problems efficiently when their evolutionary operators do not accommodate to the structures of the problems. We previously proposed a mutation-based EA that does not use a recombination operator and does not have this problem of the conventional EAs. The mutation-based EA evolves timings at which probabilities for generating phenotypic values (developmental timings) change, and brings different evolution speed to each phenotypic variable, so that it can solve a given problem hierarchically. In this paper we first propose the evolutionary algorithm evolving developmental timing (EDT) by adding a crossover operator to the mutation-based EA and then devise a new test problem that conventional EAs are likely to fail in solving and for which the features of the proposed EA are well utilized. The test problem consists of multiple deceptive problems among which there is hierarchical dependency, and has the feature that the hierarchical dependency is represented by a graph structure. We apply the EDT and the conventional EAs, the PBIL and cGA, for comparison to the new test problem and show the usefulness of the evolution of developmental timing.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baluja, S.: Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Tech. rep (1994)
Barabasi, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509–512 (1999)
Bu, T., Towsley, D.: On Distinguishing between Internet Power Law Topology Generators. In: Proceedings of IEEE Infocom 2002, pp. 638–647 (2003)
Cangelosi, A.: Heterochrony and adaptation in developing neural networks. In: Proceedings of the Genetic and Evolutionary Computation Conference 1999, San Francisco, CA, pp. 1241–1248 (1999)
Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. Foundations of Genetic Algorithms 2, 93–108 (1993)
Goldberg, D.E., Korb, B., Deb, K.: Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems 3(5), 493–530 (1989)
Gould, S.J.: Ontogeny and Phylogeny. Harvard Univ. Press, Oxford (1977)
Harik, G.R., Goldberg, D.E.: Learning linkage. Foundations of Genetic Algorithms 4, 247–262 (1996)
Harik, G.R., Lobo, F.G., Goldberg, D.E.: The compact genetic algorithm. IEEE Transactions on Evolutionary Computation 3(4), 287–297 (1999)
Kitano, H.: Designing neural networks using genetic algorithms with graph generation system. Complex Systems 4(4), 461–476 (1990)
Larranaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers (2001)
Ohnishi, K., Sastry, K., Chen, Y.-P., Goldberg, D.E.: Inducing sequentiality using grammatical genetic codes. In: Proceedings of the Genetic and Evolutionary Computation Conference 2004, Seattle, WA, pp. 1426–1437 (2004)
Ohnishi, K., Uchida, M., Oie, Y.: Evolution and Learning Mediated by Difference in Developmental Timing. Advanced Computational Intelligence and Intelligent Informatics (JACIII) 11(8), 905–913 (2007)
Pelikan, M., Goldberg, D.E., Lobo, F.: A survey of optimization by building and using probabilistic models. IlliGAL Report No. 99018, Illinois Genetic Algorithms Lab., Univ. of Illinois, Urbana, IL (1999)
Ryan, C., Collins, J.J., O’Neill, M.: Grammatical evolution: Evolving programs for an arbitrary language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 83–96. Springer, Heidelberg (1998)
Ryan, C., Nicolau, M., O’Neill, M.: Genetic algorithms using grammatical evolution. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 278–287. Springer, Heidelberg (2002)
Thierens, D., Goldberg, D.E.: Mixing in genetic algorithms. In: Proceedings of the 5th International Conference on Genetic Algorithms (ICGA 1993), pp. 38–45 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Hamano, K., Ohnishi, K., Köppen, M. (2014). Evolution of Developmental Timing for Solving Hierarchically Dependent Deceptive Problems. In: Dick, G., et al. Simulated Evolution and Learning. SEAL 2014. Lecture Notes in Computer Science, vol 8886. Springer, Cham. https://doi.org/10.1007/978-3-319-13563-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-13563-2_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13562-5
Online ISBN: 978-3-319-13563-2
eBook Packages: Computer ScienceComputer Science (R0)