Fixed parameter evolutionary algorithms and maximum leaf spanning trees: a matter of mutation
Date
2010
Authors
Kratsch, S.
Lehre, P.
Neumann, F.
Oliveto, P.
Editors
Schaefer, R.
Cotta, C.
Kolodziej, J.
Rudolph, G.
Cotta, C.
Kolodziej, J.
Rudolph, G.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Parallel Problem Solving from Nature – PPSN XI: 11th International Conference, Kraków, Poland, September 11-15, 2010, Proceedings, Part I / Robert Schaefer, Carlos Cotta, Joanna Kołodziej and Günter Rudolph (eds.): pp.204-213
Statement of Responsibility
Stefan Kratsch, Per Kristian Lehre, Frank Neumann and Pietro Simone Oliveto
Conference Name
International Conference on Parallel Problem Solving from Nature (11th : 2010 : Krakow, Poland)
Abstract
Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of computing a spanning tree that has a maximal number of leaves by evolutionary algorithms in the context of fixed parameter tractability (FPT) where the maximum number of leaves is the parameter under consideration. Our results show that simple evolutionary algorithms working with an edge-set encoding are confronted with local optima whose size of the inferior neighborhood grows with the value of an optimal solution. Investigating two common mutation operators, we show that an operator related to spanning tree problems leads to an FPT running time in contrast to a general mutation operator that does not have this property.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© Springer-Verlag Berlin Heidelberg 2010