The berth planning problem

The berth planning problem

0.00 Avg rating0 Votes
Article ID: iaor2001892
Country: United States
Volume: 22
Issue: 2/3
Start Page Number: 105
End Page Number: 110
Publication Date: Mar 1998
Journal: Operations Research Letters
Authors:
Keywords: graphs
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.

Reviews

Required fields are marked *. Your email address will not be published.