摘要翻译：
约束最优路径(COP)问题出现在许多实际应用中，尤其是在通信网络中。其中一些问题已经通过通常难以扩展的特定技术得到考虑和解决。本文提出了一种新的局部搜索模型，用于通过局部搜索解决一些复杂度问题。该模型具有组合性、模块性、重用性等特点，增强了基于约束的局部搜索的优势。我们还将该模型应用于边不相交路径问题(EDP)。我们证明了侧约束可以很容易地添加到模型中。计算结果表明了该方法的重要性。
---
英文标题：
《A Local Search Modeling for Constrained Optimum Paths Problems (Extended
  Abstract)》
---
作者：
Quang Dung Pham, Yves Deville, Pascal Van Hentenryck
---
最新提交年份：
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中的材料。
--

---
英文摘要：
  Constrained Optimum Path (COP) problems appear in many real-life applications, especially on communication networks. Some of these problems have been considered and solved by specific techniques which are usually difficult to extend. In this paper, we introduce a novel local search modeling for solving some COPs by local search. The modeling features the compositionality, modularity, reuse and strengthens the benefits of Constrained-Based Local Search. We also apply the modeling to the edge-disjoint paths problem (EDP). We show that side constraints can easily be added in the model. Computational results show the significance of the approach.
---
PDF链接：
https://arxiv.org/pdf/0910.1238