arrow
返回

A sensitivity analysis method for driving the Artificial Bee Colony algorithm's search process

delete2016-04-01
delete31
PRE
AI
P
Peio Loubière
A
Astrid Jourdan
P
Patrick Siarry *
R
Rachid Chelouah
DOI:10.1016/j.asoc.2015.12.044delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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.
Keyword:
Metaheuristic
Optimization
Artificial Bee Colony
Sensitivity analysis
Morris' method
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

C
CY Cergy Paris Universite
学者数:
1.6K
论文数: 1.4K
被引数: 7
引用论文

引用论文

Continuous authentication on relational streams
err2009-06-06
err0
errOAAI
errStavros Papadopoulos; Yin Yang; Dimitris Papadias
err分享
err收藏
Hot flashes and estrogen therapy do not influence cognition in early menopausal women
err2007-03-01
err0
PREAI
errErin S. LeBlanc; Michelle B. Neiss; Phyllis E. Carello; Mary H. Samuels; Jeri S. Janowsky
err分享
err收藏
err分享
err收藏
学者 查看更多内容