@article{oai:senshu-u.repo.nii.ac.jp:00007869,
 author = {宮崎, 晃年 and 鮏川, 矩義 and 高野, 祐一 and 水野, 眞治},
 journal = {情報科学研究},
 month = {Mar},
 note = {Nowadays, container transport is of great importance in international marine freight transportation. It is crucial for container terminals to reduce the ship loading (unloading) time from the perspective of ship waiting times and terminal utilization. The container pre-marshalling problem is to arrange containers on the yard so that they will be loaded by quay cranes into ships efficiently. This paper deals with a special container pre-marshalling problem; i.e., we develop a marshalling plan to avoid conflicts caused by quay cranes requiring containers in the same lane at the same time. The problem is formulated as an integer optimization model, and a two-step heuristic optimization algorithm is presented. Computational experiments are conducted on actual data of a container terminal in Japan. Computational results demonstrate that our method finds better marshalling plans than those of the current system of the container terminal within a reasonable length of time.},
 pages = {1--11},
 title = {キークレーン間干渉を考慮したコンテナ事前配列問題},
 volume = {37},
 year = {2017}
}