| 基于禁忌算法的长沙移动网络优化 |
| |
| 引用本文： | 邓德,边耐政.基于禁忌算法的长沙移动网络优化[J].人天科学研究,2009(10). |
| |
| 作者姓名： | 邓德 边耐政 |
| |
| 作者单位： | 湖南大学软件学院 |
| |
| 摘 要： | 移动网络优化问题是一个NP难问题,所以它并不能保证在合理的运行次数里就找到最优的方案。常用的人工智能求解优化问题有遗传算法、蚁群算法和禁忌算法。相对于这几种算法在离散对象的组合优化问题中优势比较明显,而禁忌算法更容易跳出局部极值从而能在更大的范围内寻找到一个较优解。我们开发的基于禁忌算法的长沙移动网络优化软件,通过科学分析采集的数据,从而解决话务阻塞和掉话问题,优化了网络,提高了长沙移动的网络质量。
|
| 关 键 词： | 禁忌算法 移动网络优化 LAC |
Changsha Mobile Network Optimization Based on Tabu Algorithm |
| |
| Abstract: | Mobile network optimization is a NP hard problem of volume,so it can not guarantee a reasonable number of years on the run to find the optimal option.Commonly used for solving optimization problems in artificial intelligence has a genetic algorithm,ant colony algorithm and tabu algorithm.Algorithm in relation to these types of objects in discrete combinatorial optimization problems in the more obvious advantages,and contraindications algorithm is more easily so that it can jump out of local maximum in the r... |
| |
| Keywords: | Tabu Algorithm Mobile Network Optimization LAC |
| 本文献已被 维普 等数据库收录！ |
|
