Dandelion Algorithm With Probability-Based Mutation

Dandelion Algorithm With Probability-Based Mutation

A dandelion algorithm (DA) is a recently-proposed intelligent optimization algorithm and shows an excellent performance in solving function optimization problems. However, like other intelligent algorithms, it converges slowly and falls into local optima easily. To overcome these two flaws, a dandel...

Full description

Bibliographic Details
Main Authors: Honghao Zhu, Guanjun Liu, Mengchu Zhou, Yu Xie, Qi Kang
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Dandelion algorithm
Gaussian mutation
Levy mutation
probability-based mutation
Online Access:https://ieeexplore.ieee.org/document/8758419/

Internet

https://ieeexplore.ieee.org/document/8758419/

Similar Items