Solving hierarchically decomposable problems the evolutionary transition algorithm

Tom Lenaerts, Anne Defaweux

Research output: Chapter in Book/Report/Conference proceedingChapter

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.
Original languageEnglish
Title of host publicationNatural Intelligence for Scheduling, Planning and Packing Problems
EditorsRaymond Chiong, Sandeep Dhakal
PublisherSpringer
ISBN (Print)978-3-642-04038-2
Publication statusPublished - 29 Sep 2009

Publication series

NameNatural Intelligence for Scheduling, Planning and Packing Problems

Bibliographical note

Chiong, Raymond; Dhakal, Sandeep

Keywords

  • genetic algorithm
  • complexity
  • hierarchically decomposable problems

Cite this