摘要
通过把波分复用环网中的业务疏导问题归结为组合优化问题 ,提出了一种基于遗传算法的业务疏导算法 .该算法可用于单向环网或双向环网 ,并适用于任何类型的业务需求 .数值结果表明 ,该算法的性能优于贪婪算法 ,总体和模拟退火算法相当 。
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.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2002年第6期769-772,共4页
Journal of Shanghai Jiaotong University
基金
国家自然科学基金资助项目 (69990 5 0 4)
