Abstract

The search for minimal elements in partially ordered sets is a generalization of the task of finding Pareto-optimal elements in multi-criteria optimization problems. Since there are usually many minimal elements within a partially ordered set, a population-based evolutionary search is, as a matter of principle, capable of finding several minimal elements in a single run and gains therefore a steadily increase of popularity. Here, we present an evolutionary algorithm which population converges with probability one to the set of minimal elements within a finite number of iterations.

Citations

126	Convergence Properties of Evolutionary Algorithms - Rudolph - 1997
70	Combinatorics and partially ordered sets - Trotter - 1992
48	On A Multi-objective Evolutionary Algorithm and Its Convergence To The Pareto Set - Rudolph - 1998
31	On the convergence of multiobjective evolutionary algorithms - Hanne - 1999
26	Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets - Rudolph - 1998
24	Convergence of evolutionary algorithms in general search spaces - Rudolph - 1996
3	Systemanalyse und mehrkriterielle Entscheidung - Ester - 1987
3	Use of vector optimization in multiobjective decision making - Peschel, Riedel - 1977
2	Lineare Algebra und analytische Geometrie, Band 1. Bibliographisches Institut - Klingenberg, Klein - 1971
1	Zur Existenz maximaler Werte bei quasiordnungswertigen Abbildungen - Behringer - 1979