|Title:||Evolutionary Search under Partially Ordered Fitness Sets|
|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.|
|Appears in Collections:||Sonderforschungsbereich (SFB) 531|
Files in This Item:
|ci67.pdf||DNB||66.18 kB||Adobe PDF||View/Open|
This item is protected by original copyright
All resources in the repository are protected by copyright.