INOC 2013 May 2013, Tenerife, Spain Train unit scheduling with bi-level capacity requirements Zhiyuan Lin, Eva Barrena, Raymond Kwan School of Computing,

Slides:



Advertisements
Similar presentations
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
Advertisements

Outline LP formulation of minimal cost flow problem
1 Material to Cover  relationship between different types of models  incorrect to round real to integer variables  logical relationship: site selection.
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Temporal Constraints Time and Time Again: The Many Ways to Represent Time James F Allen.
1 EP2210 Fairness Lecture material: –Bertsekas, Gallager, Data networks, 6.5 –L. Massoulie, J. Roberts, "Bandwidth sharing: objectives and algorithms,“
Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.
CAPACITY LOAD OUTPUT.
Introduction to Algorithms
Management Science 461 Lecture 6 – Network Flow Problems October 21, 2008.
Rake Linking for Suburban Train Services. Rake-Linker The Rake-Linker assigns physical trains (rakes) to services that have been proposed in a timetable.
INFORMS Annual Meeting, San Diego, Oct 11 – 14, 2009 A New, Intuitive and Industrial Scale Approach towards Uncertainty in Supply Chains G.N. Srinivasa.
Rake linking for suburban train services Narayan Rangaraj Industrial Engineering and Operations Research IIT Bombay.
A Heuristic Bidding Strategy for Multiple Heterogeneous Auctions Patricia Anthony & Nicholas R. Jennings Dept. of Electronics and Computer Science University.
Placement of Integration Points in Multi-hop Community Networks Ranveer Chandra (Cornell University) Lili Qiu, Kamal Jain and Mohammad Mahdian (Microsoft.
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
Detecting Network Intrusions via Sampling : A Game Theoretic Approach Presented By: Matt Vidal Murali Kodialam T.V. Lakshman July 22, 2003 Bell Labs, Lucent.
RPI-X: Forecasting costs Regulation and Competition John Cubbin.
Maximum Flows Lecture 4: Jan 19. Network transmission Given a directed graph G A source node s A sink node t Goal: To send as much information from s.
Utrecht, february 22, 2002 Applications of Tree Decompositions Stan van Hoesel KE-FdEWB Universiteit Maastricht
Transportation Engineering Higher Technical School of Engineering, University of Sevilla, Spain Fall School on Robust Network Design and Delay Management,
Airline Fleet Routing and Flight Scheduling under Market Competitions
Airline Schedule Optimization (Fleet Assignment II) Saba Neyshabouri.
Quadratic Programming Model for Optimizing Demand-responsive Transit Timetables Huimin Niu Professor and Dean of Traffic and Transportation School Lanzhou.
Max-flow/min-cut theorem Theorem: For each network with one source and one sink, the maximum flow from the source to the destination is equal to the minimal.
1 Lecture 4 Maximal Flow Problems Set Covering Problems.
Rail Related Research at IIT Madras
Content : 1. Introduction 2. Traffic forecasting and traffic allocation ◦ 2.1. Traffic forecasting ◦ 2.2. Traffic allocation 3. Fleeting problems ◦ 3.1.
1 Using Composite Variable Modeling to Solve Integrated Freight Transportation Planning Problems Sarah Root University of Michigan IOE November 6, 2006.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
Network Optimization Models
Introduction to Operations Research
Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
Agenda Business problem context Definitions Problem Description
Workshop PRIXNET – 11/12 Mars CONGESTION PRICING IN AIR TRANSPORTATION Karine Deschinkel Laboratoire PRiSM – Université de Versailles.
Section 2.9 Maximum Flow Problems Minimum Cost Network Flows Shortest Path Problems.
Modeling and Evaluation with Graph Mohammad Khalily Dermany Islamic Azad University, Khomein branch.
ANTs PI Meeting, Nov. 29, 2000W. Zhang, Washington University1 Flexible Methods for Multi-agent distributed resource Allocation by Exploiting Phase Transitions.
UC San Diego / VLSI CAD Laboratory Incremental Multiple-Scan Chain Ordering for ECO Flip-Flop Insertion Andrew B. Kahng, Ilgweon Kang and Siddhartha Nath.
1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 8 Lecture 8 Network Flow Based Modeling Mustafa Ozdal Computer Engineering Department,
Maximization of Network Survivability against Intelligent and Malicious Attacks (Cont’d) Presented by Erion Lin.
On Graphs Supporting Greedy Forwarding for Directional Wireless Networks W. Si, B. Scholz, G. Mao, R. Boreli, et al. University of Western Sydney National.
Goal Programming Linear program has multiple objectives, often conflicting in nature Target values or goals can be set for each objective identified Not.
DISTRIBUTION AND NETWORK MODELS (1/2)
Optimal Fueling Strategies for Locomotive Fleets in Railroad Networks Seyed Mohammad Nourbakhsh Yanfeng Ouyang 1 William W. Hay Railroad Engineering Seminar.
Presented By Dr. Mohsen Alardhi College of Technological Studies, Kuwait April 19 th,2009.
V. Cacchiani, ATMOS 2007, Seville1 Solving a Real-World Train Unit Assignment Problem V. Cacchiani, A. Caprara, P. Toth University of Bologna (Italy) European.
1 Multi-Objective Portfolio Optimization Jeremy Eckhause AMSC 698S Professor S. Gabriel 6 December 2004.
1 Iterative Integer Programming Formulation for Robust Resource Allocation in Dynamic Real-Time Systems Sethavidh Gertphol and Viktor K. Prasanna University.
Exploiting Group Recommendation Functions for Flexible Preferences.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Network Flow Problems Example of Network Flow problems:
1 Planning Base Station and Relay Station Locations in IEEE j Multi-hop Relay Networks Yang Yu, Seán Murphy, Liam Murphy Department of Computer Science.
12/08/ J/ESD.204J1 Real-Time Control Strategies for Rail Transit Outline: Problem Description and Motivation Model Formulation Model Application.
Network Problems A D O B T E C
Roman Barták (Charles University in Prague, Czech Republic) ACAT 2010.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
Tuesday, March 19 The Network Simplex Method for Solving the Minimum Cost Flow Problem Handouts: Lecture Notes Warning: there is a lot to the network.
::Network Optimization:: Minimum Spanning Trees and Clustering Taufik Djatna, Dr.Eng. 1.
A Multi-Airport Dynamic Network Flow Model with Capacity Uncertainty
Computation of the solutions of nonlinear polynomial systems
The assignment problem
Optimizing depot locations based on a public transportation timetable
ORGANIZATIONAL EFFECTIVENESS
Network Optimization Research Laboratory
1.206J/16.77J/ESD.215J Airline Schedule Planning
Introduction Basic formulations Applications
Advisor: Yeong-Sung, Lin, Ph.D. Presented by Yu-Ren, Hsieh
Fast Min-Register Retiming Through Binary Max-Flow
Presentation transcript:

INOC 2013 May 2013, Tenerife, Spain Train unit scheduling with bi-level capacity requirements Zhiyuan Lin, Eva Barrena, Raymond Kwan School of Computing, University of Leeds, UK 1 CASPT 23 July 2015, Rotterdam

2  Motivation  Problem description - Capacity levels  Model  Computational experiments  Conclusions and further work Outline

Motivation Minimize operating costs Satisfy capacity requirements Train unit scheduling problem Imprecise definition Under-utilized train units Imbalanced demands Re-balance Various sources Best representation How? 3

 Motivation  Problem description – Capacity levels  Model  Computational experiments  Conclusions and further work Outline 4

Train units 5 Class 171/7 (2-car), diesel Class 375 (4-car), electric

Train unit scheduling Train unit scheduling problem Train IDOriginDestinationDep timeArr timedemands 2E59AB09:0510: G15BC10:3012: G71CD15:0017: E59 A  B source s 2G15 B  C 2G71 C  D sink t Sign-on arc Empty-running connection arc Path (source to sink) Scheduled work for a train unit Train node Sign-off arc 6 Station connection arc

2E32 1E06 2E11 2E03 1E09 source sink 1E06 2E11 2E32 2E11 2E03 1E09 Train unit scheduling Integer multicommodity flow representation 7 Paths may overlap for coupling Coupled units may be of different but compatible types x1

Outline Capacity requirement can be inferred from: – Mandatory minimum provision – Historic provision – Passenger count surveys (PAX) – Future growth expectation Problems of a single level: – Requirements not precisely defined / unknown – Under-utilized train units as a result of optimization techniques 8 Train capacity requirements

Under-utilized train units 9

Outline Implicit information – Pattern of unit resource distribution – Agreements/expectations with transport authorities Potential problems – Capacity strengthening could be used for unit resource redistribution: didn’t reflecting the real level – Unreasonable pattern may stay in past schedules for years 10 Historic capacity provision

Outline Capacity strengthening for unit resource redistribution in historic provision: an example 11 Historic capacity provision i i j j m Requires 1 unit n Requires 2 units AB CB B D DE

Outline Actual passenger counts Only a subset of trains surveyed Might contradict with historic provisions Frequency and scale of surveys vary among operators 12 PAX surveys

Outline Over-provided (OP): if historic capacity > PAX in terms of number of train units Under-provided (UP): if historic capacity < PAX – No place available for coupling/decoupling – Result of under-optimized schedules – OP: Used for redistributing train unit resources – UP: May be inevitable due to limited fleet size and/or coupling upper bound 13 OP and UP trains

Outline A desirable level r’ j – Will be satisfied as much as possible – max {historic, PAX, …} A target level r j – Must be strictly satisfied – min {historic, PAX, …} 14 Bi-level capacity requirement (per train j)

Outline 15 Bi-level capacity requirement Historic capacity PAX Future growth Mandatory minimum … Desirable capacity Target capacity Model Scheduled capacity informationInput data Output data

 Motivation  Problem description – Capacity levels  Model  Computational experiments  Conclusions and further work Outline 16

Outline Objective function – Minimize operating costs, including Fleet size, mileage, empty-running – Reflect preferences on, e.g., long idle gaps for maintenance – Achieve the desirable capacity requirements level as much as possible 17 The integer multicommodity flow formulation

Outline Constraints – Fleet size bounds 18 The integer multicommodity flow formulation – Target capacity requirement – Coupling of compatible types – Complex coupling upper bounds – Target capacity requirement – Coupling of compatible types – Complex coupling upper bounds combined into “train convex hulls”

Outline Variables 19 The formulation Path variable number of units used for path p of type k Capacity provision variable The capacity provided by the solver at train j

Outline Realized in the objective 20 Desirable level r′ Get the capacity provision in constraints Minimize the deviation between y and r′ Deal with the absolute values Operating cost Desirable capacity level

Outline (1) Objective 21 The ILP formulation (3) Convex hulls for all trains (4) Calculate capacity provision variables (5)(6) Variable domain (2) Fleet size upper bound

 Motivation  Problem description – Capacity levels  Model  Computational experiments  Conclusions and further work Outline 22

Objective function - Competing terms Deviation from desirable level Operating costs: Fleet size, mileage,... Weights Computational experiments: Objective function terms 23

Computational experiments Purposes Calibrate the objective function weights Satisfy as much as possible the desirable capacity level for a given fleet size Compare with manual schedules Experiments E1: Varying weights in the objective function E2: Fix fleet size & solely minimize r’ deviation 24

Computational experiments Central Scotland railway network; December 2011 timetable 25

Actually operated schedule: 64 OP trains out of 156 If use PAX, solver = 29 units If use historic capacity, solver = 33 units Computational experiments: Input data 26

Computational experiments: Results on E1 27

Computational experiments: Results on E1 28

Computational experiments: Results on E2 E2: Fix fleet size & solely minimize OP deviation 29

Computational experiments: Comparison between E1 & E2 E2 E1 Actually operating schedule: Fleet size= 33, OP=64 30

Conclusions Train unit scheduling with bi-level capacity requirements:  Target: PAX; Desirable: historic provisions  Schedules with more reasonable/controlled capacities Improvements w.r.t. manual schedules:  12% reduction of fleet size  Maintaining nearly 60% OP trains 31

Further work UP trains & limited fleet size Multicriteria optimization Trade-offs between depot returns and maximizing capacity provision More problem contexts in train unit resource planning, e.g. – franchise bidding – maintenance scheduling 32

Thank you!