Train scheduling based on speed profiles

Slides:



Advertisements
Similar presentations
Heat Exchanger Network Retrofit
Advertisements

Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, and Chonggang Wang University of Minnesota, AT&T Lab, Arizona State University, Syracuse University, NEC.
1 Constraint Satisfaction Problems A Quick Overview (based on AIMA book slides)
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.
Approximations of points and polygonal chains
Multi-Objective Optimization NP-Hard Conflicting objectives – Flow shop with both minimum makespan and tardiness objective – TSP problem with minimum distance,
ArcLogistics Routing Software for Special Needs, Maintenance and Delivery.
Solving the dispatching problem by MILP MIMIC (Mixed Integer Maurizio Igor Carlo) Carlo Mannino SINTEF ICT (Oslo), University of Rome Maurizio Boccia University.
SPREADSHEETS IN EDUCATION OF LOGISTICS MANAGERS AT FACULTY OF ORGANIZATIONAL SCIENCES: AN EXAMPLE OF INVENTORY DYNAMICS SIMULATION L. Djordjevic, D. Vasiljevic.
CISC October Goals for today: Foster’s parallel algorithm design –Partitioning –Task dependency graph Granularity Concurrency Collective communication.
Yashar Ganjali Computer Systems Laboratory Stanford University February 13, 2003 Optimal Routing in the Internet.
Maintenance Routing Gábor Maróti CWI, Amsterdam and NS Reizigers, Utrecht Models for Maintenance Routing 2nd AMORE Seminar, Partas, 30.
Math443/543 Mathematical Modeling and Optimization
Ant Colonies As Logistic Processes Optimizers
Economics 214 Lecture 2 Mathematical Framework of Economic Analysis Continued.
Rail Zürich, Train scheduling based on speed profiles © ETH Zürich | M. Fuchsberger Martin Fuchsberger, ETH Zurich RailZurich, 11. February 2009.
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.
Rail Related Research at IIT Madras
Package Transportation Scheduling Albert Lee Robert Z. Lee.
Design Space Exploration
Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
Computational Experiments Algorithm run on a Pentium IV 2.4 GHz Instances from “Rete Ferroviaria Italiana” For each station: - minimum interval between.
Chapter 3 Parallel Algorithm Design. Outline Task/channel model Task/channel model Algorithm design methodology Algorithm design methodology Case studies.
RNA Secondary Structure Prediction Spring Objectives  Can we predict the structure of an RNA?  Can we predict the structure of a protein?
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
New Modeling Techniques for the Global Routing Problem Anthony Vannelli Department of Electrical and Computer Engineering University of Waterloo Waterloo,
Introduction A GENERAL MODEL OF SYSTEM OPTIMIZATION.
Interconnect Performance Modeling. Performance modeling Given an interconnect topology, routing, and other parameters, predict the interconnect performance.
Comparing Dynamic Traffic Assignment Approaches for Planning
© ABB Inc. - USETI All Rights Reserved 10/17/2015 Insert image here An Economic Analysis Development Framework for Distributed Resources Aaron F. Snyder.
Maximization of Network Survivability against Intelligent and Malicious Attacks (Cont’d) Presented by Erion Lin.
David B. Roden, Senior Consulting Manager Analysis of Transportation Projects in Northern Virginia TRB Transportation Planning Applications Conference.
Line Balancing Problem
Software Engineering 2 Software Testing Claire Lohr pp 413 Presented By: Feras Batarseh.
On Graphs Supporting Greedy Forwarding for Directional Wireless Networks W. Si, B. Scholz, G. Mao, R. Boreli, et al. University of Western Sydney National.
Lecture 4 TTH 03:30AM-04:45PM Dr. Jianjun Hu CSCE569 Parallel Computing University of South Carolina Department of.
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
Frankfurt (Germany), 6-9 June 2011 AN OPTIMISATION MODEL TO INTEGRATE ACTIVE NETWORK MANAGEMENT INTO THE DISTRIBUTION NETWORK INVESTMENT PLANNING TASK.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Aggregation and Secure Aggregation. Learning Objectives Understand why we need aggregation in WSNs Understand aggregation protocols in WSNs Understand.
Song Wei Enabling Distributed Throughput Maximization in Wireless Mesh Networks A Partitioning Approach.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.
Highway Risk Mitigation through Systems Engineering.
CEE 320 Fall 2008 Route Choice CEE 320 Steve Muench.
September 2008What’s coming in Aimsun: New features and model developments 1 Hybrid Mesoscopic-Microscopic Traffic Simulation Framework Alex Torday, Jordi.
Algebra 1 Section 7.6 Solve systems of linear inequalities The solution to a system of linear inequalities in two variable is a set of ordered pairs making.
Xin Li, Chen Qian University of Kentucky
Impact of Interference on Multi-hop Wireless Network Performance
Ken-ichi TANAKA Department of Management Science,
RAILWAY INDUSTRY TRAIN PLANNING LEVEL 2 TRAINING
Market Architectures Integrating Ancillary Services from Distributed Energy Resources Olivier Devolder Head of Energy Group N-SIDE.
Network Optimization Executive Seminar Track 1, Session A
Perancangan Sistem Manufaktur
Analytics and OR DP- summary.
ENGM 535 Optimization Networks
ME 521 Computer Aided Design 15-Optimization
Parallel Programming in C with MPI and OpenMP
Bounding the Lifetime of Sensor Networks Via Optimal Role Assignments
Chapter 4. Modeling Transportation Demand and Supply
1.206J/16.77J/ESD.215J Airline Schedule Planning
Sungho Kang Yonsei University
Equations and Problem Solving
The use of Neural Networks to schedule flow-shop with dynamic job arrival ‘A Multi-Neural Network Learning for lot Sizing and Sequencing on a Flow-Shop’
Chapter 6 Network Flow Models.
DYNAMIC PROGRAMMING.
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Parallel Programming in C with MPI and OpenMP
Constraint Satisfaction Problems
Presentation transcript:

Train scheduling based on speed profiles 23.07.2018 Train scheduling based on speed profiles Martin Fuchsberger, ETH Zurich RailZurich, 11. February 2009 D. Burkolter, G. Caimi, T. Herrmann, S. Roos, R. Wüst © ETH Zürich | M. Fuchsberger

What is train scheduling? INPUT: Train service intention (SI) Aggregated and detailed track topology of the network Rolling stock with dynamic properties OUTPUT: Conflict-free periodic train schedule fulfilling SI

Two-level approach reduces complexity Macro scheduling: Find a timetable that fulfills trip time, connection and macro level safety requirements Focus of this talk Micro scheduling: Find locally a conflict free schedule, fulfilling detailed safety requirements for a given macro schedule

Condensation vs. compensation zones Condensation zone: Main station area Bottleneck Maximum speed policy Many routes Compensation zone: Regions connecting main stations Time reserves Variable speed Few routes Portal: Link between zones Macroscopic draft passing times Focus of this talk

Micro scheduling in compensation zone 23.07.2018 Micro scheduling in compensation zone ZG LZ Entrance point Flexible speed and travel time Fixed speed profile Fixed speed profile Exit point t

Micro train scheduling - Objectives Conflict-free assignment of track paths to the trains Fulfill safety requirements on the micro level Meeting portal (boundary) conditions Additional quality criteria: Energy, time reserve distribution

Two step approach to micro scheduling Track path generation Apply two reasonable simplifications: Approximation of the continuous track path by a finite chain of <location,time> points Represent the infinitely many track paths by a representative finite set of track paths Conflict-free track path assignment

1. Trackpath generation Enumerate meaningful route alternatives Generate viable speed profiles for each route, which: Are a versatile representation of the infinitely many speed profiles Comply with maximum speed limits Obey dynamic train properties Meet portal boundary conditions

2. Speed profile generation Generate ®-speed profile „drive as fast as it is allowed“  minimal travel time Calculate time reserve based on ®-speedprofile Generate several speed profiles by distributing the time reserve among track sections

Example of speed profile generation 23.07.2018 Example of speed profile generation ... distributed over K track sections 1 2 1 2 s ®-speedprofile Diagram Illustrate Time reserve is divided by a parameter N=6 parts and … } Portaltime t

S1 Lucerne – Zug: - ®-profile - Track section split

Conflict-free trackpath assignment Optimisation model assigns a track path per train. Resource tree conflict graph Multicommodity flow Constrain flow (conflict free) Integer linear program Optimise for a quality criteria Models train dynamics and detailed safety system

The optimal solution considers all trains, not only this train! S1 Lucerne – Zug: - Min. energy consumption Max. time reserve distribution desirability Combination of both objectives Remember: The optimal solution considers all trains, not only this train!

Testcase

Testcase – continued Based on SBB 2008 timetable we derive a service intention Solve macroscopic timetable scheduling  Generates portal times Schedule contains per hour and direction 2 intercity trains 1 interregio train 2 commuter trains  10 trains / hour

Effects of parameters K and N Too few track sections (K) lead to: Less variety of speed profiles Problem became infeasible High granularity partitioning of time reserve (N): Improves objective value Increases memory consumption Computation times < 30 s After tuning parameters K and N, trains are swiftly scheduled and comply with security standards.

Outlook Our current research focuses on Application of this approach for rescheduling Interaction between: Macro and micro level (2-level approach) Compensation and condensation zones Possible contributions of Operations Research (OR) to the field of railway rescheduling

Thank You! Time for questions! 19