A genetic algorithm for the integrated berth allocation and quay crane scheduling problem in container terminals

DOI

10.2991/icsmim-15.2016.191How to use a DOI?

Keywords

Discrete berth allocation problem; Quay crane scheduling; Cost balance; Integer programming model; Genetic algorithm

Abstract

Because the cost of berths and quay cranes are very high compared to the investment costs for the other facilities in container terminals, so berths and quay cranes are the most critical resources in determining the capacity of container terminals. In order to efficiently utilize berths and quay cranes, this paper studied the dynamic discrete berth allocation and quay crane scheduling problem considering the cost balance among different vessels. The objective of the proposed model is to reduce the cost of berths and quay cranes, including the handling cost, the waiting cost and the quay crane operation cost. Due to the inherent computation complexity, a genetic algorithm is designed to attain the near optimal solution. Computational experiments show that the two proposed algorithm are effective for solving the studied problem.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jie Ren
AU  - Xiao Ting Shang
AU  - Jin Xin Cao
PY  - 2016/01
DA  - 2016/01
TI  - A genetic algorithm for the integrated berth allocation and quay crane scheduling problem in container terminals
BT  - Proceedings of the 2015 4th International Conference on Sensors, Measurement and Intelligent Materials
PB  - Atlantis Press
SP  - 1036
EP  - 1040
SN  - 2352-538X
UR  - https://doi.org/10.2991/icsmim-15.2016.191
DO  - 10.2991/icsmim-15.2016.191
ID  - Ren2016/01
ER  -