2017
DOI: 10.1063/1.4981972
|View full text |Cite
|
Sign up to set email alerts
|

Performance evaluation of firefly algorithm with variation in sorting for non-linear benchmark problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(20 citation statements)
references
References 19 publications
0
8
0
Order By: Relevance
“…Nayak et al (2020) Johari et al (2017) to achieve an improved solution for search space exploration. To decrease time complexity of the original FA algorithm, Umbarkar, Balande & Seth (2017) proposed a modified FA algorithm that ranks the fireflies based on a quick sort algorithm instead of bubble sort technique.…”
Section: Artificial Bee Colony Optimization (Abc)mentioning
confidence: 99%
“…Nayak et al (2020) Johari et al (2017) to achieve an improved solution for search space exploration. To decrease time complexity of the original FA algorithm, Umbarkar, Balande & Seth (2017) proposed a modified FA algorithm that ranks the fireflies based on a quick sort algorithm instead of bubble sort technique.…”
Section: Artificial Bee Colony Optimization (Abc)mentioning
confidence: 99%
“…The FA is an algorithm that was developed by Xin-She Yang at Cambridge University in 2007 [13]. The FA is a swarm intelligence-based metaheuristic approach inspired by the behaviour of fireflies.…”
Section: Firefly Algorithmmentioning
confidence: 99%
“…Regression analysis used to predict or find a relationship between the independent variable and dependent variable moreover, its impact on the dependent variable. Thus regression analysis finds a causal relationship between the variables [8]. The linear regression equation is shown in Equation 1.…”
Section: Fig 1 Research Frameworkmentioning
confidence: 99%
“…Sorting refers to ordering data in an increasing or decreasing fashion according to some linear relationship among the data items in a particular data structure. Sorting techniques have attracted a great deal of research for efficiency, practicality, performance, complexity and types of data structures [7,8]. Rigorous efforts have been taken to improve sorting techniques like merge sort, bubble sort, insertion sort, quick sort, selection sort, and each of them has a different mechanism to reorder elements which increase the performance and efficiency of the practical applications as well as reducing the time complexity for each one.…”
Section: Introductionmentioning
confidence: 99%