Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

Heuristic algorithm for multi-constrained shortest link-disjoint paths

NI Mingfang1,GAO Shiyun1,MA Feng1,WU Chuanxin1,CHEN Jianwen2(1.College of Communications Engineering,PLA Univ.of Sci.& Tech.,Nanjing 210007,China; 2.Department of Informatization of the General Staff Headguarters,Beijing 100840,China)  
To solve the multi-constrained shortest link-disjoint paths(MCSDP(k)) problem,a heuristic integer program algorithm was proposed and the searching scheme was given.Based on a nice feature of the integer linear constrains set,the complicated constrains were penaltied in the objective function by Lagrangian multipliers,then an integer linear program problem of which the constrains coefficients matrix is totally unimodular was reformulated.This integer linear problem can be solved efficiently by using simplex algorithm and the MCSDP(k) can be found in the iterative process of solving the linear programming problems.Experiments demonstrate that the algorithm proposed is fast and effective.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved