Optimizing Container Reshuffle Operations in Container Yards Based on Dynamic Programming

Jing Li; Yong Bo Lv

doi:10.4028/www.scientific.net/AMM.556-562.5972

Paper Titles

The Empirical Study of Cloud Computing and Companies’ Information Construction
p.5954

Applying the Complexity of Networks to Mine Disease Risk Genes
p.5958

The Design and Implementation of Database on the Full-Text Retrieval System of Multi Document
p.5964

An Application Framework Based on JBPM Workflow Engine
p.5968

Optimizing Container Reshuffle Operations in Container Yards Based on Dynamic Programming
p.5972

Based on the Research of WSN in Information Security Technology
p.5976

Time Series Forecast of Foundation Pit Deformation Based on BP Neural Network
p.5979

The Application of Neural Network Technology in the Fundus Angiography Image Segmentation
p.5984

Application of BP Neural Network to Risk Analysis of Deep Foundation Pit
p.5989

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 556-562Optimizing Container Reshuffle Operations in...

Optimizing Container Reshuffle Operations in Container Yards Based on Dynamic Programming

Abstract:

Based on the multiple phase characteristics of container reshuffle operations, the paper establishes a dynamic programming model according to both the initial stock positions and the picking sequence of containers. Then a directed weight figure is put forward through connecting different states by the order. The paper uses the bi-recursive algorithm, which combines the sequential recursive algorithm with the inverted recursive algorithm, to solve the problem. The optimization of container relocation scheduling is realized by avoiding the second relocation for the same container and minimizing the total relocating time.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 556-562)

Pages:

5972-5975

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.556-562.5972

Citation:

Cite this paper

Online since:

May 2014

Authors:

Jing Li*, Yong Bo Lv

Keywords:

Bi-Recursive Algorithm, Dynamic Programming, Reshuffle Operation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] CASTILHO B, DAGANZO C F. Handling strategies for import containers at marine terminals. Transportation Research: B, 1993, 27B(2): 151-166.

DOI: 10.1016/0191-2615(93)90005-u

Google Scholar

[2] Lin Dong, Qingmin Liu, Chao Wang. Modeling and algorithm for turning out problem of container. Economic mathematics: 2006, 23(2): 181-186.

Google Scholar

[3] KIM K H, HONG G P. A heuristic rule for relocating blocks. Computers & Operations Research, 2006, 33(4): 940-954.

DOI: 10.1016/j.cor.2004.08.005

Google Scholar

[4] Yinghua Yi, Xiangqi Ye, Haixia Hang. A New Dynamic Programming Algorithm for the Shortest Path Problem. Jiangxi Science: 2008, 26(1): 89-91. DOI: 10. 3969.

Google Scholar

[5] Jee Hyun Yang, Kap Hwan Kim. A grouped storage method for minimizing relocations in block stacking systems. Journal of Intelligent Manufacturing . 2006 (4).

DOI: 10.1007/s10845-005-0018-5

Google Scholar