• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - No thumbnail

Integrated Laycan and Berth Allocation Problem

Bouzekri, Hamza; Alpan, Gülgün; Giard, Vincent, Integrated Laycan and Berth Allocation Problem, International Conference on Industrial Engineering and Systems Management (IESM 2019), 2019-09, Shanghai, China

Type
Communication / Conférence
External document link
https://hal.archives-ouvertes.fr/hal-02342441
Conference title
International Conference on Industrial Engineering and Systems Management (IESM 2019)
Conference date
2019-09
Conference city
Shanghai
Conference country
China
Book author
Zheng, Feifeng; Chu, Feng; Liu, Ming
Publisher
Institute of Electrical and Electronics Engineers
ISBN
978-1-7281-1566-5
Publication identifier
10.1109/IESM45758.2019.8948110
Metadata
Show full item record
Author(s)
Bouzekri, Hamza cc

Alpan, Gülgün

Giard, Vincent
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
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.
Subjects / Keywords
spatiotemporal disjunctive constraints; laycan allocation; berth allocation; mixed zero-one linear programming

Related items

Showing items related by title and author.

  • Thumbnail
    Integrated Laycan and Berth Allocation and time-invariant Quay Crane Assignment Problem in tidal ports with multiple quays 
    Bouzekri, Hamza; Alpan, Gülgün; Giard, Vincent (2020) Document de travail / Working paper
  • Thumbnail
    Integrated Laycan and Berth Allocation Problem with conveyor routing constraints and preventive maintenance activities in bulk ports 
    Bouzekri, Hamza; Alpan, Gülgün; Giard, Vincent (2021-11) Document de travail / Working paper
  • Thumbnail
    A dynamic hybrid Berth Allocation Problem with routing constraints in bulk ports 
    Bouzekri, Hamza; Alpan, Gülgün; Giard, Vincent (2020) Communication / Conférence
  • Thumbnail
    Modélisation des problèmes de l’allocation des planches et des postes à quai 
    Bouzekri, Hamza; Alpan, Gülgün; Giard, Vincent (2019) Communication / Conférence
  • Thumbnail
    Modélisation du problème de l'allocation des planches et des postes à quai dans les ports vraquiers 
    Bouzekri, Hamza; Alpan, Gülgün; Giard, Vincent (2020) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo