HighlightsA novel collaborative problem between liner shipping companies and port operators.Multi-port berth allocation problem with the speed optimization at each string leg.A sensitivity analysis with different bunker prices and vessel speeds.Fuel savings up to 42% by solving the collaborative problem.Practical managerial implications of collaboration with port-liner strategic models.
AbstractThe container shipping industry faces many interrelated challenges and opportunities, as its role in the global trading system has become increasingly important over the last decades. On the one side, collaboration between port terminals and shipping liners can lead to costs savings and help achieve a sustainable supply chain, and on the other side, the optimization of operations and sailing times leads to reductions in bunker consumption and, thus, to fuel cost and air emissions reductions. To that effect, there is an increasing need to address the integration opportunities and environmental issues related to container shipping through optimization. This paper focuses on the well known Berth Allocation Problem (BAP), an optimization problem assigning berthing times and positions to vessels in container terminals. We introduce a novel mathematical formulation that extends the classical BAP to cover multiple ports in a shipping network under the assumption of strong cooperation between shipping lines and terminals. Speed is optimized on all sailing legs between ports, demonstrating the effect of speed optimization in reducing the total time of the operation, as well as total fuel consumption and emissions. Furthermore, the model implementation shows that an accurate speed discretization can result in far better economic and environmental results.
The multi-port berth allocation problem with speed optimization and emission considerations
Transportation Research Part D: Transport and Environment ; 54 ; 142-159
2017-01-01
18 pages
Article (Journal)
Electronic Resource
English
The dynamic berth allocation problem for a container port
Online Contents | 2001
|Port berth allocation method based on two-dimensional boxing problem
European Patent Office | 2023
|The stochastic discrete berth allocation problem
Online Contents | 2019
|