Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6898731 | European Journal of Operational Research | 2010 | 14 Pages |
Abstract
For a container terminal system, efficient berth and quay crane (QC) schedules have great impact on the improvement of both operation efficiency and customer satisfaction. In this paper we address berth and quay crane scheduling problems in a simultaneous way, with uncertainties of vessel arrival time and container handling time. The berths are of discrete type and vessels arrive dynamically with different service priorities. QCs are allowed to move to other berths before finishing processing on currently assigned vessels, adding more flexibility to the terminal system. A mixed integer programming model is proposed, and a simulation based Genetic Algorithm (GA) search procedure is applied to generate robust berth and QC schedule proactively. Computational experiment shows the satisfied performance of our developed algorithm under uncertainty.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Xiao-le Han, Zhi-qiang Lu, Li-feng Xi,