Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Parsimony pressure versus multi-objective optimization for variable length representations|
|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|
|Series/Report no.:||Lecture Notes in Computer Science; 7491|
|Conference Name:||International Conference on Parallel Problem Solving from Nature (12th : 2012 : Taormina, Italy)|
|Markus Wagner and Frank Neumann|
|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.|
|Keywords:||Artificial intelligence; computational biology; computation by abstract devices; pattern recognition; algorithm analysis and problem complexity; discrete mathematics in computer science|
|Rights:||© Springer-Verlag Berlin Heidelberg 2012|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.