berth allocation strategy using heuristics algorithm and simulation optimisation

被引：21

作者：

Chang, Daofang ^{[1
]}

Yan, Wei ^{[2
]}

Chen, Chun-Hisen ^{[3
]}

Jiang, Zuhua ^{[1
]}

机构：

[1] Shanghai Jiao Tong Univ, Sch Mech Engn, Shanghai 200030, Peoples R China

[2] Shanghai Maritime Univ, Logist Engn Sch, 1550 Pudong Ave, Shanghai 200135, Peoples R China

[3] Nanyang Technol Univ, Sch Mech & Aerosp Engn, Singapore 639798, Singapore

来源：

INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY | 2008年 / 32卷 / 04期

关键词：

container terminal; quay length; operational efficiency; dynamic berth allocation; heuristic algorithm; simulation optimisation;

D O I：

10.1504/IJCAT.2008.021382

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The Berth Allocation Problem (BAP) becomes critically important to the operational efficiency of a container terminal due to rapid advances in container terminal management. For reducing the total berthing time and cost, intensive research concerning only the berthing stage has been conducted. Accordingly, a broader viewpoint, i.e., an integration of berth allocation and yard planning, has not been well addressed. As such, a novel BAP strategy, which combines dynamic berth allocation and yard planning, is investigated in this study. An example of a specific container terminal in Shanghai is used to illustrate the feasibility and effectiveness of the proposed approach.

引用

页码：272 / 281

页数：10

共 20 条

[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]

Brown GG, 1997, NAV RES LOG, V44, P301, DOI 10.1002/(SICI)1520-6750(199706)44:4<301::AID-NAV2>3.0.CO

[4]

2-A

[5]

Dai J., 2007, SUPPLY CHAIN ANAL HD, P69

[6] Local search algorithms for the rectangle packing problem with general spatial costs [J].

Imahori, S ;

Yagiura, M ;

Ibaraki, T .

MATHEMATICAL PROGRAMMING, 2003, 97 (03) :543-569

[7] Berth allocation in a container port: using a continuous location space approach [J].

Imai, A ;

Sun, X ;

Nishimura, E ;

Papadimitriou, S .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (03) :199-221

[8] Efficient planning of berth allocation for container terminals in Asia [J].

Imai, A ;

Nagaiwa, K ;

Tat, CW .

JOURNAL OF ADVANCED TRANSPORTATION, 1997, 31 (01) :75-94

[9] The dynamic berth allocation problem for a container port [J].

Imai, A ;

Nishimura, E ;

Papadimitriou, S .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2001, 35 (04) :401-417

[10] Berthing ships at a multi-user container terminal with a limited quay capacity [J].

Imai, Akio ;

Nishimura, Etsuko ;

Papadimitriou, Stratos .

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (01) :136-151

← 1 2 →