Thumbnail Image

Evolutionary Algorithms and Matroid Optimization Problems

Reichel, Joachim; Skutella, Martin

Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin

We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatorial optimization problems (including many well-known examples such as minimum spanning tree and maximum bipartite matching). We obtain very promising bounds on the expected running time and quality of the computed solution. Our results establish a better theoretical understanding of why randomized search heuristics yield empirically good results for many real-world optimization problems.