| 蚁群算法用于TSP的并行策略及模型* |
| |
| 引用本文： | 刘乃文,刘方爱.蚁群算法用于TSP的并行策略及模型*[J].计算机应用研究,2007,24(12):37-40. |
| |
| 作者姓名： | 刘乃文 刘方爱 |
| |
| 作者单位： | 山东师范大学,信息科学与工程学院,济南,250014 |
| |
| 基金项目： | 国家自然科学基金重大资助项目(90612003) |
| |
| 摘 要： | 蚁群算法是一种元启发式算法,其经典应用是解决旅行商问题。该算法有着先天的并行特性。介绍了该算法的两种并行实现策略,给出了蚁群算法的并行实现模型,分析了该算法并行实现需要解决的问题。
|
| 关 键 词： | 蚁群算法 元启发式算法 旅行商问题 并行计算 |
| 文章编号： | 1001-3695(2007)12-0037-04 |
| 修稿时间： | 2006年9月26日 |
Parallel strategies and model of ant colony algorithm used for TSP |
| |
| LIU Nai wen,LIU Fang ai.Parallel strategies and model of ant colony algorithm used for TSP[J].Application Research of Computers,2007,24(12):37-40. |
| |
| Authors: | LIU Nai wen LIU Fang ai |
| |
| Affiliation: | (School of Information Science & Engineering, Shandong Normal University, Jinan 250014, China) |
| |
| Abstract: | The ant system is a new meta heuristic method, which particularly appropriate to solve hard combinatorial optimization problems. It is a population based nature inspired approach exploiting positive feedback as well as local information and has been applied successfully to a variety of combinatorial optimization problems. The structure of the ant system highly suggests a parallel implementation of the algorithm. It introduced two strategies of its parallel implementation, improved a parallel implementation model. |
| |
| Keywords: | |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
