Show simple item record

dc.contributor.authorJuhe Sun
dc.contributor.authorGuolin Huang
dc.contributor.authorLi Wang
dc.contributor.authorChuanjun Yin
dc.contributor.authorNing Ma
dc.contributor.otherSchool of Science, Shenyang Aerospace University, Shenyang 110136, China
dc.contributor.otherSchool of Science, Shenyang Aerospace University, Shenyang 110136, China
dc.contributor.otherSchool of Science, Shenyang Aerospace University, Shenyang 110136, China
dc.contributor.otherSchool of Science, Shenyang Aerospace University, Shenyang 110136, China
dc.contributor.otherSchool of Mechatronics Engineering, Shenyang Aerospace University, Shenyang 110136, China
dc.date.accessioned2025-08-27T02:32:16Z
dc.date.accessioned2025-10-08T08:50:10Z
dc.date.available2025-10-08T08:50:10Z
dc.date.issued01-05-2025
dc.identifier.urihttps://www.aimspress.com/article/doi/10.3934/math.2025533
dc.identifier.urihttp://digilib.fisipol.ugm.ac.id/repo/handle/15717717/37535
dc.description.abstractThis study presented an upgraded version of the Harris Hawk optimization algorithm (UHHO) designed to overcome the inherent limitations of the original algorithm, especially in solving nonlinear constrained optimization problems that tend to converge prematurely and fall into local optima. First, the initial population generated in a random way was replaced by a good point set strategy. Second, we replaced the linear strategy with a nonlinear strategy in the intermediate stage in order to optimize the global search process. Furthermore, the sine-cosine strategy and L-C cascade chaos strategy were introduced in the development stage to perturb the population's position. This aimed to better explore the neighborhood of Harris Hawk optimal individuals in depth, enhance the local search ability of the algorithm, and avoid the algorithm falling into local optima. Some numerical experiments for solving nonlinear inequality constrained optimization problems are presented at the end of this paper. The simulation results show that the multi-strategy upgraded Harris Hawk algorithm can effectively avoid the problem of the standard Harris Hawk optimization algorithm falling into local optima.
dc.language.isoEN
dc.publisherAIMS Press
dc.subject.lccMathematics
dc.titleA multi-strategy upgraded Harris Hawk optimization algorithm for solving nonlinear inequality constrained optimization problems
dc.typeArticle
dc.description.keywordsmulti-strategy upgrade
dc.description.keywordslocal optimality
dc.description.keywordsgood point set strategy
dc.description.keywordsnonlinear factor strategy
dc.description.keywordssine-cosine strategy
dc.description.keywordsl-c chaos strategy
dc.description.keywordsnonlinear constrained optimization problems
dc.description.pages11783-11812
dc.description.doi10.3934/math.2025533
dc.title.journalAIMS Mathematics
dc.identifier.e-issn2473-6988
dc.identifier.oaioai:doaj.org/journal:dc911f87588e4680902b3b3e19bb7d3c
dc.journal.infoVolume 10, Issue 5


This item appears in the following Collection(s)

Show simple item record