The multi-port berth allocation problem with speed optimization and emission considerations

Venturini, Giada, Iris, Cagatay ORCID: 0000-0001-5422-354X, Kontovas, Christos A and Larsen, Allan
(2017) The multi-port berth allocation problem with speed optimization and emission considerations. TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 54. pp. 142-159.

[img] Text
TRD_vol54_pp142–159.pdf - Author Accepted Manuscript

Download (679kB) | Preview


The 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.

Item Type: Article
Uncontrolled Keywords: Container terminal operations, Berth allocation problem, Speed optimization, Integer programming, Green maritime logistics
Depositing User: Symplectic Admin
Date Deposited: 27 Oct 2020 16:12
Last Modified: 18 Jan 2023 23:25
DOI: 10.1016/j.trd.2017.05.002
Related URLs: