Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
International Conference on Advanced Computer Theory and Engineering, 5th (ICACTE 2012)
Xie Yi
Xie Yi
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

For berth allocation problem of container terminal, this paper put the wharf line of terminal be continuous and consider the operation time of quay-crane for loading and unloading, formulating berth allocation model basing on the quay-crane scheduling. The objective of model is to minimize the total time of ships at the terminal and the amount of quay-cranes’ movements. Afterwards, to resolve the proposed model, a hybrid parallel genetic algorithm which combined parallel genetic algorithm and heuristic algorithm was employed. Eventually, for an example of a specific container terminal, the proposed model and algorithm was applied to make decisions on the berth allocation problem. Then comparing the scheduling scheme generated by the proposed approach and the actual scheme to demonstrate the availability and practicality of the model and algorithm.

1. Introduction
2. Problem Description
3. Problem Formulation
4. Algorithms for Proposed Mathematical Model
5. Numerical Experiments
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal