Track Allocation in Freight-Train Classification with Mixed Tracks

We consider the process of forming outbound trains from cars of inbound trains at rail-freight hump yards. Given the arrival and departure times as well as the composition of the trains, we study the problem of allocating classification tracks to outbound trains such that every outbound train can be built on a separate classification track. We observe that the core problem can be formulated as a special list coloring problem in interval graphs, which is known to be NP-complete. We focus on an extension where individual cars of different trains can temporarily be stored on a special subset of the tracks. This problem induces several new variants of the list-coloring problem, in which the given intervals can be shortened by cutting off a prefix of the interval. We show that in case of uniform and sufficient track lengths, the corresponding coloring problem can be solved in polynomial time, if the goal is to minimize the total cost associated with cutting off prefixes of the intervals. Based on these results, we devise two heuristics as well as an integer program to tackle the problem. As a case study, we consider a real-world problem instance from the Hallsberg Rangerbangård hump yard in Sweden. Planning over horizons of seven days, we obtain feasible solutions from the integer program in all scenarios, and from the heuristics in most scenarios

Track Allocation in Freight-Train Classification with Mixed Tracks

We consider the process of forming outbound trains from cars of inbound trains at rail-freight hump yards. Given the arrival and departure times as well as the composition of the trains, we study the problem of allocating classification tracks to outbound trains such that every outbound train can be built on a separate classification track. We observe that the core problem can be formulated as a special list coloring problem in interval graphs, which is known to be NP-complete. We focus on an extension where individual cars of different trains can temporarily be stored on a special subset of the tracks. This problem induces several new variants of the list-coloring problem, in which the given intervals can be shortened by cutting off a prefix of the interval. We show that in case of uniform and sufficient track lengths, the corresponding coloring problem can be solved in polynomial time, if the goal is to minimize the total cost associated with cutting off prefixes of the intervals. Based on these results, we devise two heuristics as well as an integer program to tackle the problem. As a case study, we consider a real-world problem instance from the Hallsberg Rangerbangard hump yard in Sweden. Planning over horizons of seven days, we obtain feasible solutions from the integer program in all scenarios, and from the heuristics in most scenarios

Hump Yard Track Allocation with Temporary Car Storage

In rail freight operation, freight cars need to be separated and reformed into new trains at hump yards. The classification procedure is complex and hump yards constitute bottlenecks in the rail freight network, often causing outbound trains to be delayed. One of the problems is that planning for the allocation of tracks at hump yards is difficult, given that the planner has limited resources (tracks, shunting engines, etc.) and needs to foresee the future capacity requirements when planning for the current inbound trains. In this paper, we consider the problem of allocating classification tracks in a rail freight hump yard for arriving and departing trains with predetermined arrival and departure times. The core problem can be formulated as a special list coloring problem. We focus on an extension where individual cars can temporarily be stored on a special subset of the tracks. An extension where individual cars can temporarily be stored on a special subset of the tracks is also considered. We model the problem using mixed integer programming, and also propose several heuristics that can quickly give feasible track allocations. As a case study, we consider a real-world problem instance from the Hallsberg Rangerbangård hump yard in Sweden. Planning over horizons over two to four days, we obtain feasible solutions from both the exact and heuristic approaches that allow all outgoing trains to leave on time

Optimized shunting with mixed-usage tracks

We consider the planning of railway freight classification at hump yards, where the problem involves the formation of departing freight train blocks from arriving trains subject to scheduling and capacity constraints. The hump yard layout considered consists of arrival tracks of sufficient length at an arrival yard, a hump, classification tracks of non-uniform and possibly non-sufficient length at a classification yard, and departure tracks of sufficient length. To increase yard capacity, freight cars arriving early can be stored temporarily on specific mixed-usage tracks. The entire hump yard planning process is covered in this paper, and heuristics for arrival and departure track assignment, as well as hump scheduling, have been included to provide the neccessary input data. However, the central problem considered is the classification track allocation problem. This problem has previously been modeled using direct mixed integer programming models, but this approach did not yield lower bounds of sufficient quality to prove optimality. Later attempts focused on a column generation approach based on branch-and-price that could solve problem instances of industrial size. Building upon the column generation approach we introduce a direct arc-based integer programming model, where the arcs are precedence relations between blocks on the same classification track. Further, the most promising models are adapted for rolling-horizon planning. We evaluate the methods on historical data from the Hallsberg shunting yard in Sweden. The results show that the new arc-based model performs as well as the column generation approach. It returns an optimal schedule within the execution time limit for all instances but from one, and executes as fast as the column generation approach. Further, the short execution times of the column generation approach and the arc-indexed model make them suitable for rolling-horizon planning, while the direct mixed integer program proved to be too slow for this. Extended analysis of the results shows that mixing was only required if the maximum number of concurrent trains on the classification yard exceeds 29 (there are 32 available tracks), and that after this point the number of extra car roll-ins increases heavily

Evaluation of planning policies for marshalling track allocation using simulation

Planning the operational procedures in a railway marshalling yard is a complex problem. When a train arrives at a marshalling yard, it is uncoupled on an arrival yard and then its cars are rolled to a classification yard. All cars should eventually be rolled to the classification track that has been assigned to the train they’re supposed to depart with. However, there is normally not enough capacity to compound all trains at once. In Sweden, cars arriving before a track has been assigned to their train can be stored on separate tracks called mixing tracks. All cars on mixing tracks will be pulled back to the arrival yard, and then rolled to the classification yard again to allow for reclassification. Today all procedures are planned by experienced dispatchers, but there are no documented strategies or guidelines for efficient manual planning. The aim of this paper is to examine operational planning strategies that could help dispatchers find a feasible marshalling schedule that minimizes unnecessary mixing. In order to achieve this goal, two different online planning strategies have been tested using deterministic and stochastic simulation. The Hallsberg marshalling yard was used as a case study, and was simulated for the time period between December 2010 and May 2011. The first tested strategy simply assigns tracks to trains on a first come-first served basis, while the second strategy uses time limits to determine when tracks should be assigned to departing trains. The online planning algorithms have been compared with an offline optimized track allocation. The results from both the deterministic and the stochastic simulation show that the optimized allocation is better than all online strategies and that the second strategy with a time limit of 32 hours is the best online method

Optimisation of simultaneous train formation and car sorting at marshalling yards

Efficient and correct freight train marshalling is vital for high quality carload freight transportations. During marshalling, it is desirable that cars are sorted according to their individual drop-off locations in the outbound freight trains. Furthermore, practical limitations such as non-uniform and limited track lengths and the arrival and departure times of trains need to be considered. This paper presents a novel optimisation method for freight marshalling scheduling under these circumstances. The method is based on an integer programming formulation that is solved using column generation and branch and price. The approach minimises the number of extra shunting operations that have to be performed, and is evaluated on real-world data from the Hallsberg marshalling yard in Sweden

Mathematical programming models to design and analyse efficient and robust raiway freight transport networks

(English) Searching to achieve an ambitious reduction in greenhouse gas emissions, the European Union has set as a goal a modal shift in freight transport of 30\% by rail or waterborne for the near future. The increasing efforts of many governments to intensify rail freight transport often must face the difficulties involved in improving both infrastructure and rail operations. Moreover, infrastructure management and business operations usually correspond to different entities with highly contradictory economic interests. Making progress on the reliability of the railway network is one of the main factors to be considered to make the use of the train more attractive as a means of transport for industry. Also, focusing on shippers' response to road and rail competition and the role of different rail undertakings competing with each other may help boost the use of rail for freight transport. Seeking to reinforce these two goals, this thesis introduces two independent mathematical optimisation models, which may also be complementary, and which have been developed under a common conceptual framework of data structures and variables to guarantee their compatibility. The first model is a mathematical programming-based design model for evaluating the impact on a mixed railway network from proposals for infrastructure improvement and capacity expansion that are oriented mainly toward increasing freight transportation. The model has been applied to extend elements of an existing mixed railway network, perform relatively less costly actions on the network, and enhance capacity by adding new blocking/control systems at specific locations. These aspects are usually not considered in models for regional planning. Rather than a model whose sole focus is on railway capacity expansion, this approach combines capacity-expansion with network design. Because the way investments generate returns to the freight transportation system is of utmost relevance for these types of problems, this model is based on the efficient frontier between investment and operating costs. The second model is a combined model for jointly evaluating the modal split road-rail, and the resulting railway freight flows on the railway network. This combined modal split-traffic assignment model is addressed to the case when a modal split based on a random utility model is available, and some of its coefficients may present a non-negligible variability. To this end, after the initial deterministic formulation, a robust counterpart of the model is developed. The model, formulated as a non-linear integer programming problem, is oriented to a multi-carrier environment and includes constraints to consider the interactions between the different types of flows on the railway network, allowing a detailed evaluation of the cost types of the carriers and the network capacity. An algorithmic solution based on the outer approximation method is shown to provide accurate solutions in a reasonable computational time for the robust and non-robust versions of the model. Examples centred on a section of the Trans-European Transport Network, the TEN-T Core network corridors, are reported to test the applicability of the models. Results show the effectiveness of both models. The design model can be a helpful tool for analysing the impact infrastructure investments may have on operating costs, where (implicit) capacity limitations in the scenarios to be evaluated may necessarily be taken into account. At the same time, it can be complemented with the combined modal split-traffic assignment model by assessing the possible shippers' response to the different railway carriers' services competing with each other and the road.(Español) Tratando de lograr una significativa y ambiciosa reducción de las emisiones de gases de efecto invernadero, la Unión Europea se ha marcado como objetivo que los modos de transporte de mercancías alternativos a la carretera, como el ferrocarril o la navegación fluvial, alcancen una cuota del 30% sobre el total de mercancías transportadas por tierra en Europa en los próximos años. Los crecientes esfuerzos que llevan a cabo los diferentes gobiernos se enfrentan con demasiada frecuencia con las dificultades que suponen mejorar de forma simultánea infraestructura y operaciones ferroviarias, habitualmente gestionados por entes diferentes con intereses económicos enfrentados. Mejorar la fiabilidad de la red ferroviaria es uno de los principales factores a tener en cuenta para hacer más atractivo el uso del tren como medio de transporte para la industria. Por otro lado, centrarse en los criterios que pueden llevar a las empresas a elegir entre carretera o tren, y en el papel que juegan las diferentes compañías ferroviarias en esta elección, compitiendo entre sí, puede ayudar a incrementar el uso del tren para el transporte de mercancías. Con la idea de reforzar estos dos objetivos, este trabajo de tesis presenta dos modelos matemáticos de optimización, independientes pero a la vez complementarios, y desarrollados bajo un marco conceptual de estructuras de datos y variables común para garantizar su compatibilidad. El primer modelo es un modelo de diseño basado en programación matemática para evaluar el impacto que pueden tener, sobre una red ferroviaria de uso mixto, propuestas de mejora de la infraestructura y de ampliación de la capacidad dirigidas principalmente a incrementar el uso del tren para el transporte de mercancías. El modelo se ha orientado a la modificación de elementos de una red ferroviaria de uso mixto existente, proponiendo intervenciones en la red relativamente poco costosas, y aumentando la capacidad añadiendo nuevos sistemas de bloqueo y control en ubicaciones específicas. Para este tipo de problemas, es de la máxima relevancia la manera en que las inversiones generan retornos al sistema de transporte ferroviario. Por eso, este modelo está basado en el óptimo equilibrio entre la inversión y los costes de operación. El segundo modelo es un modelo combinado para evaluar de forma conjunta el reparto modal entre carretera y tren, y los flujos de mercancías en la red ferroviaria resultantes. Este modelo está enfocado hacia aquellas situaciones en que hay un modelo de utilidad aleatoria disponible, pero algunos de sus coeficientes pueden presentar una variabilidad que no debe ser ignorada. Con esta finalidad, tras la formulación inicial del modelo determinístico se presenta una versión robusta de la formulación. El modelo, formulado como un problema de programación no lineal entera, está enfocado hacia un entorno en el que conviven (y compiten) diferentes compañías ferroviarias. Se detalla un algoritmo para resolver el modelo, basado en el método de aproximaciones externas, que permite obtener soluciones precisas con un tiempo computacional razonable, tanto para la versión determinística como para la versión robusta. Ejemplos basados en una sección de la Red Trans-Europea de Transporte (TEN-T por sus siglas en inglés) permiten validar la aplicabilidad y eficacia de los modelos. El modelo de diseño puede ser una herramienta útil para analizar el impacto que las inversiones en infraestructura pueden tener en los costes de operación, teniendo en cuenta las limitaciones de capacidad que existen en los escenarios evaluados. De la misma forma, se puede complementar este análisis con el modelo combinado de reparto modal y asignación de flujos, en el que se puede comprobar la posible respuesta de las empresas que requieren transportar sus productos ante los diferentes servicios ofrecidos por las compañías ferroviarias compitiendo entre si, y compitiendo con la carretera.Estadística i investigació operativ

Mathematical programming models to design and analyse efficient and robust raiway freight transport networks

(English) Searching to achieve an ambitious reduction in greenhouse gas emissions, the European Union has set as a goal a modal shift in freight transport of 30\% by rail or waterborne for the near future. The increasing efforts of many governments to intensify rail freight transport often must face the difficulties involved in improving both infrastructure and rail operations. Moreover, infrastructure management and business operations usually correspond to different entities with highly contradictory economic interests. Making progress on the reliability of the railway network is one of the main factors to be considered to make the use of the train more attractive as a means of transport for industry. Also, focusing on shippers' response to road and rail competition and the role of different rail undertakings competing with each other may help boost the use of rail for freight transport. Seeking to reinforce these two goals, this thesis introduces two independent mathematical optimisation models, which may also be complementary, and which have been developed under a common conceptual framework of data structures and variables to guarantee their compatibility. The first model is a mathematical programming-based design model for evaluating the impact on a mixed railway network from proposals for infrastructure improvement and capacity expansion that are oriented mainly toward increasing freight transportation. The model has been applied to extend elements of an existing mixed railway network, perform relatively less costly actions on the network, and enhance capacity by adding new blocking/control systems at specific locations. These aspects are usually not considered in models for regional planning. Rather than a model whose sole focus is on railway capacity expansion, this approach combines capacity-expansion with network design. Because the way investments generate returns to the freight transportation system is of utmost relevance for these types of problems, this model is based on the efficient frontier between investment and operating costs. The second model is a combined model for jointly evaluating the modal split road-rail, and the resulting railway freight flows on the railway network. This combined modal split-traffic assignment model is addressed to the case when a modal split based on a random utility model is available, and some of its coefficients may present a non-negligible variability. To this end, after the initial deterministic formulation, a robust counterpart of the model is developed. The model, formulated as a non-linear integer programming problem, is oriented to a multi-carrier environment and includes constraints to consider the interactions between the different types of flows on the railway network, allowing a detailed evaluation of the cost types of the carriers and the network capacity. An algorithmic solution based on the outer approximation method is shown to provide accurate solutions in a reasonable computational time for the robust and non-robust versions of the model. Examples centred on a section of the Trans-European Transport Network, the TEN-T Core network corridors, are reported to test the applicability of the models. Results show the effectiveness of both models. The design model can be a helpful tool for analysing the impact infrastructure investments may have on operating costs, where (implicit) capacity limitations in the scenarios to be evaluated may necessarily be taken into account. At the same time, it can be complemented with the combined modal split-traffic assignment model by assessing the possible shippers' response to the different railway carriers' services competing with each other and the road.(Español) Tratando de lograr una significativa y ambiciosa reducción de las emisiones de gases de efecto invernadero, la Unión Europea se ha marcado como objetivo que los modos de transporte de mercancías alternativos a la carretera, como el ferrocarril o la navegación fluvial, alcancen una cuota del 30% sobre el total de mercancías transportadas por tierra en Europa en los próximos años. Los crecientes esfuerzos que llevan a cabo los diferentes gobiernos se enfrentan con demasiada frecuencia con las dificultades que suponen mejorar de forma simultánea infraestructura y operaciones ferroviarias, habitualmente gestionados por entes diferentes con intereses económicos enfrentados. Mejorar la fiabilidad de la red ferroviaria es uno de los principales factores a tener en cuenta para hacer más atractivo el uso del tren como medio de transporte para la industria. Por otro lado, centrarse en los criterios que pueden llevar a las empresas a elegir entre carretera o tren, y en el papel que juegan las diferentes compañías ferroviarias en esta elección, compitiendo entre sí, puede ayudar a incrementar el uso del tren para el transporte de mercancías. Con la idea de reforzar estos dos objetivos, este trabajo de tesis presenta dos modelos matemáticos de optimización, independientes pero a la vez complementarios, y desarrollados bajo un marco conceptual de estructuras de datos y variables común para garantizar su compatibilidad. El primer modelo es un modelo de diseño basado en programación matemática para evaluar el impacto que pueden tener, sobre una red ferroviaria de uso mixto, propuestas de mejora de la infraestructura y de ampliación de la capacidad dirigidas principalmente a incrementar el uso del tren para el transporte de mercancías. El modelo se ha orientado a la modificación de elementos de una red ferroviaria de uso mixto existente, proponiendo intervenciones en la red relativamente poco costosas, y aumentando la capacidad añadiendo nuevos sistemas de bloqueo y control en ubicaciones específicas. Para este tipo de problemas, es de la máxima relevancia la manera en que las inversiones generan retornos al sistema de transporte ferroviario. Por eso, este modelo está basado en el óptimo equilibrio entre la inversión y los costes de operación. El segundo modelo es un modelo combinado para evaluar de forma conjunta el reparto modal entre carretera y tren, y los flujos de mercancías en la red ferroviaria resultantes. Este modelo está enfocado hacia aquellas situaciones en que hay un modelo de utilidad aleatoria disponible, pero algunos de sus coeficientes pueden presentar una variabilidad que no debe ser ignorada. Con esta finalidad, tras la formulación inicial del modelo determinístico se presenta una versión robusta de la formulación. El modelo, formulado como un problema de programación no lineal entera, está enfocado hacia un entorno en el que conviven (y compiten) diferentes compañías ferroviarias. Se detalla un algoritmo para resolver el modelo, basado en el método de aproximaciones externas, que permite obtener soluciones precisas con un tiempo computacional razonable, tanto para la versión determinística como para la versión robusta. Ejemplos basados en una sección de la Red Trans-Europea de Transporte (TEN-T por sus siglas en inglés) permiten validar la aplicabilidad y eficacia de los modelos. El modelo de diseño puede ser una herramienta útil para analizar el impacto que las inversiones en infraestructura pueden tener en los costes de operación, teniendo en cuenta las limitaciones de capacidad que existen en los escenarios evaluados. De la misma forma, se puede complementar este análisis con el modelo combinado de reparto modal y asignación de flujos, en el que se puede comprobar la posible respuesta de las empresas que requieren transportar sus productos ante los diferentes servicios ofrecidos por las compañías ferroviarias compitiendo entre si, y compitiendo con la carretera.Postprint (published version

Shunting of Passenger Train Units: an Integrated Approach

In this paper, we describe a new model for the Train Unit Shunting Problem. This model is capable of solving the matching and parking subproblems in an integrated manner, usually requiring a reasonable amount of computation time for generating acceptable solutions. Furthermore, the model incorporates complicating details from practice, such as trains composed of several train units and tracks that can be approached from two sides. Computation times are reduced by introducing the concept of virtual shunt tracks. Computational results are presented for real-life cases of NS Reizigers, the main Dutch passenger railway operator.Optimization;Passenger Railways;Shunting

Applying Operations Research techniques to planning of train shunting

In this paper, we discuss a model-based algorithmic approach for supporting planners in the creation of shunt plans for passenger trains. The approach provides an example of a mathematical model and a corresponding solution approach for model based support. We introduce a four-step solution approach and we discuss how the planners are supported by this approach. Finally, we present computational results for these steps and give some suggestions for further research.A* search;railway optimization;real world application;routing