Pre distaster planning for transportation networks

313 views

Published on

Meinolf Sellmann's presentation for Cognitive Systems Institute Speaker Series December 4, 2014.

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
313
On SlideShare
0
From Embeds
0
Number of Embeds
4
Actions
Shares
0
Downloads
3
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Pre distaster planning for transportation networks

  1. 1. Pre-Disaster Planning for Transportation Networks Hermann Schichl, MeinolfSellmann Demo: Ali Koc, Yuri Malitsky, Chandra Reddy, Horst Samulowitz
  2. 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. 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. 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. 5. Extreme Linear Resource Constraint
  6. 6. Filtering the Constraint
  7. 7. Pseudo-Polynomial Time Filtering
  8. 8. Istanbul Benchmark
  9. 9. Bay Area Benchmark

×