摘要
Evolutionary algorithms have been shown to be very successful in solving multi-objective optimization problems(MOPs).However,their performance often deteriorates when solving MOPs with irregular Pareto fronts.To remedy this issue,a large body of research has been performed in recent years and many new algorithms have been proposed.This paper provides a comprehensive survey of the research on MOPs with irregular Pareto fronts.We start with a brief introduction to the basic concepts,followed by a summary of the benchmark test problems with irregular problems,an analysis of the causes of the irregularity,and real-world optimization problems with irregular Pareto fronts.Then,a taxonomy of the existing methodologies for handling irregular problems is given and representative algorithms are reviewed with a discussion of their strengths and weaknesses.Finally,open challenges are pointed out and a few promising future directions are suggested.
基金
supported in part by the National Natural Science Foundation of China(61806051,61903078)
Natural Science Foundation of Shanghai(20ZR1400400)
Agricultural Project of the Shanghai Committee of Science and Technology(16391902800)
the Fundamental Research Funds for the Central Universities(2232020D-48)
the Project of the Humanities and Social Sciences on Young Fund of the Ministry of Education in China(Research on swarm intelligence collaborative robust optimization scheduling for high-dimensional dynamic decisionmaking system(20YJCZH052))。
