Irrecoverable blockage routing problems and algorithms

For the irrecoverable routing problem, the blocked edge cost (time) is analyzed under the effect of the different starting time of blockages and the after-effect makes the problem unfit for the use of dynamic programming. A new algorithm (MDA) for the irrecoverable blockage routing problem is proposed, that is a modification to the weight computation of Dijkstra algorithm. The complexity of the algorithm is O(n²). A practical analysis is given and the algorithm is validated.