Please use this identifier to cite or link to this item:
|Title:||A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub||Authors:||Han, Y.
High-low workload balancing protocol
|Issue Date:||Oct-2008||Citation:||Han, Y., Lee, L.H., Chew, E.P., Tan, K.C. (2008-10). A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub. OR Spectrum 30 (4) : 697-720. ScholarBank@NUS Repository. https://doi.org/10.1007/s00291-008-0127-6||Abstract:||This paper studies a storage yard management problem in a transshipment hub where the loading and unloading activities are both heavy and concentrated. In order to reduce the number of reshuffles, which helps to reduce the vessel turnaround time, the port operator uses the consignment strategy to group export and transshipment containers according to their destination vessel. To reduce the potential traffic congestion of prime movers, a high-low workload balancing protocol is used. A mixed integer programming model is formulated to determine the storage locations of incoming containers, the number of incoming containers and the smallest number of yard cranes to deploy in each shift. An iterative improvement method is developed to solve the problem, in which a tabu search based heuristic algorithm is used to generate an initial yard template, and then the generated yard template is improved by an improvement algorithm iteratively until an optimal or a satisfactory solution is obtained. Experiment results show that the proposed method can generate excellent results within a reasonable time, even for the extreme cases. © 2008 Springer-Verlag.||Source Title:||OR Spectrum||URI:||http://scholarbank.nus.edu.sg/handle/10635/62988||ISSN:||01716468||DOI:||10.1007/s00291-008-0127-6|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 22, 2020
WEB OF SCIENCETM
checked on May 13, 2020
checked on May 11, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.