| 基于蚁群算法的通信线路最佳抢修路径问题的研究 |
| |
| 引用本文： | 孙宇.基于蚁群算法的通信线路最佳抢修路径问题的研究[J].数字社区&智能家居,2011(7). |
| |
| 作者姓名： | 孙宇 |
| |
| 作者单位： | 重庆大学计算机学院; |
| |
| 摘 要： | 通信线路最佳抢修路径问题,其实质就是交通路网中的最优路径问题。该文在研究蚁群算法的原理和基本模型的基础上,提出用一种改进的蚁群算法来解决最优路径问题。实验表明,该方法能在较短时间内发现最优解,对研究通信线路最佳抢修路径问题具有较大的实际意义。
|
| 关 键 词： | 蚁群算法 信息素 最佳抢修路径 |
Research for Optimal Repair Path of Communication Lines Based on Ant Colony Algorithm |
| |
| SUN Yu.Research for Optimal Repair Path of Communication Lines Based on Ant Colony Algorithm[J].Digital Community & Smart Home,2011(7). |
| |
| Authors: | SUN Yu |
| |
| Affiliation: | SUN Yu(College of Computer Science,Chongqing University,Chongqing 400044,China) |
| |
| Abstract: | The essence of optimal repair path of communication lines is the optimal routing problem of traffic network.This paper introduced the theory and basic model of ant colony algorithm,and proposed an improved ant colony algorithm to solve the problem.The result of experiment shows that this method can accurately find the optimization solution in a relatively short period,which has the meaning of realism to the study of optimal repair path problem. |
| |
| Keywords: | ant colony algorithm pheromone optimal repair path |
| 本文献已被 CNKI 等数据库收录！ |
