Survey paperMultiobjective evolutionary algorithms: A survey of the state of the art
Introduction
Many real-world optimization problems involve multiple objectives. A multiobjective optimization problem (MOP) can be mathematically formulated as where is the decision space and is a decision vector. consists of objective functions , where is the objective space.
The objectives in (1) often conflict with each other. Improvement of one objective may lead to deterioration of another. Thus, a single solution, which can optimize all objectives simultaneously, does not exist. Instead, the best trade-off solutions, called the Pareto optimal solutions, are important to a decision maker (DM). The Pareto optimality concept, which was first proposed by Edgeworth and Pareto [1], is formally defined as follows [2], [3]. Definition 1 A vector is said to dominate another vector , denoted as , iff , and .
Definition 2 A feasible solution of problem (1) is called a Pareto optimal solution, iff such that . The set of all the Pareto optimal solutions is called the Pareto set (PS), denoted as The image of the PS in the objective space is called the Pareto front (PF)
Due to their population-based nature, evolutionary algorithms (EAs) are able to approximate the whole PS (PF) of an MOP in a single run. There has been a growing interest in applying EAs to deal with MOPs since Schaffer’s seminal work [4], and these EAs are called multiobjective evolutionary algorithms (MOEAs). By January 2011, more than 56001 publications have been published on evolutionary multiobjective optimization. Among these papers, 66.8% have been published in the last eight years, 38.4% are journal papers and 42.2% are conference papers. The research work on MOEAs has been surveyed from different aspects. Among these surveys, some are mainly on generic methodologies [5], [6], [7], [8], [9], [10], [11], [12]; some are on theoretical developments and applications [13], [14]; some work focus on special methods for MOPs, for example simulated annealing (SA) [15], particle swarm optimization (PSO) [16], and memetic algorithms [17]; some are on combinational problems [18], [19]; and others are on special applications, such as engineering problems [14], [20], [21], scheduling problems [22], economic and finance problems [23], automatic cell planning problems [24], traveling salesman problems [25], and preferences in MOPs [26]. However, no comprehensive survey has been conducted on MOEA development in recent years [6].
In this paper, we focus on recent developments on MOEAs. Our major concern is on continuous MOPs, while the works on combinational MOPs are covered in [19]. The remainder of this paper is organized as follows. Section 2 summarizes the advances in generic MOEA designs. Algorithm frameworks, selection strategies, and offspring reproduction operators are surveyed in this section. In Section 3, MOEAs for some complicated problems, such as constrained MOPs, multimodal problems, many-objective problems, expensive MOPs, and dynamic and noisy MOPs, are outlined. The benchmark problems and algorithm performance measures are surveyed in Section 4. Section 5 briefly discusses the applications of MOEAs. Finally, the paper is concluded in Section 6 with some potential directions for future research.
Section snippets
Advances in MOEA design
In this section, recent developments, including algorithm frameworks, selection and population updating strategies, offspring reproduction schemes, and other related issues, are surveyed.
Constraint handling in MOEAs
Although MOEAs have been more extensively investigated within the context of unconstrained and bound constrained MOPs, various general constraints are involved when solving real-world problems. Typically, the search space of a constrained MOP can be formulated as follows: where and are inequality and equality constraint functions, respectively. Generally, equality constraints are transformed into
Benchmark problems
Benchmark problems are important for both assessing the qualities of MOEAs and designing MOEAs. Quite a few test problems have been designed in the early stages of MOEA research. Since they are relatively simple, they are not widely used nowadays. In recent years, several test suites have been designed, and some widely used ones are as follows.
In the report of the CEC 2007 Special Session and Competition [231], 19 multiobjective minimization problems are described, including bi-objective,
Applications
Due to the rapidly growing popularity of MOEAs as effective and robust multiobjective optimizers, researchers from several domains of science and engineering have been applying MOEAs to solve optimization problems arising in their own fields. The literature on MOEA applications is huge and multifaceted. Therefore, we summarize only the major applications of MOEAs in Table 2.
Conclusions and future directions
In this paper, research work on MOEAs has been surveyed. The advances in MOEA designs, MOEAs for complicated MOPs, benchmark problems, performance measures, and some applications, have been covered. Evolutionary multiobjective optimization is still in its early stage, although there have been a huge number of publications. The following issues, along with others, should define the future research trends of MOEAs.
- •
New algorithmic frameworks: The current popular frameworks are Pareto-dominance
Acknowledgements
This work is partly supported by National Basic Research Program of China (No. 2011CB707104) and National Science Foundation of China (No. 61005050).
References (310)
- et al.
An interactive fuzzy satisficing method for general multiobjective 0-1 programming problems through genetic algorithms with double strings based on a reference solution
Fuzzy Sets and Systems
(2002) - et al.
Integrated multiobjective optimization and a priori preferences using genetic algorithms
Information Sciences
(2008) - et al.
A hybrid immune multiobjective optimization algorithm
European Journal of Operational Research
(2010) - et al.
Solving a multiobjective location routing problem with a metaheuristic based on Tabu search. application to a real case in Andalusia
European Journal of Operational Research
(2007) - et al.
A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design
European Journal of Operational Research
(2010) - et al.
Multi-objective evolutionary algorithms based on the summation of normalized objectives and diversified selection
Information Sciences
(2010) - et al.
Multiobjective fuzzy dominance based bacterial foraging algorithm to solve economic emission dispatch problem
Energy
(2010) - et al.
Multi-objective optimization with artificial weed colonies
Original Research Article Information Sciences
(2011) A survey of multicriteria optimization or the vector maximum problem, part I: 1776–1960
Journal of Optimization Theory and Applications
(1979)Nonlinear Multiobjective Optimization
(1999)
Multi-Objective Optimization Using Evolutionary Algorithms
An overview of evolutionary algorithms in multiobjective optimization
Evolutionary Computation
An updated survey of GA-based multiobjective optimization techniques
ACM Computing Surveys
Multiobjective evolutionary algorithms: analyzing the state-of-the-art
Evolutionary Computation
A short tutorial on evolutionary multiobjective optimization
Evolutionary algorithms for multi-criterion optimization: a survey
International Journal of Computing & Information Sciences
A tutorial on evolutionary multiobjective optimization
A survey of recent developments in multiobjective optimization
Annals of Operations Research
Research on evolutionary multi-objective optimization algorithms
Journal Software
Recent trends in evolutionary multiobjective optimization
Current and future research trends in evolutionary multiobjective optimization
A survey of simulated annealing as a tool for single and multiobjective optimization
Journal of the Operational Research Society
Multi-objective particle swarm optimizers: a survey of the state-of-the-art
International Journal of Computational Intelligence Research
Memetic algorithms for multiobjective optimization: issues, methods and prospects
Approximative solution methods for multiobjective combinatorial optimization
Top
Survey of multi-objective optimization methods for engineering
Structural and Multidisciplinary Optimization
Multi-objective production scheduling: a survey
International Journal of Advanced Manufacturing Technology
Evolutionary algorithms for solving the automatic cell planning problem: survey
Engineering Optimization
The multiobjective traveling salesman problem: a survey and a new approach
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
MOEA/D: a multiobjective evolutionary algorithm based on decomposition
IEEE Transactions on Evolutionary Computation
Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II
IEEE Transactions on Evolutionary Computation
Optimal synthesis of linear antenna arrays with multi-objective differential evolution
Progress in Electromagnetics Research B
Cited by (1841)
Ensemble multi-objective optimization approach for heterogeneous drone delivery problem
2024, Expert Systems with ApplicationsA co-evolutionary algorithm based on sparsity clustering for sparse large-scale multi-objective optimization
2024, Engineering Applications of Artificial IntelligenceInvestigating the performance of a surrogate-assisted nutcracker optimization algorithm on multi-objective optimization problems
2024, Expert Systems with ApplicationsA double auxiliary optimization constrained multi-objective evolutionary algorithm
2024, Mathematics and Computers in SimulationEvolutionary multiobjective optimization assisted by scalarization function approximation for high-dimensional expensive problems
2024, Swarm and Evolutionary Computation