The Berth planning problem

被引：215

作者：

Lim, A ^{[1
]}

机构：

[1] Natl Univ Singapore, Dept Informat Syst & Comp Sci, Singapore 119260, Singapore

来源：

OPERATIONS RESEARCH LETTERS | 1998年 / 22卷 / 2-3期

关键词：

Berth planning; NP-Complete; graphs; heuristic;

D O I：

10.1016/S0167-6377(98)00010-8

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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. (C) 1998 Elsevier Science B.V. All rights reserved.

引用

页码：105 / 110

页数：6