约束最优路径问题的局部搜索模型（扩展摘要）
A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract)
摘要：
约束最优路径（COP）问题在现实生活中，特别是在通信网络中经常出现。这些问题中的一些已经被考虑并通过通常难以扩展的特定技术解决。在本文中，我们介绍了一种新的局部搜索模型，解决一些COP的局部搜索。该模型具有组合性、模块化、重用性等特点，增强了基于约束的局部搜索的优势。我们还将建模应用于边不相交路径问题（EDP）。我们表明，侧约束可以很容易地添加到模型中。计算结果表明了该方法的有效性。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
