|
|
- Christal Fletcher
- 7 years ago
- Views:
Transcription
1 Dynamic Control of Railway Traffic A state-of-the-art real-time train scheduler based on optimization models and algorithms 20/06/2013 a.dariano@dia.uniroma3.it 1
2 The Aut.O.R.I. Lab (Rome Tre University) The Laboratory of Automation and Operations Research in Industry at the Roma Tre University has an international reputation for its excellence in research and teaching. It strives to maximise the relevance of its research to the marketplace through problem anticipation and solving, development of new optimization solutions, and dissemination. Mission: Ensure education and advanced research in Operations Research and Industrial Automation. Aim towards improved efficiency of transportation services and industrial organization through better operations management. Research: Oriented towards the development of new mathematical models and algorithms for solving practical scheduling problems. Main problems addressed in the last 10 years concern real-time railway management, from capacity optimisation to speed control. Permanent development of tools based on most recent research. Education: Operations Research, Industrial Automation, Combinatorial Optimization, Optimization in Public Services, Logistics Optimization, Managerial Decision Support Systems. 2
3 Members The RailOptGroup at the Aut.O.R.I. Lab 1 full professor: Dario Pacciarelli, head of the Aut.O.R.I. Lab 1 assistant professor: Andrea D Ariano 1 Ph.D. student: Marcella Samà 2 external collaborators (among others): Marco Pranzo (University of Siena) Francesco Corman (T.U. Delft) Main achievements in the railway domain Publications on the top international journals on transportation Funded Projects: National (SAT, GENESI) and European projects (COMBINE). Prizes at Railway Application Section of Informs, IEEE Intelligent Transportation Systems Society, International Association of Railway Operations Research, Italian Association of Operations Research, TRAIL Research School. Committee Members: ATMOS, TRB, MT-ITS, IAROR, IEEE ITS 3
4 Presentation contents Introduction Traffic management models AGLIBRARY solver Alstom case study ROMA dispatching system 4
5 Research project Context: Keep service intentions in case of unexpected events Aim: Development of novel railway traffic management systems for a precise and effective train traffic regulation in terms of punctuality increase Tool: Flexible rail operations via advanced models and algorithms for train sequencing, routing and timing Application: Recover real-time railway traffic disturbances such as multiple delayed trains and blocked tracks 5
6 Station A Timetable Station B Station C Recovery time Station D Station E Minimum headway Buffer time Station F Time 6
7 Station A Real-time Initial delay Station B Station C Conflicts Station D Station E Delay Station F Currenttime Time 7
8 Station A Real-time Initial delay Timetable sequence Station B Station C Station D Consecutive delay Station E Delay Station F Currenttime Time 8
9 Station A Real-time Initial delay FIFO sequence Station B Station C Station D Consecutive delay Station E Delay Station F Currenttime Time 9
10 Maximum consecutive delay for a typical instance is 16 min and the average initial delay is 1.24 min Timetable sequence With rescheduling Comulative consecutive delay in all stations is 3093 min when using the timetable sequence and 1611 min if consecutive delays are minimized by optimal train rescheduling
11 State-of-the-art: Open issues No advanced dispatching support tool exists to reschedule vehicle movements during operations. In fact, there is still a lack of: Precision: Models and algorithms must include the variability of vehicle dynamics and must respect specific problem constraints; Robustness: Existing dispatching systems are able to provide viable solutions only for small instances and simple disturbances; Quality: A set of good solutions can be computed only if global conflict resolution is considered when computing orders, routes and times of the vehicles running in the studied railway area; Efficiency: The development of novel optimization algorithms must include the constraints due to limited computation times. 11
12 Presentation contents Introduction Traffic management models AGLIBRARY solver Alstom case study ROMA dispatching system 12
13 Blocking time theory Clearing point Block sections Sight & Reaction time Running time Minimum headway time Time Space Clearing & Switching time Switching time 13
14 Conflict detection and resolution (CDR) Stop Weight of fixed arcs Weight of alternative arcs 0 Time 0 Weight of fixed arcs Space Time 14
15 G = (N,F,A) Alternative Graph (AG) N = Set of nodes F = Set of fixed arcs A= Set of pairs of alternative arcs Max consecutive delay n [Pacciarelli EJOR 2002] Time t0 0 Selection S = Choose at most one arc from each pair in A, thus obtaining a graph G(S)=(N,F S) Problem= Find a complete selection S such that the longest path from 0 to n in G(S) is minimum 15
16 From AG to MILP t n t1 w8,1 t2 t3 w9,n w0,1 w12,n t7 w0,7 t8 t9 w4,9 t4 t5 t6 t10 0 t0 Min f(t,x) s.t. t1 w0,1 t7 w0,7 t4 w0,4 t10 w0,10 t2 t1 + w1,2 t12 t11 + w11,12 t1 t8 + w8,1 M (1 X8,1_2,7) t7 t2 + w2,7 MX8,1_2,7 t11 X8,1_2,7= 1 X9,2_3,8= 1 X10,3_4,9 = 1 X11,4_5,10 = 1 X12,5_6,11 = 1 t12 16/14
17 + + x M w t t F j i w t t x t f hk ij ij i j ij i j ) (1 ), ( ), ( min, MILP ( MILP (Mixed Mixed-Integer Integer Linear Linear Programming Programming) model model FIXED ROUTES FIXED ROUTES 17 = + + selected is k h if selected is j i if x A k h j i Mx w t t x M w t t hk ij hk ij hk h k hk ij ij i j ), ( 0 ), ( 1 ), ),(, (( ) (1,,,
18 MILP (Mixed-Integer Linear Programming) model FLEXIBLE ROUTES (D Ariano et al. 2013) min f ( t, x, r t t ns = 1 j k y rs t t i = 1 + w y) t j t i + w ij M (1 y rs ) + w M (1 x ) M (1 y h ij hk Mx ij, hk ij, hk M (1 y rs rs ) M (1 ) M (1 y uv ) y uv ) ( i, s = 1,..., nt j ) F rs, r, s (( i, j),( h, k) A x ij, hk = 1 0 if if ( i, j) is selected ( h, k) is selected y rs = 1 0 if route r of train s is otherwise selected ns: number of routes of train s nt: number of trains 18
19 Presentation contents Introduction Traffic management models AGLIBRARY solver Alstom case study ROMA dispatching system 19
20 Optimization software: AGLIBRARY XML input file: Timetable Infrastructure Data Train Train routes Data Passable Traveltimes Routes Infeasible Schedule Train (Re)Scheduling CDRFR*algorithms: Heuristics (e.g. FCFS, AMCC, JGH) Branch and Bound (B&B) Feasible Schedule Rerouting Alternatives? No Rerouting or Time Limit Reached Xml output: Optimal Orders Optimal Routes Possible Improvements New Routes Train Rerouting CDR algorithms: Local Search (LS) Tabu Search (TS) *Conflict Detection and Resolution with Fixed Routes 20
21 Illustrative example (1) CDRFR formulation of a small example with three trains TA TB TC TA out TB out -160 n 40 TC out -122 Each alternative pair is used to order two trains on a block section 21
22 Illustrative example (2) Optimal CDRFR solution computed by the B&B algorithm TC TB local rerouting available... TA 60 TA out TB out -160 n 40 TC out -122 Max cons. delay = 8 A conflict-free deadlock-free schedule is a complete consistent selection S 22
23 1 Illustrative example (3) Optimal solution to the compound CDR problem New output sequence! TB TC TA 60 TA out TB out -160 n 40 TC out Max cons. delay = 0 A new route for TA and a new complete consistent selection S are shown 23
24 Test on Utrecht-DenBosh dispatching area Utrecht-Den Bosch railway network (50 km long, including 21 station platforms) 40 running trains per hour (timetable 2007) Rolling stock connections are located in Zaltbommel and Den Bosch stations Rerouting is performed in stations and corridors (356 local routes) 24
25 Results on the compound CDR problem (1) [Transp. Science 2008] Percentage of maximum consecutive delays for four ROMA(AGLIBRARY) config. ARI + Default Routing ARI + Routing Optimization* B&B + Default Routing B&B + Routing Optimization* 0% 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Average Default Routing Routing Optimization Results Delay Delay Time Delay Delay Time Max Avg Tot Max Avg Tot ARI B&B (in seconds) * *Routing Optimization by the local search algorithm 25
26 Results on the compound CDR problem (2) [TRpB 2010] * * * * * Perturbations are multiple train delays Disruptions are tracks which are blocked * * * * * *Routing Optimization by the tabu search algorithm 26
27 Presentation contents Introduction Traffic management models AGLIBRARY solver Alstom case study ROMA dispatching system 27
28 Alstom Strategy Conflict Detection And Resolution LOCAL Alternative routes near the conflicts detected Current status Timetable Manager Infrastructure Manager Rolling Stock Manager ICONIS DSS New schedule Current status AGLibrary 28
29 Railway network (nearby London) 29
30 Example 1 of disruption 30
31 Set of 10 small instances ID Alstom Time horizon Average number for resources per train Total number of alternative routes Num of trains Num of alt pairs Num of arcs Num of nodes
32 Set of 9 medium instances ID Alstom Time horizon Average number for resources per train Total number of alternative routes Num of trains Num of alt pairs Num of arcs Num of nodes
33 Set of 10 large instances ID Alstom Time horizon Average number for resources per train Total number of alternative routes Num of trains Num of alt pairs Num of arcs Num of nodes
34 Computational results Intel Core 2 Duo E6550 (2.33 GHz), 2 GB di RAM, Windows XP Scheduling & routing problem (CDR problem) : 29 instances CPLEX (algorithm: 1 hour of computation): [MILP formulation solved by IBM LOG CPLEX MIP 12.0] 6 fails, 22 optimum, avg comp time (algo) best sol sec AGLIBRARY (algorithm: 20 sec of computation): [Branch & Bound (EJOR, 2007) + Tabu Search (TRpartB, 2010)] 0 fails, 21 optimum, avg comp time (algo) best sol 11.6 sec N.B. Specific information on disruption resolution scenarios is not yet included in the solver... 34
35 CPLEX vs AGLIBRARY (scheduling & routing) small instances medium instances large instances 35
36 CPLEX vs AGLIBRARY (scheduling & routing) Time solver to compute the best solution (in seconds) BB+TS 7000 CPLEX 6000 FAIL FAIL FAIL FAIL FAIL FAIL 5691,7 best solution time ,7 2426,7 2190, Instance ID 877,0 518,8 376,3 318,7337,9 10,4 13,1 39,0 4,5 15,5 14,8 27,0 25,7 120,7 21,0 116,7 207,1 236,7 80,6 1,1 1,1 4,1 3,1 0,8 1,4 1,3 1,1 4,8 8,5 5,5 13,9 8,4 3,5 1,3 9,1 6,0 5,9 9,0 23,5 2,3 2,6 18,4 24,2 19,1 29,0 24,5 79,3 23,1 0ID small instances medium instances large instances 36
37 Demo at Alstom Ferroviaria S.P.A.
38 Presentation contents Introduction Traffic management models AGLIBRARY solver Alstom case study ROMA dispatching system 38
39 ROMA* system (1) [Networks & Spat. Economics 2009] AGLIBRARY Data Loading: Actual speed and position of all trains at their entrance in the studied area; Infrastructure status (such as track layout, signals, switches and speed limits); Timetable data; Rolling stock characteristics; Any additional significant real-time information. RailXML *Railway traffic Optimization by Means of Alternative graphs 39
40 ROMA system (2) [Transp. Science 2008] AGLIBRARY Disruption Recovery: Discards infeasible routes from a list of prioritized routes; Assigns the feasible route with highest priority to each train; Emergency timetable to be adopted when dealing with situations of strong disorder. 40
41 ROMA system (3) [Transp. Science 2008] AGLIBRARY Real-Time Railway Traffic Optimization: Solves the conflict detection and resolution problem by means of alternative graphs and with strict time limits of computation; Modifies train routes & orders; Reduces delay propagation; Improves use of infrastructure capacity at network scale. 41
42 ROMA system (4) [Comprail 2006] [IEEE Trans. ITS 2007] AGLIBRARY Train Speed Coordination: Adjusts the speed profiles of the running trains (safe headway distances for any pair of trains); Checks feasibility according to the blocking time theory (i.e., UIC norm 406); Uses single/iterative scheduling strategies (in combination with the Real-Time Railway Traffic Optimization module). 42
43 Inputs Train Speed Coordination [Comprail 2006] [IEEE Trans. ITS 2007] Infrastructure Stations, signals, switches Speed limits Track layouts Signalling rules Rolling Stock Train length Standard acceleration & braking tables Initial speeds & positions Timetable Scheduled arrival/departure times Scheduled paths Stochastic disturbances Iterative rescheduling (Re)Calculation of Train Dynamics Running times Train trajectories No Overlap Detection Any overlaps of blocking times? Outputs Optimal orders Optimal routes New arrival/ departure times Yes Fixed speed CDR Minimizing consecutive delays 43
44 A list of recent railway-related publications: Corman, F., D Ariano, A. (2013). Assessment of advanced dispatching measures for recovering disrupted railway traffic situations, Transportation Research Record, Journal of the Transportation Research Board, 2289, 1 9. Kecman, P., Corman, F., D Ariano, A., Goverde, R.M.P. (2013). Rescheduling models for railway traffic management in large-scale networks. Public Transport: Planning and Operations. Larsen, R., Pranzo, M., D Ariano, A., Corman, F., Pacciarelli, D. (2013). Susceptibility of Optimal Train Schedules to Stochastic Disturbances of Process Times, Flexible Services and Manufacturing Journal. Corman, F., D Ariano, A., Hansen, I.A. (2013). Evaluating disturbance robustness of railway schedules, Journal of Intelligent Transport Systems: Technology, Planning, and Operations. Giacco, G.L., D Ariano, A., Pacciarelli, D. (2013). Rolling stock rostering optimization under maintenance constraints, Journal of Intelligent Transport Systems: Technology, Planning, and Operations. Corman, F., D'Ariano, A., Pacciarelli, D., Pranzo, M. (2012). Optimal inter-area coordination of train rescheduling decisions, Transportation Research Part E, 48(1), Corman, F., D'Ariano, A., Pacciarelli, D., Pranzo, M. (2012). Bi-objective conflict detection and resolution in railway traffic management. Transportation Research Part C, 20 (1), Corman, F, D'Ariano, A, Hansen, I.A., Pacciarelli, D. (2011). Optimal multi-class rescheduling of railway traffic, Journal of Rail Transport Planning & Management, 1 (1), Corman, F., D'Ariano, A, Pranzo, M, Hansen, I.A. (2011). Effectiveness of dynamic reordering and rerouting of trains in a complicated and densely occupied station area. Transportation Planning and Technology, 34 (4), Corman, F., D'Ariano, A, Pacciarelli, D, Pranzo, M. (2011). Centralized versus distributed systems to reschedule trains in two dispatching areas. Public Transport: Planning and Operations, 2 (3), Corman, F., D'Ariano, A., Pacciarelli, D., Pranzo (2010). M. A tabu search algorithm for rerouting trains during rail operations. Transportation Research Part B, 44 (1), Corman, F., D Ariano, A., Hansen, I.A. (2010). Disruption handling in large railway networks, In: B. Ning, C.A. Brebbia, N. Tomii (Eds.), Computers in Railways XII, WIT Transactions on The Built Environment D Ariano, A. (2010). Improving real-time train dispatching performance: Optimization models and algorithms for re-timing, re-ordering and local re-routing, 4OR: A Quarterly Journal of Operations Research, 8 (4),
45 D'ArianoA., PranzoM., (2009). An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances, Networks and Spatial Economics, 9 (1), Corman, F, D'Ariano, A, Pacciarelli, D, Pranzo, M (2009). Evaluation of green wave policy in real-time railway traffic management. Transportation Research Part C, 17 (6), Corman, F., Goverde, R.M.P., D Ariano, A. (2009) Rescheduling dense train traffic over complex station interlocking areas, Robust and Online Large-Scale Optimization, Lecture Notes in Computer Science 5868, D Ariano, A. (2009). Innovative decision support system for railway traffic control, IEEE Intelligent Transportation Systems Magazine, 1 (4), A. D Ariano (2008). Improving Real-Time Train Dispatching: Models, Algorithms and Applications, TRAIL Thesis Series T2008/6, pages 1 240, TRAIL Research School, 2008, Delft, The Netherlands. D'Ariano A., Pacciarelli D. and Pranzo M. (2008). Assessment of flexible timetables in real-time traffic management of a railway bottleneck, Transportation Research Part C, 16 (2), D'Ariano, A, Corman, F, Pacciarelli, D., Pranzo, M (2008). A Reordering and local rerouting strategies to manage train traffic in real-time. Transportation Science, 42 (4), Flamini, M. and Pacciarelli, D. (2008). Real time management of a metro rail terminus. European Journal of Operational Research, 189 (3), Mascis, A., D. Pacciarelli, M. Pranzo. (2008). Scheduling Models for Short-term Railway Traffic Optimisation. In M. Hickman, P. Mirchandani and S. Voß (Eds.), Lecture Notes in Economics and Mathematical Systems 600: Computer-aided Systems in Public Transport. Springer D'Ariano A., Pranzo M., Hansen, I.A. (2007). Conflict Resolution and Train Speed Coordination for Solving Real- Time Timetable Perturbations, IEEE Transactions on Intelligent Transportation Systems, 8 (2), D'Ariano A., Pacciarelli D., Pranzo M. (2007). A branch and bound algorithm for scheduling trains in a railway network, European Journal of Operational Research, 183 (2), D Ariano A., Albrecht, T. (2006). Running time re-optimization during real-time timetable perturbations, In: J. Allan, C.A. Brebbia, A.F. Rumsey, G. Sciutto, S. Sone and C.J. Goodman(Eds.), Computers in Railways IX, WIT Transactions on The Built Environment, 88, Mascis, A. and Pacciarelli, D. (2002). Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 143(3):
Railway traffic optimization by advanced scheduling and rerouting algorithms
Railway traffic optimization by advanced scheduling and rerouting algorithms 1 A. D Ariano, 1 F. Corman, 1 I.A. Hansen Department of Transport & Planning, Delft University of Technology, Delft, The Netherlands
More informationAppendix A. About RailSys 3.0. A.1 Introduction
Appendix A About RailSys 3.0 This appendix describes the software system for analysis RailSys used to carry out the different computational experiments and scenario designing required for the research
More informationUniversità degli Studi di Roma Tre Dipartimento di Informatica e Automazione. Via della Vasca Navale, 79 00146 Roma, Italy
R O M A TRE DIA Università degli Studi di Roma Tre Dipartimento di Informatica e Automazione Via della Vasca Navale, 79 00146 Roma, Italy Real-time scheduling of aircraft arrivals and departures in a terminal
More informationAnalysing the Metro Cityring in Copenhagen
Computers in Railways XI 45 Analysing the Metro Cityring in Copenhagen A. H. Kaas & E. M. Jacobsen Atkins, Denmark Abstract When planning new infrastructure it is important that the infrastructure is well
More informationA Survey on Problem Models and Solution Approaches to Rescheduling in Railway Networks
JOURNAL OF L A TEX CLASS FILES, VOL. -, NO. -, JANUARY 2015 1 A Survey on Problem Models and Solution Approaches to Rescheduling in Railway Networks Wei Fang, Member, IEEE, Shengxiang Yang, Senior Member,
More informationThe Rolling Stock Recovery Problem. Literature review. Julie Jespersen Groth *α, Jesper Larsen β and Jens Clausen *γ
The Rolling Stock Recovery Problem Julie Jespersen Groth *α, Jesper Larsen β and Jens Clausen *γ DTU Management Engineering, The Technical University of Denmark, Produktionstorvet, DTU Building 424, 2800
More informationNETWORK EFFECTS IN RAILWAY SYSTEMS
NETWORK EFFECTS IN RAILWAY SYSTEMS Alex Landex Technical University of Denmark, Centre for Traffic and Transport Otto Anker Nielsen Technical University of Denmark, Centre for Traffic and Transport 1 ABSTRACT
More informationChapter 2. Estimated Timetable. 2.1 Introduction. 2.2 Selected Timetable: Spoorboekje 1999-2000
Chapter 2 Estimated Timetable 2.1 Introduction A suitable starting point from where to do capacity evaluation and further cogitate upon alternative upgraded scenarios ought to be defined. This chapter
More informationUSING SMART CARD DATA FOR BETTER DISRUPTION MANAGEMENT IN PUBLIC TRANSPORT Predicting travel behavior of passengers
11 th TRAIL Congress November 2010 USING SMART CARD DATA FOR BETTER DISRUPTION MANAGEMENT IN PUBLIC TRANSPORT Predicting travel behavior of passengers Evelien van der Hurk MSc, Prof. dr. Leo Kroon, Dr.
More informationBranch-and-Price Approach to the Vehicle Routing Problem with Time Windows
TECHNISCHE UNIVERSITEIT EINDHOVEN Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents
More informationRe-optimization of Rolling Stock Rotations
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany RALF BORNDÖRFER 1, JULIKA MEHRGARDT 1, MARKUS REUTHER 1, THOMAS SCHLECHTE 1, KERSTIN WAAS 2 Re-optimization
More informationTrapeze Rail System Simulation and Planning
trapeze Rail System English Software for Rail Modelling and Planning Trapeze Rail System Simulation and Planning www.trapezegroup.com Enabling future railway plans Cost reductions through integrated planning
More informationRailML use in the project
French institute of science and technology for transport, spatial planning, development and networks RailML use in the project Grégory Marlière Optimal Networks for Train Integration Management across
More informationA Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution. Bartosz Sawik
Decision Making in Manufacturing and Services Vol. 4 2010 No. 1 2 pp. 37 46 A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution Bartosz Sawik Abstract.
More informationTwo objective functions for a real life Split Delivery Vehicle Routing Problem
International Conference on Industrial Engineering and Systems Management IESM 2011 May 25 - May 27 METZ - FRANCE Two objective functions for a real life Split Delivery Vehicle Routing Problem Marc Uldry
More informationAutomated planning of timetables in large railway networks using a microscopic data basis and railway simulation techniques
Automated planning of timetables in large railway networks using a microscopic data basis and railway simulation techniques A. Radtke 1 & D. Hauptmann 2 1 Institut für Verkehrswesen, Eisenbahnbau und betrieb,
More informationLecture 10 Scheduling 1
Lecture 10 Scheduling 1 Transportation Models -1- large variety of models due to the many modes of transportation roads railroad shipping airlines as a consequence different type of equipment and resources
More informationA New Solution for Rail Service Network Design Problem
A New Solution for Rail Service Network Design Problem E.Zhu 1 T.G.Crainic 2 M.Gendreau 3 1 Département d informatique et de recherche opérationnelle Université de Montréal 2 École des sciences de la gestion
More informationScheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
More informationAssessment of robust capacity utilisation in railway networks
Assessment of robust capacity utilisation in railway networks Lars Wittrup Jensen 2015 Agenda 1) Introduction to WP 3.1 and PhD project 2) Model for measuring capacity consumption in railway networks a)
More informationModels in Transportation. Tim Nieberg
Models in Transportation Tim Nieberg Transportation Models large variety of models due to the many modes of transportation roads railroad shipping airlines as a consequence different type of equipment
More information5 Performance Management for Web Services. Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology. stadler@ee.kth.
5 Performance Management for Web Services Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology stadler@ee.kth.se April 2008 Overview Service Management Performance Mgt QoS Mgt
More informationOPTIMIZED STAFF SCHEDULING AT SWISSPORT
Gurobi User Conference, Frankfurt, 01.02.2016 OPTIMIZED STAFF SCHEDULING AT SWISSPORT Prof. Dr. Andreas Klinkert Dr. Peter Fusek Dipl. Ing. Roman Berner Rita Thalmann Simona Segessenmann Zurich University
More informationSolving convex MINLP problems with AIMMS
Solving convex MINLP problems with AIMMS By Marcel Hunting Paragon Decision Technology BV An AIMMS White Paper August, 2012 Abstract This document describes the Quesada and Grossman algorithm that is implemented
More informationA hierarchical multicriteria routing model with traffic splitting for MPLS networks
A hierarchical multicriteria routing model with traffic splitting for MPLS networks João Clímaco, José Craveirinha, Marta Pascoal jclimaco@inesccpt, jcrav@deecucpt, marta@matucpt University of Coimbra
More informationA MULTI-PERIOD INVESTMENT SELECTION MODEL FOR STRATEGIC RAILWAY CAPACITY PLANNING
A MULTI-PERIOD INVESTMENT SELECTION MODEL FOR STRATEGIC RAILWAY Yung-Cheng (Rex) Lai, Assistant Professor, Department of Civil Engineering, National Taiwan University, Rm 313, Civil Engineering Building,
More informationMultiple Spanning Tree Protocol (MSTP), Multi Spreading And Network Optimization Model
Load Balancing of Telecommunication Networks based on Multiple Spanning Trees Dorabella Santos Amaro de Sousa Filipe Alvelos Instituto de Telecomunicações 3810-193 Aveiro, Portugal dorabella@av.it.pt Instituto
More informationContinuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information
Continuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information Eric Hsueh-Chan Lu Chi-Wei Huang Vincent S. Tseng Institute of Computer Science and Information Engineering
More informationCapacity Statement for Railways
Capacity Statement for Railways Alex Landex, al@ctt.dtu.dk Centre for Traffic and Transport, Technical University of Denmark 1 Abstract The subject Railway capacity is a combination of the capacity consumption
More informationElevator Simulation and Scheduling: Automated Guided Vehicles in a Hospital
Elevator Simulation and Scheduling: Automated Guided Vehicles in a Hospital Johan M. M. van Rooij Guest Lecture Utrecht University, 31-03-2015 from x to u The speaker 2 Johan van Rooij - 2011 current:
More informationAn optimisation framework for determination of capacity in railway networks
CASPT 2015 An optimisation framework for determination of capacity in railway networks Lars Wittrup Jensen Abstract Within the railway industry, high quality estimates on railway capacity is crucial information,
More informationStrategic evolution of railway corridor infrastructure: dual approach for assessing capacity investments and M&R strategies
Strategic evolution of railway corridor infrastructure: dual approach for assessing capacity investments and M&R strategies Y. Putallaz & R. Rivier EPFL Swiss Federal Institute of Technology, Lausanne
More informationA Constraint Programming based Column Generation Approach to Nurse Rostering Problems
Abstract A Constraint Programming based Column Generation Approach to Nurse Rostering Problems Fang He and Rong Qu The Automated Scheduling, Optimisation and Planning (ASAP) Group School of Computer Science,
More informationReal-Time Traffic Control in Railway Systems
Real-Time Traffic Control in Railway Systems Carlo Mannino Dipartimento di Informatica e Sistemistica, Università di Roma Sapienza, e-mail: mannino@dis.uniroma1.it. Abstract Despite the constantly increasing
More informationSimulation of Railway Networks
began a few years ago as a research project at the Swiss Federal Institute of Technology. The aim of the project, Object-Oriented Modeling in Railways, was to develop a userfriendly tool to answer questions
More informationSimulation of modified timetables for high speed trains Stockholm Göteborg
17 18 May 2010, Opatija, Croatia First International Conference on Road and Rail Infrastructure Simulation of modified timetables for high speed trains Stockholm Göteborg H. Sipilä Division of Traffic
More informationTitle: Integrating Management of Truck and Rail Systems in LA. INTERIM REPORT August 2015
Title: Integrating Management of Truck and Rail Systems in LA Project Number: 3.1a Year: 2013-2017 INTERIM REPORT August 2015 Principal Investigator Maged Dessouky Researcher Lunce Fu MetroFreight Center
More informationHybrid and distributed systems and control
Hybrid and distributed systems and control Overview Introduction week DCSC September 3, 2013 1 Team members Bart De Schutter Ton van den Boom Tamás Keviczky [ + vacancy ] + 3 postdocs + 19 PhD students
More informationApplying multiscaling analysis to detect capacity resources in railway networks
Timetabling 73 Applying multiscaling analysis to detect capacity resources in railway networks A. Gille, M. Klemenz & Th. Siefer Institute of Transport, Railway Construction and Operation, Leibniz Universität
More informationCharles Fleurent Director - Optimization algorithms
Software Tools for Transit Scheduling and Routing at GIRO Charles Fleurent Director - Optimization algorithms Objectives Provide an overview of software tools and optimization algorithms offered by GIRO
More informationPlanning and Scheduling in the Digital Factory
Institute for Computer Science and Control Hungarian Academy of Sciences Berlin, May 7, 2014 1 Why "digital"? 2 Some Planning and Scheduling problems 3 Planning for "one-of-a-kind" products 4 Scheduling
More informationMixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness
Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness Débora P. Ronconi Ernesto G. Birgin April 29, 2010 Abstract Scheduling problems involving
More informationHigh-performance local search for planning maintenance of EDF nuclear park
High-performance local search for planning maintenance of EDF nuclear park Frédéric Gardi Karim Nouioua Bouygues e-lab, Paris fgardi@bouygues.com Laboratoire d'informatique Fondamentale - CNRS UMR 6166,
More informationAn Interactive Train Scheduling Tool for Solving and Plotting Running Maps
An Interactive Train Scheduling Tool for Solving and Plotting Running Maps F. Barber 1, M.A. Salido 2, L. Ingolotti 1, M. Abril 1, A. Lova 3, P. Tormos 3 1 DSIC, 3 DEIOAC, Universidad Politécnica de Valencia,
More informationIntroduction to Metropolitan Area Networks and Wide Area Networks
Introduction to Metropolitan Area Networks and Wide Area Networks Chapter 9 Learning Objectives After reading this chapter, you should be able to: Distinguish local area networks, metropolitan area networks,
More informationIntegrated maintenance scheduling for semiconductor manufacturing
Integrated maintenance scheduling for semiconductor manufacturing Andrew Davenport davenport@us.ibm.com Department of Business Analytics and Mathematical Science, IBM T. J. Watson Research Center, P.O.
More informationA Branch-Cut-and-Price Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions
A Branch-Cut-and-Price Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions Marc Goerigk, Bob Grün, and Philipp Heßler Fachbereich Mathematik, Technische Universität
More informationSecurity-Aware Beacon Based Network Monitoring
Security-Aware Beacon Based Network Monitoring Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi Graduate School of Informatics, Kyoto University, Kyoto, Japan Email: {sasaki, liang, nag}@amp.i.kyoto-u.ac.jp
More informationRailway Timetabling from an Operations Research Perspective
Railway Timetabling from an Operations Research Perspective Leo Kroon 1,3, Dennis Huisman 2,3, Gábor Maróti 1 1 Rotterdam School of Management Erasmus Center for Optimization in Public Transport (ECOPT)
More informationPANDA: A Software Tool for Improved Train Dispatching with Focus on Passenger Flows
CASPT 2015 PANDA: A Software Tool for Improved Train Dispatching with Focus on Passenger Flows Ralf Rückert Martin Lemnian Christoph Blendinger Steffen Rechner Matthias Müller-Hannemann Abstract Delay
More informationRECIFE: a MCDSS for Railway Capacity
RECIFE: a MCDSS for Railway Capacity Xavier GANDIBLEUX (1), Pierre RITEAU (1), and Xavier DELORME (2) (1) LINA - Laboratoire d Informatique de Nantes Atlantique Universite de Nantes 2 rue de la Houssiniere
More informationA WEB-BASED TRAFFIC INFORMATION SYSTEM USING WIRELESS COMMUNICATION TECHNIQUES
Advanced OR and AI Methods in Transportation A WEB-BASED TRAFFIC INFORMATION SYSTEM USING WIRELESS COMMUNICATION TECHNIQUES Akmal ABDELFATAH 1, Abdul-Rahman AL-ALI 2 Abstract. This paper presents a procedure
More informationAssembly line balancing to minimize balancing loss and system loss. D. Roy 1 ; D. Khan 2
J. Ind. Eng. Int., 6 (11), 1-, Spring 2010 ISSN: 173-702 IAU, South Tehran Branch Assembly line balancing to minimize balancing loss and system loss D. Roy 1 ; D. han 2 1 Professor, Dep. of Business Administration,
More informationA Quantitative Decision Support Framework for Optimal Railway Capacity Planning
A Quantitative Decision Support Framework for Optimal Railway Capacity Planning Y.C. Lai, C.P.L. Barkan University of Illinois at Urbana-Champaign, Urbana, USA Abstract Railways around the world are facing
More informationCombined Virtual Mobile Core Network Function Placement and Topology Optimization with Latency bounds
Combined Virtual Mobile Core Network Function Placement and Topology Optimization with Latency bounds Andreas Baumgartner Varun Reddy Thomas Bauschert Chair of Communication Networks Technische Universita
More informationVEHICLE ROUTING AND SCHEDULING PROBLEMS: A CASE STUDY OF FOOD DISTRIBUTION IN GREATER BANGKOK. Kuladej Panapinun and Peerayuth Charnsethikul.
1 VEHICLE ROUTING AND SCHEDULING PROBLEMS: A CASE STUDY OF FOOD DISTRIBUTION IN GREATER BANGKOK By Kuladej Panapinun and Peerayuth Charnsethikul Abstract Vehicle routing problem (VRP) and its extension
More informationINTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models
Integer Programming INTEGER PROGRAMMING In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is
More informationAUTOMATIC TRAIN OPERATION: THE MANDATORY IMPROVEMENT FOR ETCS APPLICATIONS
AUTOMATIC TRAIN OPERATION: THE MANDATORY IMPROVEMENT FOR ETCS APPLICATIONS Benoit Bienfait and Patrick Zoetardt, Alstom Transport, Belgium Bob Barnard, Signalling Solutions Ltd, UK SUMMARY European Main
More informationAn Energy-Aware Methodology for Live Placement of Virtual Machines with Variable Profiles in Large Data Centers
An Energy-Aware Methodology for Live Placement of Virtual Machines with Variable Profiles in Large Data Centers Rossella Macchi: Danilo Ardagna: Oriana Benetti: Politecnico di Milano eni s.p.a. Politecnico
More informationOPENTRACK: Simulation of complex nodes
OPENTRACK: Simulation of complex nodes Case Studies in Italy Zurich, 21st January 2010 About Us Important railway university in Italy OT Users since 2004 Spin-off since 2007 Cloose Cooperation with RFI
More informationBatch Production Scheduling in the Process Industries. By Prashanthi Ravi
Batch Production Scheduling in the Process Industries By Prashanthi Ravi INTRODUCTION Batch production - where a batch means a task together with the quantity produced. The processing of a batch is called
More informationResearch Paper Business Analytics. Applications for the Vehicle Routing Problem. Jelmer Blok
Research Paper Business Analytics Applications for the Vehicle Routing Problem Jelmer Blok Applications for the Vehicle Routing Problem Jelmer Blok Research Paper Vrije Universiteit Amsterdam Faculteit
More information- Robustness in Railway Operations RobustRailS Robust Railway Operations
- Robustness in Railway Operations RobustRailS Robust Railway Operations TØF,, 2014 11//2014 RobustRailS the project januar 2012 december 2015 DTU Management, DTU Transport, DTU Compute, DTU Fotonik Total
More informationOptimal Scheduling for Dependent Details Processing Using MS Excel Solver
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 8, No 2 Sofia 2008 Optimal Scheduling for Dependent Details Processing Using MS Excel Solver Daniela Borissova Institute of
More informationOnline vehicle routing and scheduling with continuous vehicle tracking
Online vehicle routing and scheduling with continuous vehicle tracking Jean Respen, Nicolas Zufferey, Jean-Yves Potvin To cite this version: Jean Respen, Nicolas Zufferey, Jean-Yves Potvin. Online vehicle
More informationA Mathematical Programming Solution to the Mars Express Memory Dumping Problem
A Mathematical Programming Solution to the Mars Express Memory Dumping Problem Giovanni Righini and Emanuele Tresoldi Dipartimento di Tecnologie dell Informazione Università degli Studi di Milano Via Bramante
More informationOpenTrack simulation for suburban tunnel in Paris (RER B & D)
OpenTrack simulation for suburban tunnel in Paris (RER B & D) Presentation Opentrack Viriato workshop January 24th, 2008 Zurich, Switzerland EGIS - ERIC BENARD Table of contents Introduction Overall context
More informationA Weighted-Sum Mixed Integer Program for Bi-Objective Dynamic Portfolio Optimization
AUTOMATYKA 2009 Tom 3 Zeszyt 2 Bartosz Sawik* A Weighted-Sum Mixed Integer Program for Bi-Objective Dynamic Portfolio Optimization. Introduction The optimal security selection is a classical portfolio
More informationMulti-layer MPLS Network Design: the Impact of Statistical Multiplexing
Multi-layer MPLS Network Design: the Impact of Statistical Multiplexing Pietro Belotti, Antonio Capone, Giuliana Carello, Federico Malucelli Tepper School of Business, Carnegie Mellon University, Pittsburgh
More informationA Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem
A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical
More informationData-Driven Optimization
Data-Driven Optimization John Turner Assistant Professor The Paul Merage School of Business University of California, Irvine October 24, 2014: UCI Data Science Initiative Analytics Unlocking the Potential
More informationHet inplannen van besteld ambulancevervoer (Engelse titel: Scheduling elected ambulance transportation)
Technische Universiteit Delft Faculteit Elektrotechniek, Wiskunde en Informatica Delft Institute of Applied Mathematics Het inplannen van besteld ambulancevervoer (Engelse titel: Scheduling elected ambulance
More informationQoS optimization for an. on-demand transportation system via a fractional linear objective function
QoS optimization for an Load charge ratio on-demand transportation system via a fractional linear objective function Thierry Garaix, University of Avignon (France) Column Generation 2008 QoS optimization
More informationA Set-Partitioning-Based Model for the Stochastic Vehicle Routing Problem
A Set-Partitioning-Based Model for the Stochastic Vehicle Routing Problem Clara Novoa Department of Engineering and Technology Texas State University 601 University Drive San Marcos, TX 78666 cn17@txstate.edu
More informationRailway operation analysis
Railway operation analysis Evaluation of quality, infrastructure and timetable on single and double-track lines with analytical models and simulation Olov Lindfeldt Doctoral thesis Division of Traffic
More informationAlighting and boarding times of passengers at Dutch railway stations
Alighting and boarding times of passengers at Dutch railway stations Analysis of data collected at 7 railway stations in October 2000 TRAIL Research School, Delft, December 2001 Author: Ir. Paul B.L. Wiggenraad
More informationWhy not a Last Clear signal Aspect (LCA)?
Why not a Last Clear signal Aspect (LCA)? 1/28 Former Driver Advisory System (DAS) Planned timetable Telephone between dispatcher and stations Real timetable and forecast Pencils and eraser RGCF & SNCF
More informationGenerating Personnel Schedules in an Industrial Setting Using a Tabu Search Algorithm
Generating Personnel Schedules in an Industrial Setting Using a Tabu Search Algorithm Pascal Tellier 1 and George White 2 1 PrairieFyre Software Inc., 555 Legget Dr., Kanata K2K 2X3, Canada pascal@prairiefyre.com
More informationSupply Chain Design and Inventory Management Optimization in the Motors Industry
A publication of 1171 CHEMICAL ENGINEERING TRANSACTIONS VOL. 32, 2013 Chief Editors: Sauro Pierucci, Jiří J. Klemeš Copyright 2013, AIDIC Servizi S.r.l., ISBN 978-88-95608-23-5; ISSN 1974-9791 The Italian
More informationFLEET REROUTING STRATEGIES WITH REAL-TIME TRAFFIC INFORMATION
FLEET REROUTING STRATEGIES WITH REAL-TIME TRAFFIC INFORMATION Barceló, Jaume. Department of Statistics and Operations Research and CENIT (Center for Innovation in Transport), Universitat Politècnica de
More informationSPRINT: Optimization of Staff Management for Desk Customer Relations Services at Hera
Daniel H. Wagner Prize for Excellence in Operations Research Practice Minneapolis, October 7, 2013 SPRINT: Optimization of Staff Management for Desk Customer Relations Services at Hera DEI, Università
More informationResearch of Railway Wagon Flow Forecast System Based on Hadoop-Hazelcast
International Conference on Civil, Transportation and Environment (ICCTE 2016) Research of Railway Wagon Flow Forecast System Based on Hadoop-Hazelcast Xiaodong Zhang1, a, Baotian Dong1, b, Weijia Zhang2,
More informationROMA TRE UNIVERSITÀ DEGLI STUDI. Doctor of Philosophy in Computer Science and Automation Roma Tre University Department of Engineering XXV Cycle
ROMA TRE UNIVERSITÀ DEGLI STUDI Doctor of Philosophy in Computer Science and Automation Roma Tre University Department of Engineering XXV Cycle Rolling stock rostering and maintenance scheduling optimization
More informationEnglish. Trapeze Rail System. www.trapezegroup.com
English Trapeze Rail System www.trapezegroup.com Trapeze Rail System Enabling future railway, tram and metro transport The worldwide growth in demand for travel and increasing competition between all modes
More informationProduction Scheduling for Dispatching Ready Mixed Concrete Trucks Using Bee Colony Optimization
American J. of Engineering and Applied Sciences 3 (1): 7-14, 2010 ISSN 1941-7020 2010 Science Publications Production Scheduling for Dispatching Ready Mixed Concrete Trucks Using Bee Colony Optimization
More informationDistributed Control in Transportation and Supply Networks
Distributed Control in Transportation and Supply Networks Marco Laumanns, Institute for Operations Research, ETH Zurich Joint work with Harold Tiemessen, Stefan Wörner (IBM Research Zurich) Apostolos Fertis,
More informationR u t c o r Research R e p o r t. A Method to Schedule Both Transportation and Production at the Same Time in a Special FMS.
R u t c o r Research R e p o r t A Method to Schedule Both Transportation and Production at the Same Time in a Special FMS Navid Hashemian a Béla Vizvári b RRR 3-2011, February 21, 2011 RUTCOR Rutgers
More informationOPTIMISING THE RESOURCES OF THE WORLD. Resource Planning & Management Systems. www.siscog.pt
OPTIMISING THE RESOURCES OF THE WORLD Resource Planning & Management Systems www.siscog.pt About us SISCOG is a software company that provides decisionsupport systems for resource planning and management
More informationAnalysis of Micro-Macro Transformations of Railway Networks
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany MARCO BLANCO THOMAS SCHLECHTE Analysis of Micro-Macro Transformations of Railway Networks Zuse Institute Berlin
More informationContext-Aware Route Planning
Context-Aware Route Planning A. W. ter Mors, C. Witteveen, J. Zutt, F. A. Kuipers Delft University of Technology September 28, 2010 Problem description A set of agents, each with their own start and destination
More informationThe Problem of Scheduling Technicians and Interventions in a Telecommunications Company
The Problem of Scheduling Technicians and Interventions in a Telecommunications Company Sérgio Garcia Panzo Dongala November 2008 Abstract In 2007 the challenge organized by the French Society of Operational
More informationAirline Schedule Development
Airline Schedule Development 16.75J/1.234J Airline Management Dr. Peter Belobaba February 22, 2006 Airline Schedule Development 1. Schedule Development Process Airline supply terminology Sequential approach
More informationA Tool for Generating Partition Schedules of Multiprocessor Systems
A Tool for Generating Partition Schedules of Multiprocessor Systems Hans-Joachim Goltz and Norbert Pieth Fraunhofer FIRST, Berlin, Germany {hans-joachim.goltz,nobert.pieth}@first.fraunhofer.de Abstract.
More informationAutomating Rolling Stock Diagramming and Platform Allocation
Automating Rolling Stock Diagramming and Platform Allocation Mark Withall 1, Chris Hinde 1, Tom Jackson 2, Iain Phillips 1, Steve Brown 3 and Robert Watson 3 Abstract Rolling stock allocation is the process
More informationFreight Sequencing to Improve Hub Operations in the Less-Than-Truckload Freight Transportation Industry
Freight Sequencing to Improve Hub Operations in the Less-Than-Truckload Freight Transportation Industry Xiangshang Tong, Ph.D. Menlo Worldwide Logistics Kimberly Ellis, Ph.D. Virginia Tech Amy Brown Greer
More informationRailway Simulation & Timetable Planning
Your Local Partner for Railway Projects Anywhere in South East Asia Railway Simulation & Timetable Planning Engineering & Maintenance CONSULTING SIMULATION PLANNING ENGINEERING PRODUCTS TECH SUPPORT Simulation
More informationLecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method
Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming
More informationDistributed and Scalable QoS Optimization for Dynamic Web Service Composition
Distributed and Scalable QoS Optimization for Dynamic Web Service Composition Mohammad Alrifai L3S Research Center Leibniz University of Hannover, Germany alrifai@l3s.de Supervised by: Prof. Dr. tech.
More informationA Decision Support System for Crew Planning in Passenger Transportation using a Flexible Branch-and-Price Algorithm
A Decision Support System for Crew Planning in Passenger Transportation using a Flexible Branch-and-Price Algorithm RICHARD FRELING 1, 2*, RAMON M. LENTINK 1, 2 AND ALBERT P.M. WAGELMANS 1 1 Erasmus Center
More informationFrans J.C.T. de Ruiter, Norman L. Biggs Applications of integer programming methods to cages
Frans J.C.T. de Ruiter, Norman L. Biggs Applications of integer programming methods to cages Article (Published version) (Refereed) Original citation: de Ruiter, Frans and Biggs, Norman (2015) Applications
More information