Skip to main content
Log in

Evolutionary many-objective optimization algorithm based on angle and clustering

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

In evolutionary multi-objective optimization, maintaining a well balance of convergence and diversity is particularly important for the performance of evolutionary algorithms. Considering the convergence and diversity at the same time, a many-objective optimization algorithm combining angle-based selection strategy and clustering strategy is proposed. In the former strategy, the whole population is divided into several partitions to ensure the diversity of the population, and superior individuals are selected to ensure the convergence of the population. The latter strategy, the individual vector angle is used to reflect the similarity and the individuals are divided into some clusters, which helps to describe the population distribution. The performance of this algorithm is compared with five state-of-the-art evolutionary many-objective optimization algorithms on a variety of benchmark test problems with 5, 10 and 15 objectives. The results suggest that the algorithm can slightly better competitive 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

References

  1. Abualigah L (2019) Feature selection and enhanced krill herd algorithm for text document clustering. Springer, Berlin. https://doi.org/10.1007/978-3-030-10674-4

    Book  Google Scholar 

  2. Abualigah L (2020) Multi-verse optimizer algorithm: a comprehensive survey of its results, variants, and applications. Neural Computing and Applications, https://doi.org/10.1007/s00521-020-04839-1

  3. Abualigah L, Diabat A (2020) A novel hybrid antlion optimization algorithm for?multi-objective task scheduling problems in cloud computing environments. Cluster Computing, https://doi.org/10.1007/s10586-020-03075-5

  4. Abualigah L, Hanandeh E (2015) Applying genetic algorithms to information retrieval using vector space model. Int J Comput Sci Eng Appl 5:19–28. https://doi.org/10.5121/ijcsea.2015.5102

    Article  Google Scholar 

  5. Abualigah LM, Khader AT (2017) Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering. J. Supercomput. 73(11):4773–4795. https://doi.org/10.1007/s11227-017-2046-2

    Article  Google Scholar 

  6. Abualigah LM, Khader AT, Hanandeh ES (2018) A combination of objective functions and hybrid krill herd algorithm for text document clustering analysis. Eng Appl Artif Intell 73:111–125. http://www.sciencedirect.com/science/article/pii/S0952197618301180

    Article  Google Scholar 

  7. Abualigah LM, Khader AT, Hanandeh ES (2018) A combination of objective functions and hybrid krill herd algorithm for text document clustering analysis. Eng. Appl. Artif. Intel. 73:111–125. https://doi.org/10.1016/j.engappai.2018.05.003

    Article  Google Scholar 

  8. Abualigah LM, Khader AT, Hanandeh ES (2018) Hybrid clustering analysis using improved krill herd algorithm. Appl Intell 48(11):4047–4071. https://doi.org/10.1007/s10489-018-1190-6

    Article  Google Scholar 

  9. Abualigah LM, Khader AT, Hanandeh ES (2018) A new feature selection method to improve the document clustering using particle swarm optimization algorithm. J Computational Science 25:456–466. http://www.sciencedirect.com/science/article/pii/S1877750316305002

    Article  Google Scholar 

  10. Agrawal RB, Deb K, Deb K, Agrawal RB (2000) Simulated binary crossover for continuous search space. Complex Systems 9(3):115–14. https://doi.org/10.1145/2739480.2754776

    Article  MathSciNet  MATH  Google Scholar 

  11. Bader J, Zitzler E (2011) HypE: An algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45–76. https://doi.org/10.1162/EVCO_a_00009

    Article  Google Scholar 

  12. Cheng R, Jin Y, Olhofer M, Sendhoff B (2016) A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evolut Comput 20(5):773–791. https://doi.org/10.1109/TEVC.2016.2519378

    Article  Google Scholar 

  13. Corne DW, Jerram NR, Knowles JD, Oates MJ (2001) PESA-II: Region-based selection in evolutionary multiobjective optimization. In: Proceedings of the 3rd Annual Conference on Genetic and Evol Comput, Morgan Kaufmann Publishers Inc., San Francisco, California, USA, GECCO’, vol 01, pp 283–290, https://doi.org/10.1137/S1052623496307510

  14. Das I, Dennis JE (1996) Normal-boundary intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8(3):631–657. https://doi.org/10.1137/S1052623496307510

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  16. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182–197. https://doi.org/10.1109/4235.996017

    Article  Google Scholar 

  17. Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable test problems for evolutionary multiobjective optimization. Springer, London, pp 105–145. https://doi.org/10.1007/1-84628-137-7_6

  18. Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18. https://doi.org/10.1016/j.swevo.2011.02.002

    Article  Google Scholar 

  19. Gong D, Xu B, Zhang Y, Guo Y, Yang S (2020) A similarity-based cooperative co-evolutionary algorithm for dynamic interval multiobjective optimization problems. IEEE Trans Evolut Comput 24 (1):142–156. https://doi.org/10.1109/TEVC.2019.2912204

    Article  Google Scholar 

  20. Hernández Gómez R, Coello Coello CA (2015) Improved metaheuristic based on the R2 indicator for many-objective optimization. In: Proceedings of the 2015 Annual Conference on Genetic and Evol Comput, Association for Computing Machinery, New York, USA, GECCO’15, pp 679–686. https://doi.org/10.1145/2739480.2754776

  21. Hu P, Rong L, Liang-lin C, Li-xian L (2011) Multiple swarms multi-objective particle swarm optimization based on decomposition. Procedia Engineering 15:3371–3375. http://www.sciencedirect.com/science/article/pii/S1877705811021333

    Article  Google Scholar 

  22. Hu Z, Yang J, Sun H, Wei L, Zhao Z (2017) An improved multi-objective evolutionary algorithm based on environmental and history information. Neurocomputing 222:170–182. https://doi.org/10.1016/j.neucom.2016.10.014

    Article  Google Scholar 

  23. Hu Z, Wei Z, Sun H, Yang J, Wei L (2019) Optimization of metal rolling control using soft computing approaches: A review. Archives of Computational Methods in Engineering https://doi.org/10.1007/s11831-019-09380-6

  24. Hu Z, Yang J, Cui H, Wei L, Fan R (2019) MOEA3D: a moea based on dominance and decomposition with probability distribution model. Soft Comput 23(4):1219–1237. https://doi.org/10.1007/s00500-017-2840-z

    Article  Google Scholar 

  25. Hu Z, Wei Z, Ma X, Sun H, Yang J (2020) Multi-parameter deep-perception and many-objective autonomous-control of rolling schedule on high speed cold tandem mill. ISA Trans. 102:193–207. https://doi.org/10.1016/j.isatra.2020.02.024

    Article  Google Scholar 

  26. Zy H u, Jm Yang, Zw Zhao, Sun H, Hj Che (2016) Multi-objective optimization of rolling schedules on aluminum hot tandem rolling. Int J Advanced Manuf Technol 85(1):85–97. https://doi.org/10.1007/s00170-015-7909-1

    Article  Google Scholar 

  27. Huband S, Hingston P, Barone L, While L (2006) A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans Evolut Comput 10(5):477–506. https://doi.org/10.1109/TEVC.2005.861417

    Article  MATH  Google Scholar 

  28. Ishibuchi H, Doi K, Nojima Y (2017) On the effect of normalization in moea/d for multi-objective and many-objective optimization. Complex Intelligent Systems 3(4):279–294. https://doi.org/10.1007/s40747-017-0061-9

    Article  Google Scholar 

  29. Knowles JD, Corne DW (2000) Approximating the nondominated front using the pareto archived evolution strategy. Evol Comput 8(2):149–172. https://doi.org/10.1162/106365600568167

    Article  Google Scholar 

  30. Li K, Deb K, Zhang Q, Kwong S (2015) An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans Evolut Comput 19(5):694–716. https://doi.org/10.1109/TEVC.2014.2373386

    Article  Google Scholar 

  31. Liu H, Gu F, Zhang Q (2014) Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Trans Evolut Comput 18(3):450–455. https://doi.org/10.1109/TEVC.2013.2281533

    Article  Google Scholar 

  32. Liu X, Zhan Z, Gao Y, Zhang J, Kwong S, Zhang J (2019) Coevolutionary particle swarm optimization with bottleneck objective learning strategy for many-objective optimization. IEEE Trans Evolut Comput 23(4):587–602. https://doi.org/10.1109/TEVC.2018.2875430

    Article  Google Scholar 

  33. Trautmann H, Wagner T, Brockhoff D (2013) R2-EMOA: Focused multiobjective search using R2-indicator-based selection. In: Learning and intelligent optimization. Springer, Berlin, pp 70–74, https://doi.org/10.1007/978-3-642-44973-4_8, (to appear in print)

  34. Zhang Q, Li H (2007) MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evolut Comput 11(6):712–731. https://doi.org/10.1109/TEVC.2007.892759

    Article  Google Scholar 

  35. Zitzler E, Künzli S (2004) Indicator-based selection in multiobjective search. In: Parallel Problem Solving from Nature - PPSN VIII. Springer, Berlin, pp 832?-842, https://doi.org/10.1007/978-3-540-30217-9_84 , (to appear in print)

  36. Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evolut Comput 3(4):257–271. https://doi.org/10.1109/4235.797969

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by Natural Science Foundation-Steel and Iron Foundation of Hebei Province (Grant Nos. E2019105123), Department of Education of Hebei Province (Grant Nos. ZD2019311). The authors would like to thank the editor and anonymous reviewers for their helpful comments and suggestions to improve the quality of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhiwei Zhao.

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

Xiong, Z., Yang, J., Hu, Z. et al. Evolutionary many-objective optimization algorithm based on angle and clustering. Appl Intell 51, 2045–2062 (2021). https://doi.org/10.1007/s10489-020-01874-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-020-01874-2

Keywords

Navigation