Evolutionary Search under Partially Ordered Fitness Sets

Full metadata record

DC Field	Value	Language
dc.contributor.author	Rudolph, Günter	de
dc.date.accessioned	2004-12-07T08:20:04Z	-
dc.date.available	2004-12-07T08:20:04Z	-
dc.date.created	1999	de
dc.date.issued	2001-10-16	de
dc.identifier.uri	http://hdl.handle.net/2003/5372	-
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-15257	-
dc.description.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 simultaneously 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.	en
dc.format.extent	67766 bytes	-
dc.format.extent	77644 bytes	-
dc.format.mimetype	application/pdf	-
dc.format.mimetype	application/postscript	-
dc.language.iso	en	de
dc.publisher	Universität Dortmund	de
dc.relation.ispartofseries	Reihe Computational Intelligence ; 67	de
dc.subject.ddc	004	de
dc.title	Evolutionary Search under Partially Ordered Fitness Sets	en
dc.type	Text	de
dc.type.publicationtype	report	-
dcterms.accessRights	open access	-
Appears in Collections:	Sonderforschungsbereich (SFB) 531

Files in This Item:

File	Description	Size	Format
ci67.pdf	DNB	66.18 kB	Adobe PDF	View/Open
ci67.ps		75.82 kB	Postscript	View/Open

This item is protected by original copyright

Show simple item record

This item is protected by original copyright rightsstatements.org