Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem |
| |
Authors: | Frank Neumann |
| |
Affiliation: | Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 24098 Kiel, Germany |
| |
Abstract: | Evolutionary algorithms are applied to problems that are not well understood as well as to problems in combinatorial optimization. The analysis of these search heuristics has been started for some well-known polynomial solvable problems. Such analyses are starting points for the analysis of evolutionary algorithms on difficult problems. We present the first runtime analysis of a multi-objective evolutionary algorithm on a NP-hard problem. The subject of our analysis is the multi-objective minimum spanning tree problem for which we give upper bounds on the expected time until a simple evolutionary algorithm has produced a population including for each extremal point of the Pareto front a corresponding spanning tree. These points are of particular interest as they give a 2-approximation of the Pareto front. We show that in expected pseudopolynomial time a population is produced that includes for each extremal point a corresponding spanning tree. |
| |
Keywords: | Evolutionary computations Multi-objective minimum spanning trees Expected optimization time |
本文献已被 ScienceDirect 等数据库收录! |