Some of the modern evolutionary multiobjective algorithms have a high computational complexity of the internal data processing. To further complicate this problem, researchers often wish to alter some of these procedures, and to do it with little ...
The goal of bi-objective optimization is to find a small set of good compromise solutions. A common problem for bi-objective evolutionary algorithms is the following subset selection problem (SSP): Given n solutions P ⊂ R2 in the objective space, select ...
We introduce generalized offline orthant search, an algorithmic framework that can be used to solve many problems coming from evolutionary multiobjective optimization using a common well-optimized algorithmic core and relatively cheap reduction ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in