摘要： 通过对波长通道路由问题具体特点的数学分析,将问题分解为多个小规模的线性数学规划模型,设计了一个基于当前解邻域变换的快速搜索算法。模拟试验表明,同启发式算法相比,该算法能在较短的时间内取得更好的优化效果。

关键词: 网络设计, 波分复用, 波长通道路由, 网络拥塞

Abstract: In this paper, with proper mathematical analysis, the problem is decomposed into a small-scale linear programming model and a specifically configured short path problem. Based on recursive neighborhood search of current solution, an efficient algorithm is designed to search in the whole legal solutions space. Experiments show that the algorithm, compared with heuristic methods, can get better solution in same or less running time.

中图分类号: 

• TN929.1