期刊
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
卷 62, 期 9, 页码 1421-1432出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1006/jpdc.2002.1854
关键词
ant colony optimization; parallelization; travelling salesman problem
Ant Colony Optimization is a relatively new class of meta-heuristic search techniques for optimization problems. As it is a population-based technique that examines numerous solution options at each step of the algorithm, there are a variety of parallelization opportunities. In this paper, several parallel decomposition strategies are examined. These techniques are applied to a specific problem, namely the travelling salesman problem, with encouraging speedup and efficiency results. (C) 2002 Elsevier Science (USA)
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据