Optimal Design of Timetables to maximize schedule reliability and minimize energy consumption, rolling stock and crew deployment.

Slides:



Advertisements
Similar presentations
Collaborative Gate Allocation Alex Cuevas, Joanna Ji, Mattan Mansoor, Katie McLaughlin, Joshua Sachse, and Amir Shushtarian.
Advertisements

A Decision Support System for Improving Railway Line Capacity G Raghuram VV Rao Indian Institute of Management, Ahmedabad.
Capacity Studies on Transportation Network Presented by Rakesh Ambre ( ) Under Guidance Of Prof. Narayan Rangaraj.
Linear Programming Problem. Introduction Linear Programming was developed by George B Dantzing in 1947 for solving military logistic operations.
Lesson 08 Linear Programming
Lisa White Ph.D. Candidate School of Environment and Sustainability University of Saskatchewan May 30 th, 2012.
Linear Programming (LP) (Chap.29)
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.
Linear Programming Problem
Jim Pauley, P.E. Vice President, Industry and Government Relations – Schneider Electric Chair, NEMA High Performance Building Council Building Star An.
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.
Introduction to Management Science
Chapter 15 Application of Computer Simulation and Modeling.
Maintenance Routing Gábor Maróti CWI, Amsterdam and NS Reizigers, Utrecht Models for Maintenance Routing 2nd AMORE Seminar, Partas, 30.
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Introduction to Management Science
Supply Chain Logistics Management
Multi-Criteria Analysis – compromise programming.
INTRODUCTION TO LINEAR PROGRAMMING
TECH 101 Product Design and Manufacturing. TECH 1012 System Life-Cycle Engineering 2 Major phases in almost all products and in many cases services –Acquisition.
Scheduling PREREQUISITES FOR EFFECTIVE SCHEDULING.
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
 Group 3 Vahe Karapetyan Dena Rad Eidin Balali Patrick Njathi Zhong Zheng Damilare Adeoye Operations Research & Linear Programming Agenda Introduction.
Privileged and Confidential Strategic Approach to Asset Management Presented to October Urban Water Council Regional Seminar.
Article Title: Optimization model for resource assignment problems of linear construction projects ShuShun Liu & ChangJung Wang, National Yunlin University.
Rail Related Research at IIT Madras
9-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Multicriteria Decision Making Chapter 9.
Multicriteria Decision Making
Metro Energy Optimization through Rescheduling: Mathematical Model and Heuristics Compared to MILP and CMA-ES David FOURNIER, PhD CIFRE Inria/GE Transporation,
Corporate Social Responsibility LECTURE 19: Corporate Social Responsibility MGT
MTH374: Optimization For Master of Mathematics By Dr. M. Fazeel Anwar Assistant Professor Department of Mathematics, CIIT Islamabad 1.
Crew Planning Optimization Mastering the planning objectives
Computational Experiments Algorithm run on a Pentium IV 2.4 GHz Instances from “Rete Ferroviaria Italiana” For each station: - minimum interval between.
MULTICRITERIAL REASONING of PRIORITIES1 THE PRINCIPLES OF MULTICRITERIAL REASONING OF THE DEVELOPMENT PRIORITIES Buracas & Zvirblis
First Regional Conference Energy Efficiency of Railways in terms of Sustainable Development November Belgrade, Serbia Mr. Saša Živković, B.Sc.Eng.
Chapter 9 - Multicriteria Decision Making 1 Chapter 9 Multicriteria Decision Making Introduction to Management Science 8th Edition by Bernard W. Taylor.
© 2012 Veritec Solutions Incorporated. All Rights Reserved. Potential Synergies from Positive Train Control Bruce Patty Vice President – Transportation.
Q/.r NSRZKLA4-P1 Capacity planning for railway systems Leo Kroon Jan 17, 2002.
Contemporary Engineering Economics, 6 th edition Park Copyright © 2016 by Pearson Education, Inc. All Rights Reserved Design Economics Lecture No. 22 Chapter.
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.
SIMPLE: Stable Increased Throughput Multi-hop Link Efficient Protocol For WBANs Qaisar Nadeem Department of Electrical Engineering Comsats Institute of.
1.st South East Environment Workshop September Belgrade, Serbia Mr. Saša Živković, B.Sc.Eng. Head of Department for Energy Efficiency IT support.
1 Iterative Integer Programming Formulation for Robust Resource Allocation in Dynamic Real-Time Systems Sethavidh Gertphol and Viktor K. Prasanna University.
Maximizing value and Minimizing base on Fuzzy TOPSIS model
Arben Asllani University of Tennessee at Chattanooga Business Analytics with Management Science Models and Methods Chapter 2 Introduction to Linear Programming.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
1 Seema Thakur (st107641) Advisor: Dr. Weerakorn Ongsakul Optimal Generation Scheduling of Cascaded Hydro-thermal and Wind Power Generation By Particle.
Resource Allocation in Hospital Networks Based on Green Cognitive Radios 王冉茵
12/08/ J/ESD.204J1 Real-Time Control Strategies for Rail Transit Outline: Problem Description and Motivation Model Formulation Model Application.
Airline Optimization Problems Constraint Technologies International
Q/.r NSRZKLA4-P1 Timetable planning Leo Kroon Sept 9, 2003.
CHAPTER 4: The Evolving/Strategic Role of Human Resource Management
Operations Research Chapter one.
Red Line Customer Capacity Update
Rough-Cut Capacity Planning in SCM Theories & Concepts
OPTIFRAME : Project Overview
Course Summary Organization: A process providing goods and services based on a set of inputs, including raw material, capital, labor and knowledge. The.
Rough-Cut Capacity Planning in SCM EGN 5623 Enterprise Systems Optimization (Professional MSEM) Fall, 2011.
MBA 651 Quantitative Methods for Decision Making
ME 521 Computer Aided Design 15-Optimization
Babak Sorkhpour, Prof. Roman Obermaisser, Ayman Murshed
Production Planning and Control
Presented by Rich Goyette
Introduction to Scheduling Chapter 1
Flexible Assembly Systems
Presentation transcript:

Optimal Design of Timetables to maximize schedule reliability and minimize energy consumption, rolling stock and crew deployment

Timetable Design & its impact

Present Method of Timetable Design done manually by feasible path construction and mapping train services No method available for construction of optimal timetables with respect to energy consumption, schedule reliability or crew & rolling stock deployment TIME STATIONSSTATIONS

Problems of Timetable Design Large number of trains Large number of sections Many constraints No metrics developed for schedule reliability, energy consumption, rolling stock & crew requirements Mathematical model not solvable because of size

Resources for Train Services Energy Sectional capacity Rolling Stock Crew

Minimum Headway Time 1mk Slack Time route

delayed on route 1 by will be delayed on route 1 by will be delayed on route 2 by

Resources for Train Services Energy Sectional capacity Rolling Stock Crew

1 m k route Energy Consumption depends on train speed, section terrain (ruling gradient & curvature), rolling stock resistance & locomotive efficiency, and regeneration.

Resources for Train Services Energy Sectional capacity Rolling Stock Crew

Rolling Stock Maintenance Primary Maintenance Station A Secondary Maintenance Station B

Rolling Stock Deployment The number of rakes required for a train service depends on the following factors: the cycle time maintenance requirements, m p hours for primary maintenance and m s hours for secondary maintenance running time of a trip, say u g hours each way scheduled lie-over of say l p,g hours at the primary maintenance station and l s,g hours at the secondary maintenance station;

Resources for Train Services Energy Sectional capacity Rolling Stock Crew

Labour Regulations Maximum duty of 8 –10 hours Out-station Rest for minimum of 8 hours Base-station Rest for minimum of 16 hours

Crew Requirements 0900 Hrs 1630 Hrs 0100 Hrs 0830 Hrs Train 1 Train 11

Crew Deployment Index (CDI)

Objective Functions Minimize Total Consumption of Energy (TCE) Maximize Total Slack Index (TSI) Minimize Rolling Stock Deployment Index (RSDI) Minimize Crew Deployment Index (CDI)

Mathematical Model- Constraints Minimum section traversal time Cycle Time Bounds on departure times, slack times, total running time

Solution Methodology Analytic Hierarchy Process (AHP) to determine relative weights of each objective Compute distance functions for distance from PIS, NIS & Closeness Rating(CR) Global Criteria Approach (GCA) to Minimize d PIS or Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) to Maximize CR

Relative Importance of Objective Functions for the Decision Maker Schedule Reliability Customer Perception Line Capacity creation Energy Consumption Rolling Stock cost of rake lead time for new rake procurement Creation of facilities for maintenance Crew Cost of crew recruitment, training and operation lead time for recruitment & training

Analytic Hierarchy Process(AHP)) Energy Consumed Schedule Reliability Rolling Stock Deployment Crew Deployment Raw weight RW Normalized weight NW Energy Consumed Schedule Reliability 1/ Rolling Stock Deployment 1/51/ Crew Deployment 1/61/ Column Total

Solution Methodology Analytic Hierarchy Process (AHP) to determine relative weights of each objective Compute distance functions for distance from PIS, NIS & Closeness Rating(CR) Global Criteria Approach (GCA) to Minimize d PIS or Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) to Maximize CR

Distance Functions Global Criteria Approach (GCA) Technique for Order Preference by Similarity to Ideal Solution(TOPSIS)

Test Problem GAMS Program of 9083 equations & 9123 variables required 6 sec compilation and execution time on a 600 Mhz computer

Test Case Results

Cost Benefits Will vary on the section, train density, rolling stock characteristics, operating & maintenance practices, crew management Results for the test case indicate 10% savings in energy, 2% less requirement of crew and 12% less requirement of rolling stock when comparing the best & worst scenarios

Summary Identification of decision variables for time table design- slack times and minimum headways Developing the concept of route to reduce problem size Developing metrics for robustness & rolling stock deployment Exploring the aspects of speed differentials and throughput Formulation and Demonstration of mathematical model to optimally design timetables

Applications Formulation of timetables which are robust to disturbances Formulation of timetables which maximize resource utilization and minimize energy consumption Identification of bottleneck sections Compare timetables for robustness Analysis of implications of speed changes: CBA Analysis of resource augmentations : CBA Identify optimal timetables for maintenance blocks Can be integrated with Driving Advice System for pacing of trains

Strategic opportunities offered by optimal timetable design Take advantage of new technologies such as regenerative braking Use optimal pacing of trains Reduce capital investment on new lines and rolling stock Methodologies can be applied for on-line scheduling and integration with on-board driving advice systems

Thank You