Presentation on theme: "Capacity Studies on Transportation Network Presented by Rakesh Ambre (04319401) Under Guidance Of Prof. Narayan Rangaraj."— Presentation transcript:
Capacity Studies on Transportation Network Presented by Rakesh Ambre ( ) Under Guidance Of Prof. Narayan Rangaraj
2 Introduction PreamblePreamble MotivationMotivation Scope of ThesisScope of Thesis Problem DefinitionProblem Definition To increase section capacity for given blocks and station configuration, timetable and priority of scheduled trains, operating and safety policies, various types of trains (loco-wagon combination), signaling regime and crew scheduling.
4 Train ChartingTrain Charting 1.Master Chart 2.Control Chart Class of TrafficClass of Traffic 1.Emergency Trains 2.Scheduled Trains 3.Unscheduled Trains
5 Factors affecting Capacity of Rail Section Factors affecting Capacity of Rail Section 1.Track configuration (single/double) 2.Station configuration (availability of loop lines and their direction etc.) 3.Signaling system and signal location 4.Operating and safety policies of railways such as the minimum headway required between two trains 5.Topography of section (gradients, curvature etc.) 6.Traffic patterns of the section 7.Various types of trains (i.e. speed differentials) 8.Different types of failures occurring in the section 9.The traversal times and arrival of different trains
6 Literature Review Simulation Based ApproachSimulation Based Approach Math Programming Based ApproachMath Programming Based Approach Simulation ModelsSimulation Models Route Seeking ModelsRoute Seeking Models Optimization modelsOptimization models Computer Assisted Dispatching ModelsComputer Assisted Dispatching Models Event Based Simulation ModelsEvent Based Simulation Models Tools Available for Simulation StudyTools Available for Simulation Study IIT Bombay-IRISET SimulatorIIT Bombay-IRISET Simulator RAILSRAILS
7 Basic Model Links Stations Constraints Constraints 1.Inter-Station Trip Time Constraint
8 2.Minimum Wait Time at Stations Minimum Headways Between Trains Minimum Headways Between Trains : 3.Headways on Entering Links 4.Headways on Exiting from Links
9 5.Consistency of the variables 6.Bounds on Departure Times 7.Bounds on Arrival Times Objective Function Objective Function
10 Bhusaval Visit DRM, ZTCDRM, ZTC Length about 526 Km from Igatpuri to BadneraLength about 526 Km from Igatpuri to Badnera Four SectionsFour Sections Engg., Loco, Traffic AllowancesEngg., Loco, Traffic Allowances
11 Proposed Algorithm 1.All trains are scheduled on the basis of first come first serve but considering some conflicts. If conflict is among passenger trains, all passenger trains are scheduled according to their priorities and scheduled timetable. 2.If conflict is between a passenger train (to be arrive later) and a freight train (to be arrive first), calculate delay caused to passenger train to travel remaining section, incase a freight train is allowed first to travel next block of section. Passenger train is halted at station if, a.This delay can be managed by running a passenger train at higher speed as mentioned above. b.Siding is available at next station. c.There are enough platforms at first station to hold passenger trains that are following. 3.If any one of above three conditions fails freight train will be halted at the station where it has reached. 4.Then passenger trains, which are waiting at previous station, are allowed to pass freight train.
12 Test Case-1
13 Test Case-2
14 Test Case-3
15 Conclusions Train Scheduling Problem is MILP.Train Scheduling Problem is MILP. Involves large number of 0-1 integer variables.Involves large number of 0-1 integer variables. Solution can be obtained using :-Solution can be obtained using :- Standard packages or Heuristics Approaches Using Simulation Models Simulation Model should handle Special Events.Simulation Model should handle Special Events.
16 Future Work Approach to OR Techniques (II Stage)Approach to OR Techniques (II Stage) Modeling all Train Activities Further Improvement of Proposed Algorithm Derive more complex test cases for above Algorithm Try to apply and include other standard Algorithms available like Branch and Bound Algorithm. Approach to Software (III Stage)Approach to Software (III Stage) If necessary further improvements in above Algorithm Successfully generate code for above mentioned algorithm Test final subroutine Include it in IIT Bombay-IRISET Simulator.