dc.contributor.author | Krimi, Issam | |
dc.contributor.author | Aloullal, Afaf | |
dc.contributor.author | Benmansour, Rachid | |
dc.contributor.author | Cadi, Abdessamad Ait el | |
dc.contributor.author | Deshayes, Laurent | |
dc.contributor.author | ETAL. | |
dc.date.accessioned | 2022-07-07T05:31:25Z | |
dc.date.available | 2022-07-07T05:31:25Z | |
dc.date.issued | 2018-10 | |
dc.identifier.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. | en_US |
dc.identifier.uri | https://dspace.adu.ac.ae/handle/1/3894 | |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.subject | Berth Allocation | en_US |
dc.subject | Crane assignment | en_US |
dc.subject | Variable Neighborhood Descent | en_US |
dc.subject | Bulk port | en_US |
dc.title | A Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraints | en_US |
dc.title.alternative | International Conference on Variable Neighborhood Search | en_US |
dc.type | Article | en_US |
dc.identifier.doi | https://doi.org/10.1007/978-3-030-15843-9_18 | |