Paper Title:
A New Genetic Algorithm for Continuous Berth and Quay Crane Allocation Problem
  Abstract

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.

  Info
Periodical
Chapter
Chapter 3: Modern Logistics System Planning and Optimization
Edited by
Shucai Li
Pages
619-622
DOI
10.4028/www.scientific.net/AMM.97-98.619
Citation
N. Li, Z. H. Jin, E. Massami, "A New Genetic Algorithm for Continuous Berth and Quay Crane Allocation Problem", Applied Mechanics and Materials, Vols. 97-98, pp. 619-622, 2011
Online since
September 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Ri Dong Wang, Jin Xin Cao, Yang Wang, Xia Xi Li
Chapter 4: Modern Logistics System Planning and Optimization
Abstract:The berth and quay crane in port are scarce resources. The scheduling optimization of them affects the ship's operating costs directly. In...
940
Authors: Zhi Jun Gao, Jin Xin Cao, Qing Yu Zhao
Chapter 4: Modern Logistics System Planning and Optimization
Abstract:In the operation of container terminal, berth allocation and quay crane assignment problems (BACAP) always prevent the container terminal...
931