Developing a Hybrid Stack Mode for Dynamic Yard Allocation Strategy of Export Containers

Jun Liang He; Wei Jian Mi; Dao Fang Chang; Zhi Cheng Bian

doi:10.4028/www.scientific.net/AMM.80-81.1305

Paper Titles

Research on the Relation Expression for District Collaborative Design
p.1284

Normalization-Based Omnidirectional Gait Planning for Small Humanoid Robot
p.1289

Design of Applied Diffusion Pump System for Electron Beam Process
p.1295

Research on the Disassembly Sequence Planning for Mechanical Product
p.1300

Developing a Hybrid Stack Mode for Dynamic Yard Allocation Strategy of Export Containers
p.1305

Yard Allocation Planning for Container Terminals Based on Twin 40ft Handing System
p.1310

The Three-Ply Analytic Approaches of Cycle Working Chart in Design of Automatic Packaging Machine
p.1315

Ground Penetrating Radar Use on Tunnel Disaster Warning
p.1320

Development and Test Study of a New Classification Equipment for Bauxite Desiliconization
p.1324

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 80-81Developing a Hybrid Stack Mode for Dynamic Yard...

Developing a Hybrid Stack Mode for Dynamic Yard Allocation Strategy of Export Containers

Abstract:

In this paper, a dynamic yard allocation strategy of export containers is proposed based on a hybrid stack mode. Firstly, a 0-1 programming model is developed for the problem. Accordingly, the model’s objective function is subject to the minimization of the total re-shuffle containers which are buried beneath other containers but heavier. To resolve the NP-hard problem regarding the dynamic yard allocation model, a hybrid algorithm, which applies heuristic rules and genetic algorithm, is then employed. Subsequently, a case study is used for system illustration. Consequently, it could be found from computational results that this approach paves a venue for resolving the dynamic yard allocation problem of export containers.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 80-81)

Pages:

1305-1309

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.80-81.1305

Citation:

Cite this paper

Online since:

July 2011

Authors:

Jun Liang He, Wei Jian Mi, Dao Fang Chang, Zhi Cheng Bian

Keywords:

0-1 Programming, Container Terminal, Dynamic Yard Allocation, Genetic Algorithm (GA), Heuristic Algorithm , Hybrid Stack Mode

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Steenken, D., Vob, S and Stahlbock, R. (2004). Container terminal operation and operations research – a classification and literature review. OR Spectrum, Vol. 26, No. 1, pp: 3-49.

DOI: 10.1007/s00291-003-0157-z

Google Scholar

[2] Vob, S and Stahlbock, R. (2008). Operations research at container terminals: a literature update. OR Spectrum, Vol. 30, No. 1, pp: 1-52.

Google Scholar

[3] Zhang, C. Q., Liu, J. Y., Wan, Y. W., Murty, K. G. (2003). Storage space allocation in container terminals. Transportation Research Part B, Vol. 37, No. 10, pp: 883-903.

DOI: 10.1016/s0191-2615(02)00089-9

Google Scholar

[4] Mi, W.J., Yan, W., He, J. L and Chang, D.F. (2009).

Google Scholar

[5] Bazzazi, M., Safaei, N and Javadian, N. (2008). A genetic algorithm to solve the storage space allocation problem in a container terminal. Computers & Industrial Engineering, Vol. 56, No. 1, pp: 44-52.

DOI: 10.1016/j.cie.2008.03.012

Google Scholar