Two-Sided Pareto Front Approximations |
| |
Authors: | I Kaliszewski J Miroforidis |
| |
Institution: | 1. Systems Research Institute, Polish Academy of Sciences, Newelska 6, 01-447, Warsaw, Poland 2. Treeffect Co, Gdów, Poland
|
| |
Abstract: | A new approach to derive Pareto front approximations with evolutionary computations is proposed here. At present, evolutionary multiobjective optimization algorithms derive a discrete approximation of the Pareto front (the set of objective maps of efficient solutions) by selecting feasible solutions such that their objective maps are close to the Pareto front. However, accuracy of such approximations is known only if the Pareto front is known, which makes their usefulness questionable. Here we propose to exploit also elements outside feasible sets to derive pairs of such Pareto front approximations that for each approximation pair the corresponding Pareto front lies, in a certain sense, in-between. Accuracies of Pareto front approximations by such pairs can be measured and controlled with respect to distance between elements of a pair. A rudimentary algorithm to derive pairs of Pareto front approximations is presented and the viability of the idea is verified on a limited number of test problems. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|