An integrated model for the transshipment yard scheduling problem

Abstract

A hub-and-spoke railway system is an efficient way of handling freight transport by land. A modern railrail train yard consists of huge gantry cranes that move the containers between the trains. In this context, we consider a rail-rail transshipment yard scheduling problem (TYSP) where the containers arrive to the hub and need to be placed on a train that will deliver them to their destination. In the literature, the problem is decomposed hierarchically into five subproblems, which are solved separately. First, the trains have to be grouped into bundles in which they visit the yard. Next, the trains have to be assigned to tracks within these bundles, namely parking positions. Then the final positions for the containers on trains have to be determined. Next, the container moves that need to be performed are assigned to the cranes. Finally, these moves have to be sequenced for each crane for processing. In this paper, an integrated MILP model is proposed, which aims to solve the TYSP as a single optimization problem. The proposed formulation also enables us to define more robust and complex objective functions that include key characteristics from each of the above-mentioned subproblems. The strength of our proposed formulation is demonstrated via computational experiments using the data from the literature. Indeed, the results show that the TYSP can be solved without the use of decomposition techniques and more insight can be obtained from the same input data used to solve particular single decomposed subproblems.

Train management in freight shunting yards: Formalisation and literature review

“…While the different tasks of the yard operations used to be tackled individually, ref. [56] propose a MILP which handles the first three aspects of the yard listed above in an integrated manner. Ref.…”

Analyzing the Railway Network of the Belt and Road Initiative

“…In addition to dynamic simulation models, analytical models were also developed related to railroad issues. Cichenski et al (2016) use mathematical modeling (mixed integer linear programming) to crack the terminal scheduling problem and reduce the time to transfer containers between two trains. Their approach takes into account various parameters like distance between the tracks, horizontal and vertical movement of the crane, number of available tracks, and relative position of trains among others, to assign trains into bundles for faster processing, which helps to reduce the train processing time.…”

Railway route optimisation from Romania to Poland based on an analysis of China's 'One Belt and One Road' initiative

“…According to a recent study on the rail transhipment yard scheduling problem, in order to simplify the scheduling problem, it has been divided into five sub problems. These sub problems are the scheduling of trains entering time slots, track assignments, the location of the loading/unloading of containers, gantry crane dispatching and quay crane scheduling (Boysen et al, 2011;Cichenski et al, 2016). Regarding to the first sub problem, Boysen et al (2012) presented a minimised objective function that considered the number of trains and the division of trains entering different time slots.…”