| 基于遗传算法的波分复用环网业务疏导 |
| |
| 引用本文： | 徐捷,曾庆济. 基于遗传算法的波分复用环网业务疏导[J]. 上海交通大学学报, 2002, 36(6): 769-772 |
| |
| 作者姓名： | 徐捷 曾庆济 |
| |
| 作者单位： | 上海交通大学,宽带光网技术中心,上海,200030 |
| |
| 基金项目： | 国家自然科学基金资助项目 (69990 5 0 4) |
| |
| 摘 要： | 通过把波分复用环网中的业务疏导问题归结为组合优化问题，提出了一种基于遗传算法的业务疏导算法，该算法可用于单向环网或双向环网，并适用于任何类型的业务需求，数值结果表明，该算法的性能优于贪婪算法，总体和模拟退火算法相当，甚至在某些方向还优于模拟退火算法。
|
| 关 键 词： | 波分复用环网 业务疏导 SDH上下路复用设备 遗传算法 组合优化问题 光电设备 网络结构 |
| 文章编号： | 1006-2467(2002)06-0769-04 |
| 修稿时间： | 2001-06-20 |
Traffic Crooming in Wavelength-Division-Multiplexing(WDM) Rings: A Genetic Algorithm Approach |
| |
| XU Jie,ZENG Qing Ji. Traffic Crooming in Wavelength-Division-Multiplexing(WDM) Rings: A Genetic Algorithm Approach[J]. Journal of Shanghai Jiaotong University, 2002, 36(6): 769-772 |
| |
| Authors: | XU Jie ZENG Qing Ji |
| |
| Abstract: | By showing that traffic grooming can be formulated as combinatorial optimization problems, this paper proposed a genetic algorithm (GA) based algorithm for traffic grooming. The algorithm can be applied to the traffic grooming in both unidirectional and bi directional rings assuming arbitrary traffic patterns. The numerical results demonstrate that the proposed algorithm performs better than the greedy heuristic and is comparable to the simulated annealing (SA) based heuristic or even better than the SA heuristic in some aspects. |
| |
| Keywords: | wavelength division multiplexing(WDM) SDH add drop multiplexer traffic grooming genetic algorithm(GA) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
