This work proposes a hybrid strategy in a two-stage search process for many-objective optimization. The first stage of the search is directed by a scalarization function and the second one by Pareto selection enhanced with Adaptive ε-Ranking. The scalarization strategy drives the population towards central regions of objective space, aiming to find solutions with good convergence properties to seed the second stage of the search. Adaptive ε-Ranking balances the search effort towards the different regions of objective space to find solutions with good convergence, spread, and distribution properties. We test the proposed hybrid strategy on MNK-Landscapes showing that performance can improve significantly on problems with more than 6 objectives. © 2010 Springer-Verlag.
CITATION STYLE
Aguirre, H., & Tanaka, K. (2010). A hybrid scalarization and adaptive ε-ranking strategy for many-objective optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6239 LNCS, pp. 11–20). https://doi.org/10.1007/978-3-642-15871-1_2
Mendeley helps you to discover research relevant for your work.