The Integrated Berth and Quay Crane Scheduling Problem in Container Terminals

Article Preview

Abstract:

With the current development of the berth and quay crane in China, minimizing the total time of all ships stopping at the port, and maximizing the utilization rate of quay cranes to reduce the waiting time in the queue at the anchorage are the key to success in the field of container terminals. The objective of this paper is to minimize the total time of all stopped ships at the port and to maximize the operation efficiency of quay cranes. Compared with single berth and quay crane allocation, this paper analyzes the berth-quay crane as a whole, and an integer programming model with some constraints is built for this problem. Then the heuristic algorithm is used in this paper to optimize the problem and gain the solution. This paper provides a guide for practical operation.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1793-1796

Citation:

Online since:

July 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] A. Imai, E. Nishimura, S. Papadimitriou, The dynamic berth allocation problem for a container port, Transportation Research Part B. 35 (2001) 401-417.

DOI: 10.1016/s0191-2615(99)00057-0

Google Scholar

[2] Y.T. Zhang, The berth scheduling problem based on genetic algorithm optimization and simulation: (a master's degree thesis), WUhan: Wuhan University of Technology. (2005) 31-61.

Google Scholar

[3] A. Haghani, E. Zaisar, A model for designing the container loading plans for Containership, Working paper, University of Maryland, Transportation Research Board the 2001 Annual Meeting. (2001) 55-62.

Google Scholar

[4] O. Dubrovsky, G. Levitin, M. Penn, A genetic algorithm with a compact solution encoding for the container ship stowage problem, Journal of Heuristics. 8 (2002) 585-599.

Google Scholar

[5] R.I. Peterkofsky, C.E. Daganzo, A branch and bound solution method for the crane, the scheduling problem Zagreb , Transportation Research Part B. 24 (1990) 159-172.

DOI: 10.1016/0191-2615(90)90014-p

Google Scholar