Finding top-K solutions for the decision-maker in multiobjective optimization

Luo，Wenjian1; Shi，Luming2; Lin，Xin1,2; Zhang，Jiajia1; Li，Miqing3; Yao，Xin4,5

2022-10-01

10.1016/j.ins.2022.09.001

INFORMATION SCIENCES   影响因子和分区

0020-0255

1872-6291

Multiobjective optimization problems (MOPs) are the optimization problem with multiple conflicting objectives. Generally, an optimization algorithm can find a large number of optimal solutions for MOPs, which easily overwhelm decision makers (DMs) and make it difficult for decision-making. Preference-based evolutionary multiobjective optimization (EMO) aims to find the partial optima in the regions preferred by the DM. Although it narrows the scope of the optimal solutions, it usually still returns a population of optimal solutions (typically 100 or larger in EMO) with a small distance between adjacent optima. Top-K, which is a well-established research subject in many fields to find the best K solutions, may be a direction to reduce the number of optimal solutions. In this paper, first, we introduce the top-K notion into preference-based EMO and propose the top-K model to obtain the best K individuals of multiobjective optimization problems (MOPs). Then, with the top-K model, we propose NSGA-II-TopK and SPEA2-TopK to search for the top-K preferred solutions for preference-based continuous and combinatorial MOPs, respectively. Finally, the proposed algorithms with several representative preference-based EMO algorithms are compared in different preference situations for MOPs. Experimental results show the proposed algorithms have strong performances against the compared algorithms.

Evolutionary algorithm Multi-objective optimization Preference handling

SCI

英语

其他

National Natural Science Foundation of China[61573327] ; EPSRC["EP/J017515/1","EP/P005578/1"] ; Program for Guangdong Introducing Innovative and Enterpreneurial Teams[2017ZT07X386] ; Shenzhen Peacock Plan[KQTD2016112514355531] ; Science and Technology Innovation Committee Foundation of Shenzhen[ZDSYS201703031748284] ; Program for University Key Laboratory of Guangdong Province[2017KSYS008]

Computer Science

Computer Science, Information Systems

WOS:000860651600010

ELSEVIER SCIENCE INC

COMPUTER SCIENCE

2-s2.0-85138453320

Scopus

1.School of Computer Science and Technology,Harbin Institute of Technology,Shenzhen,Guangdong,518055,China
2.School of Computer Science and Technology,University of Science and Technology of China,Hefei,Anhui,230027,China
3.Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA),School of Computer Science,University of Birmingham,United Kingdom
4.Shenzhen Key Laboratory of Computational Intelligence,University Key Laboratory of Evolving Intelligent Systems of Guangdong Province,Department of Computer Science and Engineering,Southern University of Science and Technology,Shenzhen,518055,China
5.CERCIA,School of Computer Science,University of Birmingham,United Kingdom

Luo，Wenjian,Shi，Luming,Lin，Xin,et al. Finding top-K solutions for the decision-maker in multiobjective optimization[J]. INFORMATION SCIENCES,2022,613:204-227.

Luo，Wenjian,Shi，Luming,Lin，Xin,Zhang，Jiajia,Li，Miqing,&Yao，Xin.(2022).Finding top-K solutions for the decision-maker in multiobjective optimization.INFORMATION SCIENCES,613,204-227.

Luo，Wenjian,et al."Finding top-K solutions for the decision-maker in multiobjective optimization".INFORMATION SCIENCES 613(2022):204-227.