Due to the asymmetry between the time required to retrieve a container to vessel and the time required to register a container at the gate, the storage space allocation problem solves the best allocation policy of these containers that minimizes the potential number of gantry movements during the assigning process and the future retrieval process. A decision rule-based heuristic is proposed, and three properties are discovered in this research. Comprehensive numerical experiments show that the proposed heuristic can solve the real-sized instances within a second, making it possible to account for uncertainty because the re-optimization effort is negligible. Moreover, when applying the proposed heuristic to a container yard at the Port of Kaohsiung in Taiwan and considering the extreme cases, the heuristic performs even better when the number of containers increases and still requires less than 1 s to solve these extreme cases. Finally, the proposed heuristic can be applied to different layouts of storage space and various material handling machines.
The Storage Space Allocation Problem at a Container Terminal
Maritime Policy & Management ; 44 , 6 ; 685-704
2017-08-18
20 pages
Article (Journal)
Electronic Resource
English
Storage space allocation in container terminals
Online Contents | 2003
|Storage space allocation in container terminals
Elsevier | 2002
|Optimisation of container space allocation in automated terminal yards
British Library Conference Proceedings | 2023
|