Skip to main content

Advertisement

SpringerLink
Log in

Mathematical foundation, discussion and suggestion on penalty parameter setting of penalty-based boundary intersection method for many-objective optimization problems

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Decomposition based method is a promising algorithmic framework for solving multi-objective optimization problems (MOPs). The target MOP is decomposed into a set of single-objective problems by using a scalarizing function with evenly specified weight vectors. Among the available scalarizing functions, penalty-based boundary intersection (PBI) with a proper penalty parameter is known to perform well. However, how to specify a penalty parameter θ that applies to an arbitrary Pareto front (PF) shape is not clear, let alone the theoretical basis behind the parameter setting. To the best of our knowledge, the theoretical basis has never been researched. The θ specification is basically a contour-setting problem. For a MOP with an unknown PF shape, one reliable practice is setting the contour on the border of the control area. To this end, a computational formulation of θ, which is determined by the angle between a given weight vector and the contour starting from this vector is deduced firstly. It provides a baseline (lower bound) of θ value and is a unified contour setting method applicable to various problems. Then, some fine-tuning methods are introduced for MOPs with a PF area that is hard to approach. Finally, a simple and classic minimal-PBI-function-first selection based genetic algorithm is used to illustrate the effectiveness of the proposed θ calculation. In the same algorithm frame, the performance of several representative θ setting methods are checked too. Their performances are compared on several test problems with different representative difficulties. The results show that the proposed θ setting can simultaneously ensure diversity and convergence.

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
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Algorithm A:
Algorithm 1:
Algorithm 2:
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

Data availability

The datasets supporting the conclusions of this article are included within the articles.

Notes

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

References

  1. Xiang Y, Zhou Y, Li M, Chen Z (2016) A Vector Angle based Evolutionary Algorithm for Unconstrained Many-Objective Optimization. IEEE Trans Evol Comput 21(1):131–152. https://doi.org/10.1109/TEVC.2016.2587808

    Article  Google Scholar 

  2. 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 Trans Evol Comput 18(4):577–601. https://doi.org/10.1109/TEVC.2013.2281535

    Article  Google Scholar 

  3. Yang S, Li M, Liu X, Zheng J (2013) A Grid-Based Evolutionary Algorithm for Many-Objective Optimization. IEEE Trans Evol Comput 17(5):16

    Article  Google Scholar 

  4. Li M, Yang S, Liu X (2014) Shift-Based Density Estimation for Pareto-Based Algorithms in Many-Objective Optimization. IEEE Trans Evol Comput 18(3):348–365. https://doi.org/10.1109/TEVC.2013.2262178

    Article  Google Scholar 

  5. He Z, Yen GG (2016) Visualization and Performance Metric in Many-Objective Optimization. IEEE Trans Evol Comput 20(3):386–402. https://doi.org/10.1109/TEVC.2015.2472283

    Article  Google Scholar 

  6. Yuan Y, Xu H, Wang B, Yao X (2016) A New Dominance Relation-Based Evolutionary Algorithm for Many-Objective Optimization. IEEE Trans Evol Comput 20(1):16–37. https://doi.org/10.1109/TEVC.2015.2420112

    Article  Google Scholar 

  7. Yuan Y, Xu H, Wang B, Zhang B, Yao X (2016) Balancing Convergence and Diversity in Decomposition-Based Many-Objective Optimizers. IEEE Trans Evol Comput 20(2):180–198. https://doi.org/10.1109/TEVC.2015.2443001

    Article  Google Scholar 

  8. Zhu C, Xu L, Goodman ED (2016) Generalization of Pareto-Optimality for Many-Objective Evolutionary Optimization. IEEE Trans Evol Comput 20(2):299–315. https://doi.org/10.1109/TEVC.2015.2457245

    Article  Google Scholar 

  9. Elarbi M, Bechikh S, Gupta A, Said LB, Ong Y-S (2017) A New Decomposition-Based NSGA-II for Many-Objective Optimization. IEEE Trans Syst Man Cybern Syst 48:1191–1210

    Article  Google Scholar 

  10. Santos T, Takahashi RHC (2017) On the performance degradation of dominance-based evolutionary algorithms in many-objective optimization. IEEE Trans Evol Comput 99:13

    Google Scholar 

  11. Miettinen K (1999) Nonlinear Multiobjective Optimization. Kluwer, Boston

    MATH  Google Scholar 

  12. Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength pareto evolutionary algorithm. Swiss Federal Institute of Technology (ETH) Zurich, ETH Zentrum, Gloriastrasse 35, CH-8092 Zurich, Switzerland, vol. 103

  13. 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. https://doi.org/10.1109/4235.996017

    Article  Google Scholar 

  14. Zhang Q, Liu W, Li H (2009) The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances. In: IEEE Congr. Evol. Comput, Trondheim, Norway, pp. 203–208

  15. Zhang Q, Li H (2007) MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition. IEEE Trans Evol Comput 11(6):19

    Google Scholar 

  16. Wang L, Zhang Q, Zhou A, Gong M, Jiao L (2016) Constrained Subproblems in a Decomposition-Based Multiobjective Evolutionary Algorithm. IEEE Trans Evol Comput 20(3):475–480. https://doi.org/10.1109/TEVC.2015.2457616

    Article  Google Scholar 

  17. Li K, Deb K, Zhang Q, Kwong S (2015) An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and Decomposition. IEEE Trans Evol Comput 19(5):694–716. https://doi.org/10.1109/TEVC.2014.2373386

    Article  Google Scholar 

  18. Pang LM, Ishibuchi H, Shang K (2022) Use of Two Penalty Values in Multiobjective Evolutionary Algorithm Based on Decomposition. IEEE Trans Cybern, Article; Early Access.https://doi.org/10.1109/tcyb.2022.3182167

  19. Yang S, Jiang S, Jiang Y (2017) Improving the multiobjective evolutionary algorithm based on decomposition with new penalty schemes. Soft Comput 21(16):4677–4691. https://doi.org/10.1007/s00500-016-2076-3

    Article  Google Scholar 

  20. Qiao J, Zhou H, Yang C, Yang S (2019) A decomposition-based multiobjective evolutionary algorithm with angle-based adaptive penalty. Appl Soft Comput 74:190–205. https://doi.org/10.1016/j.asoc.2018.10.028

    Article  Google Scholar 

  21. Wei Z, Yang J, Hu Z, Sun H (2021) An adaptive decomposition evolutionary algorithm based on environmental information for many-objective optimization. Isa Trans 111:108–120. https://doi.org/10.1016/j.isatra.2020.10.065

    Article  Google Scholar 

  22. 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. https://doi.org/10.1016/j.ins.2019.03.062

    Article  MathSciNet  MATH  Google Scholar 

  23. Qi Y, Liu D, Li X, Lei J, Xu X, Miao Q (2020) An adaptive penalty-based boundary intersection method for many-objective optimization problem. Inf Sci 509:356–375. https://doi.org/10.1016/j.ins.2019.03.040

    Article  MathSciNet  MATH  Google Scholar 

  24. Chen L, Deb K, Liu HL, Zhang Q (2021) Effect of Objective Normalization and Penalty Parameter on Penalty Boundary Intersection Decomposition-Based Evolutionary Many-Objective Optimization Algorithms. Evol Comput 29(1):157–186. https://doi.org/10.1162/evco_a_00276

    Article  Google Scholar 

  25. Trivedi A, Srinivasan D, Sanyal K, Ghosh A (2017) A Survey of Multiobjective Evolutionary Algorithms Based on Decomposition. IEEE Trans Evol Comput 21(3):440–462. https://doi.org/10.1109/TEVC.2016.2608507

    Article  Google Scholar 

  26. Deb K, Thiele L, Laumanns M, Zitzler E (2002) DTLZ-Scalable multi-objective optimization test problems. In: Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on, 12–17 May 2002, vol. 1, pp. 825–830, https://doi.org/10.1109/CEC.2002.1007032

  27. 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. https://doi.org/10.1109/TEVC.2005.861417

    Article  MATH  Google Scholar 

  28. Li H, Deb K, Zhang Q, Suganthan PN, Chen L (2019) Comparison between MOEA/D and NSGA-III on a set of novel many and multi-objective benchmark problems with challenging difficulties. Swarm Evol Comput 46:104–117. https://doi.org/10.1016/j.swevo.2019.02.003

    Article  Google Scholar 

  29. Zitzler E, Deb K, Thiele L (2000) ZDT-Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evol Comput 8(2):173–195. https://doi.org/10.1162/106365600568202

    Article  Google Scholar 

  30. Das I, Dennis JE (1998) Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8(3):27

    Article  MathSciNet  MATH  Google Scholar 

  31. Jain H, Deb K (2014) 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. https://doi.org/10.1109/TEVC.2013.2281534

    Article  Google Scholar 

  32. Huband S, Barone L, While L, Hingston P (2005) A scalable multi-objective test problem toolkit. In: Coello Coello CA, Hernández Aguirre A, Zitzler E (eds) Evolutionary multi-criterion optimization. EMO 2005. Lecture Notes in Computer Science, vol 3410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31880-4_20

  33. Zhang Q, Zhou A, Zhao S, Suganthan PN, Liu W, Tiwari S (2008) Multiobjective optimization Test Instances for the CEC 2009 Special Session and Competition. School of Computer Science and Electrical Engineering, University of Essex, School of Computer Science and Electrical Engineering, University of Essex

Download references

Funding

This research was supported in part by the National Natural Science Foundation of China under Grant No.61871100, the Fundamental Research Fund for the Central Universities of China under Grant No. ZYGX2020J012.

Author information

Authors and Affiliations

  1. School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, 610054, Sichuan, China

    Chenglin Yang & Shulin Tian

Authors
  1. Chenglin Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shulin Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Chenglin Yang contributed to the calculation of θ, programming, and manuscript writing, while Shulin Tian provided guidance for this study.

Corresponding author

Correspondence to Chenglin Yang.

Ethics declarations

Ethical and informed consent for data used

This study did not involve human or animal subjects. The data used in this paper were obtained from publicly available sources and comply with relevant laws and regulations. The references are clearly indicated.

Conflict of interests

The authors declare that they have no conflict of interest.

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

Yang, C., Tian, S. Mathematical foundation, discussion and suggestion on penalty parameter setting of penalty-based boundary intersection method for many-objective optimization problems. Appl Intell 53, 21660–21675 (2023). https://doi.org/10.1007/s10489-023-04717-y

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-023-04717-y

Keywords

Search

Navigation