Biased Multiobjective Optimization and Decomposition Algorithm

Abstract

Abstract-The bias feature is a major factor that makes a multiobjective optimization problem (MOP) difficult for multiobjective evolutionary algorithms (MOEAs). To deal with this problem feature, an algorithm should carefully balance between exploration and exploitation. The decomposition-based MOEA decomposes an MOP into a number of single objective subproblems and solves them in a collaborative manner. Single objective optimizers can be easily used in this algorithm framework. Covariance matrix adaptation evolution strategy (CMA-ES) has proven to be able to strike good balance between the exploration and the exploitation of search space. This paper proposes a scheme to use both differential evolution (DE) and covariance matrix adaptation in the MOEA based on decomposition. In this scheme, single objective optimization problems are clustered into several groups. To reduce the computational overhead, only one subproblem from each group is selected to optimize by CMA-ES while other subproblems are optimized by DE. When an evolution strategy procedure meets some stopping criteria, it will be reinitialized and used for solving another subproblem in the same group. A set of new multiobjective test problems with bias features are constructed in this paper. Extensive experimental studies show that our proposed algorithm is suitable for dealing with problems with biases.Index Terms-Bias feature, covariance matrix adaptation evolution strategy (CMA-ES), decomposition, multiobjective evolutionary algorithms (MOEAs).

PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective Optimization [Educational Forum]

“…The test problems designed for IM-MOEA BT1-BT9 [83] 2016 Multi-objective test problems with bias LSMOP1-LSMOP9 [84] 2016 Large-scale multi-objective test problems II. In addition, there are a lot of performance indicators provided by PlatEMO for experimental studies,…”

An Indicator-Based Multiobjective Evolutionary Algorithm With Reference Point Adaptation for Better Versatility

“…For MOEA/D and MOEA/DD, the size of neighborhood T is set to ⌈0.1 × N ⌉ (with N denoting the population size), and the neighborhood selection probability δ is set to 0.9. In addition, for MOEA/D, the maximum number of solutions replaced by each offspring n r is set to ⌈0.01 × N ⌉, and the Tchebycheff approach (with transformed reference points [57]) is employed as the aggregation function. For RVEA and RVEA*, the penalty parameter α is set to 2, and the frequency of reference point adaption f r is set to 0.1.…”

Scalable and customizable benchmark problems for many-objective optimization

“…[11], [14], [20], [35] Multi-modality with brittle global optima and robust local optima It is possible to formulate a problem where each objective presents a global optimum and several closer sub-optimal solutions. However, in only one of the sub-optimal solutions, robustness is observed.…”