Tackling Blind Spot Challenges in Metaheuristics Algorithms Through Exploration and Exploitation

Matej Črepinšek, Miha Ravber, Luka Mernik and Marjan Mernik ()
Additional contact information
Matej Črepinšek: Faculty of Electrical Engineering and Computer Science, University of Maribor, Koroška cesta 46, 2000 Maribor, Slovenia
Miha Ravber: Faculty of Electrical Engineering and Computer Science, University of Maribor, Koroška cesta 46, 2000 Maribor, Slovenia
Luka Mernik: Department of Applied Mathematics, Florida Polytechnic University, 4700 Research Way, Lakeland, FL 33805, USA
Marjan Mernik: Faculty of Electrical Engineering and Computer Science, University of Maribor, Koroška cesta 46, 2000 Maribor, Slovenia

Mathematics, 2025, vol. 13, issue 10, 1-51

Abstract: This paper defines blind spots in continuous optimization problems as global optima that are inherently difficult to locate due to deceptive, misleading, or barren regions in the fitness landscape. Such regions can mislead the search process, trap metaheuristic algorithms (MAs) in local optima, or hide global optima in isolated regions, making effective exploration particularly challenging. To address the issue of premature convergence caused by blind spots, we propose LTMA+ (Long-Term Memory Assistance Plus), a novel meta-approach that enhances the search capabilities of MAs. LTMA+ extends the original Long-Term Memory Assistance (LTMA) by introducing strategies for handling duplicate evaluations, shifting the search away from over-exploited regions and dynamically toward unexplored areas and thereby improving global search efficiency and robustness. We introduce the Blind Spot benchmark, a specialized test suite designed to expose weaknesses in exploration by embedding global optima within deceptive fitness landscapes. To validate LTMA+, we benchmark it against a diverse set of MAs selected from the EARS framework, chosen for their different exploration mechanisms and relevance to continuous optimization problems. The tested MAs include ABC, LSHADE, jDElscop, and the more recent GAOA and MRFO. The experimental results show that LTMA+ improves the success rates for all the tested MAs on the Blind Spot benchmark statistically significantly, enhances solution accuracy, and accelerates convergence to the global optima compared to standard MAs with and without LTMA. Furthermore, evaluations on standard benchmarks without blind spots, such as CEC’15 and the soil model problem, confirm that LTMA+ maintains strong optimization performance without introducing significant computational overhead.

Keywords: optimization; metaheuristics algorithm; algorithmic performance; duplicate solutions; non-revisited solutions; LTMA; blind spots (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/10/1580/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/10/1580/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:10:p:1580-:d:1653330

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().