Waikiki Tsunami Preparedness Major Trisha Cobb, USA LT Hamadi Bouaicha, Tunisia Navy OA 4202 Team Project Network Flows and Graphs.

Slides:



Advertisements
Similar presentations
Lee Eubanks Joseph A. Snel. Intro/Backstory Problem Assumptions Graph Elements Questions Formulation Results Relativity Follow-Up Outline.
Advertisements

OA4202 Final Project Monterey Fire Network
Is the shape below a function? Explain. Find the domain and range.
Linear Programming Problem
James Montgomery & Karen Teague. Background  Williams Tank Lines is one of the largest for-hire bulk petroleum carriers in California (Fuel Transport.
Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 8 Network models.
1 Routing and Wavelength Assignment in Wavelength Routing Networks.
DMOR Networks. Graphs: Koenigsberg bridges Leonard Euler problem (1736)
UCLA 2012 Commencement Ceremonies So Young Kim. Order of Presentation I.Introduction II.Mathematical Modeling III.Network System 3.1. Overall Data Description.
Fırat Kılcı Bahar Yetiş Kara, Burçin Bozkaya Locating Temporary Shelter Areas after a Large-Scale Disaster 1.
Transit Vehicle Routing Methods for Large-Scale Evacuation Mark Hickman and Moshe Dror University of Arizona INFORMS November 15, 2011.
Vehicle Flow.
CTC-340 Signals - Basics. Terms & Definitions (review) Cycle - Cycle Length - Interval -. change interval - clearance interval- change + clearance = Yi.
Math443/543 Mathematical Modeling and Optimization
Network Optimization Models: Maximum Flow Problems In this handout: The problem statement Solving by linear programming Augmenting path algorithm.
Previously in Chapter 4 Assignment Problems Network Flow Problems Sequential Decision Problems Vehicle Routing Problems Transportation Problems Staffing.
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results Speaker: Chen-Nien Tsai.
Transportation Model (Powerco) Send electric power from power plants to cities where power is needed at minimum cost Transportation between supply and.
Network Flows Based on the book: Introduction to Management Science. Hillier & Hillier. McGraw-Hill.
US Amtrak Network Major Josiah Pickett Captain Philip Zlatsin Lieutenant Brett Robblee 1.
Group 6: Paul Antonios, Tamara Dabbas, Justin Fung, Adib Ghawi, Nazli Guran, Donald McKinnon, Alara Tascioglu Quantitative Capacity Building for Emergency.
Modeling Traffic in St. Louis By Julia Greenberger.
Package Transportation Scheduling Albert Lee Robert Z. Lee.
Earthquake Emergency Response LT Byron Lee LT K. Beth Jasper LT Greg Bauer.
Network Models (2) Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
Introduction to Operations Research
Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.
2007 TRB Planning Application Conference D ELDOT S TATEWIDE E VACUATION M ODEL.
ON SOME GRAPH RELATED PROBLEMS IN TRANSPORTATION ANALYSIS Jaume Barceló, Mª Paz Linares, Oriol Serch
San Quentin Prison Break LT Matt Mooshegian Capt Bryan Jadro.
Mount Rainier Evacuation Plan CPT Cardy Moten III, USA LT Volkan Sozen, Turkish Army.
“Graph theory” for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate professor.
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
Comparing Dynamic Traffic Assignment Approaches for Planning
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.
Route Planning Texas Transfer Corp (TTC) Case 1. Linear programming Example: Woodcarving, Inc. Manufactures two types of wooden toys  Soldiers sell for.
Models in I.E. Lectures Introduction to Optimization Models: Shortest Paths.
Traffic Flow Fundamentals
Network Flow. Network flow formulation A network G = (V, E). Capacity c(u, v)  0 for edge (u, v). Assume c(u, v) = 0 if (u, v)  E. Source s and sink.
August 20, 2015 Transportation Analysis Meeting 2015 Update Tampa Bay Region Roberto O. Miquel, AICP.
EMIS 8374 Network Flow Models updated 29 January 2008.
1 Real-Time Parking Information on Parking-Related Travel Cost TRIP Internship Presentation 2014 Kory Harb July 24, 2014 Advisor: Dr. Yafeng Yin Coordinator:
CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.
CSX EthX Ethanol Transportation LT Brian Kendrick LT Corey Leewright LT Mike Blackman.
Network Flow Problems Example of Network Flow problems:
Model 5 Long Distance Phone Calls By Benjamin Cutting
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.
Introduction CE331 Transportation Engineering Fall 2013 Dr. Reg Souleyrette.
Spatial Networks Introduction to Spatial Computing CSE 5ISC Some slides adapted from Shashi Shekhar, University of Minnesota.
Facility Location and Network Design Models. Facility Location Assumptions Based on graph G=(V,E) Demand nodes, I  V, are known and fixed Set J  V of.
Balanced Billing Cycles and Vehicle Routing of Meter Readers by Chris Groër, Bruce Golden, Edward Wasil University of Maryland, College Park American University,
Wavelength-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study Dhritiman Banergee and Biswanath Mukherjee,
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Introduction to Spatial Computing CSE 5ISC
1st November, 2016 Transport Modelling – Developing a better understanding of Short Lived Events Marcel Pooke – Operational Modelling & Visualisation Manager.
Network Models Please carefully study the following examples:
Kinematics Assignments.
Routing and Logistics with TransCAD
Transportation, Assignment and Network Models
Introduction Basic formulations Applications
Network Models 7-1.
Chapter 5 Network Modeling.
Maximum Flow Neil Tang 4/8/2008
Transportation Engineering Calculating Signal Delay February 23, 2011
Network Flow Problems – Maximal Flow Problems
Presentation transcript:

Waikiki Tsunami Preparedness Major Trisha Cobb, USA LT Hamadi Bouaicha, Tunisia Navy OA 4202 Team Project Network Flows and Graphs

Introduction 2

Problem Statement Analyze Waikiki evacuation preparedness Given: – 30 min – 20,000 evacuees – One-way roads with choke points – County assigned disaster shelters 3

Assumptions Rational actors 2 pax per vehicle 20,000 will attempt to evac Simplified Network Everyone traveling at the same rate and departing at the same time No public transportation 4

5 Objective: maximize the number of evacuees during a limited laps of time (MOE) Constraints : Must evacuate people from starting points to shelters : Supply points All evacuees must be directed to shelters Can’t have evacuees in others locations than hotels and shelters Maximum Capacity of roads and bridges (during all the evacuation time) ESet of nodes : departure points, route intersections, shelters,… y ij Decision variables: flow over edge vMaximum number of people that we can evacuate u ij Edges capacities = length * # lanes* max Evac Time* constant (pax per car, #cars/lane/mile)

Simplified Network Design 6 Hotels Choke Shelter end

Network 9

30% Analysis 70% 8% 43% 22% 27%

Rate of Travel (mph) Sensitivity Analysis

Rate of Travel (mph) Sensitivity Analysis

Rate of Travel (mph) Sensitivity Analysis

Adding a Bridge

Walk

Adding a Bridge

4% 11% 13% 13 One Interdiction

Two Interdictions 4% 11% 13 2,119 evacuate 1 1

Three Interdictions 3% evacuate

Future Considerations Logistics rebuilding of Waikiki Time layering with an exponential arrival rate Varying road capacity based on time of day 20

Conclusion

Questions 22