Dandelion algorithm with probability-based mutation

Honghao Zhu, Guanjun Liu, Mengchu Zhou, Yu Xie, Qi Kang

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

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 dandelion algorithm with probability-based mutation (DAPM) is proposed in this paper. In DAPM, both Gaussian and Levy mutations can be used interchangeably according to a given probability model. In this paper, three probability models are discussed, namely linear, binomial, and exponential models. The experiments show that DAPM achieves better overall performance on standard test functions than DA.

Original languageEnglish (US)
Article number8758419
Pages (from-to)97974-97985
Number of pages12
JournalIEEE Access
Volume7
DOIs
StatePublished - 2019

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)

Keywords

  • Dandelion algorithm
  • Gaussian mutation
  • Levy mutation
  • probability-based mutation

Fingerprint Dive into the research topics of 'Dandelion algorithm with probability-based mutation'. Together they form a unique fingerprint.

Cite this