@article{LDH2009,
	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. In this chapter we show that the ETA indeed captures this idea and we illustrate this on instances of the Binary Constraint Satisfaction problem. The results make the ETA a promising optimization approach that requires more extensive investigation from both a theoretical and optimization perspective. We analyze here, in depth, some of the design choices that are made for the algorithm. The analysis of these choices provides insight on the plasticity of the algorithm toward alternative choices and other kinds of problems. },
	author = {T Lenaerts and A Defaweux and {van Hemert}, J},
	date-added = {2008-11-13 13:30:06 +0000},
	date-modified = {2009-03-08 14:22:30 +0000},
	editor = {Raymond Chiong},
	journal = {Nature-Inspired Algorithms for Optimisation},
	keywords = {constraint satisfaction},
	pages = {103--131},
	publisher = {Springer},
	series = {Studies in Computational Intelligence},
	title = {The Evolutionary Transition Algorithm: Evolving Complex Solutions out of Simpler Ones},
	volume = {193},
	year = {2009}}