An improved squirrel search algorithm for global function optimization (Q2003334): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: GSA: A gravitational search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified differential evolution with self-adaptive parameters method / rank
 
Normal rank

Latest revision as of 20:20, 19 July 2024

scientific article
Language Label Description Also known as
English
An improved squirrel search algorithm for global function optimization
scientific article

    Statements

    An improved squirrel search algorithm for global function optimization (English)
    0 references
    0 references
    0 references
    0 references
    8 July 2019
    0 references
    Summary: An improved squirrel search algorithm (ISSA) is proposed in this paper. The proposed algorithm contains two searching methods, one is the jumping search method, and the other is the progressive search method. The practical method used in the evolutionary process is selected automatically through the linear regression selection strategy, which enhances the robustness of squirrel search algorithm (SSA). For the jumping search method, the `escape' operation develops the search space sufficiently and the `death' operation further explores the developed space, which balances the development and exploration ability of SSA. Concerning the progressive search method, the mutation operation fully preserves the current evolutionary information and pays more attention to maintain the population diversity. Twenty-one benchmark functions are selected to test the performance of ISSA. The experimental results show that the proposed algorithm can improve the convergence accuracy, accelerate the convergence speed as well as maintain the population diversity. The statistical test proves that ISSA has significant advantages compared with SSA. Furthermore, compared with five other intelligence evolutionary algorithms, the experimental results and statistical tests also show that ISSA has obvious advantages on convergence accuracy, convergence speed and robustness.
    0 references
    the squirrel search algorithm
    0 references
    the jumping search method
    0 references
    the progressive search method
    0 references
    linear regression selection strategy
    0 references
    0 references
    0 references
    0 references

    Identifiers