A network flow model for the dynamic and flexible berth allocation problem

被引：10

作者：

Yan, Shangyao ^{[1
]}

Lu, Chung-Cheng ^{[2
]}

Hsieh, Jun-Hsiao ^{[1
]}

Lin, Han-Chun ^{[1
]}

机构：

[1] Natl Cent Univ, Dept Civil Engn, Taoyuan 320, Taiwan

[2] Natl Taipei Univ Technol, Dept Ind Engn & Management, Taipei 106, Taiwan

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 2015年 / 81卷

关键词：

Port management; Berth allocation; Mathematical programming; Multi-commodity network flow problem; ALGORITHM; SEARCH; REPAIR;

D O I：

10.1016/j.cie.2014.12.028

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper presents a new model for the dynamic berth allocation problem (BAP). The model is developed using a berth-flow network modeling approach and is formulated as an integer multi-commodity network flow problem. In addition, an innovative flexible berth-space utilization scheme, based on blocking plans, is incorporated into the proposed model. This is referred to as the dynamic (vessel arrivals) and flexible (berth space) BAP model (or DFBAP), and is designed to better utilize wharf space in a container port. Computational experiments conducted on an instance generated using actual data show that the DFBAP model is more effective and efficient than the method currently used by port authorities. A set of scenario analyses is also performed to obtain insights into important model parameters. (C) 2015 Elsevier Ltd. All rights reserved.

引用

页码：65 / 77

页数：13

共 26 条

[1] Simulation-Optimization Models for the Dynamic Berth Allocation Problem [J].

Arango, Carlos ;

Cortes, Pablo ;

Onieva, Luis ;

Escudero, Alejandro .

COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2013, 28 (10) :769-779

[2]

BROWN GG, 1994, NAV RES LOG, V41, P1, DOI 10.1002/1520-6750(199402)41:1<1::AID-NAV3220410102>3.0.CO

[3]

2-L

[4] Models for the discrete berth allocation problem: A computational comparison [J].

Buhrkal, Katja ;

Zuglian, Sara ;

Ropke, Stefan ;

Larsen, Jesper ;

Lusby, Richard .

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2011, 47 (04) :461-473

[5] A multi-objective evolutionary algorithm for berth allocation in a container port [J].

Cheong, C. Y. ;

Lin, C. J. ;

Tan, K. C. ;

Liu, D. K. .

2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, :927-+

[6] Models and tabu search heuristics for the Berth-allocation problem [J].

Cordeau, JF ;

Laporte, G ;

Legato, P ;

Moccia, L .

TRANSPORTATION SCIENCE, 2005, 39 (04) :526-538

[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] Berth allocation with service priority [J].

Imai, A ;

Nishimura, E ;

Papadimitriou, S .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (05) :437-457

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

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

← 1 2 3 →