Berth scheduling by simulated annealing

被引：299

作者：

Kim, KH ^{[1
]}

Moon, KC ^{[1
]}

机构：

[1] Pusan Natl Univ, Dept Ind Engn, Kumjeong Ku, Pusan 609735, South Korea

来源：

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL | 2003年 / 37卷 / 06期

关键词：

berth scheduling; container terminals; mixed-integer-programming; simulated annealing;

D O I：

10.1016/S0191-2615(02)00027-9

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

The objective of the berth-scheduling problem is to determine the berthing times and positions of containerships in port container terminals. Every vessel requires a specific amount of space in a wharf for a predetermined length of time to unload and load containers. In this study, a mixed-integer-linear-programming (MIP) model was formulated for the berth-scheduling problem. The simulated annealing algorithm was applied to the berth-scheduling problem to find near-optimal solutions. Experimental results showed that the simulated annealing algorithm obtains solutions that are similar to the optimal solutions found by the MIP model. (C) 2003 Elsevier Science Ltd. All rights reserved.

引用

页码：541 / 560

页数：20

共 16 条

[1] BROWN GG, 1994, NAV RES LOG, V41, P1, DOI 10.1002/1520-6750(199402)41:1<1::AID-NAV3220410102>3.0.CO
[2] 2-L
[3] CHO DW, 1982, THESIS OREGON STATE
[4] COJEEN HP, 1976, SHIP OPERATION AUTOM
[5] THE CRANE SCHEDULING PROBLEM
DAGANZO, CF
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1989, 23 (03) : 159 - 175
[6] Francis R.L., 1992, FACILITY LAYOUT LOCA, P189
[7] MINIMIZING WEIGHTED ABSOLUTE DEVIATION IN SINGLE-MACHINE SCHEDULING
FRY, TD
ARMSTRONG, RD
BLACKSTONE, JH
[J]. IIE TRANSACTIONS, 1987, 19 (04) : 445 - 450
[8] GIFFORD LA, 1981, THESIS OREGON STATE
[9] EFFICIENT MODELS FOR THE FACILITY LAYOUT PROBLEM
HERAGU, SS
KUSIAK, A
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 53 (01) : 1 - 13
[10] The dynamic berth allocation problem for a container port
Imai, A
Nishimura, E
Papadimitriou, S
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2001, 35 (04) : 401 - 417

← 1 2 →