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

Thumbnail
Date
2018-10
Type
Article
Author
Krimi, Issam
Aloullal, Afaf
Benmansour, Rachid
Cadi, Abdessamad Ait el
Deshayes, Laurent
ETAL.
Metadata
Show full item record
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.
URI
https://dspace.adu.ac.ae/handle/1/3894
DOI
https://doi.org/10.1007/978-3-030-15843-9_18
Citation
Krimi, I., Aloullal, A., Benmansour, R., Ait El Cadi, A., Deshayes, L., & Duvivier, D. (2018, October). A Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraints. In International Conference on Variable Neighborhood Search (pp. 232-242). Springer, Cham.
Collections