Show simple item record

dc.contributor.authorKrimi, Issam
dc.contributor.authorAloullal, Afaf
dc.contributor.authorBenmansour, Rachid
dc.contributor.authorCadi, Abdessamad Ait el
dc.contributor.authorDeshayes, Laurent
dc.contributor.authorETAL.
dc.date.accessioned2022-07-07T05:31:25Z
dc.date.available2022-07-07T05:31:25Z
dc.date.issued2018-10
dc.identifier.citationKrimi, 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.urihttps://dspace.adu.ac.ae/handle/1/3894
dc.description.abstractIn 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.isoenen_US
dc.publisherSpringeren_US
dc.subjectBerth Allocationen_US
dc.subjectCrane assignmenten_US
dc.subjectVariable Neighborhood Descenten_US
dc.subjectBulk porten_US
dc.titleA Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraintsen_US
dc.title.alternativeInternational Conference on Variable Neighborhood Searchen_US
dc.typeArticleen_US
dc.identifier.doihttps://doi.org/10.1007/978-3-030-15843-9_18


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record