Abstract
Capturing the metaphor of evolutionary transitions in biological complexity, the Evolutionary Transition Algorithm (ETA) evolves solutions of increasing structural and functional complexity from the symbiotic interaction of partial ones. From the definition it follows that this algorithm should be very well suited to solve hierarchically decomposable problems. In this chapter, we show that the ETA can indeed solve this kind of problems effectively.We analyze, in depth, its behavior on hierarchical problems of different size and modular complexity. These results are compared to the Symbiogenetic Model and it is shown that the ETA is more robust and efficient to tackle this kind of problems.
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
Defaweux, A., Lenaerts, T.: Evolutionary transitions in sequence complexity: a proof of concept. In: Proceedings of the Annual Machine Learning Conference of Belgium and The Nederlands, Vrije Universiteit Brussel, pp. 38–45 (2004)
Defaweux, A., Lenaerts, T., van Hemert, J.: Evolutionary transitions as a metaphor for evolutionary optimisation. In: Proceedings of The VIIIth European Conference on Artificial Life, Canterbury, UK, pp. 342–352 (2005)
Defaweux, A., Lenaerts, T., van Hemert, J., Parent, J.: Complexity transitions in evolutionary algorithms: Evaluating the impact of the initial population. In: Proceedings of the IEEE Congress on Evolutionary Computation, Edinburgh, UK, pp. 2174–2181 (2005)
Defaweux, A., Lenaerts, T., van Hemert, J., Parent, J.: Transition models as an incremental approach for problem solving in evolutionary algorithms. In: Proceedings of The Genetic and Evolutionary Computation Conference, Washington DC, USA, pp. 599–607 (2005)
de Jong, E.D., Watson, R.A.: On the complexity of hierarchical problem solving. In: Proceedings of The Genetic and Evolutionary Computation Conference, Washington DC, USA, pp. 1201–1208 (2005)
Goldberg, D., Korb, B., Deb, K.: Messy genetic algorithms: motivation, analysis, and first results. Complex Systems 3, 493–530 (1989)
Goldberg, D., Korb, B., Deb, K.: Messy genetic algorithms revisited: Studies in mixed size and scale. Complex Systems 4, 415–444 (1990)
Goldberg, D.E., Deb, K., Clark, J.H.: Genetic algorithms, noise, and the sizing of populations. Complex Systems 6, 333–362 (1992)
Greffenstette, J.: Credit assignment in rule discovery systems based on genetic algorithms. Machine Learning 3, 225–245 (1988)
Holmes, J., Lanzi, P., Stolzmann, W., Wilson, S.: Learning classifier systems: New models, successful applications. Information Processing Letters 82(1), 23–30 (2002)
Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2005)
Khor, S.: Rethinking the adaptive capability of accretive evolution on hierarchically consistent problems. In: IEEE Symposium on Artificial Life, pp. 409–416 (2007)
Khor, S.: Hill climbing on discrete HIFF: exploring the role of DNA transposition in long-term artificial evolution. In: Proceedings of the 9th annual conference on Genetic and evolutionary computation, pp. 277–284 (2007)
Lanzi, P.L., Stolzmann, W., Wilson, S.W. (eds.): IWLCS 1999. LNCS (LNAI), vol. 1813. Springer, Heidelberg (2000)
Lenaerts, T.: Different Levels of Selection in Artificial Evolutionary Systems: Analysis and Simulation of Selection Dynamics. PhD thesis, Department of Computer Science, Vrije Universiteit Brussel, Pleinlaan 2, 1050 Brussel (2003)
Maynard-Smith, J., Szathmáry, E.: The Major Transitions in Evolution. W.H. Freeman, San Francisco (1995)
McPhee, N.F., Crane, E.F.: A theoretical analysis of the HIFF problem. In: Proceedings of the conference on Genetic and Evolutionary Computation, Washington DC, USA, pp. 1153–1160. Morgan Kauffman, San Francisco (2005)
McKenzie, J.F., Castillo, L., Borrajo, D., Salido, M.A., Oddi, A.: Planning, scheduling and constraint satisfaction. IOS Press, Amsterdam (2005)
Michod, R.: Darwinian Dynamics: Evolutionary transitions in Fitness and Individuality. Princeton University Press, Princeton (1999)
Mills, R., Watson, R.A.: Symbiosis, synergy and modularity: introducing the reciprocal synergy symbiosis algorithm. In: Almeida e Costa, F., Rocha, L.M., Costa, E., Harvey, I., Coutinho, A. (eds.) ECAL 2007. LNCS (LNAI), vol. 4648, pp. 1192–1201. Springer, Heidelberg (2007)
Pelikan, M., Goldberg, D.E.: Escaping hierarchical traps with competent genetic algorithms. In: Proceedings of the 2001 conference on Genetic and Evolutionary Computation, pp. 511–518. Morgan Kaufmann, San Francisco (2001)
Potter, M.: The Design and Analysis of a Computational Model of Cooperative Coevolution. PhD thesis, Department of Computer Science, George Mason University (1997)
Raynal, F., Collet, P., Lutton, E., Schoenauer, M.: Individual gp: an alternative viewpoint for the resolution of complex problems. In: Proceeding of the Genetic and Evolutionary Computation Conference (GECCO), pp. 974–981. Morgan Kaufmann, San Francisco (1999)
Raynal, F., Collet, P., Lutton, E., Schoenauer, M.: Polar ifs + parisian genetic programming = efficient ifs inverse problem solving. Genetic Programming and Evolvable Machines Journal 1(4), 339–361 (2000)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs (1995)
Salido, M.A., Garrido, A., Barták, R.: Introduction: special issue on constraint satisfaction techniques for planning and scheduling problems. Engineering Applications of Artificial Intelligence 21(5), 679–682 (2008)
Thierens, D., Goldberg, D.E.: Mixing in genetic algorithms. In: Proceedings of the fifth international conference on genetic algorithms, pp. 38–45. Morgan Kaufmann, San Mateo (1993)
Watson, R.: Compositional Evolution: Interdisciplinary Investigations in Evolvability, Modularity, and Symbiosis. PhD thesis, Brandeis University (2002)
Watson, R.A., Pollack, J.B.: Symbiotic combination as an alternative to sexual recombination in genetic algorithms. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 425–434. Springer, Heidelberg (2000)
Watson, R.A., Pollack, J.B.: A computational model of symbiotic composition in evolutionary transitions. Biosystems Special Issue on Evolvability 69(2-3), 187–209 (2002)
Wiegand, R.P.: An Analysis of Cooperative Coevolutionary Algorithms. PhD thesis, George Mason University, Fairfax, VA (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lenaerts, T., Defaweux, A. (2009). Solving Hierarchically Decomposable Problems with the Evolutionary Transition Algorithm. In: Chiong, R., Dhakal, S. (eds) Natural Intelligence for Scheduling, Planning and Packing Problems. Studies in Computational Intelligence, vol 250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04039-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-04039-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04038-2
Online ISBN: 978-3-642-04039-9
eBook Packages: EngineeringEngineering (R0)