<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">
NWU Institutional Repository

Enhanced prairie dog optimization with Levy flight and dynamic opposition-based learning for global optimization and engineering design problems

dc.contributor.authorBiswas, Saptadeep
dc.contributor.authorShaikh, Azharuddin
dc.contributor.authorEzugwu, Absalom El-Shamir
dc.contributor.authorGreeff, Japie
dc.contributor.authorMirjalili, Seyedali
dc.contributor.authorBera, Uttam Kumar
dc.contributor.authorAbualigah, Laith
dc.date.accessioned2026-01-22T09:06:16Z
dc.date.issued2024
dc.descriptionJournal Article, (Faculty of Engineering (Mechanical Engineering)) -- North-West University, Potchefstroom Campus
dc.description.abstractThis study proposes a new prairie dog optimization algorithm version called EPDO. This new version aims to address the issues of premature convergence and slow convergence that were observed in the original PDO algorithm. To improve performance, several modifications are introduced in EPDO. First, a dynamic opposite learning strategy is employed to increase the diversity of the population and prevent premature convergence. This strategy helps the algorithm avoid falling into local optima and promotes global optimization. Additionally, the Le´vy dynamic random walk technique is utilized in EPDO. This modified Le´vy flight with random walk reduces the algorithm's running time for the test function's ideal value, accelerating its convergence. The proposed approach is evaluated using 33 benchmark problems from CEC 2017 and compared against seven other comparative techniques: GWO, MFO, ALO, WOA, DA, SCA, and RSA. Numerical results demonstrate that EPDO produces good outcomes and performs well in solving benchmark problems. To further validate the results and assess reliability, the authors employ average rank tests, the measurement of alternatives, and ranking according to the compromise solution (MARCOS) method, as well as a convergence report of EPDO and other algorithms. Furthermore, the effectiveness of the EPDO algorithm is demonstrated by applying it to five design problems. The results indicate that EPDO achieves impressive outcomes and proves its capability to address practical issues. The algorithm performs well in solving benchmark and practical design problems, as supported by the numerical results and validation methods used in the study.
dc.description.sustainableSustainable Cities and Communities
dc.identifier.citationBiswas, S. et al. 2024. Enhanced prairie dog optimization with Levy flight and dynamic opposition-based learning for global optimization and engineering design problems. Neural Computing and Applications (2024) 36:11137–11170 [https://doi.org/10.1007/s00521-024-09648-4]
dc.identifier.urihttps://doi.org/10.1007/s00521-024-09648-4
dc.identifier.urihttp://hdl.handle.net/10394/45586
dc.language.isoen
dc.publisherSpringer Nature
dc.subjectEnhanced prairie dog optimization
dc.subjectLe´vy distribution
dc.subjectDynamic opposition-based learning
dc.subjectGlobal optimization
dc.subjectEngineering design problem
dc.subjectMARCOS MCDM method
dc.subjectBenchmark problems
dc.titleEnhanced prairie dog optimization with Levy flight and dynamic opposition-based learning for global optimization and engineering design problems
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Enhanced prairie dog optimization with Levy flight and dynamic.pdf
Size:
3.05 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:

Collections