Authors: Rudolph, Günter
Title: Evolutionary Search under Partially Ordered Fitness Sets
Language (ISO): en
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.
URI: http://hdl.handle.net/2003/5372
http://dx.doi.org/10.17877/DE290R-15257
Issue Date: 2001-10-16
Publisher: Universität Dortmund
Appears in Collections:Sonderforschungsbereich (SFB) 531

Files in This Item:
File Description SizeFormat 
ci67.pdfDNB66.18 kBAdobe PDFView/Open
ci67.ps75.82 kBPostscriptView/Open


This item is protected by original copyright



All resources in the repository are protected by copyright.