A hybrid lightning search algorithm-simplex method for global optimization (Q2403904): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Metaheuristic Bat-Inspired Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical study about the usefulness of evolution strategies to solve constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective co-evolutionary differential evolution for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved harmony search algorithm for solving optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3122364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved ant colony optimization for constrained engineering design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel heuristic optimization method: charged system search / rank
 
Normal rank
Property / cites work
 
Property / cites work: GSA: A gravitational search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flower Pollination Algorithm for Global Optimization / rank
 
Normal rank

Latest revision as of 09:03, 14 July 2024

scientific article
Language Label Description Also known as
English
A hybrid lightning search algorithm-simplex method for global optimization
scientific article

    Statements

    A hybrid lightning search algorithm-simplex method for global optimization (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2017
    0 references
    Summary: In this paper, a novel hybrid lightning search algorithm-simplex method (LSA-SM) is proposed to solve the shortcomings of lightning search algorithm (LSA) premature convergence and low computational accuracy and it is applied to function optimization and constrained engineering design optimization problems. The improvement adds two major optimization strategies. Simplex method (SM) iteratively optimizes the current worst step leaders to avoid the population searching at the edge, thus improving the convergence accuracy and rate of the algorithm. Elite opposition-based learning (EOBL) increases the diversity of population to avoid the algorithm falling into local optimum. LSA-SM is tested by 18 benchmark functions and five constrained engineering design problems. The results show that LSA-SM has higher computational accuracy, faster convergence rate, and stronger stability than other algorithms and can effectively solve the problem of constrained nonlinear optimization in reality.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references