2013
DOI: 10.1016/j.amc.2013.07.092
|View full text |Cite
|
Sign up to set email alerts
|

Hybridizing ant colony optimization with firefly algorithm for unconstrained optimization problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
25
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 61 publications
(25 citation statements)
references
References 18 publications
0
25
0
Order By: Relevance
“…The main advantages of FA are namely intensification and diversification or exploitation and exploration: As light intensity decreases with distance, the attraction among fireflies can be local or global, depending on the absorbing coefficient, and thus all local modes as well as global modes will be visited. Therefore, it has captured much attention and has been successfully applied to solve several optimization problems including [7][8][9].…”
Section: Introductionmentioning
confidence: 99%
“…The main advantages of FA are namely intensification and diversification or exploitation and exploration: As light intensity decreases with distance, the attraction among fireflies can be local or global, depending on the absorbing coefficient, and thus all local modes as well as global modes will be visited. Therefore, it has captured much attention and has been successfully applied to solve several optimization problems including [7][8][9].…”
Section: Introductionmentioning
confidence: 99%
“…A promising new natureinspired algorithm known as FA was recently proposed and has gained more attention in the research literature. The ACOFA [13] is the new hybridization for FA and ACO [14] algorithm. This hybrid algorithm has been designed to solve unconstrained optimization problems and FA works as a local search to refine the positions found by the ants.…”
Section: Introductionmentioning
confidence: 99%
“…However, there are still a lot of problems to solve in the application of ant colony algorithm in multi-objective optimization. Fields worthy of exploration include how to select the initial ant colony, how to construct Pareto optimal solution set, how to set the parameters of any colony algorithm, how to conduct simulation experiment and the verification of related theories, etc [5].…”
Section: Introductionmentioning
confidence: 99%
“…However, there are still a lot of problems to solve in the application of ant colony algorithm in multi-objective optimization. Fields worthy of exploration include how to select the initial ant colony, how to construct Pareto optimal solution set, how to set the parameters of any colony algorithm, how to conduct simulation experiment and the verification of related theories, etc [5].This paper first explained the basic principles of multi-objective problems and ant colony algorithm in detail, based on which, it provided the complete procedure of multi-objective ant colony optimization, and with the simulation, test and analysis of the standard test function, and …”
mentioning
confidence: 99%