.png){kind=icon}
返回
PREACO: A fast ant colony optimization for codebook generation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2013.01.017.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents an effective and efficient method for speeding up ant colony optimization (ACO) in solving the codebook generation problem. The proposed method is inspired by the fact that many computations during the convergence process of ant-based algorithms are essentially redundant and thus can be eliminated to boost their convergence speed, especially for large and complex problems. To evaluate the performance of the proposed method, we compare it with several state-of-the-art metaheuristic algorithms. Our simulation results indicate that the proposed method can significantly reduce the computation time of ACO-based algorithms evaluated in this paper while at the same time providing results that match or outperform those ACO by itself can provide. (C) 2013 Elsevier B. V. All rights reserved.
Keyword:
Ant colony optimization
Codebook generation problem
Pattern reduction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Halogen atom transfer radical cyclization of N-allyl-N-benzyl-2,2-dihaloamides to 2-pyrrolidinones, promoted by Fe0-FeCl3 or CuCl-TMEDA.png)
Tetrahedron
TetrahedronIF0
PREAI
分享收藏Metaheuristics in combinatorial optimization: Overview and conceptual comparison组合优化中的元启发式: 概述和概念比较
PREAI
分享收藏分享收藏
查看更多内容