1 The vulnerability of road networks under area-covering disruptions Erik Jenelius Lars-Göran Mattsson Div. of Transport and Location Analysis Dept. of.

Slides:



Advertisements
Similar presentations
PMAPS 2012, Istanbul June C. J. Wallnerström, KTH - Royal Insitue of Technology 1 A Pre-Study Towards Investigating the Art of Choosing Right Level.
Advertisements

DROUGHT MONITORING CENTRE - NAIROBI WHAT COULD BE DONE ON DROUGHT WITHIN ISDR PLATFORM?
Vulnerability of Complex Infrastructure Systems Torbjörn Thedéen Safety Research, KTH.
Computer Network Topologies
1 Sårbarhetsanalyser av vägnät - gjort sedan förra mötet Referensgruppsmöte 18 december 2008.
Decision Maths Dijkstra’s Algorithm.
The traveler costs of unplanned transport network disruptions: An activity-based approach Erik Jenelius Royal Institute of Technology, Sweden Lars-Göran.
Fundamentals of Computer Networks ECE 478/578 Lecture #13: Packet Switching (2) Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
1 Developing a Methodology for Road Network Vulnerability Analysis Erik Jenelius Div. of Transport and Location Analysis Dept. of Transport and Economics.
BEN ANDERSON PROJECT MANAGER UNIVERSITY OF LOUISVILLE CENTER FOR HAZARDS RESEARCH AND POLICY DEVELOPMENT Using Dasymetric Mapping.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
CONNECTIVITY “The connectivity of a network may be defined as the degree of completeness of the links between nodes” (Robinson and Bamford, 1978).
Exploring The Relationship Between Urban Morphology And Resilience In A Few Neighbourhoods In Pretoria Darren Nel & Karina Landman University of Pretoria.
The impact of network density, travel and location patterns on regional road network vulnerability Erik Jenelius Lars-Göran Mattsson Div. of Transport.
4-step Model – Trip Assignment 1CVEN672 Lecture 13-1.
Volcano Routing Scheme Routing in a Highly Dynamic Environment Yashar Ganjali Stanford University Joint work with: Nick McKeown SECON 2005, Santa Clara,
University Bus Systems: Network Flow Demand Analysis By Craig Yannes University of Connecticut October 21, 2008.
On the interdependence of routing and data compression in multi-hop sensor networks Anna Scaglione, Sergio D. Servetto.
The Impact of Spatial Correlation on Routing with Compression in WSN Sundeep Pattem, Bhaskar Krishnamachri, Ramesh Govindan University of Southern California.
Norman W. Garrick Trip Assignment Trip assignment is the forth step of the FOUR STEP process It is used to determining how much traffic will use each link.
TRIP ASSIGNMENT.
Transportation Logistics Professor Goodchild Spring 2009.
Automatic loading of inputs for Real Time Evacuation Scenario Simulations: evaluation using mesoscopic models Josep M. Aymamí 15th TRB National Transportation.
GIS Analysis. Questions to answer Position – what is here? Condition – where are …? Trends – what has changed? Pattern – what spatial patterns exist?
Distance Indexing on Road Networks A summary Andrew Chiang CS 4440.
Network and Dynamic Segmentation Chapter 16. Introduction A network consists of connected linear features. Dynamic segmentation is a data model that is.
1 Road network vulnerability Important links and areas, exposed users Erik Jenelius Dept. of Transport and Economics Royal Institute of Technology (KTH)
1 Secondary link importance: Links as rerouting alternatives during road network disruptions Erik Jenelius Centre for Transport Studies / Royal Institute.
From EMME to DYNAMEQ in the city of MALMÖ. THE COMPANY Founded in early 2011 Currently located in Stockholm, Gothenburg and Malmö Small company (currently.
Economics of Extreme Climatic Events By Adil Rasheed (EPFL-ENAC-ICARE-LESO-PB)
Lecture 1 Introduction- Manifestations of Transport and Tourism.
DISPERSITY ROUTING: PAST and PRESENT Seungmin Kang.
Travel Cost Model: an example Sittidaj Pongkivorasin Faculty of Economics, Chulalongkorn University.
1 Road network vulnerability: Identifying important links and exposed regions Erik Jenelius, Tom Petersen, Lars-Göran Mattsson Department of Transport.
Architecture David Levinson. East Asian Grids Kyoto Nara Chang-an Ideal Chinese Plan.
Mapping City Wide Travel Times Andrew Hardin. Project Goal Encouraging alternate transportation – NYC- Bike Share – Boulder’s Transportation Management.
Cognitive ability affects connectivity in metapopulation: A simulation approach Séverine Vuilleumier The University of Queensland.
Economics of Congestion Jagadish Guria Presentation to the the 8th Annual New Zealand Transport Summit 25 February 2008.
The Network Layer.
1 Research methods and models of driver behavior studies.
Xplorah: support for integrated spatial planning in Puerto Rico Xplorah is developed for the Graduate School for Planning of the University of Puerto Rico.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
1 Analysis of in-use driving behaviour data delivered by vehicle manufacturers By Heinz Steven
Intro to Spatial Analysis Most GIS support simple spatial analysis tasks such as selecting, counting, and generating descriptive statistics such as mean.
1 Geography and road network vulnerability Erik Jenelius Div. of Transport and Location Analysis Royal Institute of Technology (KTH), Stockholm.
Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.
Two-Way (Independent) ANOVA. PSYC 6130A, PROF. J. ELDER 2 Two-Way ANOVA “Two-Way” means groups are defined by 2 independent variables. These IVs are typically.
1 Importance and Exposure in Road Network Vulnerability Analysis: A Case Study for Northern Sweden Erik Jenelius Transport and Location Analysis Dept.
Do People Use the Shortest Path? Empirical Test of Wardrop's First Principle Shanjiang Zhu, Ph.D. Research Scientist David Levinson, Ph.D., Professor Contact:
Briefing for Transportation Finance Panel Nov 23, 2015 Economic Analysis Reports: 1.I-84 Viaduct in Hartford 2.I-84/Rt8 Mixmaster in Waterbury 3.New Haven.
Using Population Data to Address the Human Dimensions of Population Change D.M. Mageean and J.G. Bartlett Jessica Daniel 10/27/2009.
A Framework for Network Survivability Characterization Soung C. Liew and Kevin W. Lu IEEE Journal on Selected Areas in Communications, January 1994 (ICC,
Raster Data Models: Data Compression Why? –Save disk space by reducing information content –Methods Run-length codes Raster chain codes Block codes Quadtrees.
Urban Planning Group Implementation of a Model of Dynamic Activity- Travel Rescheduling Decisions: An Agent-Based Micro-Simulation Framework Theo Arentze,
Distance Vector Routing
Risk assessment and Natural Hazards. Concept of vulnerability (e.g. fatalities in two contrasting societies) Deaths 1 …………………………………………
September 2008What’s coming in Aimsun: New features and model developments 1 Hybrid Mesoscopic-Microscopic Traffic Simulation Framework Alex Torday, Jordi.
Perspectives on Efficiency in Transportation David Levinson.
Transportation Planning Asian Institute of Technology
Route Choice Lecture 11 Norman W. Garrick
Data Mining Soongsil University
16장. Networking and Internetworking Devices
1st November, 2016 Transport Modelling – Developing a better understanding of Short Lived Events Marcel Pooke – Operational Modelling & Visualisation Manager.
Computer Network Topologies
Xplorah: support for integrated spatial planning in Puerto Rico
Decision Maths Dijkstra’s Algorithm.
Route Choice Lecture 11 Norman W. Garrick
Xplorah: support for integrated spatial planning in Puerto Rico
Geo-enabling the SDG indicators – experiences from the UN Global Geospatial Management and the GEOSTAT 3 project Agenda item 12 Ekkehard PETRI – Eurostat,
Presentation transcript:

1 The vulnerability of road networks under area-covering disruptions Erik Jenelius Lars-Göran Mattsson Div. of Transport and Location Analysis Dept. of Transport and Economics Royal Institute of Technology (KTH) Stockholm, Sweden INFORMS Annual Meeting 2008, Washington D.C., USA

2 Background Road network a fundament of modern society Disruptions and closures can cause severe consequences for people and businesses Disruptive events may affect extended areas in space, e.g. extreme snowfall, hurricanes, floods, forest fires

3 Background Past applied vulnerability studies focused on identifying important (critical, significant, vital) links Our aim: Study vulnerability to area-covering disruptions –Provide complement to single link failure analysis –Develop methodology for systematic analysis –Apply to large real-world road networks –Gain general insights

4 Methodology Study area is covered with grid of equally shaped and sized cell Each cell represents spatial extent of disruptive event Event representation: All links intersecting cell are closed, remaining links unaffected Hexagonal Square

5 Methodology Multiple, displaced grids used to increase accuracy Advantages of grid approach: –No coverage bias: Each point in study area equally covered –Avoids combinatioral issues with multiple link failures –Easy to combine with frequency data Disadvantages: –Results depend on rotation

6 Consequence model Indicator: Increase in travel time for users Constant, inelastic travel demand x ij Initial link travel times from equilibrium assignment, no change during closure During disruption of cell, two possibilities: 1.No alternative routes Unsatisfied demand, must delay trip until after closure Total delay: 0 τ τ dept. time delay/user

7 Consequence model 2.Alternative routes Users choose new shortest route, or if faster delay trip Total delay: 0 τ τ dept. time delay/user

8 Importance and exposure Cell importance: Total increase in travel time for all users when cell is disrupted Given collection of grids G and closure duration τ, Importance of cell c : Worst-case regional user exposure: Mean increase in travel time per user starting in region when most important cell for region is closed

9 Calculations Initial SP tree from start node using Dijkstra Remove link k in cell by setting long length L If k in SP tree, update tree under k If distance to node L: no alternative route Repeat for all links in cell Repeat for all cells in grids Repeat for all start nodes Calculation time independent of grid size L

10 Case study Swedish road network: 174,044 directed links, 8,764 centroids Three square cell sizes: 12.5 km, 25 km, 50 km 12 hour closure duration Cell size# cells/grid# grids 12.5 km64 x km32 x km16 x 3216

11

12 Cell importance 12.5 km grid

13 Cell importance 25 km grid

14 Cell importance 50 km grid

15 Cell importance Consequences as function of cell size Unsatisfied demand constitutes 97.6% % of total increase in travel time

16 Worst-case county user exposure Exposure depends on concentrated travel demand, not network redundancy In most exposed county, more than 60% of demand unsatisfied

17 Worst-case cell vs. link Area-covering disruption particularly worse in densely populated regions 12 of 21 counties: Worst-case link within worst-case cell

18 Some insights Other factors behind vulnerability to area-covering disruptions compared to single link failures Vulnerability reduced through allocation of restoration resources rather than increasing redundancy Unsatisfied demand constitutes nearly all increase in travel time –Unchanged link travel times may be reasonable assumption –Duration not significant for relative comparisons Results depend on link and demand location and regional partition

19 Thank you!