A Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraints

Issam Krimi (1) , Afaf Alloulal (2) , Rachid Benmansour (3) , Abdessamad Ait El Cadi (1) , Laurent Deshayes (2) , David Duvivier (1)

1 LAMIH - Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201
2 UM6P - Université Mohammed VI Polytechnique [Ben Guerir]
3 INSEA - Institut National de Statistique et d’Economie Appliquée [Rabat]

In this paper, we consider the integrated Berth Allocation and Crane Assignment problem, with availability constraints and high tides restrictions, in bulk port context. We were inspired by a real case study of a port owned by our industrial partner. The objective is to minimize the total penalty of tardiness. First, we implemented a greedy heuristic to compute an initial solution. Then, we proposed a sequential Variable Neighborhood Descent (seq-VND) for the problem. In addition, we compared the efficiency of different scenarios for the seq-VND against results given by a mathematical model for the problem.

Mots clés: Berth Allocation; Bulk port; Crane assignment; Variable Neighborhood Descent

Domaines: Informatique [cs]

Issam Krimi, Afaf Alloulal, Rachid Benmansour, Abdessamad Ait El Cadi, Laurent Deshayes, et al.. A Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraints. Proceedings of the 6th International Conference on Variable Neighborhood Search (ICVNS2018), Oct 2020, Sithonia, Greece. pp.232-242, ⟨10.1007/978-3-030-15843-9_18⟩. ⟨hal-03382671⟩