Adaptive mutation dynamic search fireworks algorithm

DOI10.3390/A10020048MaRDI QIDQ1662714zbMATH OpenOpenAlexFDO

Authors Y. Aharonov

Publication date 20 August 2018

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a10020048

zbMATH Keywords

dynamic search fireworks algorithmGaussian mutationLevy mutationmutation probabilitystandard test functions

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Review text

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.

Recommendations

• Analysis and improvement of fireworks algorithm
• Opposition-based adaptive fireworks algorithm
• Adaptive hybrid mutation gravitational search algorithm
• A dynamic adaptive firefly algorithm with globally orientation
• Fireworks algorithm with gravitational search operator

Cites work

• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• Analysis and improvement of fireworks algorithm
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces

Cited in

(4)

• Analysis and improvement of fireworks algorithm
• Opposition-based adaptive fireworks algorithm
• A modified fireworks algorithm with dynamic search interval based on closed-loop control
• Dynamic Multi-Swarm Competitive Fireworks Algorithm for Global Optimization and Engineering Constraint Problems

Describes a project that uses

Uses Software

• CEC 13
• ABC

This page was built for publication: Adaptive mutation dynamic search fireworks algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662714)