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

被引：9

作者：

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

共 50 条

[21] A Dynamic Hybrid Berth Allocation Problem with Routing Constraints in Bulk Ports
Bouzekri, Hamza
Alpan, Gulgun
Giard, Vincent
ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS: THE PATH TO DIGITAL TRANSFORMATION AND INNOVATION OF PRODUCTION MANAGEMENT SYSTEMS, PT I, 2020, 591 : 250 - 258
[22] New hybrid genetic algorithms to solve dynamic berth allocation problem
Bacalhau, Eduardo Tadeu
Casacio, Luciana
de Azevedo, Anibal Tavares
EXPERT SYSTEMS WITH APPLICATIONS, 2021, 167
[23] A Disjunctive Graph Solution Representation for the Continuous and Dynamic Berth Allocation Problem
Cheimanoff, Nicolas
Fenies, Pierre
Kitri, Mohamed Nour
Tchernev, Nikolay
METAHEURISTICS, MIC 2024, PT II, 2024, 14754 : 204 - 218
[24] An Integer Linear Programming Model for Continuous Berth Allocation Problem
Yang, Jie-Min
Hu, Zhi-Hua
Ding, Xiang-Qian
Luo, Jack Xunjie
2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 4, PROCEEDINGS, 2009, : 74 - +
[25] A HPSO for solving dynamic and discrete berth allocation problem and dynamic quay crane assignment problem simultaneously
Hsu, Hsien-Pin
SWARM AND EVOLUTIONARY COMPUTATION, 2016, 27 : 156 - 168
[26] Combination of a Dynamic-Hybrid Berth Allocation Problem with a Quay Crane Scheduling Problem
Alnaqbi, Bushra
Alrubaiai, Hanan
Al Alawi, Shaikha
2016 7TH INTERNATIONAL CONFERENCE ON INFORMATION, INTELLIGENCE, SYSTEMS & APPLICATIONS (IISA), 2016,
[27] POPMUSIC as a matheuristic for the berth allocation problem
Eduardo Lalla-Ruiz
Stefan Voß
Annals of Mathematics and Artificial Intelligence, 2016, 76 : 173 - 189
[28] The stochastic discrete berth allocation problem
Schepler, Xavier
Absi, Nabil
Feillet, Dominique
Sanlaville, Eric
EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2019, 8 (04) : 363 - 396
[29] POPMUSIC as a matheuristic for the berth allocation problem
Lalla-Ruiz, Eduardo
Voss, Stefan
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2016, 76 (1-2) : 173 - 189
[30] Clustering Search for the Berth Allocation Problem
de Oliveira, Rudinei Martins
Mauri, Geraldo Regis
Nogueira Lorena, Luiz Antonio
EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (05) : 5499 - 5505

← 1 2 3 4 5 →