Heuristic for finding reliable and robust paths in dynamic networks

In this paper we propose an new heuristic criterion to determine the most critical arc of a robust path in a semi dynamic graph. A robust path is defined as a collection of deviation paths covering the critical arcs. This heuristic rely on arcs fault probabilities to determine which arc of the robust path is the most critical. We experimentaly compare this heuristic with others criterions.