1. Performance Evaluation of Firefly Algorithm with Variation in Sorting for Non-Linear Benchmark Problems.
- Author
-
Umbarkar, A. J., Balande, U. T., and Seth, P. D.
- Subjects
MATHEMATICAL optimization ,PROBLEM solving ,STANDARD deviations ,ANALYSIS of variance ,ALGORITHMS - Abstract
The field of nature inspired computing and optimization techniques have evolved to solve difficult optimization problem in diverse fields of engineering, science and technology. The firefly attraction process is mimicked in the algorithm for solving optimizing proble3ms. In Firefly Algorithm (FA) sorting of fireflies is done by using sorting algorithm. The original FA is proposed with bubble sort for ranking the fireflies. In this paper, the quick sort replaces bubble sort to decrease the time complexity of FA. The dataset used is unconstrained benchmark functions from CEC 2005 [22]. The comparison of FA using bubble sort and FA using quick sort is performed with respect to best, worst, mean, standard deviation, number of comparisons and execution time. The experimental result shows that FA using quick sort requires less number of comparisons but requires more execution time. The increased number of fireflies helps to converge into optimal solution whereas by varying dimension for algorithm performed better at a lower dimension than higher dimension. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF