摘要翻译：
本文提出了一种新的方法和基于约束的目标函数来解决与光通信网络设计有关的两个问题，即同步光网络环分配问题(SRAP)和环内同步光网络设计问题(IDP)。这些网络拓扑问题可以表示为一个具有容量约束的图划分，如前人所述。本文提出了一种新的目标函数和一种新的局部搜索算法来解决这些问题。在彗星上进行的实验使我们能够将我们的方法与以前的方法进行比较，并表明我们获得了更好的结果。
---
英文标题：
《Sonet Network Design Problems》
---
作者：
Marie Pelleau, Pascal Van Hentenryck, Charlotte Truchet
---
最新提交年份：
2009
---
分类信息：

一级分类：Computer Science        计算机科学
二级分类：Artificial Intelligence        人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--

---
英文摘要：
  This paper presents a new method and a constraint-based objective function to solve two problems related to the design of optical telecommunication networks, namely the Synchronous Optical Network Ring Assignment Problem (SRAP) and the Intra-ring Synchronous Optical Network Design Problem (IDP). These network topology problems can be represented as a graph partitioning with capacity constraints as shown in previous works. We present here a new objective function and a new local search algorithm to solve these problems. Experiments conducted in Comet allow us to compare our method to previous ones and show that we obtain better results.
---
PDF链接：
https://arxiv.org/pdf/0910.1255