Modeling Attacks to Chesapeake Bay Shipping LT Sarah Watson LT Matt Yokeley.

Slides:



Advertisements
Similar presentations
PORT SECURITY: A CHALLENGE FOR THE HEMISPHERE
Advertisements

ITS THE FINAL LECTURE! (SING IT, YOU KNOW YOU WANT TO) Operations Research.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Chapter 11 To accompany Quantitative Analysis for Management, Eleventh Edition, Global Edition by Render, Stair, and Hanna Power Point slides created by.
Restoring Estuaries: Chesapeake Bay
Network Optimization Models: Maximum Flow Problems
Network Optimization Models: Maximum Flow Problems In this handout: The problem statement Solving by linear programming Augmenting path algorithm.
© 2008 Prentice-Hall, Inc. Chapter 12 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides.
Transportation, Assignment, Network Models
Earthquake Emergency Response LT Byron Lee LT K. Beth Jasper LT Greg Bauer.
Multi-Commodity Flow Joe Monahan Josh Onuska. Back Story N.S. - Largest rail shipper of automobiles Scope – Exclusive deal with Ford (1.9 million sold.
Cocaine Trafficking Network within the United States LT Young LT Foster LT Carline.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Afghanistan Illegal Drug Trade LT Dan Ryan Capt Steve Felts Capt Bethany Kauffman.
and 6.855J The Capacity Scaling Algorithm.
Networks and the Shortest Path Problem.  Physical Networks  Road Networks  Railway Networks  Airline traffic Networks  Electrical networks, e.g.,
It’s Not Easy Being Green Jill Buerck, Southeast Missouri State University Gretchen A. Koch, Goucher College Sarah Schubert, Southeast Missouri State University.
ENGM 732 Network Flow Programming Network Flow Models.
Section 2.9 Maximum Flow Problems Minimum Cost Network Flows Shortest Path Problems.
 LCDR Hui Lee  LCDR Ashwin Anupdev  03 Nov 2011.
Traffic Flow Jerusalem to Tel Aviv Kiong Teo Yuval Nevo Steve Hunt.
Network-Based Optimization Models Charles E. Noon, Ph.D. The University of Tennessee.
EMIS 8373: Integer Programming “Easy” Integer Programming Problems: Network Flow Problems updated 11 February 2007.
CALIFORNIA NATURAL GAS PIPELINE SYSTEM LT SEZGIN OZCAN LT MEHMET BUHUR.
CS 4407, Algorithms University College Cork, Gregory M. Provan Network Optimization Models: Maximum Flow Problems In this handout: The problem statement.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
EMIS 8374 Network Flow Models updated 29 January 2008.
& 6.855J & ESD.78J Algorithm Visualization The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem.
The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem Thanks to Jim Orlin & MIT OCW.
CSX EthX Ethanol Transportation LT Brian Kendrick LT Corey Leewright LT Mike Blackman.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
SOUTHWEST PASS AREA Examples of the Known Effects to Navigation Due to Channel Narrowing Associated Branch Pilots for the Port of New Orleans Associated.
Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Network Problems A D O B T E C
Capt. Mike Lorino, President Capt. Michael Miller, Vice President Associated Branch Pilots for the Port of New Orleans Southwest Pass Area Examples of.
Mohammed Alzaaq MS GIS Program University of Redlands.
Network Models Chapter 12
Graph Theory and Optimization
Protection of Critical Infrastructure
ENGM 535 Optimization Networks
Network Models Chapter 12
Chapter 12 Network Models 12-1
Dijkstra’s Algorithm with two levels of buckets
The Shortest Augmenting Path Algorithm for the Maximum Flow Problem
Transportation, Assignment and Network Models
Transportation of oil BY DR. GHULAM ABBAS.
Chapter 3 Dynamic Programming.
15.082J & 6.855J & ESD.78J Visualizations
Transportation of oil BY DR. GHULAM ABBAS.
Breadth first search animation
Lecture 19-Problem Solving 4 Incremental Method
Spanning Tree Algorithms
and 6.855J Flow Decomposition
Primal-Dual Algorithm
Network Models Chapter 12
15.082J & 6.855J & ESD.78J Radix Heap Animation
The Shortest Augmenting Path Algorithm for the Maximum Flow Problem
The Shortest Augmenting Path Algorithm for the Maximum Flow Problem
and 6.855J The Goldberg-Tarjan Preflow Push Algorithm for the Maximum Flow Problem Obtain a network, and use the same network to illustrate the.
and 6.855J Dijkstra’s Algorithm
Visualizations Dijkstra’s Algorithm
and 6.855J The Goldberg-Tarjan Preflow Push Algorithm for the Maximum Flow Problem Obtain a network, and use the same network to illustrate the.
Eulerian Cycles in directed graphs
Research Paper Overview.
15.082J & 6.855J & ESD.78J Visualizations
A feasible solution for problem 2.
Network Flow Problems – Maximal Flow Problems
15.082J & 6.855J & ESD.78J Visualizations
Virginia Coal Power Generation
Presentation transcript:

Modeling Attacks to Chesapeake Bay Shipping LT Sarah Watson LT Matt Yokeley

Project Overview What is this project about? The goal of this project The scope of this project

Background Terrorism continues to threaten international cargo There is a larger threat to sea born attack than air born Long term effects of shipping attacks =+ $

The Network Chesapeake Bay o Covers 64,299 square miles o More than 150 rivers feed into it Abstraction o One “dummy” start node o Three supply ports o Ends at Chesapeake Lighthouse o 55 arcs

The Model

The Dual

Process Select max number of attackers (x= 1-4) Determine plan of attack Remove attacked arcs from list Find number of CG vessels required to prevent complete network shutdown

Analysis of One Attacker Maximum flow of network = 180,235.3 tons Attackable arcs Optimal arc for terrorist to attack Defended arcs At this point the entire path out of Hampton Roads is protected from attack

Analysis of Two Attackers Maximum flow of network = 180,235.3 tons Attackable arcs Optimal arc for terrorist to attack Defended arcs

Analysis of Three Attackers Maximum flow of network = 180,235.3 tons Attackable arcs Optimal arc for terrorist to attack Defended arcs

Analysis of Four Attackers Maximum flow of network = 180,235.3 tons Attackable arcs Optimal arc for terrorist to attack Defended arcs The terrorist is able to employ this extra attack as a “reserve” to keep the network down

Conclusions It’s possible to shut down all cargo flow by only attacking two arcs Attacker/defender ratio is not one-to-one Compounding increase in goods near the bay entrance causes it to be the major point of concern What’s next? o Model distance from CG stations to attack points o Use probabilities of attack on arcs o Assign priorities to arcs base d on cargo

Questions??