Skip to main content

An Improved MOEA/D with Pareto Frontier Individual Selection Based on Weight Vector Angles

  • Conference paper
  • First Online:
Bio-Inspired Computing: Theories and Applications (BIC-TA 2023)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 2061))

  • 26 Accesses

Abstract

In this paper, we introduce an improved MOEA/D with pareto frontier individual selection based on weight vector angles (WVA-MOEA/D). This method specifically addresses premature convergence issues observed in MOEA/D when tackling high-dimensional multi-objective optimization challenges. The principal aim is to bolster the algorithm’s diversity throughout its convergence journey. In this method, each weight vector is steered to select a Pareto front individual that minimizes the angle formed between the weight vector and the vector originating from the ideal point directed towards the individual. For these highlighted individuals, the replacement protocol of MOEA/D’s aggregation function is only applied if a novel individual can supersede all its marked attributes comprehensively. The strategy leverages the orthogonal distance between the solution and the weight vector in the objective space, ensuring the preservation of desired diversity across the evolutionary trajectory. Such an adaptation strikes a more refined balance between convergence and diversity, especially in the realm of high-dimensional multi-objective optimization. Experimental validations suggest that our proposed algorithm consistently surpasses traditional techniques in harmonizing convergence with diversity and remains highly competitive against other prevailing algorithms in addressing many-objective optimization quandaries.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cheng, R., Li, M., Tian, Y., et al.: A benchmark test suite for evolutionary many-objective optimization. Complex Intell. Syst. 3(1), 67–81 (2017)

    Article  MathSciNet  Google Scholar 

  2. Coello, C.A.C., Lamont, G.B., Veldhuizen, D.A.V.: Evolutionary Algorithms for Solving Multi-objective Problems. Springer, New York (2007). https://doi.org/10.1007/978-0-387-36797-2

    Book  Google Scholar 

  3. Cohon, J.L.: Multi-objective Programming and Planning. Courier Corporation (2013)

    Google Scholar 

  4. Ishibuchi, H., Setoguchi, Y., Masuda, H., et al.: Performance of decomposition-based many-objective algorithms strongly depends on pareto front shapes. IEEE Trans. Evol. Comput. 21(2), 169–190 (2017)

    Article  Google Scholar 

  5. Jiang, S., Yang, S.: A strength pareto evolutionary algorithm based on reference direction for multiobjective and many-objective optimization. IEEE Trans. Evol. Comput. 21(3), 329–346 (2017)

    Article  Google Scholar 

  6. Koski, J.: Multicriterion optimization in structural design. Technical report, DTIC Document (1981)

    Google Scholar 

  7. Li, H., Zhang, Q.: Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGA-II. IEEE Trans. Evol. Comput. 13(2), 284–302 (2009)

    Article  Google Scholar 

  8. Lin, J., He, C., Cheng, R.: Adaptive dropout for high-dimensional expensive multiobjective optimization. Complex Intell. Syst. 8(1), 271–285 (2022)

    Article  Google Scholar 

  9. Liu, H.L., Gu, F., Zhang, Q.: Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Trans. Evol. Comput. 18(3), 450–455 (2014)

    Article  Google Scholar 

  10. Osyczka, A.: An approach to multicriterion optimization problems for engineering design. Comput. Methods Appl. Mech. Eng. 15(3), 309–333 (1978)

    Article  Google Scholar 

  11. Steuer, R.E.: Multiple Criteria Optimization: Theory, Computation, and Application. Krieger Pub. Co. (1989)

    Google Scholar 

  12. Yuan, Y., Xu, H., Wang, B., et al.: Balancing convergence and diversity in decomposition-based many-objective optimizers. IEEE Trans. Evol. Comput. 20(2), 180–198 (2016)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported by the Open Research Project of the Hubei Key Laboratory of Intelligent Geo-Information Processing (Grant No. KLIGIP-2021B04).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qiwei Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, Q., Guan, J. (2024). An Improved MOEA/D with Pareto Frontier Individual Selection Based on Weight Vector Angles. In: Pan, L., Wang, Y., Lin, J. (eds) Bio-Inspired Computing: Theories and Applications. BIC-TA 2023. Communications in Computer and Information Science, vol 2061. Springer, Singapore. https://doi.org/10.1007/978-981-97-2272-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-981-97-2272-3_9

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-97-2271-6

  • Online ISBN: 978-981-97-2272-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics