A heuristic for retrieving containers from a yard

Yusin Lee, Yen Ju Lee

研究成果: Article同行評審

106 引文 斯高帕斯(Scopus)

摘要

This paper presents a three-phase heuristic to solve for an optimized working plan for a crane to retrieve all the containers from a given yard according to a given order. The optimization goal is to minimize the number of container movements, as well as the crane's working time. After generating an initial feasible movement sequence, the second phase reduces the length of the sequence by repeatedly formulating and generating a binary integer program. With another mixed integer program, phase three reduces the crane's working time by adjusting the movement sequence through iterations. Numerical testing results show that the heuristic is able to solve instances with more than 700 containers, which is within the range of real-world applications. Moreover, the number of movements approaches the lower bound in most cases, and the resulting movement sequence is efficient.

原文English
頁(從 - 到)1139-1147
頁數9
期刊Computers and Operations Research
37
發行號6
DOIs
出版狀態Published - 2010 六月 1

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

指紋 深入研究「A heuristic for retrieving containers from a yard」主題。共同形成了獨特的指紋。

引用此