Abstract
A number of evolutionary multi-objective optimization (EMO) algorithms have been proposed to search for non-dominated solutions around reference points that are usually assumed to be given by a decision maker (DM) based on his/her preference. However, setting the reference point needs a priori knowledge that the DM sometimes does not have. In order to obtain favorable solutions without a priori knowledge, “knee points” can be used. Some algorithms have already been proposed to obtain solutions around the knee points. TKR-NSGAII is one of them. In this algorithm, the DM is supposed to specify the number of knee points as a parameter whereas such information is usually unknown. In this paper, we propose an EMO algorithm that does not require the DM to specify the number of knee points in advance. We demonstrate that the proposed method can efficiently find solutions around knee points.
Author supplied keywords
Cite
CITATION STYLE
Setoguchi, Y., Narukawa, K., & Ishibuchi, H. (2015). A knee-based EMO algorithm with an efficient method to update mobile reference points. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9018, pp. 202–217). Springer Verlag. https://doi.org/10.1007/978-3-319-15934-8_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.