Effective heuristics for ant colony optimization to handle large-scale problems
详细信息 查看全文
- 作者：Hassan Ismkhan H.Ismkhan@bonabu.ac.ir Esmkhan@gmail.comAuthor Vitae
- 关键词：Large-scale optimization ; Ant colony optimization ; ACO ; Heuristics ; Traveling salesman problem
- 刊名：Swarm and Evolutionary Computation
- 出版年：2017
- 出版时间：February 2017
- 年：2017
- 卷：32
- 期：Complete
- 页码：140-149
- 全文大小：1563 K
- 卷排序：32
文摘
Although ant colony optimization (ACO) has successfully been applied to a wide range of optimization problems, its high time- and space-complexity prevent it to be applied to the large-scale instances. Furthermore, local search, used in ACO to increase its performance, is applied without using heuristic information stored in pheromone values. To overcome these problems, this paper proposes new strategies including effective representation and heuristics, which speed up ACO and enable it to be applied to large-scale instances. Results show that in performed experiments, proposed ACO has better performance than other versions in terms of accuracy and speed.