A berth allocation strategy using heuristics algorithm and simulation optimisation
by Daofang Chang, Wei Yan, Chun-Hisen Chen, Zuhua Jiang
International Journal of Computer Applications in Technology (IJCAT), Vol. 32, No. 4, 2008

Abstract: The Berth Allocation Problem (BAP) becomes critically important to the operational efficiency of a container terminal due to rapid advances in container terminal management. For reducing the total berthing time and cost, intensive research concerning only the berthing stage has been conducted. Accordingly, a broader viewpoint, i.e., an integration of berth allocation and yard planning, has not been well addressed. As such, a novel BAP strategy, which combines dynamic berth allocation and yard planning, is investigated in this study. An example of a specific container terminal in Shanghai is used to illustrate the feasibility and effectiveness of the proposed approach.

Online publication date: Fri, 21-Nov-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com