| 基于动态聚类邻域分区的并行蚁群优化算法 |
| |
| 引用本文： | 丁建立,陈增强,袁著祉. 基于动态聚类邻域分区的并行蚁群优化算法[J]. 系统工程理论与实践, 2003, 23(9): 105-110. DOI: 10.12011/1000-6788(2003)9-105 |
| |
| 作者姓名： | 丁建立 陈增强 袁著祉 |
| |
| 作者单位： | 南开大学信息学院 |
| |
| 基金项目： | 国家自然科学基金(60174021)，天津自然科学基金重点项目(013800711)，河南科技攻关项目 |
| |
| 摘 要： | 本文算法体现"分而治之"的思想,首先采用动态K均值聚类快速邻域分解,其次应用蚁群算法同时对分区并行优化计算,最后基于分区重心进行邻域全局连接,得到大规模TSP问题的满意解.
|
| 关 键 词： | 动态K均值聚类 邻域分区搜索 并行蚁群优化算法 大规模TSP问题 |
| 文章编号： | 1000-6788(2003)09-0105-06 |
| 修稿时间： | 2002-07-09 |
Parallel Ant Colonies Optimization Algorithm Based on Nearest Neighbor Classify Used to Dynamic K-Means Cluster |
| |
| Jian Li DING,Zeng Qiang CHEN,Zhu Zhi YUAN. Parallel Ant Colonies Optimization Algorithm Based on Nearest Neighbor Classify Used to Dynamic K-Means Cluster[J]. Systems Engineering —Theory & Practice, 2003, 23(9): 105-110. DOI: 10.12011/1000-6788(2003)9-105 |
| |
| Authors: | Jian Li DING Zeng Qiang CHEN Zhu Zhi YUAN |
| |
| Affiliation: | College of Information Technology and Science, Nankai University |
| |
| Abstract: | For a large number of TSP of combinatorial-explode NP-Hard problems, Any only one algorithm will be face challenge in optimization characteristic and CPU run-time. The paper thinking is "divide and rule". First, we fast nearest neighbor classify used to $k$means cluster. Second, we are parallel computing used to ant colonies optimization for every group. Finally, we get good results used to globally optimizing use of between-group linkage and between-group Centro baric distance. |
| |
| Keywords: | dynamic k-means cluster nearest neighbor classify parallel ant colony optimization a large number of TSP |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
|
点击此处可从《系统工程理论与实践》下载全文 |
