返回
Accelerating Artificial Bee Colony algorithm with adaptive local search
DOI:10.1007/s12293-015-0158-x.png)
摘要
En 中文
Artificial Bee Colony (ABC) algorithm has been emerged as one of the latest Swarm Intelligence based algorithm. Though, ABC is a competitive algorithm as compared to many other optimization techniques, the drawbacks like preference on exploration at the cost of exploitation and skipping the true solution due to large step sizes, are also associated with it. In this paper, two modifications are proposed in the basic version of ABC to deal with these drawbacks: solution update strategy is modified by incorporating the role of fitness of the solutions and a local search based on greedy logarithmic decreasing step size is applied. The modified ABC is named as accelerating ABC with an adaptive local search (AABCLS). The former change is incorporated to guide to not so good solutions about the directions for position update, while the latter modification concentrates only on exploitation of the available information of the search space. To validate the performance of the proposed algorithm AABCLS, benchmark optimization problems of different complexities are considered and results comparison section shows the clear superiority of the proposed modification over the Basic ABC and the other recent variants namely, Best-So-Far ABC (BSFABC), Gbest guided ABC (GABC), Opposition based levy flight ABC (OBLFABC) and Modified ABC (MABC).
Keyword:
Artificial Bee Colony
Memetic algorithm
Optimization
Exploration-exploitation
Swarm Intelligence
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.3
论文数:
453
被引数:
718
机构
引用论文
Arc-Guided Evolutionary Algorithm for the Vehicle Routing Problem with Time Windows带时间窗车辆路径问题的弧形引导进化算法

