Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem

摘要

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 of difficult problems. We consider the NP-hard multi-objective minimum spanning tree problem and 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.