An optimization model for the container pre-marshalling problem

Yusin Lee, Nai Yun Hsu

研究成果: Article同行評審

175 引文 斯高帕斯(Scopus)


In most container yards around the world, containers are stacked high to utilize yard space more efficiently. In these yards, one major factor that affects their operational efficiency is the need to re-shuffle containers when accessing a container that is buried beneath other containers. One way to achieve higher loading efficiency is to pre-marshal the containers in such a way that it fits the loading sequence. In this research, we present a mathematical model for the container pre-marshalling problem. With respect to a given yard layout and a given sequence that containers are loaded onto a ship, the model yields a plan to re-position the export containers within the yard, so that no extra re-handles will be needed during the loading operation. The optimization goal is to minimize the number of container movements during pre-marshalling. The resulting model is an integer programming model composed of a multi-commodity flow problem and a set of side constraints. Several possible variations of the model as well as a solution heuristic are also discussed. Computation results are provided.

頁(從 - 到)3295-3313
期刊Computers and Operations Research
出版狀態Published - 2007 11月

All Science Journal Classification (ASJC) codes

  • 電腦科學(全部)
  • 建模與模擬
  • 管理科學與經營研究


深入研究「An optimization model for the container pre-marshalling problem」主題。共同形成了獨特的指紋。