In this paper we describe a new model for the train unit shunting problem. This model is able to solve the matching and the parking subproblem 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 shunt 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
Parking, matching, scheduling, and routing are common problems in train maintenance. In particular, ...
textabstractIn this paper, we discuss a model-based algorithmic approach for supporting planners in ...
Due to growing demand of sustainable transport, the number of passengers carried by railways is incr...
In this paper we describe a new model for the train unit shunting problem. This model is able to sol...
In this paper we describe a new model for the train unit shunting problem. This model is able to sol...
textabstractIn this paper, we describe a new model for the Train Unit Shunting Problem. This model i...
We consider the Train Unit Shunting Problem, an important plan- ning problem for passenger railway o...
Railway rolling stock is one of the most significant cost components for operators of passenger trai...
In this paper we consider the train unit shunting problem extended with service task scheduling. Thi...
In this paper we consider the problem of shunting train units on a railway station. Train units arri...
This thesis proposes several methods to solve the planning of parking and servicing of trains in a s...
In this paper we consider the problem of shunting train units on a railway station. Train units arri...
In this paper we consider the problem of shunting train units on a railway station. Train units arri...
The Train Unit Shunting and Servicing (TUSS) problem is an NP-hard problem encountered by the Dutch ...
Shunting yards are the locations where trains, which are not included in the train schedule at a cer...
Parking, matching, scheduling, and routing are common problems in train maintenance. In particular, ...
textabstractIn this paper, we discuss a model-based algorithmic approach for supporting planners in ...
Due to growing demand of sustainable transport, the number of passengers carried by railways is incr...
In this paper we describe a new model for the train unit shunting problem. This model is able to sol...
In this paper we describe a new model for the train unit shunting problem. This model is able to sol...
textabstractIn this paper, we describe a new model for the Train Unit Shunting Problem. This model i...
We consider the Train Unit Shunting Problem, an important plan- ning problem for passenger railway o...
Railway rolling stock is one of the most significant cost components for operators of passenger trai...
In this paper we consider the train unit shunting problem extended with service task scheduling. Thi...
In this paper we consider the problem of shunting train units on a railway station. Train units arri...
This thesis proposes several methods to solve the planning of parking and servicing of trains in a s...
In this paper we consider the problem of shunting train units on a railway station. Train units arri...
In this paper we consider the problem of shunting train units on a railway station. Train units arri...
The Train Unit Shunting and Servicing (TUSS) problem is an NP-hard problem encountered by the Dutch ...
Shunting yards are the locations where trains, which are not included in the train schedule at a cer...
Parking, matching, scheduling, and routing are common problems in train maintenance. In particular, ...
textabstractIn this paper, we discuss a model-based algorithmic approach for supporting planners in ...
Due to growing demand of sustainable transport, the number of passengers carried by railways is incr...