Multiobjectivization of Single-Objective Optimization in Evolutionary Computation: A Survey
- 22 December 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 53 (6) , 3702-3715
Abstract
Multiobjectivization has emerged as a new promising paradigm to solve single-objective optimization problems (SOPs) in evolutionary computation, where an SOP is transformed into a multiobjective optimization problem (MOP) and solved by an evolutionary algorithm to find the optimal solutions of the original SOP. The transformation of an SOP into an MOP can be done by adding helper-objective(s) into the original objective, decomposing the original objective into multiple subobjectives, or aggregating subobjectives of the original objective into multiple scalar objectives. Multiobjectivization bridges the gap between SOPs and MOPs by transforming an SOP into the counterpart MOP, through which multiobjective optimization methods manage to attain superior solutions of the original SOP. Particularly, using multiobjectivization to solve SOPs can reduce the number of local optima, create new search paths from local optima to global optima, attain more incomparability solutions, and/or improve solution diversity. Since the term “multiobjectivization” was coined by Knowles et al. in 2001, this subject has accumulated plenty of works in the last two decades, yet there is a lack of systematic and comprehensive survey of these efforts. This article presents a comprehensive multifacet survey of the state-of-the-art multiobjectivization methods. Particularly, a new taxonomy of the methods is provided in this article and the advantages, limitations, challenges, theoretical analyses, benchmarks, applications, as well as future directions of the multiobjectivization methods are discussed.Keywords
Funding Information
- National Natural Science Foundation of China (61976143, 61871272, 61772392, 61975135)
- International Cooperation and Exchanges NSFC (61911530218)
- Basic and Applied Basic Research Foundation of Guangdong Province (2019A1515010869, 2020A1515010946, 2021A1515012637)
- Shenzhen Municipal Fundamental Research Program (JCYJ20190808173617147)
- Guangdong Provincial Key Laboratory (2020B121201001)
- Scientific Research Foundation of Shenzhen University for Newly Introduced Teachers (860/2110312)
- Science Basic Research Plan in Shaanxi Province of China (2018JM6009)
- BGI-Research Shenzhen Open Funds (BGIRSZ20200002)
This publication has 64 references indexed in Scilit:
- Multi-objectivization of the Tool Selection Problem on a Budget of Evaluations2013
- Multiobjective evolutionary algorithms: A survey of the state of the artSwarm and Evolutionary Computation, 2011
- Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective ModelsEvolutionary Computation, 2010
- SMS-EMOA: Multiobjective selection based on dominated hypervolumeEuropean Journal of Operational Research, 2007
- Minimum spanning trees made easier via multi-objective optimizationNatural Computing, 2006
- Evolutionary multi-objective optimization: a historical view of the fieldIEEE Computational Intelligence Magazine, 2006
- Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisationJournal of Mathematical Modelling and Algorithms, 2005
- The Analysis of Evolutionary Algorithms on Sorting and Shortest Paths ProblemsJournal of Mathematical Modelling and Algorithms, 2004
- Design of combinational logic circuits through an evolutionary multiobjective optimization approachArtificial Intelligence for Engineering Design, Analysis and Manufacturing, 2002
- Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithmsBioSystems, 1996