DocumentCode
3514518
Title
Optimizing Retrieval Sequencing in Container Yards
Author
Li, Jin ; Yu, Hong-xia
Author_Institution
Sch. of Inf. Sci., Zhejiang Ocean Univ., Zhoushan, China
Volume
2
fYear
2010
fDate
11-12 Nov. 2010
Firstpage
90
Lastpage
92
Abstract
This paper presents a mixed-integer programming (MIP) model of retrieval sequencing in container yards. Exact penalty function methods are proposed to find the exact solution. The optimization goal is to minimize the weighted sum of the number of container movements and the total working time of the crane.
Keywords
integer programming; sea ports; transportation; container movements; container yards; exact penalty function methods; mixed-integer programming model; optimization goal; retrieval sequencing; total working time; container yards; exact penalty function methods; retrieval sequencing;
fLanguage
English
Publisher
ieee
Conference_Titel
Optoelectronics and Image Processing (ICOIP), 2010 International Conference on
Conference_Location
Haiko
Print_ISBN
978-1-4244-8683-0
Type
conf
DOI
10.1109/ICOIP.2010.236
Filename
5663129
Link To Document