Skip to main content
Log in

Expensive many-objective evolutionary optimization guided by two individual infill criteria

  • Regular Research Paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

Recently, surrogate-assisted multi-objective evolutionary algorithms have achieved much attention for solving computationally expensive multi-/many-objective optimization problems. An effective infill sampling strategy is critical in surrogate-assisted multi-objective evolutionary optimization to assist evolutionary algorithms in identifying the optimal non-dominated solutions. This paper proposes a Kriging-assisted many-objective optimization algorithm guided by two infill sampling criteria to self-adaptively select two new solutions for expensive objective function evaluations to improve history models. The first uncertainty-based criterion selects the solution for expensive function evaluations with the maximum approximation uncertainty to improve the chance of discovering the optimal region. The approximation uncertainty of a solution is the weighted sum of approximation uncertainties on all objectives. The other indicator-based criterion selects the solution with the best indicator value to accelerate exploiting the non-dominated optimal solutions. The indicator of an individual is defined by the convergence-based and crowding-based distances in the objective space. Finally, two multi-objective test suites, DTLZ and MaF, and three real-world applications are applied to test the performance of the proposed method and four compared classical surrogate-assisted multi-objective evolutionary algorithms. The results show that the proposed algorithm is more competitive on most optimization problems.

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
Algorithm 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. He C, Cheng R, Jin Y, Yao X (2019) Surrogate-assisted expensive many-objective optimization by model fusion. In: 2019 IEEE congress on evolutionary computation (CEC), pp 1672–1679

  2. Cheng R, Jin Y, Olhofer M, Sendhoff B (2016) A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 20(5):773–791

    Article  Google Scholar 

  3. Qin S, Sun C, Jin Y, Tan Y, Fieldsend J (2021) Large-scale evolutionary multiobjective optimization assisted by directed sampling. IEEE Trans Evol Comput 25(4):724–738

    Article  Google Scholar 

  4. Yang S, Li M, Liu X, Zheng J (2013) A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 17(5):721–736

    Article  Google Scholar 

  5. Zhang X, Tian Y, Jin Y (2015) A knee point-driven evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 19(6):761–776

    Article  Google Scholar 

  6. 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 

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

    Article  Google Scholar 

  8. Qin S, Sun C, Zhang G, He X, Tan Y (2020) A modified particle swarm optimization based on decomposition with different ideal points for many-objective optimization problems. Complex Intell Syst 6:263–274

    Article  Google Scholar 

  9. Bader J, Zitzler E (2011) HypE: an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45–76

    Article  PubMed  Google Scholar 

  10. Gómez RH, Coello CAC (2013) MOMBI: a new metaheuristic for many-objective optimization based on the R2 indicator. In: 2013 IEEE congress on evolutionary computation, pp 2488–2495

  11. Tian Y, Cheng R, Zhang X, Cheng F, Jin Y (2017) An indicator-based multiobjective evolutionary algorithm with reference point adaptation for better versatility. IEEE Trans Evol Comput 22(4):609–622

    Article  Google Scholar 

  12. Li M, Yang S, Liu X (2015) Bi-goal evolution for many-objective optimization problems. Artif Intell 228:45–65

    Article  MathSciNet  Google Scholar 

  13. 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

    Article  Google Scholar 

  14. Hamza K, Shalaby M (2014) A framework for parallelized efficient global optimization with application to vehicle crashworthiness optimization. Eng Optim 46(9):1200–1221

    Article  Google Scholar 

  15. Wang H, Jin Y, Doherty J (2017) Committee-based active learning for surrogate-assisted particle swarm optimization of expensive problems. IEEE Trans Cybern 47(9):2664–2677

  16. Guo D, Chai T, Ding J, Jin Y (2016) Small data driven evolutionary multi-objective optimization of fused magnesium furnaces. In: 2016 IEEE symposium series on computational intelligence (SSCI). IEEE, pp 1–8

  17. Qin S, Sun C, Jin Y, Zhang G (2019) Bayesian approaches to surrogate-assisted evolutionary multi-objective optimization: a comparative study. In: 2019 IEEE symposium series on computational intelligence (SSCI), pp 2074–2080

  18. Chugh T, Jin Y, Miettinen K, Hakanen J, Sindhya K (2016) A surrogate-assisted reference vector guided evolutionary algorithm for computationally expensive many-objective optimization. IEEE Trans Evol Comput 22(1):129–142

    Article  Google Scholar 

  19. Guo D, Jin Y, Ding J, Chai T (2018) Heterogeneous ensemble-based infill criterion for evolutionary multiobjective optimization of expensive problems. IEEE Trans Cybern 49(3):1012–1025

    Article  PubMed  Google Scholar 

  20. Pan L, He C, Tian Y, Wang H, Zhang X, Jin Y (2018) A classification-based surrogate-assisted evolutionary algorithm for expensive many-objective optimization. IEEE Trans Evol Comput 23(1):74–88

    Article  Google Scholar 

  21. Habib A, Singh HK, Chugh T, Ray T, Miettinen K (2019) A multiple surrogate assisted decomposition-based evolutionary algorithm for expensive multi/many-objective optimization. IEEE Trans Evol Comput 23(6):1000–1014

    Article  Google Scholar 

  22. Knowles J (2006) ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems. IEEE Trans Evol Comput 10(1):50–66

    Article  Google Scholar 

  23. Zhan D, Cheng Y, Liu J (2017) Expected improvement matrix-based infill criteria for expensive multiobjective optimization. IEEE Trans Evol Comput 21(6):956–975

    Article  Google Scholar 

  24. Emmerich M, Naujoks B (2004) Metamodel assisted multiobjective optimisation strategies and their application, pp 249–260

  25. Zhang Q, Liu W, Tsang E, Virginas B (2010) Expensive multiobjective optimization by MOEA/D with Gaussian process model. IEEE Trans Evol Comput 14(3):456–474

    Article  Google Scholar 

  26. Qin S, Sun C, Liu Q, Jin Y (2023) A performance indicator-based infill criterion for expensive multi-/many-objective optimization. IEEE Trans Evol Comput 27(4):1085–1099

    Article  Google Scholar 

  27. Wang X, Jin Y, Schmitt S, Olhofer M (2020) An adaptive Bayesian approach to surrogate-assisted evolutionary multi-objective optimization. Inf Sci 519:317–331

    Article  MathSciNet  Google Scholar 

  28. Song Z, Wang H, He C, Jin Y (2021) A Kriging-assisted two-archive evolutionary algorithm for expensive many-objective optimization. IEEE Trans Evol Comput 25(6):1013–1027

    Article  Google Scholar 

  29. Lu X-F, Tang K (2012) Classification and regression-assisted differential evolution for computationally expensive problems. J Comput Sci Technol 27(5):1024–1034

    Article  MathSciNet  Google Scholar 

  30. 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:179–191

    Article  Google Scholar 

  31. Deb K, Thiele L, Laumanns M, Zitzler E (2002) Scalable multi-objective optimization test problems. IEEE congress on evolutionary computation 1:825–830

    Google Scholar 

  32. 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 

  33. He C, Tian Y, Wang H, Jin Y (2020) A repository of real-world datasets for data-driven evolutionary multiobjective optimization. Complex Intell Syst 6(1):189–197

    Article  Google Scholar 

  34. Bosman PA, Thierens D (2003) The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):174–188

  35. 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 

  36. Lin Q, Wu X, Ma L, Li J, Gong M, Coello CAC (2022) An ensemble surrogate-based framework for expensive multiobjective evolutionary optimization. IEEE Trans Evol Comput 26(4):631–645

Download references

Acknowledgements

This work was supported in part by National Natural Science Foundation of China (Grant No. 62303344, 62372319), Shanxi Provincial Key Research and Development Project (Grant No. 202102020101002), Shanxi Provincial Youth Science Research Project (Grant No. 202203021222196), Scientific Research Fund for Introducing Outstanding Doctorate in Shanxi Province (Grant No. 20232052), Ph.D. Research Start-up Fund (Grant No. 20222053), Science and Technology Innovation Program of Colleges and Universities in Shanxi Province (Grant No. 288).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chaoli Sun.

Ethics declarations

Conflict of interest

We wish to confirm that there are no known conflicts of interest associated with this publication and there has been no significant financial support for this work that could have influenced its outcome.

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

Qin, S., Sun, C., Akhtar, F. et al. Expensive many-objective evolutionary optimization guided by two individual infill criteria. Memetic Comp. 16, 55–69 (2024). https://doi.org/10.1007/s12293-023-00404-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-023-00404-0

Keywords

Navigation