文章基本信息

标题：Optimization on Retrieving Containers based on Multi-phase Hybrid Dynamic Programming
本地全文：下载
作者：Zhan Bian ; Zhan Bian ; Zhi-hong Jin 等
期刊名称：Procedia - Social and Behavioral Sciences
印刷版ISSN：1877-0428
出版年度：2013
卷号：96
页码：844-855
DOI：10.1016/j.sbspro.2013.08.096
语种：English
出版社：Elsevier
摘要：AbstractRetrieving export containers from a container yard is an important part of the ship-loading process. This paper presents a three-phase hybrid algorithm to solve for an optimized working plan for a gantry 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 retrieving sequence with heuristic rules, phase two obtains several alternative retrieving sequences through various methods. With a network, phase three constructs a shortest path problem and derives the optimal sequence by dynamic programming. Numerical testing results show that the algorithm is able to solve instances with more than 2000 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 retrieving sequence is efficient.
关键词：containers;retrieving sequence;heuristic rules;dynamic programming;three-phase hybrid algorithm