A New Genetic Algorithm for Continuous Berth and Quay Crane Allocation Problem

Abstract:

The combined optimization of continuous berth allocation problem and quay crane assignment problem are solved. Considering the real constraints of container terminal, an improved genetic algorithm is proposed. The chromosome is composed of berthing time, berthing location and number of quay cranes. While in the following, specific quay cranes are fixed to assign to ships. Through comparisons with the former two literatures, the results are improved averagely by 33.78% and 28.57% respectively by the proposed genetic algorithm, which shows its effectiveness.

• Periodical: Applied Mechanics and Materials (Volumes 97-98)
• Pages: 619-622
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.97-98.619
• Online since: September 2011
• Authors: Na Li, Zhi Hong Jin, Erick Massami
• Keywords: Berth Allocation, Combined Optimization, Genetic Algorithm (GA), Quay Crane Allocation

References

[1] P.F. Zhou and H.G. Kang: Systems Engineering - Theory & Practice Vol.28 (2008), p.161

[2] F. Meisel and C. Bierwirth: Transportation Research Part E Vol.45 (2009), p.196

[3] C. Zhang et al.: Computers & Industrial Engineering Vol.58 (2010), p.40

[4] D. Chang et al.: Transportation Research Part E Vol.46 (2010), p.975

[5] Q.C. Zeng et al.: Systems Engineering - Theory & Practice Vol.30 (2010), p. (2026)

[6] N. Li and Z.H. Jin: in 2nd ICICTA (2009), p.229

[7] N. Li and Z.H. Jin: Navigation of China (2011), in press (in Chinese)