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

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Integrated Laycan and Berth Allocation Problem

Thumbnail
Link to item file
https://hal.archives-ouvertes.fr/hal-02342441
Dewey
Recherche opérationnelle
Sujet
spatiotemporal disjunctive constraints; laycan allocation; berth allocation; mixed zero-one linear programming
DOI
http://dx.doi.org/10.1109/IESM45758.2019.8948110
Conference name
International Conference on Industrial Engineering and Systems Management (IESM 2019)
Conference date
09-2019
Conference city
Shanghai
Conference country
China
Author
Zheng, Feifeng; Chu, Feng; Liu, Ming
Publisher
Institute of Electrical and Electronics Engineers
Year
2020
ISBN
978-1-7281-1566-5
URI
https://basepub.dauphine.fr/handle/123456789/20853
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Bouzekri, Hamza
Alpan, Gülgün
Giard, Vincent
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Type
Communication / Conférence
Abstract (EN)
Handling vessels within the agreed time limits at a port with an optimal exploitation of its quays plays an important role in the improvement of port effectiveness as it reduces the stay time of vessels and avoids the payment of contractual penalties to shipowners due to the overrun of laytimes. In this paper, we propose a mixed zero-one linear model for a new problem called the integrated Laycan and Berth Allocation Problem with dynamic vessel arrivals in a port with multiple continuous quays. The model aims, first, to achieve an optimal berth plan that reduces the late departures of chartered vessels by maximizing the difference between their despatch money and demurrage charges, considering water depth and maximum waiting time constraints and the productivity that depends on berth positions and, second, to propose laycans for new vessels to charter. Only one binary variable is used to determine the spatiotemporal allocations of vessels and the spatiotemporal constraints of the problem are covered by a disjunctive constraint. An illustrative example and several numerical tests are provided.

  • 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

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.