A Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraints - Université Polytechnique des Hauts-de-France Access content directly
Conference Papers Year : 2019

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.
No file

Dates and versions

hal-03382671 , version 1 (18-10-2021)

Identifiers

Cite

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⟩
26 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More