Answers are grounded in this paper and cite their sources.
Metaheuristic algorithms are widely used in intelligent systems to solve complex optimization problems with high‐dimensional search spaces, nonlinear objective functions, and multiple constraints. Despite their broad applicability, many existing methods still face difficulties in maintaining population diversity and are prone to premature convergence. To address these issues, this paper proposes an enhanced dung beetle optimizer (EDBO). The method improves the original DBO in three aspects: solution similarity is used to screen candidate individuals during initialization, sine chaotic mapping is introduced to improve the distribution of the initial population, and lens‐imaging reverse learning is incorporated to strengthen the search in later iterations. The performance of EDBO is evaluated on 23 benchmark functions from the CEC2005 test suite and compared with the original DBO and several representative metaheuristic algorithms. The results show that EDBO achieves better overall performance on most test functions and exhibits stable convergence behavior. To further examine its effectiveness on constrained optimization tasks, the algorithm is also tested on three classical engineering design problems, including welded beam design, pressure vessel design, and three‐bar truss design. In addition, a representative application to consensus node selection in distributed environments is discussed. The results indicate that EDBO is a competitive and effective approach for complex optimization problems.
No takes yet. Share an insight, caveat, or question.
Li et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: