AbstractThis 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.
The simultaneous berth and quay crane allocation problem
Transportation Research Part E: Logistics and Transportation Review ; 44 , 5 ; 900-920
2007-03-24
21 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
The simultaneous berth and quay crane allocation problem
Online Contents | 2008
|The simultaneous berth and quay crane allocation problem
Online Contents | 2008
|Integrating berth allocation and quay crane assignments
Elsevier | 2010
|Integrating berth allocation and quay crane assignments
Online Contents | 2010
|A New Genetic Algorithm for Continuous Berth and Quay Crane Allocation Problem
British Library Conference Proceedings | 2011
|