Comparative analysis of chaotic variant of firefly algorithm, flower pollination algorithm and dragonfly algorithm for high dimension non-linear test functions

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Non-linear test functions are NP-Class problems. To solve them, Swarm Algorithms (SA) have been used in last two decades very effectively. In this work, three swarm based algorithms (i.e. Firefly Algorithm (FFA); Flower Pollination Algorithm (FPA) and Dragonfly Algorithm (DA)) have been used. Chaos is familiarized with swarm algorithm to improve their performance. As per our knowledge, most of the studies have applied chaos on one standard SA and compared it with other standard algorithm(s). No comparison has been shown among the chaotic variant of different algorithms. Comparison of Chaotic variants of FFA, FPA & DA with their standard algorithms has been performed using four high dimensions non-linear test functions on the basis of Mean fitness (i.e. P1) and convergence rate (i.e. P2). The results indicate that chaotic variant has performed better than standard and FFA evaluates best fitness for multi-modal function (i.e. f3 and f4).

Cite

CITATION STYLE

APA

Singh, A. P., & Kaur, A. (2019). Comparative analysis of chaotic variant of firefly algorithm, flower pollination algorithm and dragonfly algorithm for high dimension non-linear test functions. In Advances in Intelligent Systems and Computing (Vol. 939, pp. 192–201). Springer Verlag. https://doi.org/10.1007/978-3-030-16681-6_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free