Sep 2026· Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence· 3 citations· 54 references
TL;DR
A dual-population MOEA with Exploration and Exploitation Decoupled (MOEA/EED) is proposed: the exploration population uses a simple aging mechanism, while the exploitation population preserves the currently optimal solutions.
Abstract
Evolutionary Algorithms (EAs) are currently the most popular tool for solving multi-objective optimization problems. Balancing exploration and exploitation is fundamental to the performance of Multi-Objective EAs (MOEAs). Achieving this requires maintaining a set of high-quality solutions for effective exploitation while simultaneously enabling exploration of diverse regions of the search space. In MOEAs, these two roles are typically fulfilled by a single evolutionary population. However, high-quality solutions that are promising for exploitation may lack the potential to guide the search toward different regions of the search space. Conversely, solutions with high exploratory potential that can lead the search toward more promising regions may themselves be of low quality. To address this issue, this paper proposes a dual-population MOEA with Exploration and Exploitation Decoupled (MOEA/EED): the exploration population uses a simple aging mechanism, while the exploitation population preserves the currently optimal solutions. We theoretically prove the benefits of MOEA/EED, i.e., it achieves the upper bounds, O(n^(k+1) · min{1, (e ln(3e) / k)^k}) and O((5e ln(3e))^(n/5)), on the expected running time for solving two commonly studied bi-objective problems OneJumpZeroJump and bi-objective RealRoyalRoad, which are significantly better (even exponentially smaller) than that of the popular SMS-EMOA, NSGA-II, and their non-elitist variants. Lastly, we empirically show its effectiveness on a wide range of practical optimization problems.
Experimental results demonstrate that the proposed hybrid strategy effectively overcomes the individual limitations of CMA-ES and GWO, making HCG a reliable method for solving complex continuous optimization problems.
Elias Ahmad Ahmadi, Besmillah Danish, Ahmad Ramin Rahnaward· Journal of Mathematics and S...· 0 citations
Results show that integrating local search significantly enhances performance, while a principled method for setting hybrid parameters ensures robustness and reproducibility, highlighting the potential of combining mathematical programming techniques with evolutionary algorithms for high-dimensional many-objective opti...
Regina C. L. C. de Sousa, Dênis E. C. Vargas, Elizabeth F. Wanner et al.· Journal of Heuristics· 0 citations
This work proves that a widely-studied MOEA, GSEMO, using unit-step mutation can be trapped in local optimal regions and fail to identify the Pareto front, and demonstrates the extendability of the proposed benchmark to more complex landscapes with numerous local optima, resembling well-established problems in the fiel...
Yue-Tong Sun, Zeqiong Lv, Sheng-Jie Ren et al.· Proceedings of the Thirty-Fi...· 0 citations
Although population-based metaheuristic algorithms have been widely applied to the One-Dimensional Cutting Stock Problem (1D-CSP), their performance is often limited by premature convergence and insufficient local search capability. This study presents a comparative investigation of the effect of local search on four p...
Gözde Alp, Fatih Soygazi, Yılmaz Kılıçaslan· Mathematics· 0 citations
This study introduces a nature-inspired optimization algorithm called the Spider-Tailed Viper and Bird Optimizer (STVBO), which is inspired by the hunting strategy of the Iranian spider-tailed viper, and demonstrates superior performance compared to rival algorithms.
Mahdi Ranjbar Hassani, Soodeh Shadravan, A. K. Bardsiri· Cluster Computing· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.