Real-Time Control Strategies for Rail Transit

Similar documents
Transit Vehicle Scheduling: Problem Description

Workshop on Advances in Public Transport Control and Operations, Stockholm, June 2017

Introduction Runways delay analysis Runways scheduling integration Results Conclusion. Raphaël Deau, Jean-Baptiste Gotteland, Nicolas Durand

Automatic Aircraft Cargo Load Planning with Pick-up and Delivery

PRESENTATION OVERVIEW

A RECURSION EVENT-DRIVEN MODEL TO SOLVE THE SINGLE AIRPORT GROUND-HOLDING PROBLEM

U.Md. Zahir, H. Matsui & M. Fujita Department of Civil Engineering Nagoya Institute of Technology,

Transfer Scheduling and Control to Reduce Passenger Waiting Time

HOW TO IMPROVE HIGH-FREQUENCY BUS SERVICE RELIABILITY THROUGH SCHEDULING

QUEUEING MODELS FOR 4D AIRCRAFT OPERATIONS. Tasos Nikoleris and Mark Hansen EIWAC 2010

Transportation Timetabling

CURRENT SHORT-RANGE TRANSIT PLANNING PRACTICE. 1. SRTP -- Definition & Introduction 2. Measures and Standards

PRAJWAL KHADGI Department of Industrial and Systems Engineering Northern Illinois University DeKalb, Illinois, USA

Service Reliability Measurement using Oyster Data

The impact of scheduling on service reliability: trip-time determination and holding points in long-headway services

DMAN-SMAN-AMAN Optimisation at Milano Linate Airport

CHAPTER 5 SIMULATION MODEL TO DETERMINE FREQUENCY OF A SINGLE BUS ROUTE WITH SINGLE AND MULTIPLE HEADWAYS

Bus Corridor Service Options

BOSTON REGION METROPOLITAN PLANNING ORGANIZATION

American Airlines Next Top Model

Airline Scheduling Optimization ( Chapter 7 I)

Preemptive Rerouting of Airline Passengers under. Uncertain Delays

A Review of Airport Runway Scheduling

Two Major Problems Problems Crew Pairing Problem (CPP) Find a set of legal pairin Find gs (each pairing

RECEDING HORIZON CONTROL FOR AIRPORT CAPACITY MANAGEMENT

Airline Schedule Development Overview Dr. Peter Belobaba

TAXIWAY AIRCRAFT TRAFFIC SCHEDULING: A MODEL AND SOLUTION ALGORITHMS. A Thesis CHUNYU TIAN

Operational Performance

Corridor Analysis. Corridor Objectives and Strategies Express Local Limited Stop Overlay on Local Service 1 Deadhead

Including Linear Holding in Air Traffic Flow Management for Flexible Delay Handling

Inter-modal Substitution (IMS) in Airline Collaborative Decision Making

A Study of Tradeoffs in Airport Coordinated Surface Operations

Lessons Learned from Rebuilding the Muni Subway Schedule Leslie Bienenfeld

UC Berkeley Working Papers

Measuring Bus Service Reliability: An Example of Bus Rapid Transit in Changzhou

Proceedings of the 2014 Winter Simulation Conference A. Tolk, S. Y. Diallo, I. O. Ryzhov, L. Yilmaz, S. Buckley, and J. A. Miller, eds.

Appendix 8: Coding of Interchanges for PTSS

Reliability Analysis of Public Transit Systems Using Stochastic Simulation

2012 Performance Framework AFI

ATTEND Analytical Tools To Evaluate Negotiation Difficulty

Mathematical modeling in the airline industry: optimizing aircraft assignment for on-demand air transport

Integrated Optimization of Arrival, Departure, and Surface Operations

Simulation of disturbances and modelling of expected train passenger delays

A Basic Study on Trip Reservation Systems for Recreational Trips on Motorways

Roadmapping Breakout Session Overview

A Pickup and Delivery Problem for Ridesharing Considering Congestion

Introduction. Chapter 1

We consider the airline fleet assignment problem involving the profit maximizing assignment

Integrated aircraft and passenger recovery with cruise time controllability

Outline. 1. Timetable Development 2. Fleet Size. Nigel H.M. Wilson. 3. Vehicle Scheduling J/11.543J/ESD.226J Spring 2010, Lecture 18

Business Intelligence Development at Winnipeg Transit

Combining Control by CTA and Dynamic En Route Speed Adjustment to Improve Ground Delay Program Performance

Metrics for Evaluating the Impact of Weather on Jet Routes J. Krozel, M. Ganji, S. Yang, J.S.B., Mitchell, and V. Polishchuk 15 th Conf.

MBTA-REALTIME API FOR PERFORMANCE DATA DOCUMENTATION (V 0.9)

A Framework for Coordinated Surface Operations Planning at Dallas-Fort Worth International Airport

Analysis of Operational Impacts of Continuous Descent Arrivals (CDA) using runwaysimulator

An Analytical Approach to the BFS vs. DFS Algorithm Selection Problem 1

ESD Working Paper Series

ERASMUS. Strategic deconfliction to benefit SESAR. Rosa Weber & Fabrice Drogoul

SERVICE NETWORK DESIGN: APPLICATIONS IN TRANSPORTATION AND LOGISTICS

Wake Turbulence Research Modeling

A GRASP for Aircraft Routing in Response to Groundings and Delays

8 CROSS-BOUNDARY AGREEMENT WITH BRAMPTON TRANSIT

ATM Seminar 2015 OPTIMIZING INTEGRATED ARRIVAL, DEPARTURE AND SURFACE OPERATIONS UNDER UNCERTAINTY. Wednesday, June 24 nd 2015

An Appointment Overbooking Model To Improve Client Access and Provider Productivity

Evaluating the Robustness and Feasibility of Integer Programming and Dynamic Programming in Aircraft Sequencing Optimization

Trajectory Based Operations

Load-following capabilities of Nuclear Power Plants. Erik Nonbøl

Reducing Departure Delays at LaGuardia Airport with Departure-Sensitive Arrival Spacing (DSAS) Operations

Scheduling Under Uncertainty: Applications to Aviation, Healthcare and Aerospace

Cross-sectional time-series analysis of airspace capacity in Europe

Aircraft Arrival Sequencing: Creating order from disorder

An Analysis of Dynamic Actions on the Big Long River

Optimal assignment of incoming flights to baggage carousels at airports

arxiv: v1 [cs.oh] 28 Aug 2013

Reducing Garbage-In for Discrete Choice Model Estimation

Optimizing Airport Capacity Utilization in Air Traffic Flow Management Subject to Constraints at Arrival and Departure Fixes

Modelling Airline Network Routing and Scheduling under Airport Capacity Constraints

Att. A, AI 46, 11/9/17

INTEGRATE BUS TIMETABLE AND FLIGHT TIMETABLE FOR GREEN TRANSPORTATION ENHANCE TOURISM TRANSPORTATION FOR OFF- SHORE ISLANDS

REGIONAL AIRPORTS. Learning from Experience - Planning Ahead

Airline Scheduling: An Overview

Scheduling Aircraft Landings under Constrained Position Shifting

4 YORK REGION TRANSIT DON MILLS SUBWAY STATION ACCESS AGREEMENT

Airport Gate Assignment A Hybrid Model and Implementation

Evaluation of Predictability as a Performance Measure

Disruptions in the airline industry: math-heuristics for re-assigning aircraft and passengers simultaneously

A Methodology for Integrated Conceptual Design of Aircraft Configuration and Operation to Reduce Environmental Impact

SAN LUIS OBISPO TRANSIT + SAN LUIS OBISPO RTA JOINT SHORT RANGE TRANSIT PLANS: SERVICE STRATEGIES. Presented by: Gordon Shaw, PE, AICP; Principal

Civil and Enviromental Engineering, Gadjah Mada University. PUBLIC TRANSPORT PLANNING (Frequency, Headway, and Number of Bus)

Estimating Avoidable Delay in the NAS

Total Airport Management Solution DELIVERING THE NEXT GENERATION AIRPORT

Service Reliability Impacts of Computer-Aided Dispatching and Automatic Vehicle Location Technology: A Tri-Met Case Study

Alternatives: Strategies for Transit Systems Change

Predicting Flight Delays Using Data Mining Techniques

Stacey Schwarcz MASTER OF SCIENCE IN TRANSPORTATION. at the. September C 2004 Massachusetts Institute of Technology All rights Reserved

Response of U.S. Air Carriers to On-Time Disclosure Rule

Optimized Itinerary Generation for NAS Performance Analysis

Modeling Crew Itineraries and Delays in the National Air Transportation System

Optimizing Submarine Berthing with a Persistence Incentive

Transcription:

Real-Time Control Strategies for Rail Transit Outline: Problem Description and Motivation Model Formulation Model Application and Results Implementation Issues Conclusions 12/08/03 1.224J/ESD.204J 1

Problem Context High frequency urban rail service (e.g. headways of 2-10 minutes) passengers arrive randomly service regularity is a key goal E(WT) = E(H) [1 + cov(h) 2 ] 2 Branching route structure Central real-time train location information and dispatch capability 12/08/03 1.224J/ESD.204J 2

Three Levels of Control Problems Routine disturbances - several minutes deviation from schedule Control Strategies: speed adjustment dwell time adjustment (selective holding) terminal recovery Short-term disruptions: 5-30 minute blockages on the line Longer-term disruptions - greater than 30 minute blockages Control Strategies: single-track reverse direction operations replacement bus service around blockage 12/08/03 1.224J/ESD.204J 3

Disruption Response Strategies Terminal A short-turn option 1 short-turn option 2 Terminal B X Express train after clearance Blockage Held trains KEY Station Train 12/08/03 1.224J/ESD.204J 4

Problem Description Overall Objective: -- Develop a real-time decision support system to determine control strategies to recover from disruptions Specific Objective: -- Minimize passenger waiting times (implies maintaining even headways) Key Characteristics: -- Instability of even headways -- Passenger sensitivity to long waiting time and crowding -- Cost insensitivity to different strategies Possible Strategies: -- Holding -- Short-turning -- Expressing 12/08/03 1.224J/ESD.204J 5

Example of Transit Control Strategies Vehicle Stop T1Õ Blockage T4 T3 T2 T1 S1 S2 4 passengers/ min 20 passengers/ min 6-minute scheduled headways 3-minute minimum safe headway 10-minute disruption impact set includes trains T2, T3, and T4 and stations S1 and S2 12/08/03 1.224J/ESD.204J 6

Example Results 1. Do nothing: h T 2 = 6 mins.; h T3 = 16 mins.; h T4 = 3 mins. Total Passenger Waiting Time = 1 [ 2 4(162 + 3 2 )] + 1 [ 2 20(62 +16 2 + 3 2 )] = 3540 pass mins. 2. Holding: Hold T2 at S2 for 4 mins. Then at S2: h T 2 = 10 mins.; h T3 = 12 mins.; h T4 = 3 mins. TPWT = 1 [( 2 4(16 2 + 3 2 ) +20(10 2 + 12 2 + 3 2 ))] = 3060 pass mins. 3. Expressing: Express T3 past S1 to save 1 minute in travel time. Then at S2: h T 2 = 6 mins.; h T3 = 15 mins.; h T4 = 4 mins. TPWT = 1 [ 2 4*192 + 20(6 2 +15 2 + 4 2 )] = 3492 pass mins. 12/08/03 1.224J/ESD.204J 7

Model Formulation Key Features: station specific parameters: passenger arrival rates, alighting fractions, minimum safe headways station dwell time a linear function of passengers boarding, alighting and crowding train order is variable train capacity constraint Simplifications: predictable disruption length passenger flows estimated from historical data system is modelled as deterministic strategies selected to produce minimum inter-station travel times. 12/08/03 1.224J/ESD.204J 8

Model Formulation Decision Variables: departure time of train i from station k Objective function: minimization of passenger waiting time quadratic function approximated by a piecewise linear function Impact Set: consider a finite set of trains and stations and approximate the effects beyond this set Constraints: train running time and minimum safe headways other relationships govern passenger loads, train dwell times Model Structure: mixed integer program except if passenger capacity is not binding when it is a linear program 12/08/03 1.224J/ESD.204J 9

Specific Models Holding Strategy Models: Hold all Hold once Hold at first station Combined Short-turning and Holding Models: Predetermined train order Undetermined train order 12/08/03 1.224J/ESD.204J 10

Model Application MBTA Red Line Characteristics: 23 stations (including 3 terminals) 27 six-car trains in A.M. peak 3.4 minute trunk headways (6 and 8 minutes on branches) 30,000 passengers in peak hour 12/08/03 1.224J/ESD.204J 11

Red Line Ashmont North Park Street Harvard Square Alewife Kendall/MIT Blockage Location, Incident 1 Blockage Location, Incident 2 Braintree KEY: Ashmont Train Braintree Train Station Blockage 12/08/03 1.224J/ESD.204J 12

Incident 1, Ten Minute Delay Control Strategies FOHPC STPP Passenger Waiting Time Do Hold Hold Hold at Hold (Passenger-Minutes) Nothing All Once First All Ahead of Blockage 11202 8863 8931 8961 9997 Savings (percent) 15% 14% 14% 8% Behind Blockage 4791 4763 4753 Savings (percent) 0% 0% Maximum Train Load 988 603 614 666 603 Problem Size 95 95 95 88 CPU Time (seconds) 22 37 21 16

Incident 1, Twenty Minute Delay Control Strategies FOHPC STPP Passenger Waiting Time Do Hold Hold Hold at Hold (Passenger-Minutes) Nothing All Once First All Ahead of Blockage 36868 16934 17306 17385 16836 Savings (percent) 43% 42% 42% 43% Behind Blockage 9218 7833 6842 Savings (percent) 3% 5% Maximum Train Load 1646 666 759 805 651 Problem Size 95 95 95 88 CPU Time (seconds) 25 82 27 17

Incident 2, Ten Minute Delay Control Strategies FOHPC STPP Passenger Waiting Time Do Hold Hold Hold at Hold (Passenger-Minutes) Nothing All Once First All Ahead of Blockage 32495 23101 24465 25327 23016 Savings (percent) 25% 21% 19% 25% Behind Blockage 5593 5320 5404 Savings (percent) <1% <1% Maximum Train Load 1336 1137 964 985 776 Problem Size 69 69 69 78 CPU Time (seconds) 17 274 23 12

Incident 2, Twenty Minute Delay Control Strategies FOHPC STPP Passenger Waiting Time Do Hold Hold Hold at Hold (Passenger-Minutes) Nothing All Once First All Ahead of Blockage 88204 48978 52620 55487 38244 Savings (percent) 41% 37% 34% 52% Behind Blockage 6773 6124 5964 Savings (percent) <1% <1% Maximum Train Load 1653 1422 1343 1307 1200 Problem Size 69 69 69 78 CPU Time (seconds) 25 2458 763 62

Impact Set Size Passenger Waiting Time Saved (minutes) 45000 40000 35000 30000 25000 20000 15000 10000 5000 0 Incident 1, Twenty Minute Delay 0 1 2 3 4 5 6 7 8 Number of Trains Held 12/08/03 1.224J/ESD.204J 17

Passenger On-Board Time Passenger Time Incident Delay Objective Function Waiting On-Board Total (Weighted) 1 10 Min. PWT 8961 1543 9578 TPT 9074 271 9182 1 20 Min. PWT 17385 2372 18334 TPT 17659 806 17982 2 10 Min. PWT 23411 8666 26877 TPT 23702 5920 26070 2 20 Min. PWT 50018 17617 57065 TPT 51201 10488 55396

Execution Times Sun SPARC 20 workstation GAMS V. 2.25 CPLEX V. 3.0 Simple front-end heuristic to fix some binary variables Large Problems: Execution Time: Realistic Size: Execution Time: 11-13 trains, 69-95 train/station decision var. 10 out of 16 <30 sec. 7-8 trains, 40-50 train/station decision var. 16 out of 16 <34 sec. 12/08/03 1.224J/ESD.204J 19

Conclusions Holding and short-turning models formulated and solved to optimality Active control strategies result in significant passenger waiting time savings Train control set can be reduced to trains ahead of the blockage Train control set need not be large 12/08/03 1.224J/ESD.204J 20

Conclusions Hold at First or Hold Once strategies can be almost as effective as Hold All strategy Short-turning most effective where: -- blockage is long relative to short-turn time -- number of stations outside the short-turn loop is small Consideration of on-board time is desirable Execution time is 30 seconds or less but faster heuristics are probably achievable 12/08/03 1.224J/ESD.204J 21