TY - JOUR
T1 - A heuristic for retrieving containers from a yard
AU - Lee, Yusin
AU - Lee, Yen Ju
N1 - Funding Information:
This research was partially funded by Taiwan National Science Council funding NSC 95-2221-E-006-431, NSC90-2211-E-006-072, and NSC 97-2815-C-006-050-E. The authors would also like to thank Professors Kap Hwan Kim and Gyu-Pyo Hong for sharing their code.
PY - 2010/6
Y1 - 2010/6
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=71749087908&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=71749087908&partnerID=8YFLogxK
U2 - 10.1016/j.cor.2009.10.005
DO - 10.1016/j.cor.2009.10.005
M3 - Article
AN - SCOPUS:71749087908
SN - 0305-0548
VL - 37
SP - 1139
EP - 1147
JO - Computers and Operations Research
JF - Computers and Operations Research
IS - 6
ER -