...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Photonic Network Communication >A Fiber Routing Problem in Designing Optical Transport Networks with Wavelength Division Multiplexed Systems
【24h】

A Fiber Routing Problem in Designing Optical Transport Networks with Wavelength Division Multiplexed Systems

机译：波分复用系统设计光传输网络中的光纤路由问题

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we consider a fiber routing problem arising from the design of optical transport networks. The problem is to find an optimal routing of multiple rings and an optimal location of wavelength division multiplexed (WDM) systems for carrying demand traffic. This problem can be conceptualized as a Steiner (multiple) ring problem with link capacity constraints. We formulate the problem as a mixed-integer programming model and develop a new branch-and-cut procedure along with preprocessing routines and valid inequalities for optimally solving the problem. Exploiting the inherent special structures of the formulation, we focus on developing strong valid inequalities and devising an effective Tabu search heuristic for solving large-scale problems. Computational results indicate that preprocessing rules and valid inequalities provide a tight lower bound, and in turn reduce the effort required to solve the problem within the framework of the branch-and-cut procedure. Moreover, the proposed Tabu search heuristic works quite well for solving large-scale problems. Motivated by promising computational results, we provide insights into implementing the proposed branch-and-cut procedure for deploying fiber optic networks in practice.
机译：在本文中，我们考虑了光传输网络的设计引起的光纤路由问题。问题在于找到用于承载需求业务的多个环的最佳路由和波分复用（WDM）系统的最佳位置。该问题可以概念化为具有链路容量约束的Steiner（多个）环问题。我们将问题表述为混合整数编程模型，并开发新的分支剪切程序以及预处理例程和有效不等式，以最佳地解决问题。利用公式固有的特殊结构，我们专注于发展强大的有效不等式，并设计出有效的禁忌搜索启发式方法来解决大规模问题。计算结果表明，预处理规则和有效的不等式提供了一个严格的下界，从而减少了在分支剪切过程框架内解决问题所需的工作。此外，提出的禁忌搜索启发式方法在解决大规模问题方面效果很好。受有希望的计算结果的激励，我们提供了在实践中实施提议的分支切割程序以部署光纤网络的见识。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号