Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1023796 | Transportation Research Part E: Logistics and Transportation Review | 2008 | 21 Pages |
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.
Related Topics
Social Sciences and Humanities
Business, Management and Accounting
Business and International Management
Authors
Akio Imai, Hsieh Chia Chen, Etsuko Nishimura, Stratos Papadimitriou,