Please use this identifier to cite or link to this item:
|Title:||An optimization model for storage yard management in transshipment hubs||Authors:||Lee, L.H.
|Issue Date:||2007||Citation:||Lee, L.H.,Chew, E.P.,Tan, K.C.,Han, Y. (2007). An optimization model for storage yard management in transshipment hubs. Container Terminals and Cargo Systems: Design, Operations Management, and Logistics Control Issues : 107-129. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-49550-5_6||Abstract:||This paper studies a yard storage allocation problem in a transshipment hub where there is a great number of loading and unloading activities. The primary challenge is to efficiently shift containers between the vessels and the storage area so that reshuffling and traffic congestion is minimized. In particular, to reduce reshuffling, a consignment strategy is used. This strategy groups unloaded containers according to their destination vessel. To reduce traffic congestion, a new workload balancing protocol is proposed. A mixed integer-programming model is then formulated to determine the minimum number of yard cranes to deploy and the location where unloaded containers should be stored. The model is solved using CPLEX. Due to the size and complexity of this model two heuristics are also developed. The first is a sequential method while the second is a column generation method. A bound is developed that allows the quality of the solution to be judged. Lastly, a numerical investigation is provided and demonstrates that the algorithms perform adequately on most cases considered. © 2007 Springer-Verlag Berlin Heidelberg.||Source Title:||Container Terminals and Cargo Systems: Design, Operations Management, and Logistics Control Issues||URI:||http://scholarbank.nus.edu.sg/handle/10635/67831||ISBN:||9783540495499||DOI:||10.1007/978-3-540-49550-5_6|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 20, 2019
checked on Apr 19, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.