• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>AI communications >Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers
【24h】

Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers

机译：使用冲突驱动的ASP解算器解决路由和波长分配问题

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

摘要

The Routing and Wavelength Assignment (RWA) problem is an optical networking problem that aims to improve data transmission by eliminating optoelectronic conversions through the network. The RWA problem is in the set of NP-complete problems and thus, it is also an interesting problem from a computational point of view. It can be solved in different flavors, being the Static Lightpath Establishment (SLE) the one studied in this work. In this work we define different Answer Set Programming (ASP) encodings for the RWA-SLE problem and study their performance when solving the problem with a state-of-the-art conflict-driven ASP solver: clasp. We investigate the relation between the performance of the ASP encodings and two different characteristics of the encodings: the number of nogoods and loop nogoods generated during search and a new measure for their tightness that we introduce. We also compare the performance of our ASP encodings with the best performing pseudo-Boolean encoding that we presented in a previous work.
机译：路由和波长分配（RWA）问题是一个光学联网问题，旨在通过消除通过网络的光电转换来改善数据传输。 RWA问题在NP完全问题集中，因此，从计算角度来看，它也是一个有趣的问题。可以用不同的方式解决它，这就是本文研究的静态光路建立（SLE）。在这项工作中，我们为RWA-SLE问题定义了不同的答案集编程（ASP）编码，并研究了使用最新的冲突驱动的ASP解算器：clasp解决问题时的性能。我们研究了ASP编码的性能与编码的两个不同特征之间的关系：在搜索过程中产生的杂物和循环杂物的数量，以及引入的紧密度的新度量。我们还将ASP编码的性能与之前工作中介绍的性能最佳的伪布尔编码进行了比较。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号