A Dynamic Hybrid Berth Allocation Problem with Routing Constraints in Bulk Ports
The Berth Allocation Problem (BAP) is considered as one of the most important operational problems in the seaside area of ports. It refers to the problem of assigning a set of vessels to a given berth layout within a given time horizon. In this paper, we
- PDF / 301,825 Bytes
- 9 Pages / 439.37 x 666.142 pts Page_size
- 72 Downloads / 166 Views
, Gülgün Alpan1,2
, and Vincent Giard1,3
1
3
EMINES - School of Industrial Management, Mohammed VI Polytechnic University, 43150 Ben Guerir, Morocco [email protected] 2 Université Grenoble Alpes, Grenoble INP, CNRS, G-SCOP, 38000 Grenoble, France [email protected] Université Paris-Dauphine, PSL Research University, 75016 Paris, France [email protected]
Abstract. The Berth Allocation Problem (BAP) is considered as one of the most important operational problems in the seaside area of ports. It refers to the problem of assigning a set of vessels to a given berth layout within a given time horizon. In this paper, we study the dynamic and hybrid case of the BAP in the context of bulk ports with multiple quays, different water depths, and heterogeneous loading equipment, considering routing constraints (routes between storage hangars and berths). This study is motivated by the operations of OCP Group, a world leader in the phosphate industry, at the bulk port of Jorf Lasfar in Morocco, recognized as the largest ore port in Africa. The objective of the problem is to enhance the coordination between the berthing and yard activities, besides maximizing the difference between the despatch money and the demurrage charges of all berthed vessels. We propose an integer linear programming model formulated with predicates, which ensures maximum flexibility in the implementation of the model. Finally, the proposed model is tested and validated through numerical experiments based on instances inspired by real bulk port data. The results show that the model can be used to solve to optimality instances with up to 40 vessels within reasonable computational time. Keywords: Berth Allocation Problem
Conveyor system Bulk ports
1 Introduction Although containerization has played a significant role in developing the port sector and maritime transport, bulk cargoes are still the essential and enduring trades that support the dynamism of maritime shipping. It has to be noted that bulk port operations are very different from container port operations. Indeed, in bulk ports, it is necessary to consider the cargo type and to model the interaction between the storage locations of goods on the yard and the berthing locations of vessels. Hence, establishing a set of feasible routes between berths and storage locations to guarantee that goods are shipped on schedule when making berth allocation decisions, is critical. © IFIP International Federation for Information Processing 2020 Published by Springer Nature Switzerland AG 2020 B. Lalic et al. (Eds.): APMS 2020, IFIP AICT 591, pp. 250–258, 2020. https://doi.org/10.1007/978-3-030-57993-7_29
A Dynamic Hybrid Berth Allocation Problem with Routing Constraints
251
Our analysis considers the bulk port of Jorf Lasfar where a complex conveyor system, composed of different routes that share one or more conveyor belts, is used to transport goods from storage hangars to berths. In addition, we consider the draft restrictions on vessels that limit the feasible be
Data Loading...
