Stochastic optimization of a timetable M.E. van Kooten Niekerk.

Slides:



Advertisements
Similar presentations
A Decision Support System for Improving Railway Line Capacity G Raghuram VV Rao Indian Institute of Management, Ahmedabad.
Advertisements

Capacity Studies on Transportation Network Presented by Rakesh Ambre ( ) Under Guidance Of Prof. Narayan Rangaraj.
Outline LP formulation of minimal cost flow problem
Chapter 3 Workforce scheduling.
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.
Network Coding in Peer-to-Peer Networks Presented by Chu Chun Ngai
Crew Scheduling Housos Efthymios, Professor Computer Systems Laboratory (CSL) Electrical & Computer Engineering University of Patras.
SCHEDULING Critical Activities are: B, F, I, M, Q.
Fuzzy immune PID neural network control method based on boiler steam pressure system Third pacific-asia conference on circuits,communications and system,
1 February 2009 Analysis of capacity on double-track railway lines Olov Lindfeldt February 2008.
10 December J/ESD.204J Lecture 13 Outline Real Time Control Strategies for Rail Transit Prior Research Shen/Wilson Model Formulation Model Application.
Event-drive SimulationCS-2303, C-Term Project #3 – Event-driven Simulation CS-2303 System Programming Concepts (Slides include materials from The.
Reinventing Crew Scheduling At Netherlands Railways Erwin Abbink, NS Reizigers bv, The Netherlands (NL) Matteo Fischetti, University of Padua, Italy Double.
Maintenance Routing Gábor Maróti CWI, Amsterdam and NS Reizigers, Utrecht Models for Maintenance Routing 2nd AMORE Seminar, Partas, 30.
Erasmus Center for Optimization in Public Transport 1 Shunting passenger train units: Practical planning aspects Ramon Lentink, Pieter-Jan Fioole, Dennis.
3rd ARRIVAL Review Meeting [Patras, 12 May 2009] – WP3 Presentation ARRIVAL – WP3 Algorithms for Robust and online Railway optimization: Improving the.
1 A Second Stage Network Recourse Problem in Stochastic Airline Crew Scheduling Joyce W. Yen University of Michigan John R. Birge Northwestern University.
Quantitative issues in contact centers Ger Koole Vrije Universiteit seminar E-commerce & OR 18 January 2001 Lunteren.
3rd ARRIVAL Review Meeting [Patras, 12 May 2009] – WP3 Presentation ARRIVAL – WP3 Algorithms for Robust and online Railway optimization: Improving the.
© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-1 Operations Management Simulation Module F.
Effective Gaussian mixture learning for video background subtraction Dar-Shyang Lee, Member, IEEE.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
Distributed Constraint Optimization * some slides courtesy of P. Modi
Train Scheduling in a Main Station Area © ETH Zürich | M. Fuchsberger Martin Fuchsberger Master thesis, Final Presentation Zurich, March 15.
Quadratic Programming Model for Optimizing Demand-responsive Transit Timetables Huimin Niu Professor and Dean of Traffic and Transportation School Lanzhou.
Location Models For Airline Hubs Behaving as M/D/C Queues By: Shuxing Cheng Yi-Chieh Han Emile White.
1/33 Team NCKU lead by I-Lin Wang INFORMS RAS 2014 Problem Solving Competition Team NCKU (National Cheng Kung  I-Lin Wang (Associate.
Package Transportation Scheduling Albert Lee Robert Z. Lee.
1 Real-Time Queueing Network Theory Presented by Akramul Azim Department of Electrical and Computer Engineering University of Waterloo, Canada John P.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 1 Introduction to Operations Research.
Quantitative Methods of Management
University of Zagreb MMVE 2012 workshop1 Towards Reinterpretation of Interaction Complexity for Load Prediction in Cloud-based MMORPGs Mirko Sužnjević,
Column Generation Approach for Operating Rooms Planning Mehdi LAMIRI, Xiaolan XIE and ZHANG Shuguang Industrial Engineering and Computer Sciences Division.
1 Botond Kovari: Crew Planning 1 st Int. Conf. on Research in Air Transportation - Zilina, Nov 22-24, 2004 Cost Optimisation Methods in Air Crew Planning.
Modeling and simulation of systems Simulation optimization and example of its usage in flexible production system control.
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.
Transportation Problem
Chapter 3: Project Management Omar Meqdadi SE 2730 Lecture 3 Department of Computer Science and Software Engineering University of Wisconsin-Platteville.
Operational Research & ManagementOperations Scheduling Workforce Scheduling 1.Days-Off Scheduling 2.Shift Scheduling 3. Cyclic Staffing Problem (& extensions)
Railway Operations: Issues and Objectives Capacity management Infrastructure planning Timetable preparation Management of day-to-day movement of trains.
A Joint Research Project funded under the Seventh Framework Programme (FP7) of the European Commission Innovations in Automated Planning.
Materials developed by K. Watkins, J. LaMondia and C. Brakewood Timetabling Components Unit 5: Staff & Fleet Scheduling.
1 Contents 1. Statement of Timetabling Problems 2. Approaches to Timetabling Problems 3. Some Innovations in Meta-Heuristic Methods for Timetabling University.
Lecture 3 Page 1 CS 111 Online Disk Drives An especially important and complex form of I/O device Still the primary method of providing stable storage.
© J. Christopher Beck Lecture 25: Workforce Scheduling 3.
Chapter 1 Introduction n Introduction: Problem Solving and Decision Making n Quantitative Analysis and Decision Making n Quantitative Analysis n Model.
V. Cacchiani, A. Caprara and P. Toth DEIS, University of Bologna TIMETABLING FOR CONGESTED CORRIDORS.
INOC 2013 May 2013, Tenerife, Spain Train unit scheduling with bi-level capacity requirements Zhiyuan Lin, Eva Barrena, Raymond Kwan School of Computing,
Q/.r NSRZKLA4-P1 EUR team: Leo Kroon (EUR / NS)Timetable, rolling stock, crew Gabor Maroti (EUR / ARRIVAL)Timetable, rolling stock Ph.D. student (EUR /
Transportation Logistics CEE 498B/599I Professor Goodchild 4/18/07.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
EFFICIENT WATER TRANSMISSION SYSTEM OPTIMIZATION WITH REAL-TIME EMISSION S. Mohsen Sadatiyan A. Carol J. Miller.
Output Grouping-Based Decomposition of Logic Functions Petr Fišer, Hana Kubátová Department of Computer Science and Engineering Czech Technical University.
DEPARTMENT/SEMESTER ME VII Sem COURSE NAME Operation Research Manav Rachna College of Engg.
Hongjie Zhu,Chao Zhang,Jianhua Lu Designing of Fountain Codes with Short Code-Length International Workshop on Signal Design and Its Applications in Communications,
OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
Erasmus Center for Optimization in Public Transport ECOPT – workshop February 19, 2004 Michiel Vromans, Rommert Dekker, Leo Kroon Erasmus University, NS.
Aircraft Landing Problem
Trading Timeliness and Accuracy in Geo-Distributed Streaming Analytics
CHAPTER 8 Operations Scheduling
The Train Driver Recovery Problem – Solution
Optimizing depot locations based on a public transportation timetable
Effective Social Network Quarantine with Minimal Isolation Costs
1.206J/16.77J/ESD.215J Airline Schedule Planning
Javad Ghaderi, Tianxiong Ji and R. Srikant
Richard Anderson Autumn 2015 Lecture 7
Area Coverage Problem Optimization by (local) Search
Presentation transcript:

Stochastic optimization of a timetable M.E. van Kooten Niekerk

Outline Timetable: theory and reality Time Supplements Optimization of Time Supplements Extension of model Theoretical results Practical results Conclusion

Timetable: Theory & Reality Theoretical: Minimum technical driving times Reality is different: –Human factor –Weather –Other To cover this, extra driving time is scheduled

Time Supplements (1) In NL: about 5% of MTDT is added as time supplement Per trip segment, between important points How to assign time supplements?

Time Supplements (2) At every timing point: Actual departure ≥ scheduled departure. If too early, wait. No negative delay. D: Delay compared to timetable s: Time supplement δ: Actual delay on segment

Time Supplements (3) Spread evenly –1st intuition: OK –Likely to wait, so total time has larger average than necessary All at the start –Excessive waiting on the trip –No serious option All before arrival –Minimal waiting during the trip –Earliest arrival at end of trip –Too late on most timing points

Time supplements: Optimization Distribute time supplements s.t.: –Total supplement = constant –Average delay is minimal Problem: non-linearity of delay with respect to applied time supplements Solution: Combination of simulation and (I)LP

Time supplements: Optimization 1 Base-timetable Number of realizations (set of ‘random’ delays), about 1000 Goal: minimize average delay in the realizations by making changes to the base-timetable

Optimization model (1) At every timing point: Actual departure ≥ scheduled departure. If too early, wait. No negative delay. D n ≥ 0 Formula:

Optimization model (2)

Results Time supplements not evenly spread across trip segments Average delay is reduced for the greater part of the trip Delay at end of trip is larger

Extension of model Now 1 single line Reality: complex set of lines To model: –Slow and fast trains on the same track, overtaking is not possible –Conflicts when trains are crossing –Single track

Extension of model Overtaking of trains is not possible Minimal Headway between trips:

Extension of model Possible conflicts on track usage Eg. Crossing of trains Train t2 should wait until t1 has arrived

Extension of model Trips influence each other, delays can be propagated We should keep track of real departure time, only delay is not enough We should consider a whole day, not one hour Change: 21 hrs a day, 20 realizations Gives LP with variables and constraints 16 to 32 hours computation time

Theoretical results

Practical results Results were applied during 8 weeks in 2006 on the Zaanlijn Punctuality went from 79,4% to 86,5% Results on corridor Amsterdam-Eindhoven lead to theoretical reduction of average delay of 30%.

Conclusion Optimization of distribution of time supplements leads to a reduction of average delay without extra cost. Some stations may have more delays Method will be applied to whole network of NS

Literature Kroon, L.G., Dekker, R., Vromans, M.J.C.M., 2007, Cyclic railway timetabling: a stochastic optimization approach. In: Geraets, F., Kroon, L.G., Schöbel, A., Wagner, R., Zaroliagis, C. (Eds.), Algorithmic Methods in Railway Optimization. Lecture notes in Computer Science, vol Springer, pp Kroon, L.G., Maróti, G., Retel Helmrich, M., Vromans, M.J.C.M, Dekker, R., 2007, Stochastic improvement of cyclic railway timetables. In: Transport Research, Part B 42, Elsevier, pp

Questions?