Find-reassemble-path algorithm for finding node disjoint paths in telecommunications networks with two technologies

In this paper, we present a new algorithm, the find-reassemble-path algorithm, for finding two node disjoint paths with lower cost than the original heuristics. We use the approach that reverses the directions of the arcs of the first shortest path, instead of deleting all the nodes on the path and all the arcs incident to the path, and then find second paths on the new graph. Finally, we use these two paths to reassemble into two node disjoint paths. There are four major steps in this algorithm. The first two steps are used to find paths and the last two steps are used to reassemble paths.