A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty.
Iago A. CarvalhoThiago F. NoronhaChristophe DuhamelLuiz Filipe M. VieiraVinícius Fernandes dos SantosPublished in: Int. Trans. Oper. Res. (2023)
Keyphrases
- interval data
- shortest path
- shortest path problem
- minmax regret
- shortest path algorithm
- road network
- lagrangian relaxation
- minimum spanning tree
- search algorithm
- routing algorithm
- simulated annealing
- travel time
- optimal path
- path length
- dynamic programming
- combinatorial optimization problems
- combinatorial optimization
- optimal solution
- weighted graph
- search procedure
- tabu search
- shortest distance
- routing problem