The combined optimization of continuous berth allocation problem and quay crane assignment problem are solved. Considering the real constraints of container terminal, an improved genetic algorithm is proposed. The chromosome is composed of berthing time, berthing location and number of quay cranes. While in the following, specific quay cranes are fixed to assign to ships. Through comparisons with the former two literatures, the results are improved averagely by 33.78% and 28.57% respectively by the proposed genetic algorithm, which shows its effectiveness.
A New Genetic Algorithm for Continuous Berth and Quay Crane Allocation Problem
Applied Mechanics and Materials ; 97-98 ; 619-622
08.09.2011
4 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
A New Genetic Algorithm for Continuous Berth and Quay Crane Allocation Problem
British Library Conference Proceedings | 2011
|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
Online Contents | 2010
|