An integrated model for the transshipment yard scheduling problem

Mateusz Cichenski (), Florian Jaehn, Grzegorz Pawlak, Erwin Pesch, Gaurav Singh and Jacek Blazewicz
Additional contact information
Mateusz Cichenski: Poznan University of Technology
Florian Jaehn: Poznan University of Technology
Grzegorz Pawlak: Poznan University of Technology
Erwin Pesch: Poznan University of Technology
Gaurav Singh: CSIRO Digital Productivity Flagship, Commonwealth Scientific and Industrial Research Organisation
Jacek Blazewicz: Poznan University of Technology

Journal of Scheduling, 2017, vol. 20, issue 1, No 5, 57-65

Abstract: Abstract 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.

Keywords: Rail–rail transshipment; Integrated model; Mathematical modelling; Optimization; Scheduling (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-016-0470-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:20:y:2017:i:1:d:10.1007_s10951-016-0470-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-016-0470-4

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().