Adaptive mutation dynamic search fireworks algorithm (Q1662714)

From MaRDI portal
Revision as of 03:41, 28 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Adaptive mutation dynamic search fireworks algorithm
scientific article

    Statements

    Adaptive mutation dynamic search fireworks algorithm (English)
    0 references
    0 references
    0 references
    20 August 2018
    0 references
    Summary: The Dynamic Search Fireworks Algorithm (dynFWA) is an effective algorithm for solving optimization problems. However, dynFWA easily falls into local optimal solutions prematurely and it also has a slow convergence rate. In order to improve these problems, an adaptive mutation dynamic search fireworks algorithm (AMdynFWA) is introduced in this paper. The proposed algorithm applies the Gaussian mutation or the Levy mutation for the core firework (CF) with mutation probability. Our simulation compares the proposed algorithm with the FWA-Based algorithms and other swarm intelligence algorithms. The results show that the proposed algorithm achieves better overall performance on the standard test functions.
    0 references
    dynamic search fireworks algorithm
    0 references
    Gaussian mutation
    0 references
    Levy mutation
    0 references
    mutation probability
    0 references
    standard test functions
    0 references

    Identifiers