Parsimony pressure versus multi-objective optimization for variable length representations
Date
2012
Authors
Wagner, M.
Neumann, F.
Editors
Coello, C.A.C.
Cutello, V.
Deb, K.
Forrest, S.
Nicosia, G.
Pavone, M.
Cutello, V.
Deb, K.
Forrest, S.
Nicosia, G.
Pavone, M.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the 12th International Conference on Parallel Problem Solving from Nature, held in Taormina, Itay, 1-5 September, 2012 / C.A. Coello Coello, V. Cutello, K. Deb, S. Forrest, G. Nicosia and M. Pavone (eds.): pp.133-142
Statement of Responsibility
Markus Wagner and Frank Neumann
Conference Name
International Conference on Parallel Problem Solving from Nature (12th : 2012 : Taormina, Italy)
Abstract
We contribute to the theoretical understanding of variable length evolutionary algorithms. Such algorithms are very flexible but can encounter the bloat problem which means solutions grow during the optimization run without providing additional benefit. We explore two common mechanisms for dealing with this problem from a theoretical point of view and point out the differences of a parsimony and a multi-objective approach in a rigorous way. As an example to point out the differences, we consider different measures of sortedness for the classical sorting problem which has already been studied in the computational complexity analysis of evolutionary algorithms with fixed length representations.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© Springer-Verlag Berlin Heidelberg 2012