.png){kind=icon}
.png){kind=icon}
Return
A sensitivity analysis method for driving the Artificial Bee Colony algorithm's search process
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2015.12.044.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we improve D. Karaboga's Artificial Bee Colony (ABC) optimization algorithm, by using the sensitivity analysis method described by Morris. Many improvements of the ABC algorithm have been made, with effective results. In this paper, we propose a new approach of random selection in neighborhood search. As the algorithm is running, we apply a sensitivity analysis method, Morris' OAT (One-At-Time) method, to orientate the random choice selection of a dimension to shift. Morris' method detects which dimensions have a high influence on the objective function result and promotes the search following these dimensions. The result of this analysis drives the ABC algorithm towards significant dimensions of the search space to improve the discovery of the global optimum. We also demonstrate that this method is fruitful for more recent improvements of ABC algorithm, such as GABC, MeABC and qABC. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Metaheuristic
Optimization
Artificial Bee Colony
Sensitivity analysis
Morris' method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W