The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms

✍ Scribed by Sherali, Hanif D.; Ozbay, Kaan; Subramanian, Shivaram

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 160 KB
• Volume: 31
• Category: Article
• ISSN: 0028-3045
• DOI: 10.1002/(sici)1097-0037(199807)31:4<259::aid-net6>3.0.co;2-c

✦ Synopsis

In this paper, we examine complexity issues, models, and algorithms for the problem of finding a shortest pair of disjoint paths between two nodes of a network such that the total travel delay is minimized, given that the individual arc delays are time-dependent. Such disjoint paths address the issue of network vulnerability by prescribing alternate routes for traffic flows. Applications include the dispatching of duplicate packets of data to improve the reliability in communication networks and the diverting of traffic during congestion to reduce the chances of bottlenecks in transportation networks, in the presence of time-dependent variations in travel delays in the network. We prove that this problem, and many variations of it, are NP-hard and we develop a 0-1 linear programming model that can be used to solve this problem. This model can accommodate various degrees of disjointedness of the pair of paths, from complete to partial with respect to specific arcs. We also present some computational results obtained by solving the above models using CPLEX-MIP.