A rolling stock circulation model for combining and splitting of passenger trains

Fioole, Pieter‐Jan; Kroon, Leo; Maróti, Gábor; Schrijver, Alexander

doi:10.1016/j.ejor.2005.03.032

Cited by 158 publications

(144 citation statements)

References 7 publications

Supporting

Mentioning

143

Contrasting

Order By: Relevance

“…They solve the problem by using a Dantzig-Wolfe reformulation and applying a branch-and-price algorithm, being able to find the optimal solution of real-world instances of NSR (the main Dutch Train Operator) in very short computing times. Fioole et al [15] present a mixed ILP model that can be seen as an extended version of the model described by [25]. They apply several methods to improve the continuous relaxation and manage to solve to near optimality real-world instances by a general-purpose ILP solver.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Solving a real-world train-unit assignment problem

2010

View full text Add to dashboard Cite

Abstract. We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenger seats, and a set of train units, each with a given number of available seats, the problem calls for an assignment of the train units to trips, possibly combining more than one train unit for a given trip, that fulfills the seat requests. With respect to analogous case studies previously faced in the literature, ours is characterized by the fairly large number of distinct train unit types available (in addition to the fairly large number of trips to be covered). As a result, although there is a wide margin of improvement over the solution used by the practitioners (as our results show), even only finding a solution of the same value is challenging in practice. We present a successful approach, based on an ILP formulation in which the seat requirement constraints are stated in a ")-1(strong" fo rm, derived from the description of the convex hull of the variant of the knapsack polytope arising when the sum of the variables is restricted not to exceed two, illustrating computational results on our case study.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

“…There are a few references that consider the assignment of TUs: [1,2,15,23,25]. Most of them consider the case in which there is a very small number of distinct TU types (two in most cases).…”

Section: Literature Reviewmentioning

confidence: 99%

Solving a real-world train-unit assignment problem

2010

View full text Add to dashboard Cite

show abstract

“…For example, the rolling stock circulations of NS are planned on a line-by-line basis and, preferably, each line is operated by a single rolling stock type, see Huisman et al [10] and Fioole et al [8]. No research has been done yet on more sophisticated methods for robust rolling stock planning.…”

Section: Related Fieldsmentioning

confidence: 99%

“…The applicability of the models proposed by Fioole et al [8] and Maróti [16] in the real-time operations will be further explored.…”

Section: Rolling Stock Re-scheduling At Nsmentioning

confidence: 99%

Disruption Management in Passenger Railway Transportation

Jespersen-Groth

Potthoff

Clausen

et al. 2009

Robust and Online Large-Scale Optimization

Self Cite

113

View full text Add to dashboard Cite

“…The second proposed approach extends a flow based Mixed Integer Program (MIP) inspired by Fioole et al (2006) for the RSP. As with the model Haahr et al (2014), very little information regarding depots is included in this formulation of the RSP.…”

Section: Introductionmentioning

confidence: 99%

Integrating rolling stock scheduling with train unit shunting

Haahr¹,

Lusby

2017

European Journal of Operational Research

View full text Add to dashboard Cite

Highlights• We develop two integrated frameworks for scheduling rolling stock and train unit shunting.• We provide a comparison of several methods for solving the Track Allocation Problem.• We give a counter example demonstrating the suboptimality of a previously proposed optimal method. AbstractIn this paper we consider integrating two important railway optimization problems, in particular the Rolling Stock Scheduling Problem and the Train Unit Shunting Problem. We present two similar branch-and-cut based approaches to solve this integrated problem and, in addition, provide a comparison of different approaches to solve the so-called Track Assignment problem, a subcomponent of the Train Unit Shunting problem. In this analysis we demonstrate, by way of a counter example, the heuristic nature of a previously argued optimal approach. For the integrated problem we analyze the performance of the proposed approaches on several real-life case studies provided by DSB S-tog, a suburban train operator in the greater Copenhagen area. Computational results confirm the necessity of the integrated approach; high quality solutions to the integrated problem are obtained on instances where a conventional, sequential approach ends in infeasibility. Furthermore, for the considered instances, solutions are typically found within a few minutes, indicating the applicability of the methodology to short-term planning.

show abstract

A rolling stock circulation model for combining and splitting of passenger trains

Cited by 158 publications

References 7 publications

Solving a real-world train-unit assignment problem

Solving a real-world train-unit assignment problem

Disruption Management in Passenger Railway Transportation

Integrating rolling stock scheduling with train unit shunting

Contact Info

Product

Resources

About