By Topic

An Algorithm for Continuous Berth Allocation with Quay Crane Dynamic Allocation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chen Xuelian ; Coll. of Inf. Eng., Shanghai Maritime Univ., Shanghai, China ; Yang Zhiying

In this paper, we study the continuous berth allocation problem for the container terminals with assumption of quay crane being dynamically allocated and propose new berth allocation model. Based on brother-son method, we develop algorithm to solve the berth allocation problem with presetting the position of the vessels and quay crane being dynamically allocated in the right position without crossing. Computing experiments show that our model and algorithm are more efficient.

Published in:

Intelligent Computation Technology and Automation (ICICTA), 2012 Fifth International Conference on

Date of Conference:

12-14 Jan. 2012