Abstract
This paper presents an integer programming model for the terminal and yard allocation problem in a large container transshipment hub with multiple terminals. The model integrates two decisions: terminal allocation for vessels and yard allocation for transshipment container movements within a terminal as well as between terminals. The objective function aims to minimize the total inter-terminal and intra-terminal handling costs generated by transshipment flows. To solve the problem, we develop a 2-level heuristic algorithm to obtain high quality solutions in an efficient way. Computational experiments show the effectiveness of the proposed approach.
| Original language | English |
|---|---|
| Pages (from-to) | 516-528 |
| Number of pages | 13 |
| Journal | Transportation Research Part E: Logistics and Transportation Review |
| Volume | 48 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Mar 2012 |
| Externally published | Yes |
Keywords
- Container ports
- Terminal allocation
- Transshipment
- Yard allocation
Fingerprint
Dive into the research topics of 'Terminal and yard allocation problem for a container transshipment hub with multiple terminals'. Together they form a unique fingerprint.Cite this
Lee, D. H., Jin, J. G., & Chen, J. H. (2012). Terminal and yard allocation problem for a container transshipment hub with multiple terminals. Transportation Research Part E: Logistics and Transportation Review, 48(2), 516-528. https://doi.org/10.1016/j.tre.2011.09.004