EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Opposition-based learning techniques in metaheuristics: classification, comparison, and convergence analysis

Rihab Lakbichi, Farouq Zitouni iD, Saad Harous iD, Aridj Ferhat, Abdelhadi Limane iD, Abdulaziz S Almazyad iD, Guojiang Xiong, Ali Wagdy Mohamed

PeerJ Computer Science · 15.07.2025 · 11 · e2935

DOI: 10.7717/peerj-cs.2935 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PeerJ Computer Science, online erschienen am 15.07.2025. Verfasst von Rihab Lakbichi und 7 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer Science and Information Technology, University of Kasdi Merbah, Laboratory of Artificial Intelligence and Information Technolo…. Die Arbeit wurde bisher 18-mal zitiert (Crossref) und nennt 139 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In recent years, opposition-based learning (OBL) has emerged as a powerful enhancement strategy in metaheuristic algorithms (MAs), gaining significant attention for its potential to accelerate convergence and improve solution quality. Existing research lacks a structured analysis of how different OBL variants influence optimization performance when integrated into various MAs. This study categorizes and analyzes nine distinct OBL techniques: basic opposition-based learning, quasi-opposition-based learning, generalized opposition-based learning, current optimum opposition-based learning, quasi-reflection opposition-based learning, centroid opposition-based learning, random opposition-based learning, super opposition-based learning, and stochastic opposition-based learning. To systematically assess the effectiveness of these techniques, five widely used OBL variants—basic opposition-based learning, quasi-opposition-based learning, generalized opposition-based learning, current optimum opposition-based learning, quasi-reflection opposition-based learning—were selected for implementation within five well-established MAs: differential evolution, genetic algorithm, particle swarm optimization, artificial bee colony, and harmony search. These hybridized algorithms were evaluated across different integration phases, including the initialization passes and generation updates phase, and in both phases. To experimentally demonstrate the capability of OBL strategies to enhance MAs that face common issues such as slow convergence, limited exploration, and imbalanced exploration-exploitation, we have used 12 benchmark functions from CEC2022 suite. Key performance metrics—including maximum, minimum, mean, standard deviation, and convergence curves—were rigorously analyzed to quantify the improvements introduced by each OBL-enhanced MA. Additionally, a Friedman test was conducted to statistically validate the performance differences among the variants. The results indicate that quasi-reflection opposition-based learning consistently outperforms other OBL variants, demonstrating superior convergence speed and solution quality across most benchmark functions.

Schlagwörter

Stichwörter der Autor:innen

Metaheuristic algorithmsOBL variantsOpposition-based learningOptimization

Autor:innen und Institutionen

  • Department of Computer Science and Information Technology, University of Kasdi Merbah, Laboratory of Artificial Intelligence and Information Technology, Ouargla, Algeria.
  • Department of Computer Science, College of Computing and Informatics, Sharjah, United Arab Emirates.
  • King Saud University, Department of Computer Engineering, College of Computer and Information Sciences, Riyadh, Saudi Arabia.
  • College of Electrical Engineering, Guizhou Key Laboratory of Intelligent Technology in Power System, Guiyang, China.
  • Faculty of Graduate Studies for Statistical Research, Operations Research Department, Giza, Egypt.
  • Applied Science Private University, Applied Science Research Center, Amman, Jordan.

ORCID-Profile: Farouq Zitouni, Saad Harous, Abdelhadi Limane, Abdulaziz S Almazyad

Zitieren

APA

Lakbichi, R., Zitouni, F., Harous, S., Ferhat, A., Limane, A., Almazyad, A. S., Xiong, G., & Mohamed, A. W. (2025). Opposition-based learning techniques in metaheuristics: classification, comparison, and convergence analysis. PeerJ Computer Science, 11, e2935. https://doi.org/10.7717/peerj-cs.2935

Vancouver

Lakbichi R, Zitouni F, Harous S, Ferhat A, Limane A, Almazyad AS, et al. Opposition-based learning techniques in metaheuristics: classification, comparison, and convergence analysis. PeerJ Computer Science. 2025;11:e2935. doi:10.7717/peerj-cs.2935

BibTeX
@article{Lakbichi2025,
  author = {Lakbichi, Rihab and Zitouni, Farouq and Harous, Saad and Ferhat, Aridj and Limane, Abdelhadi and Almazyad, Abdulaziz S and Xiong, Guojiang and Mohamed, Ali Wagdy},
  title = {Opposition-based learning techniques in metaheuristics: classification, comparison, and convergence analysis},
  journal = {PeerJ Computer Science},
  year = {2025},
  volume = {11},
  pages = {e2935},
  doi = {10.7717/peerj-cs.2935}
}
Kostenlos starten →