Single- and multi-objective genetic programming: new runtime results for sorting
Date
2014
Authors
Wagner, M.
Neumann, F.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014, 2014, pp.125-132
Statement of Responsibility
Markus Wagner and Frank Neumann
Conference Name
2014 IEEE Congress on Evolutionary Computation (CEC) (6 Jul 2014 - 11 Jul 2014 : Beijing)
Abstract
In genetic programming, the size of a solution is typically not specified in advance and solutions of larger size may have a larger benefit. The flexibility often comes at the cost of the so-called bloat problem: individuals grow without providing additional benefit to the quality of solutions, and the additional elements can block the optimisation process. Consequently, problems that are relatively easy to optimise can not be handled by variable-length evolutionary algorithms. In this article, we present several new bounds for different single- and multi-objective algorithms on the sorting problem, a problem that typically lacks independent and additive fitness structures.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
©2014 IEEE