A multi-objective multi-factorial evolutionary algorithm with reference-point-based approach

In recent years, multi-task optimization is one of the emerging topics among evolutionary computation researchers. Multi-Factorial Evolutionary Algorithm (MFEA) is developed based on that individuals, from various cultures, exchange their underlying similarities to improve the convergence characteristic. However, in terms of Multi-Objective Multi-Factorial Optimization (MOMFO), current algorithms employing nondominated front ranking and crowding distance still meet difficulties when the number of objective functions arises. In this paper, we propose a Muli-Objective Multi-Factorial Evolutionary Algorithm (MO-MFEA) with reference-point-based approach to improve the multitasking framework. Rather than using crowding distance to compute individual ranking in the context of MOMFO, we employ a set of reference points to determine the diversity of current population. On the other hand, we improve the guided method that automatically adapt the Random Mating Probability (RMP) in order to exploit shared knowledge among high similar task. Further improvement on genetic operators with JADE crossover and NSLS. The conducted experiments demonstrate our approach performs better than the baseline results.

[1]  Qingfu Zhang,et al.  Evolutionary Multitasking for Multiobjective Continuous Optimization: Benchmark Problems, Performance Metrics and Baseline Results , 2017, ArXiv.

[2]  Dirk Thierens,et al.  The balance between proximity and diversity in multiobjective evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[3]  Yew-Soon Ong,et al.  Multifactorial Evolution: Toward Evolutionary Multitasking , 2016, IEEE Transactions on Evolutionary Computation.

[4]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[5]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

[6]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[7]  Kalyanmoy Deb,et al.  U-NSGA-III: A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives: Proof-of-Principle Results , 2015, EMO.

[8]  Qingfu Zhang,et al.  Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II , 2009, IEEE Transactions on Evolutionary Computation.

[9]  Kay Chen Tan,et al.  Multiobjective Multifactorial Optimization in Evolutionary Multitasking , 2017, IEEE Transactions on Cybernetics.

[10]  Liang Feng,et al.  Evolutionary multitasking across single and multi-objective formulations for improved problem solving , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[11]  Xin Yao,et al.  Many-Objective Evolutionary Algorithms , 2015, ACM Comput. Surv..

[12]  Arthur C. Sanderson,et al.  JADE: Adaptive Differential Evolution With Optional External Archive , 2009, IEEE Transactions on Evolutionary Computation.

[13]  Wenhua Zeng,et al.  A New Local Search-Based Multiobjective Optimization Algorithm , 2015, IEEE Transactions on Evolutionary Computation.

[14]  Ta Duy Hoang,et al.  A Guided Differential Evolutionary Multi-Tasking with Powell Search Method for Solving Multi-Objective Continuous Optimization , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).

[15]  Yew-Soon Ong,et al.  Evolutionary Multitasking: A Computer Science View of Cognitive Multitasking , 2016, Cognitive Computation.

[16]  Kalyanmoy Deb,et al.  A Niched-Penalty Approach for Constraint Handling in Genetic Algorithms , 1999, ICANNGA.