On the berth allocation problem

Shaikha Ahmed Jumaa Alzaabi, Ali Diabat

    Research output: Contribution to journalArticle

    Abstract

    The rapid growth of the maritime industry has created a need for improvement in container terminal operations, by effectively utilizing the available resources. One of the most important seaside planning problems that has received considerable attention in the literature is the assignment of quay space to vessels, commonly referred to as the Berth Allocation Problem (BAP). Despite the significant contributions to the BAP found in the literature, there are certain important requirements that have not been considered. These include vessels of different sizes, suitability of a berth to a vessel, known as service requirement, and the possibility for one vessel to be accommodated by more than one berth. Thus, we formulate a mixed integer program (MIP) that explicitly considers these factors, in order to produce more realistic results. The model assumes that the quay is partitioned into berths of the same size and that several berths can be assigned to one vessel, given that the vessel is too long to be accommodated by a single berth. Considering the possibility of occupation of several berths by one vessel implies that the sequence of berths occupied is valid and feasible. In addition, we consider two extensions; the first extension of the model accounts for the different service requirements of each vessel, while the second assumes different berth lengths. A preliminary computational analysis is conducted to test the effectiveness of the proposed models and provide useful insights to port operators.

    Original languageEnglish (US)
    Pages (from-to)491-501
    Number of pages11
    JournalRAIRO - Operations Research
    Volume50
    Issue number3
    DOIs
    StatePublished - Jan 1 2016

    Fingerprint

    Vessel
    Containers
    Planning
    Requirements
    Container Terminal
    Mixed Integer Program
    Allocation problem
    Computational Analysis
    Industry
    Assignment
    Model
    Valid
    Imply
    Resources
    Operator
    Container terminal
    Maritime industry
    Mixed integer program
    Factors
    Computational analysis

    Keywords

    • Berth allocation problem
    • Container terminals
    • Maritime logistics
    • MIP formulation

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science Applications
    • Management Science and Operations Research

    Cite this

    On the berth allocation problem. / Alzaabi, Shaikha Ahmed Jumaa; Diabat, Ali.

    In: RAIRO - Operations Research, Vol. 50, No. 3, 01.01.2016, p. 491-501.

    Research output: Contribution to journalArticle

    Alzaabi, SAJ & Diabat, A 2016, 'On the berth allocation problem', RAIRO - Operations Research, vol. 50, no. 3, pp. 491-501. https://doi.org/10.1051/ro/2015029
    Alzaabi, Shaikha Ahmed Jumaa ; Diabat, Ali. / On the berth allocation problem. In: RAIRO - Operations Research. 2016 ; Vol. 50, No. 3. pp. 491-501.
    @article{b7d7a042669f46cdbc90f6e132543ea4,
    title = "On the berth allocation problem",
    abstract = "The rapid growth of the maritime industry has created a need for improvement in container terminal operations, by effectively utilizing the available resources. One of the most important seaside planning problems that has received considerable attention in the literature is the assignment of quay space to vessels, commonly referred to as the Berth Allocation Problem (BAP). Despite the significant contributions to the BAP found in the literature, there are certain important requirements that have not been considered. These include vessels of different sizes, suitability of a berth to a vessel, known as service requirement, and the possibility for one vessel to be accommodated by more than one berth. Thus, we formulate a mixed integer program (MIP) that explicitly considers these factors, in order to produce more realistic results. The model assumes that the quay is partitioned into berths of the same size and that several berths can be assigned to one vessel, given that the vessel is too long to be accommodated by a single berth. Considering the possibility of occupation of several berths by one vessel implies that the sequence of berths occupied is valid and feasible. In addition, we consider two extensions; the first extension of the model accounts for the different service requirements of each vessel, while the second assumes different berth lengths. A preliminary computational analysis is conducted to test the effectiveness of the proposed models and provide useful insights to port operators.",
    keywords = "Berth allocation problem, Container terminals, Maritime logistics, MIP formulation",
    author = "Alzaabi, {Shaikha Ahmed Jumaa} and Ali Diabat",
    year = "2016",
    month = "1",
    day = "1",
    doi = "10.1051/ro/2015029",
    language = "English (US)",
    volume = "50",
    pages = "491--501",
    journal = "RAIRO - Operations Research",
    issn = "0399-0559",
    publisher = "EDP Sciences",
    number = "3",

    }

    TY - JOUR

    T1 - On the berth allocation problem

    AU - Alzaabi, Shaikha Ahmed Jumaa

    AU - Diabat, Ali

    PY - 2016/1/1

    Y1 - 2016/1/1

    N2 - The rapid growth of the maritime industry has created a need for improvement in container terminal operations, by effectively utilizing the available resources. One of the most important seaside planning problems that has received considerable attention in the literature is the assignment of quay space to vessels, commonly referred to as the Berth Allocation Problem (BAP). Despite the significant contributions to the BAP found in the literature, there are certain important requirements that have not been considered. These include vessels of different sizes, suitability of a berth to a vessel, known as service requirement, and the possibility for one vessel to be accommodated by more than one berth. Thus, we formulate a mixed integer program (MIP) that explicitly considers these factors, in order to produce more realistic results. The model assumes that the quay is partitioned into berths of the same size and that several berths can be assigned to one vessel, given that the vessel is too long to be accommodated by a single berth. Considering the possibility of occupation of several berths by one vessel implies that the sequence of berths occupied is valid and feasible. In addition, we consider two extensions; the first extension of the model accounts for the different service requirements of each vessel, while the second assumes different berth lengths. A preliminary computational analysis is conducted to test the effectiveness of the proposed models and provide useful insights to port operators.

    AB - The rapid growth of the maritime industry has created a need for improvement in container terminal operations, by effectively utilizing the available resources. One of the most important seaside planning problems that has received considerable attention in the literature is the assignment of quay space to vessels, commonly referred to as the Berth Allocation Problem (BAP). Despite the significant contributions to the BAP found in the literature, there are certain important requirements that have not been considered. These include vessels of different sizes, suitability of a berth to a vessel, known as service requirement, and the possibility for one vessel to be accommodated by more than one berth. Thus, we formulate a mixed integer program (MIP) that explicitly considers these factors, in order to produce more realistic results. The model assumes that the quay is partitioned into berths of the same size and that several berths can be assigned to one vessel, given that the vessel is too long to be accommodated by a single berth. Considering the possibility of occupation of several berths by one vessel implies that the sequence of berths occupied is valid and feasible. In addition, we consider two extensions; the first extension of the model accounts for the different service requirements of each vessel, while the second assumes different berth lengths. A preliminary computational analysis is conducted to test the effectiveness of the proposed models and provide useful insights to port operators.

    KW - Berth allocation problem

    KW - Container terminals

    KW - Maritime logistics

    KW - MIP formulation

    UR - http://www.scopus.com/inward/record.url?scp=84971453941&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84971453941&partnerID=8YFLogxK

    U2 - 10.1051/ro/2015029

    DO - 10.1051/ro/2015029

    M3 - Article

    VL - 50

    SP - 491

    EP - 501

    JO - RAIRO - Operations Research

    JF - RAIRO - Operations Research

    SN - 0399-0559

    IS - 3

    ER -