Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
480902 | European Journal of Operational Research | 2009 | 9 Pages |
Abstract
Berths are among the most important resources in a port. In this research we present an optimization-based approach for the berth scheduling problem, which is to determine the berthing time and space for each incoming ship. The neighborhood-search based heuristic treats the quay as a continuous space. In additional to basic physical requirements, this model takes several factors important in practice into consideration, including the first-come-first-served rule, clearance distance between ships, and possibility of ship shifting. Computational experience is provided.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Yusin Lee, Chuen-Yih Chen,