Multi-objective evolutionary algorithms: introducing bias among Pareto-optimal solutions
Advances in evolutionary computing
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A multi-objective evolutionary algorithm with weighted-sum niching for convergence on knee regions
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A fast and effective method for pruning of non-dominated solutions in many-objective problems
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Exploiting the trade-off — the benefits of multiple objectives in data clustering
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
An Investigation on Preference Order Ranking Scheme for Multiobjective Evolutionary Optimization
IEEE Transactions on Evolutionary Computation
Flat vs. symbiotic evolutionary subspace clusterings
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
In this paper we address the problem of approximating the 'knee' of a bi-objective optimization problem with stochastic search algorithms. Knees or entire knee-regions are of particular interest since such solutions are often preferred by the decision makers in many applications. Here we propose and investigate two update strategies which can be used in combination with stochastic multi-objective search algorithms (e.g., evolutionary algorithms) and aim for the computation of the knee and the knee-region, respectively. Finally, we demonstrate the applicability of the approach on two examples.