Evidence map›Paper›PMID 40989287›Full record

ArticlePeerJ. Computer science2025

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

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

Abstract read
In one paragraph

Article in PeerJ. Computer science, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers.

0numbers the graph read from it
0cells of the map it votes in
9citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

9 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

8 authors.

Rihab LakbichiDepartment of Computer Science and Information Technology, University of Kasdi Merbah, Laboratory of Artificial Intelligence and Information Technology, Ouargla, Algeria.
Farouq ZitouniDepartment of Computer Science and Information Technology, University of Kasdi Merbah, Laboratory of Artificial Intelligence and Information Technology, Ouargla, Algeria.ORCID 0000-0003-2566-1457
Saad HarousDepartment of Computer Science, College of Computing and Informatics, Sharjah, United Arab Emirates.ORCID 0000-0001-6524-7352
Aridj FerhatDepartment of Computer Science and Information Technology, University of Kasdi Merbah, Laboratory of Artificial Intelligence and Information Technology, Ouargla, Algeria.
Abdelhadi LimaneDepartment of Computer Science and Information Technology, University of Kasdi Merbah, Laboratory of Artificial Intelligence and Information Technology, Ouargla, Algeria.ORCID 0009-0000-5314-0291
Abdulaziz S AlmazyadKing Saud University, Department of Computer Engineering, College of Computer and Information Sciences, Riyadh, Saudi Arabia.ORCID 0000-0003-4440-6208
Guojiang XiongCollege of Electrical Engineering, Guizhou Key Laboratory of Intelligent Technology in Power System, Guiyang, China.
Ali Wagdy MohamedFaculty of Graduate Studies for Statistical Research, Operations Research Department, Giza, Egypt.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

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.

Indexed as

Metaheuristic algorithmsOBL variantsOpposition-based learningOptimization

Identifiers

PMID40989287
PMCPMC12453659

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.