Article ID: | iaor2017212 |
Volume: | 68 |
Issue: | 1 |
Start Page Number: | 74 |
End Page Number: | 88 |
Publication Date: | Jan 2017 |
Journal: | J Oper Res Soc |
Authors: | Scaparra M, Starita Stefano, OHanley Jesse |
Keywords: | design, simulation, programming: dynamic, programming: integer, heuristics |
This paper focuses on the problem of identifying optimal protection strategies to reduce the impact of flooding on a road network. We propose a dynamic mixed‐integer programming model that extends the classic concept of road network protection by shifting away from single‐arc fortifications to a more general and realistic approach involving protection plans that cover multiple components. We also consider multiple disruption scenarios of varying magnitude. To efficiently solve large problem instances, we introduce a customised GRASP heuristic. Finally, we provide some analysis and insights from a case study of the Hertfordshire road network in the East of England. Results show that optimal protection strategies mainly involve safeguarding against flooding events that are small and likely to occur, whereas implementing higher protection standards are not considered cost‐effective.