The locomotive assignment problem: a survey on optimization models

Piu, F.; Speranza, Maria

doi:10.1111/itor.12062

Cited by 38 publications

(21 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The locomotive planning problem assigns locomotives to a set of train units in such a way that it minimizes the cost and satisfies a number of business and operational constraints. For a recent survey on the locomotive assignment problem, that also includes variants with some maintenance constraints, see Piu and Speranza (2014). Furthermore, there are many papers about maintenance routing for aviation such as those of Clarke et al (1997), Talluri (1998), and Sarac et al (2006).…”

Section: Maintenance Routingmentioning

confidence: 99%

Maintenance Location Routing for Rolling Stock Under Line and Fleet Planning Uncertainty

Tönissen

Arts

Shen

2019

Transportation Science

View full text Add to dashboard Cite

Rolling stock needs regular maintenance in a maintenance facility. Rolling stock from different fleets are routed to maintenance facilities by interchanging the destinations of trains at common stations and by using empty drives. We consider the problem of locating maintenance facilities in a railway network under uncertain or changing line planning, fleet planning and other uncertain factors. These uncertainties and changes are modeled by a discrete set of scenarios. We show that this new problem is NP-hard and provide a two-stage stochastic programming and a two-stage robust optimization formulation. The second-stage decision is a maintenance routing problem with similarity to a minimum cost-flow problem. We prove that the facility location decisions remain unchanged under a simplified routing problem and this gives rise to an efficient mixed integer programming (MIP) formulation. This result also allows us to find an efficient decomposition algorithm for the robust formulation based on scenario addition (SA). Computational work shows that our improved MIP formulation can efficiently solve instances of industrial size. SA improves the computational time for the robust formulation even further and can handle larger instances due to more efficient memory usage. Finally, we apply our algorithms on practical instances of the Netherlands Railways and give managerial insights.

show abstract

Section: Maintenance Routingmentioning

confidence: 99%

Maintenance Location Routing for Rolling Stock Under Line and Fleet Planning Uncertainty

Tönissen

Arts

Shen

2019

Transportation Science

View full text Add to dashboard Cite

show abstract

“…The contributions [1,2] give very detailed information about the literature dealing with solving the locomotive assignment problem. In particular, we must mention the works [3,4] and the recent works [5,6].…”

Section: State Of the Artmentioning

confidence: 99%

“…It is obvious that it is not possible to allocate more own locomotives than the transport operator owns to the individual depots. This is ensured by the group of constraints (2). The group of constraints (3) assures that the number of locomotives of the class ∈ that depart from the depot ∈ to serve the connections does not exceed the number of the locomotives found in the depot.…”

Section: Summary Of the Symbols Used In The Mathematicalmentioning

confidence: 99%

Locomotive Assignment Problem with Heterogeneous Vehicle Fleet and Hiring External Locomotives

Teichmann

Dorda

Golc

et al. 2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper focuses on solving the problem of how to assign locomotives to assembled trains optimally. To solve the problem, linear programming is applied. The situation we model in the paper occurs in the conditions of a transport operator that provides rail transport in the Czech Republic. In the paper, an extended locomotive assignment problem is modeled; the transport operator can use different classes of the locomotives to serve individual connections, some connections must be served by a predefined locomotive class, and the locomotives can be allocated to several depots at the beginning. The proposed model also takes into consideration the fact that some connections can be served by the locomotives of external transport companies or operators. The presented model is applied to a real example in order to test its functionality.

show abstract

“…In the works [3] by Cordeau et al and Piu and Speranza [6] two types of locomotive planning models were identified: Single and Multiple. Single locomotive planning models assume that there is only one type of locomotive available for assignment and train is drived by only one locomotive.…”

Section: Introductionmentioning

confidence: 99%

Improvement of the analysis methods of the working hours` distribution of locomotive crews by the types of train operation in freight traffic

et al. 2019

View full text Add to dashboard Cite

The work is aimed to increase the efficiency of cargo transportation by railway transport by improving the work organization of locomotive crews. The research is based on the methods of organization of operational work of railways and the methods of mathematical statistics. The problem of increasing the use efficiency of working hours of locomotive crews in freight traffic is considered in the article. Based on the statistical data processing of drivers’ routes, the working hours` distribution of locomotive crews for different types of train operation in freight traffic for four locomotive depots was performed. During the research, a conditional division of the working time of locomotive crew by the type of work was performed, if the crew worked with trains of various categories. The algorithm for assigning the idle time and empty running of locomotive to certain types of train operation was also developed. The work originality lies in the fact that it improves the methods of analysis of the working hours` distribution of locomotive crews for certain types of train operation in freight traffic. The developed methods give an opportunity to evaluate the work specifics of individual locomotive depots and provide the initial data for planning the use of locomotives and the work and rest schedule of locomotive crews.

show abstract

The locomotive assignment problem: a survey on optimization models

Cited by 38 publications

References 44 publications

Maintenance Location Routing for Rolling Stock Under Line and Fleet Planning Uncertainty

Maintenance Location Routing for Rolling Stock Under Line and Fleet Planning Uncertainty

Locomotive Assignment Problem with Heterogeneous Vehicle Fleet and Hiring External Locomotives

Improvement of the analysis methods of the working hours` distribution of locomotive crews by the types of train operation in freight traffic

Contact Info

Product

Resources

About