10 December 20031.224J/ESD.204J Lecture 13 Outline Real Time Control Strategies for Rail Transit Prior Research Shen/Wilson Model Formulation Model Application.

Slides:



Advertisements
Similar presentations
Capacity Studies on Transportation Network Presented by Rakesh Ambre ( ) Under Guidance Of Prof. Narayan Rangaraj.
Advertisements

IEOR 4004: Introduction to Operations Research Deterministic Models January 22, 2014.
James Montgomery & Karen Teague. Background  Williams Tank Lines is one of the largest for-hire bulk petroleum carriers in California (Fuel Transport.
Electrical and Computer Engineering Mississippi State University
D2 Roadway Discussion Sound Transit Board September 22, 2011.
Abstract The SEPTA Regional Rail system serves as an important network for the Philadelphia region, moving many commuters during the peak hours on suburb-to-city.
Materials developed by K. Watkins, J. LaMondia and C. Brakewood Network Design Unit 4: Service Planning & Network Design.
Progress in Linear Programming Based Branch-and-Bound Algorithms
Train platforming problem Ľudmila Jánošíková Michal Krempl University of Žilina, VŠB-Technical University of Ostrava, Slovak Republic Czech Republic.
Demand for bus and Rail Analyzing a corridor with a similar Level Of Service 5 th Israeli-British/Irish Workshop in Regional Science April, 2007.
The Disputed Federalist Papers : SVM Feature Selection via Concave Minimization Glenn Fung and Olvi L. Mangasarian CSNA 2002 June 13-16, 2002 Madison,
INFORMS Annual Meeting, San Diego, Oct 11 – 14, 2009 A New, Intuitive and Industrial Scale Approach towards Uncertainty in Supply Chains G.N. Srinivasa.
Rake linking for suburban train services Narayan Rangaraj Industrial Engineering and Operations Research IIT Bombay.
Geometry information from Liufang Ave. North in Beijing Green phase (s): 99,77,66,75,60 Dwell time distribution: N (30,9), N (27,7), N (24,6) Maximal bandwidth:
Materials developed by K. Watkins, J. LaMondia and C. Brakewood Rail Capacity Unit 3: Measuring & Maximizing Capacity.
Center for Engineering Logistics and Distribution (CELDi) An NSF sponsored Industry/University Cooperative Research Center Logistics of Using Underground.
Enhanced analytical decision support tools The Scheme level Final workshop of the DISTILLATE programme Great Minster House, London Tuesday 22 nd January.
ISM 206 Optimization Theory and Applications Fall 2005 Lecture 1: Introduction.
Final Exam Tuesday, December 9 2:30 – 4:20 pm 121 Raitt Hall Open book
Math443/543 Mathematical Modeling and Optimization
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
1 A Second Stage Network Recourse Problem in Stochastic Airline Crew Scheduling Joyce W. Yen University of Michigan John R. Birge Northwestern University.
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
Airline Fleet Routing and Flight Scheduling under Market Competitions
Quadratic Programming Model for Optimizing Demand-responsive Transit Timetables Huimin Niu Professor and Dean of Traffic and Transportation School Lanzhou.
Minimizing Waiting Time at Intermediate Nodes for Intercity Public Bus Transportation Saharidis G.K.D. Dimitropoulos Ch. Skordilis E. Saharidis G.K.D.,
Decision for the location of Intermodal terminals in a rail-road network Anupam Kulshreshtha IIM - Lucknow.
Metro Energy Optimization through Rescheduling: Mathematical Model and Heuristics Compared to MILP and CMA-ES David FOURNIER, PhD CIFRE Inria/GE Transporation,
Quantitative Methods of Management
11/26/ J/ESD.204J1 Transit Crew Scheduling Outline Crew Scheduling Work Rules and Policies Model Formulation Matching Problem Approximation approach.
Arben Asllani University of Tennessee at Chattanooga Prescriptive Analytics CHAPTER 6 Business Analytics with Integer Programming Business Analytics with.
Business Logistics 420 Public Transportation Lecture 20: Transit System Design.
Materials developed by K. Watkins, J. LaMondia and C. Brakewood Service Planning & Standards Unit 4: Service Planning & Network Design.
D Nagesh Kumar, IIScOptimization Methods: M1L3 1 Introduction and Basic Concepts (iii) Classification of Optimization Problems.
Transit Priority Strategies for Multiple Routes under Headway-based Operations Shandong University, China & University of Maryland at College Park, USA.
Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.
Portland North Small Starts Alternatives Analysis Coordination Meeting June 16, 2009.
TRB 88th Annual Meeting, Washington DC January, 2009 Huan Li and Robert L. Bertini Transportation Research Board 88th Annual Meeting Washington, DC January.
New Modeling Techniques for the Global Routing Problem Anthony Vannelli Department of Electrical and Computer Engineering University of Waterloo Waterloo,
Lecture 14 – Queuing Networks Topics Description of Jackson networks Equations for computing internal arrival rates Examples: computation center, job shop.
Managerial Decision Making and Problem Solving
0 Christopher A. Pangilinan, P.E. Special Assistant to the Deputy Administrator Research and Innovative Technology Administration, ITS Joint Program Office.
Hub Location Problems Chapter 12
Portland North Small Starts Alternatives Analysis Coordination Meeting June 15, 2009.
Tactical Planning in Healthcare with Approximate Dynamic Programming Martijn Mes & Peter Hulshof Department of Industrial Engineering and Business Information.
Real-time Bus Arrival Time Prediction: An Application to the Case of Chinese Cities Shandong University, China & University of Maryland at College Park,
Exact and heuristics algorithms
Planning Applications Conference, Reno, NV, May Impact of Crowding on Rail Ridership: Sydney Metro Experience and Forecasting Approach William Davidson,
Column Generation By Soumitra Pal Under the guidance of Prof. A. G. Ranade.
May 2009TRB National Transportation Planning Applications Conference 1 PATHBUILDER TESTS USING 2007 DALLAS ON-BOARD SURVEY Hua Yang, Arash Mirzaei, Kathleen.
Optimal Placement of Energy Storage in Power Networks Christos Thrampoulidis Subhonmesh Bose and Babak Hassibi Joint work with 52 nd IEEE CDC December.
Hcm 2010: BASIC CONCEPTS praveen edara, ph.d., p.e., PTOE
Materials developed by K. Watkins, J. LaMondia and C. Brakewood Frequency Determination Unit 5: Staff & Fleet Scheduling.
Monte-Carlo based Expertise A powerful Tool for System Evaluation & Optimization  Introduction  Features  System Performance.
Transit Signal Priority: The Importance of AVL Data David T. Crout Tri-County Metropolitan Transportation District of Oregon (TriMet) Presented at Transportation.
12/08/ J/ESD.204J1 Real-Time Control Strategies for Rail Transit Outline: Problem Description and Motivation Model Formulation Model Application.
Managerial Economics Linear Programming Aalto University School of Science Department of Industrial Engineering and Management January 12 – 28, 2016 Dr.
Strategies to cope with disruptions in urban public transportation networks Evelien van der Hurk Department of Decision and Information Sciences Complexity.
Operations Research Models and Methods Advanced Operations Research Reference: Operations Research Models and Methods, Operations Research Models and Methods,
Introduction to Integer Programming Integer programming models Thursday, April 4 Handouts: Lecture Notes.
Balanced Billing Cycles and Vehicle Routing of Meter Readers by Chris Groër, Bruce Golden, Edward Wasil University of Maryland, College Park American University,
Lecture 2: Improving Transit Service Through Planning, Design, and Operations This lecture was originally prepared by Dr. Kari Watkins, Georgia Institute.
GRTC Bus Rapid Transit Project July 17, Agenda 1.BRT Concept 2.Project Goals 3.Project Benefits 4.Project Corridor 5.Proposed Multimodal Access.
Lecture 20 Review of ISM 206 Optimization Theory and Applications.
Intermodal Supply Chain Optimization at a Large Retailer Part 1: Model Development Scott J. Mason, Ph.D. Fluor Endowed Chair in Supply Chain Optimization.
Managerial Economics Linear Programming
Karen Tsang Bureau of Transport Statistics Department of Transport
1.206J/16.77J/ESD.215J Airline Schedule Planning
Transit Signal Priority: The Importance of AVL Data
Presentation transcript:

10 December J/ESD.204J Lecture 13 Outline Real Time Control Strategies for Rail Transit Prior Research Shen/Wilson Model Formulation Model Application and Results Implementation Issues Conclusions Follow-on Subjects Final Exam

10 December J/ESD.204J Lecture 13 Prior Research O’Dell and Wilson (1999): Formulated and solved to optimality holding and (restricted) short-turning models Active control strategies resulted in significant passenger wait time savings Train impact set need not be large and can be restricted to trains ahead of the blockage Hold-at-first station strategy is recommended Short-turning is most effective where: –blockage is long relative to short-turn time –number of stations outside short-turn loop is small Solution time is typically 30 seconds or less

10 December J/ESD.204J Lecture 13 Prior Research Limitations: only specified short-turns included in solution expressing not included objective function ignored in-vehicle delay time did not recognize the stochastic nature of disruption duration

10 December J/ESD.204J Lecture 13 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.

10 December J/ESD.204J Lecture 13 Shen/Wilson Model Formulation* Decision variables: departure time of train i from station k short-turning binary variables expressing binary variables Objective function: minimization of weighted sum of passenger waiting time at stations and in-vehicle delay Control set: set of trains and stations where control actions may be applied, typically: –2-4 holding candidates ahead of the disruption –1-2 expressing candidates behind the disruption –1-3 short-turning candidates *Reference: Shen, S. and N.H.M. Wilson, “Optimal Integrated Real-Time Disruption Control Model for Rail Transit Systems”, Computer-Aided Scheduling of Public Transport, Lecture Notes in Economics and Mathematical Systems #505 (S. Voss and J. Daduna, co-editors), pp , April 2001.

10 December J/ESD.204J Lecture 13 Model Formulation Impact set: consider a finite set of trains and stations over which to evaluate the impacts of the control strategies Constraints include: train running time and minimum safe separation train dwell time=f(passengers boarding and alighting) passenger loads and train capacity Model Structure: mixed integer program

10 December J/ESD.204J Lecture 13 Model Simplifications A.Piece-wise linear approximation of quadratic terms in objective function: waiting time holding time B.Simplification of non-separable terms additional waiting time for passengers left behind: – approximate headway by minimum headway in-vehicle delay: – approximate passengers on train by normal passenger load at that time and point on route

10 December J/ESD.204J Lecture 13 Model Applications 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 Simplified system: single loop scaled passenger arrival rates and minimum safe separation on trunk portion of line 6-minute headways

10 December J/ESD.204J Lecture 13 Scenario Description Ashmont Park Street Harvard Square Alewife Kendall/MIT Incident Braintree 10 December 2003 Ashmont Train Braintree Train Station Blockage KEY: North

10 December J/ESD.204J Lecture 13 Control Strategy Mean Platform Waiting Time (min) Mean In- Vehicle Delay (min) Mean Weighted Waiting Time (min) Saving over NC ND NC H % HE % HET % Comparison of Strategy Effectiveness for 10-Minute Disruption Scenario ND = No Disruption NC = No ControlH = Holding Only HE = Holding and Expressing Only HET = Holding, Expressing, and Short-Turning

10 December J/ESD.204J Lecture 13 Control Strategy Mean Platform Waiting Time (min) Mean In- vehicle Delay (min) Mean Weighted Waiting Time (min) Saving over NC NC H % HE % HET % Comparison of Strategy Effectiveness for 20-Minute Disruption Scenario NC = No Control H = Holding OnlyHE = Holding and Expressing Only HET = Holding, Expressing, and Short-Turning

10 December J/ESD.204J Lecture 13 Sensitivity Analysis: Effect of Under-estimating Disruption Duration Blockage Duration Estimate 15 Minutes10 Minutes Control SchemesHHEHETHHEHET Mean Weighted Waiting Time (min) Increase due to Inaccurate Estimate +0.5%+4.0%+14.3% H = Holding OnlyHE = Holding and Expressing Only HET = Holding, Expressing, and Short-Turning

10 December J/ESD.204J Lecture 13 Sensitivity Analysis: Effect of Over-estimating the Disruption Duration Blockage Duration Estimate 5 Minutes10 Minutes Control SchemesH, HE, HETH & HEHET Total Weighted Waiting Time(min) Increase due to Wrong Estimate -+0.6% H = Holding OnlyHE = Holding and Expressing Only HET = Holding, Expressing, and Short-Turning

10 December J/ESD.204J Lecture 13 Solution Times Micron P-II, 300 MHz, 64 MB RAM computer C-PLEX v. 4.0 Solution Times with and without Expressing (in seconds) ScenarioHHEHETHT 10-Minute Minute H = Holding OnlyHE = Holding and Expressing Only HET = Holding, Expressing, and Short-TurningHT = Holding and Short-Turning Only

10 December J/ESD.204J Lecture 13 Conclusions Holding provides 10-18% passenger waiting time savings over the no-control case Expressing provides little incremental benefit over holding Short-turning combined with holding can provide substantial savings: in the case analyzed, 35-57% savings. Holding is not sensitive to errors in estimating disruption deviation, but short-turning can be Solution time is typically less than 30 seconds

10 December J/ESD.204J Lecture 13 Future Directions Develop robust disruption control models recognizing key stochastic elements such as disruption duration, running time, dwell time, and passenger loads Develop fast routine control models incorporating control strategies such as speed variation and dwell time variation

10 December J/ESD.204J Lecture 13 Follow-on Subjects Optimization –15.057Systems Optimization –15.093Optimization Methods –15.094Systems Optimization:Models and Computation –15.081Introduction to Mathematical Programming –15.082Network Optimization –15.083Combinatorial Optimization –15.084Nonlinear Programming Transportation and Logistics/Optimization –1.206J/16.77JAirline Schedule Planning –1.258J/11.541J/Public Transportation Service and ESD.226J Operations Planning –1.270J/ESD.270JLogistics and Supply Chain Management

10 December J/ESD.204J Lecture 13 Final Exam Tuesday, December 16, Room 4-149, 9 AM - noon 1 8.5x11" page of notes, both sides Focus on modeling and basics of optimization