Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
A GRASP and Path Relinking Heuristic for Rural Road Network Development
Journal of Heuristics
Updating Paths in Time-Varying Networks Given Arc Weight Changes
Transportation Science
A shortest path algorithm with novel heuristics for dynamic transportation networks
International Journal of Geographical Information Science
A theory and algorithms for combinatorial reoptimization
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Computers and Operations Research
Reoptimization of the minimum total flow-time scheduling problem
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Reoptimizing the rural postman problem
Computers and Operations Research
| Hi-index | 0.00 |
We propose the first algorithmic approach which reoptimizes the shortest paths when any subset of arcs of the input graph is affected by a change of the costs, which can be either lower or higher than the old ones. This situation is more general than the ones addressed in the literature so far. We analyze the worst-case time complexity of the algorithm as a function of both the input size and the overall cost perturbation, and discuss cases for which the proposed reoptimization method theoretically outperforms the approach of applying a standard shortest path algorithm after the change of the arc costs.