Robusta tidtabeller för järnvägstrafik + - Ökad robusthet i kritiska punkter Emma Andersson Anders Peterson, Johanna Törnquist Krasemann.

Slides:



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

Real Time Train SNCF. 1 Agenda Essentials Basic Model Applications Traffic density is getting very high in several networks and management.
Line Balancing Problem A B C 4.1mins D 1.7mins E 2.7 mins F 3.3 mins G 2.6 mins 2.2 mins 3.4 mins.
D2 Roadway Discussion Sound Transit Board September 22, 2011.
Solutions for Scheduling Assays. Why do we use laboratory automation? Improve quality control (QC) Free resources Reduce sa fety risks Automatic data.
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.
Train platforming problem Ľudmila Jánošíková Michal Krempl University of Žilina, VŠB-Technical University of Ostrava, Slovak Republic Czech Republic.
Rake Linking for Suburban Train Services. Rake-Linker The Rake-Linker assigns physical trains (rakes) to services that have been proposed in a timetable.
Linear Programming?!?! Sec Linear Programming In management science, it is often required to maximize or minimize a linear function called an objective.
Transportation Engineering
10 December J/ESD.204J Lecture 13 Outline Real Time Control Strategies for Rail Transit Prior Research Shen/Wilson Model Formulation Model Application.
PROFESSOR GOODCHILD CEE 587 APRIL 15, 2009 Basic Optimization.
Lecture #12 Arterial Design and LOS Analysis. Objectives  Understand the factors in arterial design Understand how arterial LOS is determined.
Stochastic optimization of a timetable M.E. van Kooten Niekerk.
How to get a smoother ride on BART Pamela Williams Susanna Gordon Sandia National Laboratories, CA.
Duality Dual problem Duality Theorem Complementary Slackness
Support Vector Machines Formulation  Solve the quadratic program for some : min s. t.,, denotes where or membership.  Different error functions and measures.
3rd ARRIVAL Review Meeting [Patras, 12 May 2009] – WP3 Presentation ARRIVAL – WP3 Algorithms for Robust and online Railway optimization: Improving the.
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
3rd ARRIVAL Review Meeting [Patras, 12 May 2009] – WP3 Presentation ARRIVAL – WP3 Algorithms for Robust and online Railway optimization: Improving the.
A Probabilistic Method to Determine the Minimum Leakage Vector for Combinational Designs Kanupriya Gulati Nikhil Jayakumar Sunil P. Khatri Department of.
Operation-driven Scheduling Approach for Fast, Frequent and Reliable Railway Services Alfons A.M. Schaafsma, Vincent A. Weeda ProRail, Department of Traffic.
Further Optimization of Economic Functions
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results Speaker: Chen-Nien Tsai.
Linear Programming Example 2 Alternate Optimal Solutions.
Capacity for Rail KAJT Dagarna, Dala-Storsund Pavle Kecman - LiU Anders Peterson - LiU Martin Joborn – LiU, SICS Magnus Wahlborg - Trafikverket.
Optimal Design of Timetables to maximize schedule reliability and minimize energy consumption, rolling stock and crew deployment.
Quadratic Programming Model for Optimizing Demand-responsive Transit Timetables Huimin Niu Professor and Dean of Traffic and Transportation School Lanzhou.
Decision for the location of Intermodal terminals in a rail-road network Anupam Kulshreshtha IIM - Lucknow.
Quantitative Methods of Management
Fair Real-time Traffic Scheduling over Wireless Local Area Networks Insik Shin Joint work with M. Adamou, S. Khanna, I. Lee, and S. Zhou Dept. of Computer.
Flows and Networks Plan for today (lecture 5): Last time / Questions? Blocking of transitions Kelly / Whittle network Optimal design of a Kelly / Whittle.
Computational Experiments Algorithm run on a Pentium IV 2.4 GHz Instances from “Rete Ferroviaria Italiana” For each station: - minimum interval between.
Anders Peterson Fahimeh Khoshniyat Dept. of Science and Technology Linköping University, Norrköping, Sweden 6 th May 2014 Effects of Travel Time Dependent.
OSGi On Rails How the Swiss Railways benefit from Eclipse Technology.
Transit Priority Strategies for Multiple Routes under Headway-based Operations Shandong University, China & University of Maryland at College Park, USA.
ICUAS 2014 Towards Real Time Scheduling for Persistent UAV Service: A Rolling Horizon MILP Approach, RHTA and the STAH Heuristic Byung Duk Song, Jonghoe.
Algorithms for Allocating Wavelength Converters in All-Optical Networks Authors: Goaxi Xiao and Yiu-Wing Leung Presented by: Douglas L. Potts CEG 790 Summer.
Integrated Scheduling and Synthesis of Control Applications on Distributed Embedded Systems Soheil Samii 1, Anton Cervin 2, Petru Eles 1, Zebo Peng 1 1.
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
Industrial Engineering and Optimization Barrett Summer Scholars 2011 Sustainable Engineering: Learning to Engineer Truly Green Products.
Railway Operations: Issues and Objectives Capacity management Infrastructure planning Timetable preparation Management of day-to-day movement of trains.
Hamed Pouryousef ; Pasi Lautala, Ph.D, P.E. Hamed Pouryousef ; Pasi Lautala, Ph.D, P.E. Michigan Tech. University Michigan Tech. University PhD Candidate.
Robust Synchronization of Actuated Signals on Arterials Project # : Simulation-Based Robust Optimization for Actuated Signal Timing and Setting.
V. Cacchiani, ATMOS 2007, Seville1 Solving a Real-World Train Unit Assignment Problem V. Cacchiani, A. Caprara, P. Toth University of Bologna (Italy) European.
Towards a More Fair and Robust Internet Backbone Year 1 Status Report Rene Cruz, Tara Javidi, Bill Lin Center for Networked Systems University of California,
Optimization unconstrained and constrained Calculus part II.
V. Cacchiani, A. Caprara and P. Toth DEIS, University of Bologna TIMETABLING FOR CONGESTED CORRIDORS.
Optimal train rescheduling after conflict detection Sofie Van Thielen, Sofie Burggraeve, Pieter Vansteenwegen KU Leuven, Leuven Mobility Research Centre.
Intelligent Supply Chain Management Strategic Supply Chain Management
12/08/ J/ESD.204J1 Real-Time Control Strategies for Rail Transit Outline: Problem Description and Motivation Model Formulation Model Application.
Calculus-Based Optimization AGEC 317 Economic Analysis for Agribusiness and Management.
Managerial Economics Linear Programming Aalto University School of Science Department of Industrial Engineering and Management January 12 – 28, 2016 Dr.
Q/.r NSRZKLA4-P1 Timetable planning Leo Kroon Sept 9, 2003.
Progress Report - Solving optimal control problem Yoonsang Lee, Movement Research Lab., Seoul National University.
EE141 Project: 32x32 SRAM Abhinav Gupta, Glen Wong Optimization goals: Balance between area and performance Minimize area without sacrificing performance.
The integrated dial-a-ride problem with timetabled fixed route service Marcus Posada, Henrik Andersson and Carl Henrik Häll.
Operations Research.  Operations Research (OR) aims to having the optimization solution for some administrative problems, such as transportation, decision-making,
Scoring the Technical Evaluation Maximum possible score
Ardavan Asef-Vaziri Systems and Operations Management
Optimal Train Scheduling
Balancing Weather Risk and Crop Yield for Soybean Variety Selection
Excel Solver.
? The slope tells us the speed Run into a jungle Stop for 5 sec Walk backwards The slope tells us the speed.
1.206J/16.77J/ESD.215J Airline Schedule Planning
System Optimizations Work Group Update
Modeling and Optimization
Machine Learning Week 3.
MECH 3550 : Simulation & Visualization
Calculus-Based Optimization AGEC 317
Presentation transcript:

Robusta tidtabeller för järnvägstrafik + - Ökad robusthet i kritiska punkter Emma Andersson Anders Peterson, Johanna Törnquist Krasemann

A typical critical point timetable for train 530 (2011)

Robustness in critical points (RCP) A measure with three parts that indicate how robust a critical point are: – The available runtime margins for the operating/overtaking train before the critical point – The available runtime margins for the entering/overtaken train after the critical point. – The headway margin between the trains in the critical point

The three parts of RCP Stations Time D A B C E Train 1 Train 2 Runtime margin for train 2 between station B and C Runtime margin for train 1 between station A and B Headway margin between train 1 and 2 at station B

How to increase RCP Increase some of the three margin parts in the measure – Might increase the trains’ runtime – Might lead to a chain of reactions in the timetable We need a method that can handle all trains at the same time to find the best overall solution – Mathematical programming, optimization, checks all possible train combinations and result in the optimal timetable

How to increase RCP Two ways to use RCP in an optimization model – As an objective function: Maximize RCP – As a constraint: RCP >= ‘120’ seconds At the same time the difference to the initial timetable should be as small as possible: – Minimize T* - T Evaluate the timetable by simulation with disturbances

Work in progress

Experiments for the Swedish Southern mainline Malmö – Alvesta 8 th of September :45 – 07:15 5:30 5:40 5:50 6:00 6:10 6:20 6:30 6:40 6:50 7:00 7:10 7:20

Critical points G H I J K F D C E B L A PointRCP (seconds) A0 B813 C298 D325 E0 F61 G512 H67 I433 J110 K233 L191

Experiments of RCP increase Restrict RCP by constraints: – RCP(p) >= 120 sec – RCP(p) >= 240 sec – RCP(p) >= 300 sec Results: Min RCP Total travel time increase (sec) No. of trains with increased travel time Total change in arr/dep times (sec) No. of trains with changed arr/dep times

5:30 5:40 5:50 6:00 6:10 6:20 6:30 6:40 6:50 7:00 7:10 7:20 RCP (p) >= 120 sec G H I F D C E B L A PointRCP (sec)Diff A B813 C D325 E F G512 H I433 J K L191 J K

Evaluation of RCP increase The trains are re-scheduled in the most optimal way, given the timetable flexibility – The re-scheduling model from EOT is used – Trains can use both tracks flexible – Optimal re-scheduling – Does not represent reality – Objective function: Minimize the difference in dep/arr times at all planned stops – Solver: CPLEX 12.5 Traffic simulation when a train is delayed at the first station: – Train 1023 is delayed 120 sec – Train 1023 is delayed 240 sec – Train 1023 is delayed 480 sec

Evaluation of RCP increase Results: Min RCPScenario Total delay for all trains at all stopping stations (sec) No. of delayed trains at end station No. of delayed arrivals to stops Final delay for the initially delayed train (sec) Scenario 1: Train 1023 is delayed 120 sec Scenario 2: Train 1023 is delayed 240 sec Scenario 3: Train 1023 is delayed 480 sec

Continuing work Evaluate the timetables with more disturbance scenarios Test how to maximize RCP in the objective function

Tack för er uppmärksamhet! Frågor?