Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets

dc.contributor.author	Rudoph, Günter	de
dc.date.accessioned	2004-12-07T08:19:26Z
dc.date.available	2004-12-07T08:19:26Z
dc.date.created	1998	de
dc.date.issued	1998-11-08	de
dc.description.abstract	The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real valued function or of finding pareto optimal points of a multicriteria optimization problem. It is shown that evolutionary algorithms are able to converge to the set of minimal elements in finite time with probability one, provided that the search space is finite, the time invariant variation operator is associated with a positive transition probability function and that the selection operator obeys the so called elite preservation strategy.	en
dc.format.extent	86542 bytes
dc.format.extent	88320 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/postscript
dc.identifier.uri	http://hdl.handle.net/2003/5336
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-15256
dc.language.iso	en	de
dc.publisher	Universität Dortmund	de
dc.relation.ispartofseries	Reihe Computational Intelligence ; 16	de
dc.subject.ddc	004	de
dc.title	Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets	en
dc.type	Text	de
dc.type.publicationtype	report
dcterms.accessRights	open access

Files

Now showing 1 - 2 of 2