The Storage Space Allocation Problem at a Container Terminal

Dung Ying Lin, Chia Wei Chiang

研究成果: Article同行評審

20 引文 斯高帕斯(Scopus)


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.

頁(從 - 到)685-704
期刊Maritime Policy and Management
出版狀態Published - 2017 八月 18

All Science Journal Classification (ASJC) codes

  • 地理、規劃與發展
  • 運輸
  • 海洋工程
  • 管理、監督、政策法律


深入研究「The Storage Space Allocation Problem at a Container Terminal」主題。共同形成了獨特的指紋。