Diversity enhanced Equilibrium Optimization algorithm for solving unconstrained and constrained optimization problems
Yükleniyor...
Dosyalar
Tarih
2023
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer Heidelberg
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
This research study proposes a novel mutation scheme mainly based on the manipulation equations of Tangent Search Optimization and mutualism phase of Symbiotic Organism Search algorithms to be implemented on the Equilibrium Optimization algorithm to enhance the solution diversity among the population individuals. Beneficial coordination between these governing search mechanisms enables maintaining diversity in the population. It eliminates the stagnation towards the local sub-optimal solutions over the search domain, significantly alleviating the inherent drawbacks of Equilibrium Optimizer. To assess the efficiency of the proposed diversity-enhanced Equilibrium Optimization algorithm (DEQUIL) on unconstrained problems, thirty-four multidimensional optimization test instances comprised of unimodal and multimodal benchmark problems have been solved, and respective performances are verified against those obtained from well-reputed new emerged metaheuristic algorithms. A comprehensive comparison based on the decisive metrics, including statistical analysis, performance index analysis, scalability tests, diversity analysis, and convergence rates demonstrates the effectiveness of the hybrid search methodology. Later, fourteen real-world constrained engineering problems with varying complexities were solved by the proposed DEQUIL method. The prediction performance of DEQUIL is compared with a wide range of available literature optimizers to scrutinize the improvements in problem-solving capabilities and seen that it can successfully cope with the complex constrained design problems outperforming the majority of the compared algorithm in most design cases.
Açıklama
Anahtar Kelimeler
Engineering Design Optimization; Equilibrium Optimizer; Mutualism; Tangent Search Algorithm
