Evidence map›Paper›PMID 35535189›Full record

ArticleComputational intelligence and neuroscience2022

Modified Harris Hawks Optimization Algorithm with Exploration Factor and Random Walk Strategy.

Meijia Song, Heming Jia, Laith Abualigah, Qingxin Liu, Zhixing Lin, Di Wu, Maryam Altalhi

Abstract read
In one paragraph

Article in Computational intelligence and neuroscience, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

7 authors.

Meijia SongNetwork Center, Sanming University, Sanming 365004, China.ORCID https://orcid.org/0000-0001-5466-6885
Heming JiaSchool of Information and Engineering, Sanming University, Sanming 365004, China.ORCID https://orcid.org/0000-0002-4339-8464
Laith AbualigahFaculty of Computer Sciences and Informatics, Amman Arab University, Amman 11953, Jordan.
Qingxin LiuSchool of Computer Science and Technology, Hainan University, Haikou 570228, China.
Zhixing LinNetwork Center, Sanming University, Sanming 365004, China.
Di WuSchool of Education and Music, Sanming University, Sanming 365004, China.
Maryam AltalhiDepartment of Management Information System, College of Business Administration, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

One of the most popular population-based metaheuristic algorithms is Harris hawks optimization (HHO), which imitates the hunting mechanisms of Harris hawks in nature. Although HHO can obtain optimal solutions for specific problems, it stagnates in local optima solutions. In this paper, an improved Harris hawks optimization named ERHHO is proposed for solving global optimization problems. Firstly, we introduce tent chaotic map in the initialization stage to improve the diversity of the initialization population. Secondly, an exploration factor is proposed to optimize parameters for improving the ability of exploration. Finally, a random walk strategy is proposed to enhance the exploitation capability of HHO further and help search agent jump out the local optimal. Results from systematic experiments conducted on 23 benchmark functions and the CEC2017 test functions demonstrated that the proposed method can provide a more reliable solution than other well-known algorithms.

Indexed as

AlgorithmsFalconiformesAnimalsBirdsProblem Solving

Identifiers

PMID35535189
PMCPMC9078797

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.