The simultaneous berth and quay crane allocation problem |
| |
Authors: | Akio Imai Hsieh Chia Chen Etsuko Nishimura Stratos Papadimitriou |
| |
Institution: | aFaculty of Maritime Sciences, Kobe University, Fukae, Higashinada, Kobe 658-0022, Japan;bWorld Maritime University, P.O. Box 500, S-201 24 Malmo, Sweden;cDepartment of Maritime Studies, University of Piraeus, 80 Karaoli and Dimitriou Str., GR185 32 Piraeus, Greece |
| |
Abstract: | This paper addresses efficient berth and crane allocation scheduling at a multi-user container terminal. First, we introduce a formulation for the simultaneous berth and crane allocation problem. Next, by employing genetic algorithm we develop a heuristic to find an approximate solution for the problem. The fitness value of a chromosome is obtained by crane transfer scheduling across berths, which is determined by a maximum flow problem-based algorithm based on a berth allocation problem solution defined by the chromosome. The results of numerical experiments show that the proposed heuristic is applicable to solve this difficult but essential terminal operation problem. |
| |
Keywords: | Berth allocation Crane scheduling Terminal management Container transportation Mathematical programming |
本文献已被 ScienceDirect 等数据库收录! |
|