An Integration Optimization for Berth Allocation and Quay Crane Scheduling Method Based on the Genetic and Ant Colony Algorithm

Article Preview

Abstract:

The berth and quay crane in port are scarce resources. The scheduling optimization of them affects the ship's operating costs directly. In this paper we build an integration optimization model of berth allocation and quay crane scheduling to minimize the operating costs of quay crane and operating costs of the ships. A new genetic and ant colony algorithm is designed to solve this model.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

940-944

Citation:

Online since:

January 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] G. G. Brown. S. Lwaphonegpanich. K. P. Optimizing ship berthing. Naval Research Logistic. 41 (1994) 1-15.

Google Scholar

[2] A. Imai. X. Sun. E. Nishimura. berth allocation in a container port: Using a continuous location space approach. Transportation Research Part B. 39 (2005) 199-221.

DOI: 10.1016/j.trb.2004.04.004

Google Scholar

[3] C. F. Daganzo. The crane scheduling problem. Transportation Research Part B. 23 (1989) 159-175.

DOI: 10.1016/0191-2615(89)90001-5

Google Scholar

[4] R. I. Peterofsky. C. F. Daganzo. A branch and bound solution method for the crane scheduling problem. Transportation Research Part B. 24 (1990) 159-172.

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

Google Scholar

[5] M. Frank. B.A. Christian. Framework for integrated berth allocation and operations planning in seaport container terminals. Transportation Research Part B. 47 (2013) 131-147.

DOI: 10.1287/trsc.1120.0419

Google Scholar

[6] V. Ilaria. S. Matteo. B. Michel. An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transportation Research Part B, 47 (2013) 148-161.

DOI: 10.1287/trsc.1120.0428

Google Scholar