Strategies to cope with disruptions in urban public transportation networks Evelien van der Hurk Department of Decision and Information Sciences Complexity.

Slides:



Advertisements
Similar presentations
Introduction to Transportation Systems. PART II: FREIGHT TRANSPORTATION.
Advertisements

OVERVIEW OF CMAPS ADVANCED TRAVEL MODEL CADRE Kermit Wies, Deputy Executive Director for Research and Analysis AMPO Modeling Group, November 2010.
A Decision Support System for Improving Railway Line Capacity G Raghuram VV Rao Indian Institute of Management, Ahmedabad.
A Topological Interpretation for Mass Transit Network Connectivity July 8, 2006 Chulmin Jun, Seungjae Lee, Hyeyoung Kim & Seungil Lee The University of.
Chapter 8 – Logistic Regression
Theoretical Maximum Capacity as a Benchmark for Empty Vehicle Redistribution in Personal Rapid Transit John D. Lees-Miller 1,2 Dr. John C. Hammersley 2.
10 December J/ESD.204J Lecture 13 Outline Real Time Control Strategies for Rail Transit Prior Research Shen/Wilson Model Formulation Model Application.
Company confidential Prepared by HERE Transit Sr. Product Manager, HERE Transit Product Overview David Volpe.
Enhanced analytical decision support tools The Scheme level Final workshop of the DISTILLATE programme Great Minster House, London Tuesday 22 nd January.
Erasmus Center for Optimization in Public Transport 1 Shunting passenger train units: Practical planning aspects Ramon Lentink, Pieter-Jan Fioole, Dennis.
11 Quantifying Benefits of Traffic Information Provision under Stochastic Demand and Capacity Conditions: A Multi-day Traffic Equilibrium Approach Mingxin.
Capacity for Rail KAJT Dagarna, Dala-Storsund Pavle Kecman - LiU Anders Peterson - LiU Martin Joborn – LiU, SICS Magnus Wahlborg - Trafikverket.
Trip Reconstruction Tool for GPS- Based Personal Travel Surveys Eui-Hwan Chung.
Passenger travel behavior model in railway network simulation Ting Li Eric van Heck Peter Vervest Jasper Voskuilen Dept. Of decision and information sciences.
Decision for the location of Intermodal terminals in a rail-road network Anupam Kulshreshtha IIM - Lucknow.
Luis Cadarso(1), Vikrant Vaze(2), Cynthia Barnhart(3), Ángel Marín(1)
Route Planning and Evaluation
Implementing a Blended Model System to Forecast Transportation and Land Use Changes at Bob Hope Airport 15 th TRB National Transportation Planning Applications.
US Amtrak Network Major Josiah Pickett Captain Philip Zlatsin Lieutenant Brett Robblee 1.
An Empirical Comparison of Microscopic and Mesoscopic Traffic Simulation Paradigms Ramachandran Balakrishna Daniel Morgan Qi Yang Caliper Corporation 14.
Mobile Ghent Mobile positioning data and transport: a theoretical, methodological and empirical discussion 24 October 2013 Bert van Wee Delft University.
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Ann Melissa Campbell, Jan Fabian Ehmke 2013 Service Management and Science Forum Decision.
Bus Management System in SEOUL Metropolitan Area.
Integrated Tactical and Operational Planning of Police Helicopters Martijn Mes Department of Industrial Engineering and Business Information Systems University.
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.
Modelling of Trips using Strategic Park-and-Ride Site at Longbridge Railway Station Seattle, USA, Oct th International EMME/2 Users Conference.
MIT ICAT ICATMIT M I T I n t e r n a t i o n a l C e n t e r f o r A i r T r a n s p o r t a t i o n Virtual Hubs: A Case Study Michelle Karow
Transportation leadership you can trust. presented to TRB Planning Applications Conference presented by Vamsee Modugula Cambridge Systematics, Inc. May.
Some network flow problems in urban road networks Michael Zhang Civil and Environmental Engineering University of California Davis.
Innovative ITS services thanks to Future Internet technologies ITS World Congress Orlando, SS42, 18 October 2011.
Regional Traffic Simulation/Assignment Model for Evaluation of Transit Performance and Asset Utilization April 22, 2003 Athanasios Ziliaskopoulos Elaine.
“An Iterative Capacity Constrained Parking Methodology for Ridership Forecasts for BART Extension Stations” Mike Aronson May 19, th TRB National.
Industrial Project (236504) Transportation task planning algorithms ClickSoftware Project Requirements Students: Noam Lavie, Ori Shalev Supervisors: Israel.
Master’s Thesis Competition Date Monday, 17 th May ‘10.
On Activity-Based Network Design Problems JEE EUN (JAMIE) KANG, JOSEPH Y. J. CHOW, AND WILL W. RECKER 20 TH INTERNATIONAL SYMPOSIUM ON TRANSPORTATION AND.
Comparing Dynamic Traffic Assignment Approaches for Planning
Development of a New Efficient and Accurate Available Bandwidth Estimation Method Péter Hága Attila Pásztor István Csabai Darryl Veitch Viktória Hunyadi.
Highway Risk Mitigation through Systems Engineering.
Network Optimization Problems
Dynamics of Traffic Flows in Combined Day-to-day and With- in Day Context Chandra Balijepalli ITS, Leeds September 2004.
Network effects from improved traffic signals Kristina Schmidt Transek AB.
Valuation of Travel Time Uncertainty & Delays Joel P. Franklin Assistant Professor, KTH – Transport and Location Analysis.
Simulation of Non-Recurrent Road Congestion CASA Seminar Ed Manley EngD Candidate University College London Supervisors Dr Tao Cheng (UCL) Prof Alan Penn.
1 Challenge the future Feed forward mechanisms in public transport Data driven optimisation dr. ir. N. van Oort Assistant professor public transport EMTA.
Experimental Evaluation of Real-Time Information Services in Transit Systems from the Perspective of Users Antonio Mauttone Operations Research Department,
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:
A Tour-Based Urban Freight Transportation Model Based on Entropy Maximization Qian Wang, Assistant Professor Department of Civil, Structural and Environmental.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
1 Simple provisioning, complex consolidation – An approach to improve the efficiency of provisioning oriented optical networks Tamás Kárász Budapest University.
Capacity-constrained Traffic Assignment in Network with Residual Queues and Implementation in EMME/2 Tel.: , 16th.
CE Urban Transportation Planning and Management Iowa State University Calibration and Adjustment Techniques, Part 1 Source: Calibration and Adjustment.
12/08/ J/ESD.204J1 Real-Time Control Strategies for Rail Transit Outline: Problem Description and Motivation Model Formulation Model Application.
Kent Route Director Andrew Munden November Agenda Introduction Network Rail’s Role Network Capacity Network Constraints Timetable Development Process.
2/14/2016  A. Orda, A. Segall, 1 Queueing Networks M nodes external arrival rate (Poisson) service rate in each node (exponential) upon service completion.
Highway Risk Mitigation through Systems Engineering.
A Novel Timing-Driven Global Routing Algorithm Considering Coupling Effects for High Performance Circuit Design Jingyu Xu, Xianlong Hong, Tong Jing, Yici.
Mining Resource-Scheduling Protocols Arik Senderovich, Matthias Weidlich, Avigdor Gal, and Avishai Mandelbaum Technion – Israel Institute of Technology.
TRAFFIC STUDY AND FORECASTING SHRI DEVI POLYTECHINIC
Use Survey to Improve the DFX Transit Model
T-Share: A Large-Scale Dynamic Taxi Ridesharing Service
1st November, 2016 Transport Modelling – Developing a better understanding of Short Lived Events Marcel Pooke – Operational Modelling & Visualisation Manager.
Kent Route Director Andrew Munden
Erasmus University Rotterdam
Karen Tsang Bureau of Transport Statistics Department of Transport
A Modeling Framework for Flight Schedule Planning
Fuzzy Dynamic Traffic Assignment Model
Routing and Logistics with TransCAD
Transit Path-Building: “To Multipath or Not to Multipath”
Network Models Robert Zimmer Room 6, 25 St James.
Sample ‘Scheduling Process’
Presentation transcript:

Strategies to cope with disruptions in urban public transportation networks Evelien van der Hurk Department of Decision and Information Sciences Complexity in Public Transport:

AN INTRODUCTION From Rotterdam, The Netherlands

AN INTRODUCTION From Rotterdam, The Netherlands Collaboration with Netherlands Railways

AN INTRODUCTION From Rotterdam, The Netherlands Collaboration with Netherlands Railways Thesis focus on –analysing passenger flows/behavior –Disruption Management –Interaction between passenger and logistic system

AN INTRODUCTION From Rotterdam, The Netherlands Collaboration with Netherlands Railways Thesis focus on –analysing passenger flows/behavior –Disruption Management –Interaction between passenger and logistic system 3 months at MIT, Prof Larson, Prof Sussman, Prof Wilson

RESEARCH QUESTION Is it possible to use the interaction between passenger route choice, the operations, and operation's control to increase service level by dynamically changing the network structure?

AN EXAMPLE CLOSE TO HOME – MBTA NETWORK

LONGFELLOW BRIDGE CLOSURE - MBTA’S PLAN

PLANNING SHUTTLES

THE LINE PLANNING PROBLEM – EXAMPLE NETWORK Station Red Line Broadway Downtown crossing Kendall/MIT Back Bay Community College Orange Line

THE LINE PLANNING PROBLEM – EXAMPLE NETWORK Station Red Line Orange Line Entrance Exit Enter, exit and transfer arcs Choose line with operating frequency and capacity Broadway Downtown crossing Kendall/MIT Back Bay Community College

THE LINE PLANNING PROBLEM – EXAMPLE NETWORK Station Red Line Orange Line Entrance Exit Enter, exit and transfer arcs Broadway Downtown crossing Kendall/MIT Back Bay Community College shuttle 1 shuttle 2 Choose lines and shuttles with operating frequency and capacity

LINE PLANNING MODEL

SUMMARY Is it possible to use the interaction between passenger route choice, the operations, and operation's control to increase service level by dynamically changing the network structure? Planned Disruptions Network effects Both Passengers and Logistics Practical examples (but theoretical model) –MBTA – longfellow bridge –TfL – to be decided Outcome: plan for logistics & plan for detour of passengers

CASE STUDY OF LONGFELLOWBRIDGE

DISCUSSION

MOTIVATION – DEDUCTION OF PASSENGER’S ROUTE CHOICE Knowledge on passenger route choice provides Estimate demand for capacity Test assumptions on passenger behavior and route choice Hind-sight analysis of passenger service (delays) Forecasting of future denand and effects in network So far: Surveys and panel data to deduce route choice Models for route choice: maximum utilitym regret minimization,… Now: Automated Fare Collection (AFC) Systems generetae detailed data on journeys Question: Can we deduce route choice from the Automated Fare Collection Systems data?

PROBLEM OVERVIEW ROUTE DEDUCTION FROM AFC Which route (time, space, trains) did a passenger take? Station AStation B Platform iPlatform k ci co timeci co trains Time +Station Conductor check

DATA Smart card data –Origin station, destination station, start time, end time, card id Realized timetable –Departure time station, arrival time station, train number Conductor checks –Card id, time, train number General:  5 days  Over 500,000 journeys,  about 1/3 with conductor check  full Dutch Railway network of Netherlands Railways trains  Comparison between disrupted and non disrupted days

MODEL Generate Paths Based on Realized Timetable Link a route to a path: –Find the set of routes leading from O to D that fit within the time interval of check-in, check out –If multiple routes fit, select one based on: 1) First Departure (FD) 2) Last Arrival (LA) 3) Least Transfers (LT) 4) Selected Least Transfers Last Arrival (STA) Check accuracy of matching based on conductor checks: –does assigned route have train?

MODEL - SCHEMATIC

EXAMPLE Journey: FromToDepatureArrivalCard ID AB8:008:46xxyy

DepartureArrivalTransfersTrain Numbers 7:558: :028:432100,200,300 8:058: :058:431200,300 8:208: :328:571400,500 EXAMPLE – STEP 1 ROUTE GENERATION (PREPROCESSING) FromToDepatureArrivalCard ID AB8:008:46xxyy Journey: Preprocessing – Route generation. Results for A-B:

DepartureArrivalTransfersTrain Numbers 7:558: :028:432100,200,300 8:058: :058:431200,300 8:208: :328:571400,500 EXAMPLE – STEP 2 ROUTE SELECTION FromToDepatureArrivalCard ID AB8:008:46xxyy Journey: Select Routes within check-in and check-out

EXAMPLE – STEP 2 ROUTE SELECTION FromToDepatureArrivalCard ID RotterdamAmsterdamxxyy Journey: Select based on Decision rule. 4 scenarios for decision rules: FD: First Departure LA: Last Arrival LT: Least Transfers STA: Selected least Transfers last Arrival

EXAMPLE – STEP 2 ROUTE SELECTION FromToDepatureArrivalCard ID RotterdamAmsterdamxxyy Journey: Select based on Decision rule (tested 4 decision rules) DepartureArrivalTransfersTrain Numbers 7:558: :028:432100,200,300 8:058: :058:431200,300 8:208: :328:571400,500 FD LT + LA STA

EXAMPLE – STEP 3 VALIDATION FromToDepatureArrivalCard ID RotterdamAmsterdamxxyy Journey: Check selection with MCL data : STA is correct choice, Other decision rules or wrong (in example) FromToTimeTrainNumberCard ID CD8:20400xxyy DepartureArrivalTransfersTrain Numbers 8:028:432100,200,300 8:058: :208: FD LT + LA STA

RESULTS Results for 5 days with extended list of journeys, realized timetable Results for 1 day with different settings Extended List: using conductor checks to find addtional routes

CONCLUSIONS / FUTURE WORK Conclusions Method for linking routes up to an accuracy of over 85% Passengers do not travel only on shortest paths Increasing path side based on conductor checks improves linking Based on linking insight into behavior in disruptions can be obtained, e.g. change in arrival at platform when timetable changes Future work Include learning of routes based on historic conductor data Research individual choice rules instead of one global behavioral rule Formulate general rules for route choice of passengers

QUESTIONS? Questions? Suggestions? Thanks for your attention!

DIFFERENCE IN TRAVEL BEHAVIOR Compare in-vehicle travel time differences with departure-arrival travel time differences between normal days and disrupted days: