Heuristic for the continuous and dynamic berth allocation problem in dry bulk terminals with tidal and stock levels constraints

Authors / Editors

Research Areas

No matching items found.

Publication Details

Output type: Conference proceeding

UM6P affiliated Publication?: Yes

Author list: Cheimanoff N., Fontane F., Kitri M.N., Tchernev N.

Editor list: Cheimanoff N.,Fontane F., ,Kitri M.N.,Tchernev N.

Publisher: International Conference on Information Systems, Logistics and Supply Chain

Publication year: 2020

Start page: 406

End page: 413

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085950791&partnerID=40&md5=6aaad5c83669202cd852d94aaa51368f

Languages: English (EN-GB)


The Berth Allocation Problem (BAP) is one of the main seaside operations planning problems in bulk terminals. The problem consists of allocating space along the quayside to incoming vessels. In this article, the BAP for a continuous quay and dynamic arrivals is considered. The formulation includes both the tidal and stock levels constraints that are common in bulk terminals. A MILP formulation is developed and tested on randomly generated instances using CPLEX. Due to the NP-hard nature of the problem, larger instances are not efficiently solved. Therefore, a heuristic approach is developed to find good quality solutions for these difficult instances. In further experiments, the heuristic solution is used as a starting point for CPLEX. The numerical results show that the scheduling heuristic provides better solutions for larger instances while its use as a starting point for CPLEX improved significantly its performance on solving those instances. © Interconnected Supply Chains in an Era of Innovation - Proceedings of the 8th International Conference on Information Systems, Logistics and Supply Chain, ILS 2020. All rights reserved.


No matching items found.


No matching items found.

Last updated on 2021-22-09 at 16:06