Skip to content
Review Open access

Mutual operator patterns in metaheuristics: A review of classical numerical optimization problems

Oct 2026 · Open Academic Journal of Advanced Science and Technology · 0 citations · 25 references

TL;DR

This paper reviews common patterns of operator cooperation in metaheuristics used for the classical problem of numerical optimization and proposes operator-oriented taxonomy and analysis of the ways in which operator cooperation depends on the properties of the landscape.

Abstract

Operator landscapes form an essential tool for evaluating the performance, stability, and convergence ability of metaheuristic algorithms in the face of modality, separability, dimensionality, ruggedness, and landscape deception. For this reason, state-of-the-art hybrid metaheuristics are more often than not built based on the use of several search operators. Despite a growing number of scientific works devoted to various aspects of hybrid optimization, there remains a lack of information about the mutual patterns of operator cooperation that have helped achieve optimization results. To address this gap, this paper reviews common patterns of operator cooperation in metaheuristics used for the classical problem of numerical optimization. First, recurring patterns of operator cooperation in the context of numerical optimization problems, which involve both unimodal, multimodal, rotated, shifted, hybrid, composition, and high-dimensional benchmarks, are discussed. Second, common operator types used in modern optimization algorithms are introduced. Lastly, common patterns of operator cooperation involving combinations of operators used for exploration and exploitation of the optimization landscape, diversification and perturbation of solutions, chaos-based search, Lévy-flight diversification, memetic search, operators' adaptation to the current optimization landscape, and simultaneous multi-population optimization are discussed. In particular, operator-oriented taxonomy and analysis of the ways in which operator cooperation depends on the properties of the landscape are proposed. Key areas of further research include operator compatibility, scalability, reproducibility, explainability, and operator autonomy. New trends in the field consist of adaptable operator ecosystems, reinforcement learning-assisted optimization, modular structure of hybrid algorithms, and self-evolution. In conclusion, the significance of operator cooperation in achieving good optimization results is highlighted.

Read PDF

Similar papers

Review Open access Oct 2026

The Evolution of Metaheuristic Optimization Algorithms: Structures, Inspirations, and Research Trends

This systematic review presents a comprehensive analysis of metaheuristic optimization algorithms based on 515 distinct metaheuristic optimization algorithms and analyzes the historical evolution, inspiration diversity, search structures, symmetry-oriented search balance, and development trends of modern metaheuristics...

Ebubekir Kaya, Harun Akbulut, Ceren Baştemur Kaya et al. · 0 citations
Review Open access Sep 2026

A Systematic Review of Stopping Criteria in Metaheuristic Optimization Algorithms

This paper proposes a taxonomy of stopping criteria based on the aspect of the metaheuristic search process used to trigger algorithm termination, covering resource-based, objective-progress-based, population-state-based, convergence-indicator-based, statistical, algorithm-specific, and hybrid approaches.

Kata Egres, Sándor Szénási · 0 citations
Conference

Enhancing Community Detection: A Comparative Study of Metaheuristic Optimization Techniques

This paper compares the performance of Genetic Algorithms, Particle Swarm Optimization, and Tabu Search in solving the MMDM problem against the previously proposed Density Ratio (DR) Heuristic, a method designed to handle larger datasets where exact solutions are computationally prohibitive.

S. Gamal · 0 citations
Open access 2026

Development of a Chaotic Tent Map-Based Pelican Optimization Algorithm for Hyperparameter Optimization

Metaheuristic optimisation algorithms have received a lot of attention due to their ability to solve complicated optimisation problems without using any gradient information. However, the performance of these algorithms may be affected by insufficient exploration, premature convergence and getting stuck in local optima...

Ayeni J. A., I. W., Olanrewaju S. S. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.