A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 simultaneously and gains therefore a steadily increase of popularity. Here, we present an evolutionary algorithm which population convergesdoi:10.17877/de290r-15257 fatcat:rnsaouy3ofdyve3jksh5jlhzli