Teaching-learning-based optimization algorithm with dynamic neighborhood and crossover search mechanism for numerical optimization

This paper presents an improving teaching-learning-based optimization algorithm (called DRCMTLBO) combined with the dynamic ring neighborhood topology. Firstly, based on the individuals’ fitness distribution and clustered state within and beyond the ring neighborhood, two evaluations of relative nei...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied soft computing Ročník 154; s. 111332
Hlavní autoři: Zeng, Zhibo, Dong, He, Xu, Yunlang, Zhang, Wei, Yu, Hangcheng, Li, Xiaoping
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.03.2024
Témata:
ISSN:1568-4946, 1872-9681
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents an improving teaching-learning-based optimization algorithm (called DRCMTLBO) combined with the dynamic ring neighborhood topology. Firstly, based on the individuals’ fitness distribution and clustered state within and beyond the ring neighborhood, two evaluations of relative neighborhood quality (RNQ) are developed to separately guide population evolution. On the one hand, a dynamic neighborhood strategy driven by fitness-based evaluation is used to adjust neighborhood radius, maintaining individual variability and neighborhood diversity. On the other hand, to utilize individuals’ information of the entire topology, a novel crossover search mechanism driven by Euclidean distance-based evaluation is used to expand the search space, determining whether individuals should enhance exploitation within the neighborhood or exploration beyond the neighborhood. Finally, the above strategies are embedded into the TLBO algorithm, assisted by improved search approaches that achieve a significant balance between exploitation and exploration. Numerical computation results on functions of CEC2014 and CEC2020 show that our proposed DRCMTLBO algorithm outperforms other ten typical algorithms significantly, and its computational performance can compete with several CEC winner algorithms. •Proposing two relative neighborhood quality evaluations for expanding information.•Designing a dynamic neighborhood strategy adapted to the search tendency.•A novel crossover mechanism enhances the exploration of opposite neighborhoods.•Validating the DRCMTLBO algorithm on CEC2014 and CEC2020.
ISSN:1568-4946
1872-9681
DOI:10.1016/j.asoc.2024.111332