Skip to main content
Log in

Weight grouping operators selection strategy for a multiobjective evolutionary algorithm based on decomposition

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Multiobjective evolutionary algorithm based on decomposition (MOEA/D) works by using a set of uniformly distributed weight vectors to decompose a multiobjective optimization problem (MOP) into multiple single objective optimization subproblems for simultaneous optimization. Selecting parents from the neighborhood when performing reproduction is highly probable, thus different operators and neighborhoods may produce different offspring. However, one omnipotent operator usually cannot handle all different complex MOPs very well, for this reason, we propose a weight grouping operators selection (WGOS) strategy. Firstly, we divide the weight vectors into several groups and assign different reproduction operators to each group. The subproblems in each group are optimized by using the reproduction operators assigned. Then, the size of each group is dynamically adjusted according to the quality of the generated offspring, and the group of the reproduction operator that generates the better offspring expands, and the group of the reproduction operator that generates the worse offspring shrinks correspondingly until all the groups are merged into one and all adopt the same reproduction operator. This process will eventually pick out one operator for subsequent evolution. Finally, we will verify the performance of the selected operator to decide whether to continue using it or switch to another operator. A large number of comparative experiments have proved this strategy has better performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Data Availability Statements

Data supporting the results of this study are available from the corresponding author upon reasonable request, including source code and experimental results.

References

  1. Chen Q, Sun J, Palade V, Wu X, Shi X (2021) An improved gaussian distribution based quantum-behaved particle swarm optimization algorithm for engineering shape design problems. Eng Optim, 1–27

  2. Farag A, Al-Baiyat S, Cheng T C (1995) Economic load dispatch multiobjective optimization procedures using linear programming techniques. IEEE Trans Power Syst 10(2):731–738

    Article  Google Scholar 

  3. Pisacane O, Potena D, Antomarioni S, Bevilacqua M, Diamantini C (2020) Data-driven predictive maintenance policy based on multi-objective optimization approaches for the component repairing problem. Eng Optim, 6

  4. Sang H Y, Duan P Y, Li J Q (2017) An effective invasive weed optimization algorithm for scheduling semiconductor final testing problem. Swarm Evol Comput 38:42–53

    Article  Google Scholar 

  5. Li J Q, Song M X, Wang L, Duan P Y, Han Y Y, Sang H Y, Pan Q K (2020) Hybrid artificial bee colony algorithm for a parallel batching distributed flow-shop problem with deteriorating jobs. IEEE Trans Cybern 50(6):2425–2439

    Article  Google Scholar 

  6. Ruela A S, Delgado K V, Bernardes J (2020) A multi-objective evolutionary approach for the nonlinear scale-free level problem. Appl Intell 50(11)

  7. Xu J, Zhang Z, Hu Z, Du L, Cai X (2020) A many-objective optimized task allocation scheduling model in cloud computing. Appl Intell 51(1):1573–7497

    Google Scholar 

  8. Chen J, Xu Y, Sun W, Huang L (2021) Joint sparse neural network compression via multi-application multi-objective optimization. Appl Intell 51(6):7837–7854

    Article  Google Scholar 

  9. Miettinen K, Mkel M M, Mnnikk T (1998) Nonlinear mult/objective optimization. Comput Optim Applic 11(2):177–194

    Article  Google Scholar 

  10. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  11. Zitzler E, Künzli S (2004) Indicator-based selection in multiobjective search. In: International conference on parallel problem solving from nature. Springer, pp 832–842

  12. Zhang Q, Hui L (2008) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731

    Article  Google Scholar 

  13. Qi Y, Ma X, Fang L, Jiao L, Sun J, Wu J (2014) MOEA/D with adaptive weight adjustment. Evol Comput 22(2):231–264

    Article  Google Scholar 

  14. Dai C, Lei X (2018) A decomposition-based multiobjective evolutionary algorithm with adaptive weight adjustment. Complexity 2018:1–20

    Google Scholar 

  15. Meghwani S S, Thakur M (2021) Adaptively weighted decomposition based multi-objective evolutionary algorithm. Appl Intell 51(4):1–23

    Google Scholar 

  16. Li E, Chen R (2020) Multi-objective decomposition optimization algorithm based on adaptive weight vector and matching strategy. Appl Intell, 6

  17. Ma X, Yu Y, Li X, Qi Y, Zhu Z (2020) A survey of weight vector adjustment methods for decomposition based multi-objective evolutionary algorithms. IEEE Trans Evol Comput PP(99):1–1

    Google Scholar 

  18. Deb K (2001) Multi-objective optimization using evolutionary algorithms, p 16. Wiley

  19. Storn R, Price K (1997) Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359

    Article  MathSciNet  MATH  Google Scholar 

  20. Li K, Fialho A, Kwong S, Zhang Q (2014) Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 18(1):114–130

    Article  Google Scholar 

  21. Zhang S X, Zheng L M, Liu L, Zheng S Y, Pan Y M (2016) Decomposition-based multi-objective evolutionary algorithm with mating neighborhood sizes and reproduction operators adaptation. Soft Comput 21(21):6381–6392

    Article  Google Scholar 

  22. Yan Z, Tan Y, Zheng W, Meng L, Zhang H (2021) Leader recommend operators selection strategy for a multiobjective evolutionary algorithm based on decomposition. Inf Sci 550:166–188

    Article  MathSciNet  MATH  Google Scholar 

  23. Lin W, Lin Q, Ji J, Zhu Z, Wong K C (2021) Decomposition-based multiobjective optimization with bicriteria assisted adaptive operator selection. Swarm Evol Comput 60:100790

    Article  Google Scholar 

  24. Li H, Zhang Q, Deng J (2016) Biased multiobjective optimization and decomposition algorithm. IEEE Trans Cybern 47(1):52–66

    Article  Google Scholar 

  25. H X, Xue B, Zhang M (2020) A duplication analysis based evolutionary algorithm for bi-objective feature selection. IEEE Trans Evol Comput PP(99):1–1

    Google Scholar 

  26. Cheng R, Jin Y, Narukawa K, Sendhoff B (2015) A multiobjective evolutionary algorithm using gaussian process-based inverse modeling. IEEE Trans Evol Comput 19(6):838–856

    Article  Google Scholar 

  27. Zille H (2019) Large-scale multi-objective optimisation: new approaches and a classification of the state-of-the-art

  28. Tian Y, Zheng X, Zhang X, Jin Y (2019) Efficient large-scale multi-objective optimization based on a competitive swarm optimizer. IEEE Transactions on Cybernetics, 1–13

  29. Yan, Qiao, Coello, Carlos, A., Coello, Liang, Zhengping, Liu, Zhiwang (2016) Adaptive composite operator selection and parameter control for multiobjective evolutionary algorithm. Inform Sci: Int J 339:332–352

    Article  Google Scholar 

  30. Zhang Q, Zhou A, Zhao S, Suganthan P N, Tiwari S (2008) Multiobjective optimization test instances for the cec 2009 special session and competition. Mechanical engineering (New York, N.Y.: 1919)

  31. Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: Empirical results. Evol Comput 8(2):173–195

    Article  Google Scholar 

  32. Huband S, Hingston P, Barone L, While L (2006) A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans Evol Comput 10(5):477–506

    Article  MATH  Google Scholar 

  33. Deb K, Thiele L, Laumanns M, Zitzler E (2006) Scalable test problems for evolutionary multi-objective optimization. Evolutionary Multiobjective Optimization

  34. Ye T, Ran C, Zhang X, Jin Y (2017) Platemo: a matlab platform for evolutionary multi-objective optimization. IEEE Comput Intell Mag 12(4):73–87

    Article  Google Scholar 

  35. Zitzler E, Thiele L, Laumanns M, Fonseca C M, Fonseca V (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117–132

    Article  Google Scholar 

  36. Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257–271

    Article  Google Scholar 

Download references

Acknowledgements

The work is partially supported by the National Natural Science Foundation of China (Nos. U1836216, 61772322), the major fundamental research project of Shandong, China(Nos. ZR2020MF042, ZR2019ZD03).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yanyan Tan.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shi, L., Tan, Y., Yan, Z. et al. Weight grouping operators selection strategy for a multiobjective evolutionary algorithm based on decomposition. Appl Intell 53, 10585–10601 (2023). https://doi.org/10.1007/s10489-022-03900-x

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-022-03900-x

Keywords

Navigation