Abstract

Complex optimization problems with hundreds or even thousands of decision variables and dozens of conflicting objectives are not uncommon in the real world. In the past five years, increased research efforts have been dedicated to large-scale multiobjective optimization problems (LSMOPs) by using a variety of search strategies, including variable grouping, variable analysis, problem transformation, dimensionality reduction, and novel recombination operators. Despite the success of these efforts in solving some general LSMOPs, there still remains a big gap between the LSMOPs that have been addressed and those encountered in real life, such as sparse, highly constrained, dynamic, and expensive LMOPs, as well as very large-scale and many-objective optimization problems that are widely seen and of paramount importance for solving scientific and engineering problems. Due to the significant practical importance of large-scale multiobjective optimization, there is a high demand for computationally efficient and effective evolutionary algorithms for solving LSMOPs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call