Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03382671
Contributor : Kathleen Torck Connect in order to contact the contributor
Submitted on : Monday, October 18, 2021 - 12:04:22 PM
Last modification on : Wednesday, November 3, 2021 - 8:45:59 AM

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

6