• français
    • English
  • français 
    • français
    • English
  • Connexion
JavaScript is disabled for your browser. Some features of this site may not work without it.
Accueil

Afficher

Cette collectionPar Date de CréationAuteursTitresSujetsNoms de revueToute la baseCentres de recherche & CollectionsPar Date de CréationAuteursTitresSujetsNoms de revue

Mon compte

Connexion

Statistiques

Afficher les statistiques d'usage

Integrated Laycan and Berth Allocation and time-invariant Quay Crane Assignment Problem in tidal ports with multiple quays

Thumbnail
Ouvrir
cahier_393.pdf_1.pdf (4.482Mb)
Date
2020
Ville de l'éditeur
Paris
Titre de la collection
Cahier du LAMSADE
n° dans la collection
393
Indexation documentaire
Programmation, logiciels, organisation des données
Subject
Integer programming; Berth and quay crane assignment; Predicates; Laycan allocation; Scheduling
URI
https://basepub.dauphine.fr/handle/123456789/20765
Collections
  • LAMSADE : Publications
Métadonnées
Afficher la notice complète
Auteur
Bouzekri, Hamza
74240 Laboratoire des sciences pour la conception, l'optimisation et la production [G-SCOP]
Alpan, Gülgün
74240 Laboratoire des sciences pour la conception, l'optimisation et la production [G-SCOP]
Giard, Vincent
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Type
Document de travail / Working paper
Résumé en anglais
Efficient management of port resources plays a crucial role in reducing vessel stay times and avoiding the payment of demurrage charges. In this paper, we focus on the integrated Laycan and Berth Allocation and Quay Crane Assignment Problem (LBACAP), which considers three problems in an integrated way: the Laycan Allocation Problem, the dynamic continuous Berth Allocation Problem and the time-invariant Quay Crane Assignment Problem. Since these problems have different decision levels, a change of decision time scale is made inside the planning horizon. To ensure that this integrated problem is as close as possible to reality, we consider non-working periods and tidal ports with multiple quays that have different water depths. The integer programming model proposed for the LBACAP aims to find an efficient schedule for berthing chartered vessels with an efficient quay crane assignment, and to propose laycans (laydays and canceling) to new vessels to charter. In a second part, we focus on the integrated Laycan and Berth Allocation and Specific Quay Crane Assignment Problem (LBACASP), which extends the LBACAP model to include the assignment of a set of specific quay cranes to each vessel, considering the productivity of quay cranes (homogeneous or heterogeneous) and their maximum outreach. Moreover, we use predicates in the formulation of both models, which ensure maximum flexibility in their implementation, thereby improving significantly their computational performance. Finally, the computational study on several classes of generated test instances shows that problems with up to 100 vessels can be solved to optimality.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Cette création est mise à disposition sous un contrat Creative Commons.