A decomposition-based heuristic for stochastic emergency routing problems
作者：
Highlights：
• We consider a network delivery problem under travel-time and deadline uncertainty.
• We propose a heuristic procedure which uses decomposition to address the problem.
• The heuristic allows for flexible decision-making based on risk appetite.
• We experiment on three uncertainty regimes: low, medium, and high.
• Results suggest that greater uncertainty enhances the heuristic’s reliability.
摘要
•We consider a network delivery problem under travel-time and deadline uncertainty.•We propose a heuristic procedure which uses decomposition to address the problem.•The heuristic allows for flexible decision-making based on risk appetite.•We experiment on three uncertainty regimes: low, medium, and high.•Results suggest that greater uncertainty enhances the heuristic’s reliability.
论文关键词：Robust emergency planning,Routing under uncertainty,Decomposition-based algorithms,Crisis management
论文评审过程：Received 20 September 2015, Revised 27 December 2015, Accepted 2 April 2016, Available online 21 April 2016, Version of Record 28 April 2016.
论文官网地址：https://doi.org/10.1016/j.eswa.2016.04.002
