Pre-Disaster planning aims to strengthen transportation networks by investing in infrastructure to increase the survival probabilities of edges during earthquakes. This reduces the expected shortest path lengths between origin-destination pairs within a limited budget. The problem is computationally difficult as it involves determining which edges to invest in to minimize disruptions, taking into account the complex interactions between network elements and probabilistic failures. The document proposes modeling it as a nonlinear integer program and applies filtering techniques and benchmarks to efficiently solve problems based on real-world networks.

1. Pre-Disaster Planning for Transportation Networks
Hermann Schichl, MeinolfSellmann
Demo: Ali Koc, Yuri Malitsky,
Chandra Reddy, Horst Samulowitz

2. Earthquakes
Edge
Length
Probfail
Probfail-invest
Cost –limited budget C!
O-D Pairs
Cutoff
Cutoff-Penalty
Objective
Minimize Sum of Expected Shortest Path Lengths

3. Properties
•Investments change survival probabilities (first stage affect probabilities in second stage)
•Problem is APX-hard (Steiner trees)
•Problem is not convex, and neither sub-nor super-modular
•Objective is monotone!
A
B
C

4. Formulation as NIP
•Order paths by increasing length for each O/D
•Compute term that specific path is shortest
•Must block all shorter paths -> Set Covering!

5. Extreme Linear Resource Constraint

6. Filtering the Constraint

7. Pseudo-Polynomial Time Filtering

8. Istanbul Benchmark

9. Bay Area Benchmark