An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
In telecommunication networks design the problem of obtaining optimal (arc or node) disjoint paths, for increasing network reliability, is extremely important. The problem of calculating k (c) disjoint paths from s to t (two distinct nodes), in a network with k (c) different (arbitrary) costs on every arc such that the total cost of the paths is minimised, is NP-complete even for k (c) =2. When k (c) =2 these networks are usually designated as dual arc cost networks. In this paper we propose an exact algorithm for finding the whole set of arc-disjoint path pairs, with minimal cost in a network with dual arc costs. The correctness of the algorithm is based on a condition which guarantees that the optimal path pair cost has been obtained and on a proposition which guarantees that at the end of the algorithm all the optimal pairs have been obtained. The optimality condition is based on the calculation of upper and lower bounds on the optimal cost. Extensive experimentation is presented to show the effectiveness of the algorithm.
dual arc costs or in telecommunications paths with minimal cost sum