首页> 中文期刊>兰州大学学报(自然科学版) >基于现代超启发式搜索方法的计算机rn通信网络中路由选择优化的研究

基于现代超启发式搜索方法的计算机rn通信网络中路由选择优化的研究

     

摘要

为了改进计算机通信网络的性能,首次采用近年来才开始应用、且具有很强灵活性的现代超启发式搜索方法——Tabu搜索方法,对计算机通信网络中重要的路由选择优化问题进行了详细的研究,得到了比经典的拉格朗日松弛及子梯度优化方法更优的结果,尤其在网络负荷很重的情况下,与其它算法相比,更显示出该方法的优越性,从而为计算机网络的优化理论提供了新的思路和方法.大量的计算机仿真实验的结果表明,所得结论对于计算机通信网络以及电信网、电力网、交通运输网等,在其性能优化与评价、提高网络性能与效益、降低运营费用等方面,具有重要的理论价值和广阔的应用前景.%In order to improve performances of computer communication networks, the important route selection optimization in computer communication networks is firstly studied in detail by using the modern metaheuristic search method, i. e., Tabu search, which is of great flexibility and came into use just a few years ago. Better results are obtained and compared with the traditional Lagrangean relaxation and subgradient optimization method. Especially, the superiority of this method over other algorithms is further shown in the case of very heavily loaded network. Thus, the new thinking and method are provided for the optimization theory of computer networks. A great number of the experimental results simulated by the computer show that the given conclusions are of important theoretical value and have broad application prospects, not only for the computer communication networks, but also for the networks in telecommunication, electrical power and transportation fields, in their performance optimizations and evaluations, achieving better network properties and beneficial results, and reducing their operation costs, etc.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号