Please use this identifier to cite or link to this item:
|Title:||The berth planning problem|
|Citation:||Lim, A. (1998-03-01). The berth planning problem. Operations Research Letters 22 (2-3) : 105-110. ScholarBank@NUS Repository.|
|Abstract:||Singapore has one of the busiest ports in the world. Berth planning is one of the problems faced by planners. This paper studies the berth planning problem. We first formulate the problem and show that it is NP-Complete. We transform the berthing problem to a restricted form of the two-dimensional packing problem, use a graph theoretical representation to capture the problem succinctly, and propose an effective heuristic for the problem. Experimental results show that our heuristic performs well on historical test data. © 1998 Elsevier Science B.V. All rights reserved.|
|Source Title:||Operations Research Letters|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.