Chapter 3 Passenger Railway Optimization

Publisher Summary Railway transportation can be split into passenger transportation and cargo transportation. This chapter discusses the European situation, where the major part of railway transportation consists of passenger transportation without addressing important problems in cargo transportation—such as car blocking, train makeup, train routing, and empty car distribution. The chapter describes several mathematical models and optimization techniques that have been developed for effectively supporting traditional planning processes in passenger railway transportation. A lot of research has been carried out in this area, both of a practical and theoretical nature. The results of this research are starting to be applied in practice. Real-time control is at the other side of the planning spectrum. The current trend in the railway industry is a shift from “planning in detail” to “effective real-time control.” Disturbances and disruptions in the railway operations are inevitable. Therefore, large parts of the operational plans are never carried out.

[1]  J. P. Arabeyre,et al.  The Airline Crew Scheduling Problem: A Survey , 1969 .

[2]  Alain Billionnet,et al.  Using Integer Programming to Solve the Train-Platforming Problem , 2003, Transp. Sci..

[3]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[4]  Matteo Fischetti,et al.  Modeling and Solving the Crew Rostering Problem , 1998, Oper. Res..

[5]  Nagraj Balakrishnan,et al.  A network model for the rotating workforce scheduling problem , 1990, Networks.

[6]  Ernesto M. Morgado,et al.  Scheduling and managing crew in the Portuguese railways , 1992 .

[7]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[8]  Leo G. Kroon,et al.  On solving multi-type railway line planning problems , 2006, Eur. J. Oper. Res..

[9]  Peter Brucker,et al.  Routing of Railway Carriages , 2003, J. Glob. Optim..

[10]  Marc Peeters,et al.  Circulation of railway rolling stock: a branch-and-price approach , 2003, Comput. Oper. Res..

[11]  Karl Nachtigall,et al.  A genetic algorithm approach to periodic railway synchronization , 1996, Comput. Oper. Res..

[12]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[13]  Matteo Fischetti,et al.  Algorithms for railway crew management , 1997, Math. Program..

[14]  Giorgio Gallo,et al.  Dispatching Buses in Parking Depots , 2001, Transp. Sci..

[15]  Leo G. Kroon,et al.  A rolling stock circulation model for combining and splitting of passenger trains , 2006, Eur. J. Oper. Res..

[16]  Dag Wedelin,et al.  An algorithm for large scale 0–1 integer programming with application to airline crew scheduling , 1995, Ann. Oper. Res..

[17]  Andreas T. Ernst,et al.  An Integrated Optimization Model for Train Crew Management , 2001, Ann. Oper. Res..

[18]  Jacques Desrosiers,et al.  A Column Generation Approach for Large-Scale Aircrew Rostering Problems , 1999, Oper. Res..

[19]  U. T. Zimmermann,et al.  Train Schedule Optimization in Public Rail Transport , 2003 .

[20]  X. Cai,et al.  A fast heuristic for the train scheduling problem , 1994, Comput. Oper. Res..

[21]  Paolo Toth,et al.  Models and algorithms for a staff scheduling problem , 2003, Math. Program..

[22]  Leo G. Kroon,et al.  A Branch-and-Cut Approach for Solving Railway Line-Planning Problems , 2004, Transp. Sci..

[23]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[24]  Sohail S. Chaudhry,et al.  Fuzzy dispatching model and genetic algorithms for railyards operations , 2000, Eur. J. Oper. Res..

[25]  Nigel H. Wilson,et al.  Computer-Aided Transit Scheduling , 1999, Lecture Notes in Economics and Mathematical Systems.

[26]  J. Beasley.  An algorithm for set covering problem , 1987 .

[27]  Malachy Carey,et al.  Scheduling and Platforming Trains at Busy Complex Stations , 2003 .

[28]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[29]  Leo G. Kroon,et al.  Maintenance routing for train units: The interchange model , 2007, Comput. Oper. Res..

[30]  Malachy Carey,et al.  A Model, Algorithms and Strategy for Train Pathing , 1995 .

[31]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

[32]  Leo G. Kroon,et al.  Reinventing Crew Scheduling at Netherlands Railways , 2004, Interfaces.

[33]  Paolo Toth,et al.  A Lagrangian heuristic algorithm for a real-world train timetabling problem , 2006, Discret. Appl. Math..

[34]  Uwe T. Zimmermann,et al.  Real-time dispatch of trams in storage yards , 2000, Ann. Oper. Res..

[35]  Leo Kroon,et al.  Routing trains through railway stations: complexity issues , 1997 .

[36]  Michiel A. Odijk,et al.  A CONSTRAINT GENERATION ALGORITHM FOR THE CONSTRUCTION OF PERIODIC RAILWAY TIMETABLES , 1996 .

[37]  Guy Desaulniers,et al.  Dispatching Buses in a Depot Using Block Patterns , 2006, Transp. Sci..

[38]  Mirka Miller,et al.  The train marshalling problem , 2000, Discret. Appl. Math..

[39]  Leo G. Kroon,et al.  Routing Trains Through Railway Stations: Model Formulation and Algorithms , 1996, Transp. Sci..

[40]  Michael R. Bussieck,et al.  Scheduling trams in the morning , 1999, Math. Methods Oper. Res..

[41]  Katta G. Murty,et al.  Mathematical programming: State of the art 1994 , 1994 .

[42]  James M. Tien,et al.  On Manpower Scheduling Algorithms , 1982 .

[43]  A. Bouma,et al.  Linienplanung und Simulation für öffentliche Verkehrswege in Praxis und Theorie , 1994 .

[44]  David M. Ryan,et al.  The Solution of Massive Generalized Set Partitioning Problems in Aircrew Rostering , 1992 .

[45]  Leo Kroon,et al.  Maintenance routing for train units: the scenario model , 2004 .

[46]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[47]  Anthony Wren,et al.  Experiences with a Flexible Driver Scheduler , 2001 .

[48]  Jean-François Cordeau,et al.  Simultaneous Assignment of Locomotives and Cars to Passenger Trains , 1998, Oper. Res..

[49]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[50]  Michael R. Bussieck,et al.  Optimal Lines in Public Rail Transport , 1998 .

[51]  Michael R. Bussieck,et al.  Discrete optimization in public rail transport , 1997, Math. Program..

[52]  L. W. Jacobs,et al.  Note: A local-search heuristic for large set-covering problems , 1995 .

[53]  Norio Tomii,et al.  Shunting scheduling problem at railway stations , 1999 .

[54]  G. Mitra,et al.  Computer Scheduling of Public Transport , 1982 .

[55]  Leo G. Kroon,et al.  A Variable Trip Time Model for Cyclic Railway Timetabling , 2003, Transp. Sci..

[56]  Stefan Voß,et al.  Computer-Aided Scheduling of Public Transport , 2001 .

[57]  Walter Ukovich,et al.  A Mathematical Model for Periodic Scheduling Problems , 1989, SIAM J. Discret. Math..

[58]  Leon W P Peeters,et al.  Cyclic Railway Timetable Optimization , 2003 .

[59]  Paolo Toth,et al.  A Global Method for Crew Planning in Railway Applications , 2001 .

[60]  Leo G. Kroon,et al.  Cyclic Railway Timetabling: A Stochastic Optimization Approach , 2004, ATMOS.

[61]  Dorotea De Luca Cardillo,et al.  k L-list λ colouring of graphs , 1998, Eur. J. Oper. Res..

[62]  Nejib Ben-Khedher,et al.  Schedule Optimization at SNCF: From Conception to Day of Departure , 1998, Interfaces.

[63]  N. Tomii,et al.  Depot Shunting Scheduling Using Combined Genetic Algorithm And PERT , 2000 .

[64]  Richard Freling,et al.  Scheduling train crews: a case study for the Dutch Railways , 2000 .

[65]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[66]  L. A. Lorena,et al.  A surrogate heuristic for set covering problems , 1994 .

[67]  G. Maróti,et al.  Maintenance Routing for Train Units: The Transition Model , 2005, Transp. Sci..

[68]  Paolo Toth,et al.  A Survey of Optimization Models for Train Routing and Scheduling , 1998, Transp. Sci..

[69]  Thomas Winter,et al.  Online and Real-Time Dispatching Problems , 1999 .

[70]  Antonio Sassano,et al.  A Lagrangian-based heuristic for large-scale set covering problems , 1998, Math. Program..

[71]  Egon Balas,et al.  A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering , 1992, Oper. Res..

[72]  Patrick T. Harker,et al.  Tactical Scheduling of Rail Operations: The SCAN I System , 1991, Transp. Sci..

[73]  Leo G. Kroon,et al.  Allocation of Railway Rolling Stock for Passenger Trains , 2002, Transp. Sci..

[74]  P. Kreuzer,et al.  Optimal lines for railway systems , 1997 .

[75]  Andreas T. Ernst,et al.  An Annotated Bibliography of Personnel Scheduling and Rostering , 2004, Ann. Oper. Res..

[76]  Erhan Kozan,et al.  Heuristic Techniques for Single Line Train Scheduling , 1997, J. Heuristics.

[77]  Nico M. van Dijk,et al.  Cost optimal allocation of rail passenger lines , 1998, Eur. J. Oper. Res..

[78]  Toshihide Ibaraki,et al.  A 3-flip neighborhood local search for the set covering problem , 2006, Eur. J. Oper. Res..

[79]  J. Beasley,et al.  Enhancing an algorithm for set covering problems , 1992 .

[80]  Jacques Desrosiers,et al.  OPERATIONAL CAR ASSIGNMENT AT VIA RAIL CANADA , 2000 .

[81]  Per Olov Lindberg,et al.  Railway Timetabling Using Lagrangian Relaxation , 1998, Transp. Sci..

[82]  Dennis Huisman,et al.  Shunting of Passenger Train Units in a Railway Station , 2002, Transp. Sci..

[83]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[84]  Albert P. M. Wagelmans,et al.  A Decision Support System for Crew Planning in Passenger Transportation Using a Flexible Branch-and-Price Algorithm , 2004, Ann. Oper. Res..

[85]  Andreas T. Ernst,et al.  Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..

[86]  Gabriele Di Stefano,et al.  A Graph Theoretical Approach To The Shunting Problem , 2004, Electron. Notes Theor. Comput. Sci..

[87]  Leo G. Kroon,et al.  Routing trains through a railway station based on a node packing model , 2001, Eur. J. Oper. Res..

[88]  Dennis Huisman,et al.  Operations Research in passenger railway transportation , 2005 .

[89]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[90]  Lex Schrijver,et al.  Minimum circulation of railway stock , 1993 .

[91]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[92]  D. I. Calvert,et al.  Computer Scheduling of Public Transport 2 , 1986 .

[93]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[94]  Sydney C. K. Chu,et al.  Crew scheduling of light rail transit in Hong Kong: from modeling to implementation , 1998, Comput. Oper. Res..

[95]  Matteo Fischetti,et al.  Modeling and Solving the Train Timetabling Problem , 2002, Oper. Res..

[96]  Michel Gamache,et al.  A METHOD FOR OPTIMALLY SOLVING THE ROSTERING PROBLEM , 1993 .

[97]  J. Beasley.  A lagrangian heuristic for set‐covering problems , 1990 .