zbMATH — the first resource for mathematics

An integrated model for the transshipment yard scheduling problem. (English) Zbl 1391.90249
Summary: A hub-and-spoke railway system is an efficient way of handling freight transport by land. A modern rail-rail 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.

90B35 Deterministic scheduling theory in operations research
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
90C05 Linear programming
90C11 Mixed integer programming
Full Text: DOI
[1] Alicke, K, Modeling and optimization of the intermodal terminal mega hub, OR Spectrum, 24, 1-17, (2002) · Zbl 0993.90012
[2] Alicke, K; Arnold, D, Modellierung und optimierung von mehrstufigen umschlagsystemen, Fördern und Heben, 8, 769-772, (1998)
[3] Bontekoning, Y; Macharis, C; Trip, J, Is a new applied transportation research field emerging? A review of intermodal rail-truck freight transport literature, Transportation Res Part A: Policy and Practice, 38, 1-24, (2004)
[4] Bostel, N; Dejax, P, Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard, Transportation Science, 32, 370-379, (1998) · Zbl 0987.90505
[5] Boysen, N; Fliedner, M, Determining crane areas in intermodal transshipment yards: the yard partition problem, European Journal of Operational Research, 204, 336-342, (2010) · Zbl 1178.90142
[6] Boysen, N; Jaehn, F; Pesch, E, Scheduling freight trains in rail-rail transshipment yards, Transportation Science, 45, 199-211, (2011)
[7] Boysen, N; Fliedner, M; Jaehn, F; Pesch, E, A survey on container processing in railway yards, Transportation Science, 47, 312-329, (2012)
[8] Boysen, N; Fliedner, M; Jaehn, F; Pesch, E, Shunting yard operations: theoretical aspects and applications, European Journal of Operational Research, 220, 1-14, (2012)
[9] Boysen, N; Jaehn, F; Pesch, E, New bounds and algorithms for the transshipment yard scheduling problem, Journal of Scheduling, 15, 499-511, (2012) · Zbl 1280.90033
[10] Cordeau, J; Toth, P; Vigo, D, A survey of optimization models for train routing and scheduling, Transportation Science, 32, 380-404, (1988) · Zbl 0987.90507
[11] Corry, P; Kozan, E, Optimised loading patterns for intermodal trains, OR Spectrum, 30, 721-750, (2008) · Zbl 1193.90038
[12] Crainic, T; Kim, K, Intermodal transport, Transportation, Handbooks in Operations Research and Management Science, 14, 467-538, (2007)
[13] Dahlhaus, E; Horak, P; Miller, M; Ryan, J, The train marshalling problem, Discrete Applied Mathmatics, 103, 41-54, (2000) · Zbl 0962.90009
[14] Dorndorf, U; Schneider, F, Scheduling automated triple cross-over stacking cranes in a container yard, OR Spectrum, 32, 617-632, (2010) · Zbl 1200.90072
[15] Gatto, M., Maue, J., Mihalak, M., & Widmayer, P. (2009). Shunting for dummies: An introductory algorithmic survey. In R. Ahuja, R. Möhring, & C. Zaroliagis (Eds.), Robust and online large-scale optimization (Vol. 5868, pp. 310-337)., Lecture Notes in Computer Science Berlin: Springer. · Zbl 1266.90042
[16] Hansmann, RS; Zimmermann, UT; Krebs, HJ (ed.); Jäger, W (ed.), Optimal sorting of rolling stock at hump yards, 189-203, (2008), Berlin
[17] Jacob, R; Marton, P; Maue, J; Nunkesser, M, Multistage methods for freight train classification, Networks, 57, 87-105, (2011) · Zbl 1205.90049
[18] Kellner, M; Boysen, N; Fliedner, M, How to park freight trains on rail-rail transshipment yards: the train location problem, OR Spectrum, 34, 535-561, (2012) · Zbl 1244.90143
[19] Lim, A; Rodrigues, B; Xu, Z, A m-parallel crane scheduling problem with a noncrossing constraint, Naval Research Logistics, 54, 115-127, (2007) · Zbl 1126.90025
[20] Macharis, C; Bontekoning, Y, Opportunities for or in intermodal freight transport research: A review, European Journal of Operational Research, 153, 400-416, (2004) · Zbl 1053.90008
[21] Martinez, M; Gutierrez, I; Oliveira, A; Bedia, LA, Gantry crane operations to transfer containers between trains: A simulation study of a Spanish terminal, Transportation Planning Tech, 27, 261-284, (2004)
[22] Moccia, L; Cordeau, J; Gaudioso, M; Laporte, G, A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal, Naval Research Logistics, 53, 45-59, (2006) · Zbl 1112.90033
[23] Rotter, H, New operating concepts for intermodal transport: the mega hub in hanover/lehrte in Germany, Transportation Planning Technology, 27, 347-365, (2004)
[24] Sammarra, M; Cordeau, J; Laporte, G; Monaco, M, A tabu search heuristic for the quay crane scheduling problem, Journal of Scheduling, 10, 327-336, (2007) · Zbl 1168.90468
[25] Zhu, Y; Lim, A, Crane scheduling with noncrossing constraints, J Operational Research Society, 57, 1464-1471, (2006) · Zbl 1123.90042
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.