论文部分内容阅读
文章研究约束最短链路不相交路径(CSDP(k))问题,该问题分为两类:CSDP(k)-和CSDP(k)-。首先引入问题的整数规划模型,通过拉格朗日乘子将复杂约束引入到目标函数中,接着给出了求解CSDP(k)-的一种快速启发式算法FHABIP,并给出了改进的搜索方案。算法实验结果表明该算法快速有效,能得到最优解或很好的近似最优解。
This paper studies the problem of constrained shortest link disjoint paths (CSDP (k)). The problem is divided into two types: CSDP (k) - and CSDP (k) -. Firstly, the integer programming model of the problem is introduced. The Lagrange multiplier is used to introduce the complex constraints into the objective function. Then, a fast heuristic algorithm FHABIP for solving CSDP (k) - is given and an improved search Program. Experimental results show that the algorithm is fast and efficient, and can obtain the optimal solution or a good approximate optimal solution.