Advertisement

Soft Computing

, Volume 23, Issue 23, pp 12843–12857 | Cite as

Review and analysis of three components of the differential evolution mutation operator in MOEA/D-DE

  • Ryoji Tanabe
  • Hisao IshibuchiEmail author
Methodologies and Application
  • 206 Downloads

Abstract

A decomposition-based multi-objective evolutionary algorithm with a differential evolution variation operator (MOEA/D-DE) shows high performance on challenging multi-objective problems (MOPs). The DE mutation consists of three key components: a mutation strategy, an index selection method for parent individuals, and a bound-handling method. However, the configuration of the DE mutation operator that should be used for MOEA/D-DE has not been thoroughly investigated in the literature. This configuration choice confuses researchers and users of MOEA/D-DE. To address this issue, we present a review of the existing configurations of the DE mutation operator in MOEA/D-DE and systematically examine the influence of each component on the performance of MOEA/D-DE. Our review reveals that the configuration of the DE mutation operator differs depending on the source code of MOEA/D-DE. In our analysis, a total of 30 configurations (three index selection methods, two mutation strategies, and five bound-handling methods) are investigated on 16 MOPs with up to five objectives. Results show that each component significantly affects the performance of MOEA/D-DE. We also present the most suitable configuration of the DE mutation operator, which maximizes the effectiveness of MOEA/D-DE.

Keywords

Multi-objective optimization Decomposition-based evolutionary algorithms Differential evolution operators Implementation of algorithms 

Notes

Acknowledgements

This work was supported by National Natural Science Foundation of China (Grant No. 61876075), the Program for Guangdong Introducing Innovative and Entrepreneurial Teams (Grant No. 2017ZT07X386), Shenzhen Peacock Plan (Grant No. KQTD2016112514355531), the Science and Technology Innovation Committee Foundation of Shenzhen (Grant No. ZDSYS201703031748284), and the Program for University Key Laboratory of Guangdong Province (Grant No. 2017KSYS008).

Compliance with ethical standards

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants performed by any of the authors.

Supplementary material

500_2019_3842_MOESM1_ESM.pdf (85 kb)
Supplementary material 1 (pdf 85 KB)

References

  1. Arabas J, Szczepankiewicz A, Wroniak T (2010) Experimental comparison of methods to handle boundary constraints in differential evolution. In: PPSN, pp 411–420Google Scholar
  2. Auger A, Brockhoff D, Hansen N, Tusar D, Tusar T, Wagner T (2016) The impact of variation operators on the performance of SMS-EMOA on the bi-objective BBOB-2016 test suite. In: GECCO, pp 1225–1232Google Scholar
  3. Bader J, Zitzler E (2011) HypE: an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45–76CrossRefGoogle Scholar
  4. Beume N, Naujoks B, Emmerich MTM (2007) SMS-EMOA: multiobjective selection based on dominated hypervolume. EJOR 181(3):1653–1669CrossRefGoogle Scholar
  5. Bezerra LCT, López-Ibáñez M, Stützle T (2015) To DE or Not to DE? Multi-objective differential evolution revisited from a component-wise perspective. In: EMO, pp 48–63Google Scholar
  6. Brockhoff D, Tran T, Hansen N (2015) Benchmarking numerical multiobjective optimizers revisited. In: GECCO, pp 639–646Google Scholar
  7. Cheng R, Li M, Tian Y, Zhang X, Yang S, Jin Y, Yao X (2017) Benchmark functions for the CEC’2017 competition on many-objective optimization. Technical report, University of BirminghamGoogle Scholar
  8. Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE TEVC 15(1):4–31Google Scholar
  9. Das S, Mullick SS, Suganthan PN (2016) Recent advances in differential evolution—an updated survey. Swarm Evol Comput 27:1–30CrossRefGoogle Scholar
  10. Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, HobokenzbMATHGoogle Scholar
  11. Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE TEVC 18(4):577–601Google Scholar
  12. Deb K, Agrawal S, Pratap A, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE TEVC 6(2):182–197Google Scholar
  13. Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable test problems for evolutionary multi-objective optimization. In: Evolutionary multiobjective optimization. Theoretical advances and applications, pp 105–145. SpringerGoogle Scholar
  14. Gong W, Wang Y, Cai Z, Yang S (2017) A weighted biobjective transformation technique for locating multiple optimal solutions of nonlinear equation systems. IEEE TEVC 21(5):697–713Google Scholar
  15. Hansen N, Niederberger ASP, Guzzella L, Koumoutsakos P (2009) A method for handling uncertainty in evolutionary optimization with an application to feedback control of combustion. IEEE TEVC 13(1):180–197Google Scholar
  16. Helwig S, Branke J, Mostaghim S (2013) Experimental analysis of bound handling techniques in particle swarm optimization. IEEE TEVC 17(2):259–271Google Scholar
  17. Huband S, Hingston P, Barone L, While RL (2006) A review of multiobjective test problems and a scalable test problem toolkit. IEEE TEVC 10(5):477–506zbMATHGoogle Scholar
  18. Ishibuchi H, Akedo N, Nojima Y (2015) Behavior of multiobjective evolutionary algorithms on many-objective knapsack problems. IEEE TEVC 19(2):264–283Google Scholar
  19. Ishibuchi H, Masuda H, Nojima Y (2016) Pareto fronts of many-objective degenerate test problems. IEEE TEVC 20(5):807–813Google Scholar
  20. Ishibuchi H, Setoguchi Y, Masuda H, Nojima Y (2017) Performance of decomposition-based many-objective algorithms strongly depends on pareto front shapes. IEEE TEVC 21(2):169–190Google Scholar
  21. Jiang S, Yang S (2016) An improved multiobjective optimization evolutionary algorithm based on decomposition for complex pareto fronts. IEEE Trans Cybern 46(2):421–437CrossRefGoogle Scholar
  22. Kollat JB, Reed PM, Maxwell RM (2011) Many-objective groundwater monitoring network design using bias-aware ensemble Kalman filtering, evolutionary optimization, and visual analytics. Water Resour Res 47(2):1–18CrossRefGoogle Scholar
  23. Kukkonen S, Lampinen J (2005) GDE3: the third evolution step of generalized differential evolution. In: IEEE CEC, pp 443–450Google Scholar
  24. Le MN, Ong Y, Menzel S, Jin Y, Sendhoff B (2013) Evolution by adapting surrogates. Evol Comput 21(2):313–340CrossRefGoogle Scholar
  25. Li H, Zhang Q (2009) Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGA-II. IEEE TEVC 13(2):284–302Google Scholar
  26. Li K, Fialho Á, Kwong S, Zhang Q (2014a) Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition. IEEE TEVC 18(1):114–130Google Scholar
  27. Li K, Zhang Q, Kwong S, Li M, Wang R (2014b) Stable matching-based selection in evolutionary multiobjective optimization. IEEE TEVC 18(6):909–923Google Scholar
  28. Liao X, Li Q, Yang X, Zhang W, Li W (2008) Multiobjective optimization for crash safety design of vehicles using stepwise regression model. Struct Multidiscip Optim 35(6):561–569CrossRefGoogle Scholar
  29. Mezura-Montes E, Velázquez-Reyes J, Coello Coello CA (2006) A comparative study of differential evolution variants for global optimization. In: GECCO, pp 485–492Google Scholar
  30. Ong YS, Nair PB, Keane AJ (2003) Evolutionary optimization of computationally expensive problems via surrogate modeling. AIAA J 41(4):687–696CrossRefGoogle Scholar
  31. Pescador-Rojas M, Gómez, RH, Montero E, Rojas-Morales N, Riff MC, Coello CA (2017) An overview of weighted and unconstrained scalarizing functions. In: EMO, pp 499–513 (2017)Google Scholar
  32. Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE TEVC 13(2):398–417Google Scholar
  33. Robič T, Filipič B (2005) DEMO: differential evolution for multiobjective optimization. In: EMO, pp 520–533Google Scholar
  34. Rönkkönen J, Kukkonen S, Price KV (2005) Real-parameter optimization with differential evolution. In: IEEE CEC, pp 506–513Google Scholar
  35. Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359MathSciNetCrossRefGoogle Scholar
  36. Trivedi A, Srinivasan D, Sanyal K, Ghosh A (2017) A survey of multiobjective evolutionary algorithms based on decomposition. IEEE TEVC 21(3):440–462Google Scholar
  37. Tusar T, Filipic B (2007) Differential evolution versus genetic algorithms in multiobjective optimization. In: EMO, pp 257–271Google Scholar
  38. Wang Y, Cai Z, Zhang Q (2011) Differential evolution with composite trial vector generation strategies and control parameters. IEEE TEVC 15(1):55–66Google Scholar
  39. Wang Y, Liu Z, Li J, Li H, Wang J (2016a) On the selection of solutions for mutation in differential evolution. Front Comput Sci 12(2):297–315. https://link.springer.com/article/10.1007/s11704-016-5353-5
  40. Wang Z, Zhang Q, Zhou A, Gong M, Jiao L (2016b) Adaptive replacement strategies for MOEA/D. IEEE Trans Cybern 46(2):474–486CrossRefGoogle Scholar
  41. Wessing S (2013) Repair methods for box constraints revisited. In: EvoApplications, pp 469–478Google Scholar
  42. Yuan Y, Xu H, Wang B (2015) An experimental investigation of variation operators in reference-point based many-objective optimization. In: GECCO, pp 775–782Google Scholar
  43. Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE TEVC 11(6):712–731Google Scholar
  44. Zhang Q, Liu W, Li H (2009) The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances. In: IEEE CEC, pp 203–208Google Scholar
  45. Zitzler E, Künzli S (2004) Indicator-based selection in multiobjective search. In: Proceedings of PPSN, pp 832–842Google Scholar
  46. Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm. Technical report, ETHZGoogle Scholar
  47. Zitzler E, Thiele L, Laumanns M, Fonseca CM, Grunert da Fonseca V (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE TEVC 7(2):117–132Google Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Shenzhen Key Laboratory of Computational Intelligence, University Key Laboratory of Evolving Intelligent Systems of Guangdong Province, Department of Computer Science and EngineeringSouthern University of Science and TechnologyShenzhenChina

Personalised recommendations