Skip to main content
SpringerLink
Log in

A decomposition-based many-objective evolutionary algorithm with weight grouping and adaptive adjustment

  • Regular research paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

Multiobjective evolutionary algorithms based on decomposition (MOEA/D) have attracted tremendous interest and have been thoroughly developed because of their excellent performance in multi/many-objective optimization problems. In general, MOEA/D methods use a set of uniformly distributed weight vectors to decompose a multiobjective problem into multiple single-objective subproblems and solve them cooperatively. However, a set of uniformly distributed weight vectors tends to perform well over smooth, continuous, and well-spread Pareto fronts (PFs) but poorly over irregular PFs, such as discontinuous PFs, degenerate PFs and PFs with long peaks and tails. Many weight vector adjustment strategies have been proposed to alleviate this issue. In this article, we propose a novel weight grouping strategy and an adaptive adjustment strategy. Specifically, we dynamically divide the weight vectors into three groups, normal weight vectors, invalid weight vectors and crowded weight vectors; then, the invalid weight vectors and crowded weight vectors are deleted in order, and new weight vectors are added according to the external archived individuals. The proposed method can be combined with a penalty-based boundary intersection approach or the Tchebycheff aggregation function. In the experiments, we compare our algorithm with several state-of-the-art many-objective evolutionary algorithms in several many-objective problem test instances with PFs of varying degrees of difficulty, and the results show that the proposed algorithm performs best on most test instances, which further demonstrates that it outperforms all the comparison algorithms.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Algorithm 1
Fig. 2
Algorithm 2
Fig. 3
Algorithm 3
Algorithm 4
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Notes

  1. https://github.com/BIMK/PlatEMO.

References

  1. Chen J, Ding J, Tan KC, Chen Q (2021) A decomposition-based evolutionary algorithm for scalable multi/many-objective optimization. Memet Comput 13(3):413–432

    Article  Google Scholar 

  2. Li G, Wang G-G, Wang S (2021) Two-population coevolutionary algorithm with dynamic learning strategy for many-objective optimization. Mathematics 9(4):420

    Article  Google Scholar 

  3. Han D, Du W, Du W, Jin Y, Wu C (2019) An adaptive decomposition-based evolutionary algorithm for many-objective optimization. Inf Sci 491:204–222

  4. Zhao W, Zhang Z, Mirjalili S, Wang L, Khodadadi N, Mirjalili SM (2022) An effective multi-objective artificial hummingbird algorithm with dynamic elimination-based crowding distance for solving engineering design problems. Comput Methods Appl Mech Eng 398:115223

    Article  MathSciNet  ADS  Google Scholar 

  5. He L, Chiong R, Li W, Budhi GS, Zhang Y (2022) A multiobjective evolutionary algorithm for achieving energy efficiency in production environments integrated with multiple automated guided vehicles. Knowl Based Syst 243:108315

    Article  Google Scholar 

  6. Ghane-Kanafi A, Khorram E (2015) A new scalarization method for finding the efficient frontier in non-convex multi-objective problems. Appl Math Model 39(23–24):7483–7498

    Article  MathSciNet  Google Scholar 

  7. Xue Y, Zhu H, Neri F (2022) A self-adaptive multi-objective feature selection approach for classification problems. Integr Comput Aided Eng (Preprint), 1–19

  8. Zhang H, Wang G-G (2021) Improved NSGA-III using transfer learning and centroid distance for dynamic multi-objective optimization. Complex Intell Syst 1–22

  9. Zhou A, Qu B-Y, Li H, Zhao S-Z, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol Comput 1(1):32–49

    Article  Google Scholar 

  10. Sirbiladze G, Garg H, Ghvaberidze B, Matsaberidze B, Khutsishvili I, Midodashvili B (2022) Uncertainty modeling in multi-objective vehicle routing problem under extreme environment. Artif Intell Rev 1–35

  11. Song Z, Wang H, Xu H (2022) A framework for expensive many-objective optimization with Pareto-based bi-indicator infill sampling criterion. Memet Comput 14(2):179–191

    Article  Google Scholar 

  12. Zhang L, Xie Y, Chen J, Feng L, Chen C, Liu K (2021) A study on multiform multi-objective evolutionary optimization. Memet Comput 13(3):307–318

    Article  Google Scholar 

  13. Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731

    Article  Google Scholar 

  14. Yang Q, Wang Z, Luo J, He Q (2021) Balancing performance between the decision space and the objective space in multimodal multiobjective optimization. Memet Comput 13(1):31–47

    Article  CAS  ADS  Google Scholar 

  15. Yuan J (2021) Dynamic grid-based uniform search for solving constrained multiobjective optimization problems. Memet Comput 13(4):497–508

    Article  Google Scholar 

  16. Ma X, Yu Y, Li X, Qi Y, Zhu Z (2020) A survey of weight vector adjustment methods for decomposition-based multiobjective evolutionary algorithms. IEEE Trans Evol Comput 24(4):634–649

    Article  Google Scholar 

  17. Shang K, Ishibuchi H, He L, Pang LM (2020) A survey on the hypervolume indicator in evolutionary multiobjective optimization. IEEE Trans Evol Comput 25(1):1–20

    Article  Google Scholar 

  18. Camacho A, Toscano G, Landa R, Ishibuchi H (2019) Indicator-based weight adaptation for solving many-objective optimization problems. In: International conference on evolutionary multi-criterion optimization. Springer, pp 216–228

  19. Jain H, Deb K (2013) An improved adaptive approach for elitist nondominated sorting genetic algorithm for many-objective optimization. In: International conference on evolutionary multi-criterion optimization. Springer, pp. 307–321

  20. Fan R, Wei L, Sun H, Hu Z (2020) An enhanced reference vectors-based multi-objective evolutionary algorithm with neighborhood-based adaptive adjustment. Neural Comput Appl 32:11767–11789

    Article  Google Scholar 

  21. Xue Y, Zhu H, Neri F (2023) A feature selection approach based on nsga-ii with relieff. Appl Soft Comput 109987

  22. Ma X, Sun H, Hu Z, Wei L, Yang J (2023) Multi-spatial information joint guidance evolutionary algorithm for dynamic multi-objective optimization with a changing number of objectives. Neural Comput Appl 1–33

  23. Jin Y, Okabe T, Sendho B (2001) Adapting weighted aggregation for multiobjective evolution strategies. In: International conference on evolutionary multi-criterion optimization. Springer, pp 96–110

  24. Jaszkiewicz A (2002) On the performance of multiple-objective genetic local search on the 0/1 knapsack problem-a comparative experiment. IEEE Trans Evol Comput 6(4):402–412

    Article  Google Scholar 

  25. Gu F, Liu H-L, Tan KC (2012) A multiobjective evolutionary algorithm using dynamic weight design method. Int J Innov Comput Inf Control 8(5(B)):3677–3688

    Google Scholar 

  26. Wu M, Li K, Kwong S, Zhang Q, Zhang J (2019) Learning to decompose: a paradigm for decomposition-based multiobjective optimization. IEEE Trans Evol Comput 23(3):376–390

    Article  ADS  Google Scholar 

  27. Liu H-L, Gu F-Q, Cheung Y-M (2010) T-MOEA/D: MOEA/D with objective transform in multi-objective problems. In: 2010 international conference of information science and management engineering. IEEE, vol 2, pp 282–285

  28. Jain H, Deb K (2013) An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part II: Handling constraints and extending to an adaptive approach. IEEE Trans Evol Comput 18(4):602–622

    Article  Google Scholar 

  29. Zhu C, Cai X, Fan Z, Sulaman M (2016) A two-phase many-objective evolutionary algorithm with penalty based adjustment for reference lines. In: 2016 IEEE congress on evolutionary computation (CEC). IEEE, pp 2161–2168

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

    Article  PubMed  Google Scholar 

  31. de Farias LR, Braga PH, Bassani HF, Araújo AF (2018) MOEA/D with uniformly randomly adaptive weights. In: Proceedings of the genetic and evolutionary computation conference, pp 641–648

  32. Li H, Landa-Silva D (2011) An adaptive evolutionary multi-objective approach based on simulated annealing. Evol Comput 19(4):561–595

    Article  CAS  PubMed  Google Scholar 

  33. Xu H, Zeng W, Zhang D, Zeng X (2017) MOEA/HD: a multiobjective evolutionary algorithm based on hierarchical decomposition. IEEE Trans Cybern 49(2):517–526

    Article  PubMed  Google Scholar 

  34. Wang R, Purshouse RC, Fleming PJ (2012) Preference-inspired coevolutionary algorithms for many-objective optimization. IEEE Trans Evol Comput 17(4):474–494

    Article  Google Scholar 

  35. Wang R, Purshouse RC, Fleming PJ (2013) On finding well-spread Pareto optimal solutions by preference-inspired co-evolutionary algorithm. In: Proceedings of the 15th annual conference on genetic and evolutionary computation, pp 695–702

  36. Wang Z, Zhang Q, Zhou A, Gong M, Jiao L (2015) Adaptive replacement strategies for MOEA/D. IEEE Trans Cybern 46(2):474–486

    Article  PubMed  Google Scholar 

  37. Wang Z, Zhang Q, Li H, Ishibuchi H, Jiao L (2017) On the use of two reference points in decomposition based multiobjective evolutionary algorithms. Swarm Evol Comput 34:89–102

    Article  CAS  Google Scholar 

  38. de Farias LR, Araújo AF (2022) A decomposition-based many-objective evolutionary algorithm updating weights when required. Swarm Evol Comput 68:100980

    Article  Google Scholar 

  39. Liu Y, Hu Y, Zhu N, Li K, Zou J, Li M (2021) A decomposition-based multiobjective evolutionary algorithm with weights updated adaptively. Inf Sci 572:343–377

    Article  MathSciNet  Google Scholar 

  40. Zhang Q, Liu W, Li H (2009) The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances. In: 2009 IEEE congress on evolutionary computation. IEEE, pp 203–208

  41. Tian Y, Cheng R, Zhang X, Jin Y (2017) PlatEMO: a MATLAB platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput Intell Mag 12(4):73–87

    Article  Google Scholar 

  42. Yuan J, Liu H-L, Gu F, Zhang Q, He Z (2021) Investigating the properties of indicators and an evolutionary many-objective algorithm using promising regions. IEEE Trans Evol Comput 25(1):75–86

    Article  Google Scholar 

  43. Abdel-Basset M, Mohamed R, Mirjalili S (2021) A novel whale optimization algorithm integrated with Nelder–Mead simplex for multi-objective optimization problems. Knowl Based Syst 212:106619

    Article  Google Scholar 

  44. 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  Google Scholar 

  45. Cheng R, Li M, Tian Y, Zhang X, Yang S, Jin Y, Yao X (2017) A benchmark test suite for evolutionary many-objective optimization. Complex Intell Syst 3(1):67–81

    Article  Google Scholar 

  46. Wang Z, Ong Y-S, Ishibuchi H (2018) On scalable multiobjective test problems with hardly dominated boundaries. IEEE Trans Evol Comput 23(2):217–231

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China under Grant 62072348 and China Yunnan province major science and technology special plan project No. 202202AF080004. The numerical calculations in this paper have been done on the supercomputing system in the Supercomputing Center of Wuhan University.

Author information

Authors and Affiliations

  1. School of Computer Science, Wuhan University, Wuhan, 430072, China

    Xiaoxin Gao, Fazhi He, Jinkun Luo & Tongzhen Si

Authors
  1. Xiaoxin Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fazhi He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jinkun Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tongzhen Si
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fazhi He.

Ethics declarations

Conflict of interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gao, X., He, F., Luo, J. et al. A decomposition-based many-objective evolutionary algorithm with weight grouping and adaptive adjustment. Memetic Comp. 16, 91–113 (2024). https://doi.org/10.1007/s12293-023-00401-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-023-00401-3

Keywords

Search

Navigation