| 共享信息素矩阵:一种新的并行ACO方法 |
| |
| 引用本文： | 吕强,高彦明,钱培德.共享信息素矩阵:一种新的并行ACO方法[J].自动化学报,2007,33(4):418-421. |
| |
| 作者姓名： | 吕强 高彦明 钱培德 |
| |
| 作者单位： | 1.苏州大学计算机科学与技术学院 苏州 215006 |
| |
| 摘 要： | 提出并实现了一种新的蚁群优化(ACO)并行化策略SHOP(Sharing one pheromone matrix). 主要思想是基于多蚁群在解的构造过程和信息素更新过程中共享同一个信息素矩阵. 以ACS和MMAS的SHOP并行实现为例, 简要描述了SHOP 设计思想和实现过程, 尝试了ACS和MMAS并行混合. 以对称TSP测试集为对象, 将SHOP的实现与相应串行算法在相同计算环境下的实验结果比较, 以及与现有的并行实现进行比较, 结果表明SHOP并行策略相对于串行ACO及现有的并行策略具有一定的优势.
|
| 关 键 词： | 蚁群优化 并行 共享信息素矩阵 |
| 收稿时间： | 2005-12-26 |
| 修稿时间： | 2005年12月26 |
Sharing One Pheromone Matrix: A New Approach to Parallel ACO |
| |
| LU Qiang,GAO Yan-Ming,QIAN Pei-De.Sharing One Pheromone Matrix: A New Approach to Parallel ACO[J].Acta Automatica Sinica,2007,33(4):418-421. |
| |
| Authors: | LU Qiang GAO Yan-Ming QIAN Pei-De |
| |
| Affiliation: | 1.School of Computer Science and Technology, Soochow University, Suzhou 215006;2.Jiangsu Provincial Key Laboratory of Computer Information Processing Technology, Suzhou 215006 |
| |
| Abstract: | This paper proposes and implements a new ap- proach to parallel ant colony optimization(ACO)algorithms. The principal idea is to make multiple ant colonies share and utilize only one pheromone matrix.We call our approach shar- ing one pheromone matrix(SHOP).This paper briefly describes how to parallelize ACS and MMAS by SHOP strategy,and tries to hybridize these two in parallel.By tackling symmetric travel- ling salesman problems,this paper compares SHOP-ACO imple- mentation with the relevant sequential ACO algorithms under fair computing environment,as well as with the existing parallel ACO algorithms.The experimental results indicate that SHOP strategy is superior to the sequential ACO algorithms and the existing parallel strategies. |
| |
| Keywords: | Ant colony optimization parallelization shaving one pheromone matrix |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《自动化学报》浏览原始摘要信息 |
|
点击此处可从《自动化学报》下载全文 |
