• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>European Conference on Universal Multiservice Networks >Resolution of a WDM network design problem using a decomposition approach and a size reduction method
【24h】

Resolution of a WDM network design problem using a decomposition approach and a size reduction method

机译：使用分解方法和尺寸减少方法解决WDM网络设计问题的解决方案

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Multicommodity flow models have been proposed in the literature to formulate different network design problems as Mixed Integer Linear Programming (MILP) problems. The formulations are important because there are algorithms that find the optimal solution to these problems. However, MILP problems are NP-hard, which makes the solution of design problem instances of non trivial size numerically intractable. In this article we propose a method to tackle the inherent complexity of a WDM network design problem formulated as a multicommodity flow problem. The method allows to solve WDM network design problems of medium size. We first decompose the design problem into two subproblems that can be solved separately. Multicommodity flow models are used to formulate each subproblem as a MILP problem. We then prune the variables' space associated to each subprolem by eliminating from the formulation useless variables. The solution to the design problem is obtained by solving the subproblems sequentially. To take into account the dependency between subproblems, we introduce a feedback mechanism to exchange information between the algorithms that solve the subproblems.
机译：在文献中提出了多个流量模型，以制定不同的网络设计问题作为混合整数线性编程（MILP）问题。配方很重要，因为存在对这些问题的最佳解决方案有算法。然而，MILP问题是NP-HARD，这使得设计问题实例的非琐碎尺寸的解决方案数值棘手的解决方案。在本文中，我们提出了一种解决作为多个流量问题的WDM网络设计问题的固有复杂性的方法。该方法允许解决中等大小的WDM网络设计问题。我们首先将设计问题分解为两个可以单独解决的子问题。多个货流程模型用于将每个子问题标记为MILP问题。然后，我们通过从制定无用变量中消除了与每个分子器相关联的变量的空间。通过顺序解决子问题来获得设计问题的解决方案。要考虑子问题的依赖性，我们介绍了一种反馈机制，以在解决子问题的算法之间交换信息。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号