Rotation Planning of Locomotive and Carriage Groups with Shared Capacities

Maintenance Appointments in Railway Rolling Stock Rescheduling

“…The problem is modelled as an integer multi-commodity flow model and is solved with CPLEX. Similar problems are considered by Brucker et al [2003] and Mellouli and Suhl [2007]. Lingaya et al [2002] also study the problem of scheduling locomotives and carriages in the tactical planning phase.…”

“…No maintenance • Fioole et al [2006] • Cordeau et al [2001] • Lingaya et al [2002] • Brucker et al [2003] • Mellouli and Suhl [2007] • Peeters and Kroon [2008] • Nielsen [2011] • Nielsen et al [2012] • • Sato et al [2009] • Sato and Fukumura [2012] Maintenance • Maróti and Kroon [2005] • Maróti and Kroon [2007] • Borndörfer et al [2015] • Wagenaar et al…”

Robust rolling stock in rapid transit networks

“…They propose a heuristic branch-and-bound algorithm for the extended model, solving the linear programming relaxations by column generation. A RS circulation problem related to the circulation of ICE train units in the German ICE network was described by Mellouli and Suhl [8]. In this case, the required capacities of the trains are known a priori.…”

An improved method of determining the schemes of locomotive circulation with regard to the technological peculiarities of railcar traffic

“…Solutions of such problems for rail systems that differ from the principles of operating railway transport in Ukraine are described in studies on the locomotive planning problem or the locomotive scheduling problem and the crew scheduling problem [14][15][16]. For example, in [12], the locomotive planning problem for U.S. railways is solved by suggesting an optimization mathematical model that is formulated as a task of mixed-integer programming, MIP.…”

“…where φ v=14, v=12, v=10, v=6, v=4] stops on each traction haul j of the route μ k to serve trains of the railcar flow k, UAH; rever.loc s,j,k E is the daily service cost of a reverse reserve run of locomotives at the station s of the traction haul j for the railcar traffic k, UAH; δ k jm is a supporting Boolean function to model the presence of a stop to maintain a train at the maintenance station m, m∈V for changing locomotives or locomotive crews δ ∈ is the cost of a locomotive-km of a reserve run at the station s [15], UAH; sta s l is the length of the station s, km.…”