An improved fireworks algorithm based on grouping strategy of the shuffled frog leaping algorithm to solve function optimization problems (Q1736778): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.3390/a9020023 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3390/a9020023 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2315372597 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3390/a9020023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2315372597 / 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 / DOI
 
Property / DOI: 10.3390/A9020023 / rank
 
Normal rank

Latest revision as of 06:47, 11 December 2024

scientific article
Language Label Description Also known as
English
An improved fireworks algorithm based on grouping strategy of the shuffled frog leaping algorithm to solve function optimization problems
scientific article

    Statements

    An improved fireworks algorithm based on grouping strategy of the shuffled frog leaping algorithm to solve function optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 March 2019
    0 references
    Summary: The fireworks algorithm (FA) is a new parallel diffuse optimization algorithm to simulate the fireworks explosion phenomenon, which realizes the balance between global exploration and local searching by means of adjusting the explosion mode of fireworks bombs. By introducing the grouping strategy of the shuffled frog leaping algorithm (SFLA), an improved FA-SFLA hybrid algorithm is put forward, which can effectively make the FA jump out of the local optimum and accelerate the global search ability. The simulation results show that the hybrid algorithm greatly improves the accuracy and convergence velocity for solving the function optimization problems.
    0 references
    fireworks algorithm
    0 references
    shuffled frog leaping algorithm
    0 references
    grouping strategy
    0 references
    function optimization
    0 references

    Identifiers