Please use this identifier to cite or link to this item:
|Title:||Terminal and yard allocation problem for a container transshipment hub with multiple terminals|
|Authors:||Lee, D.-H. |
|Citation:||Lee, D.-H., Jin, J.G., Chen, J.H. (2012-03). 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. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tre.2011.09.004|
|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. © 2011 Elsevier Ltd.|
|Source Title:||Transportation Research Part E: Logistics and Transportation Review|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 18, 2018
WEB OF SCIENCETM
checked on Oct 2, 2018
checked on Oct 13, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.