The integrated berth allocation, quay crane assignment and scheduling problem: mathematical formulations and a case study

Omar Abou Kasm, Ali Diabat, T. C.E. Cheng

    Research output: Contribution to journalArticle

    Abstract

    This paper considers the integration of three essential seaport terminal operations: the berth allocation problem, the quay crane assignment problem (QCAP), and the quay crane scheduling problem (QCSP). The paper presents a new mathematical formulation that captures all associated operations and constraints. Different quay crane operational policies are considered, namely permitting versus not permitting bay task preemption in QCSP and static versus dynamic crane allocations in QCAP. Thus, variants of the mathematical formulation are introduced to capture the different combinations of these scenarios. Due to the preemption consideration, the models include disaggregated quay crane (QC) tasks. Specifically, QC tasks are identified by single container movements as opposed to bay or stack task allocations that are commonly used in the literature. A case study based on Abu Dhabi’s container terminal is presented where the use of the proposed mathematical models are compared against the current existing operational approach. Results show that the service times can be significantly decreased by the use of the proposed models. Moreover, the policy choice effect on the total schedule is compared through simulated examples and Abu Dhabi’s container terminal case study. The results show that the policy improvements can depend on the problem’s attributes and thus a better policy cannot be generalized.

    Original languageEnglish (US)
    JournalAnnals of Operations Research
    DOIs
    StateAccepted/In press - Jan 1 2019

    Fingerprint

    Integrated
    Assignment
    Container terminal
    Preemption
    Assignment problem
    Task allocation
    Container
    Scenarios
    Seaports
    Allocation problem
    Mathematical model
    Policy choice
    Schedule

    Keywords

    • Berth allocation problem
    • Maritime logistics
    • Optimization modeling
    • Quay crane assignment
    • Quay crane scheduling
    • Seaport operations

    ASJC Scopus subject areas

    • Decision Sciences(all)
    • Management Science and Operations Research

    Cite this

    @article{a541f2750a3843cb9cd8a992afccd87f,
    title = "The integrated berth allocation, quay crane assignment and scheduling problem: mathematical formulations and a case study",
    abstract = "This paper considers the integration of three essential seaport terminal operations: the berth allocation problem, the quay crane assignment problem (QCAP), and the quay crane scheduling problem (QCSP). The paper presents a new mathematical formulation that captures all associated operations and constraints. Different quay crane operational policies are considered, namely permitting versus not permitting bay task preemption in QCSP and static versus dynamic crane allocations in QCAP. Thus, variants of the mathematical formulation are introduced to capture the different combinations of these scenarios. Due to the preemption consideration, the models include disaggregated quay crane (QC) tasks. Specifically, QC tasks are identified by single container movements as opposed to bay or stack task allocations that are commonly used in the literature. A case study based on Abu Dhabi’s container terminal is presented where the use of the proposed mathematical models are compared against the current existing operational approach. Results show that the service times can be significantly decreased by the use of the proposed models. Moreover, the policy choice effect on the total schedule is compared through simulated examples and Abu Dhabi’s container terminal case study. The results show that the policy improvements can depend on the problem’s attributes and thus a better policy cannot be generalized.",
    keywords = "Berth allocation problem, Maritime logistics, Optimization modeling, Quay crane assignment, Quay crane scheduling, Seaport operations",
    author = "{Abou Kasm}, Omar and Ali Diabat and Cheng, {T. C.E.}",
    year = "2019",
    month = "1",
    day = "1",
    doi = "10.1007/s10479-018-3125-3",
    language = "English (US)",
    journal = "Annals of Operations Research",
    issn = "0254-5330",
    publisher = "Springer Netherlands",

    }

    TY - JOUR

    T1 - The integrated berth allocation, quay crane assignment and scheduling problem

    T2 - mathematical formulations and a case study

    AU - Abou Kasm, Omar

    AU - Diabat, Ali

    AU - Cheng, T. C.E.

    PY - 2019/1/1

    Y1 - 2019/1/1

    N2 - This paper considers the integration of three essential seaport terminal operations: the berth allocation problem, the quay crane assignment problem (QCAP), and the quay crane scheduling problem (QCSP). The paper presents a new mathematical formulation that captures all associated operations and constraints. Different quay crane operational policies are considered, namely permitting versus not permitting bay task preemption in QCSP and static versus dynamic crane allocations in QCAP. Thus, variants of the mathematical formulation are introduced to capture the different combinations of these scenarios. Due to the preemption consideration, the models include disaggregated quay crane (QC) tasks. Specifically, QC tasks are identified by single container movements as opposed to bay or stack task allocations that are commonly used in the literature. A case study based on Abu Dhabi’s container terminal is presented where the use of the proposed mathematical models are compared against the current existing operational approach. Results show that the service times can be significantly decreased by the use of the proposed models. Moreover, the policy choice effect on the total schedule is compared through simulated examples and Abu Dhabi’s container terminal case study. The results show that the policy improvements can depend on the problem’s attributes and thus a better policy cannot be generalized.

    AB - This paper considers the integration of three essential seaport terminal operations: the berth allocation problem, the quay crane assignment problem (QCAP), and the quay crane scheduling problem (QCSP). The paper presents a new mathematical formulation that captures all associated operations and constraints. Different quay crane operational policies are considered, namely permitting versus not permitting bay task preemption in QCSP and static versus dynamic crane allocations in QCAP. Thus, variants of the mathematical formulation are introduced to capture the different combinations of these scenarios. Due to the preemption consideration, the models include disaggregated quay crane (QC) tasks. Specifically, QC tasks are identified by single container movements as opposed to bay or stack task allocations that are commonly used in the literature. A case study based on Abu Dhabi’s container terminal is presented where the use of the proposed mathematical models are compared against the current existing operational approach. Results show that the service times can be significantly decreased by the use of the proposed models. Moreover, the policy choice effect on the total schedule is compared through simulated examples and Abu Dhabi’s container terminal case study. The results show that the policy improvements can depend on the problem’s attributes and thus a better policy cannot be generalized.

    KW - Berth allocation problem

    KW - Maritime logistics

    KW - Optimization modeling

    KW - Quay crane assignment

    KW - Quay crane scheduling

    KW - Seaport operations

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

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

    U2 - 10.1007/s10479-018-3125-3

    DO - 10.1007/s10479-018-3125-3

    M3 - Article

    AN - SCOPUS:85059642607

    JO - Annals of Operations Research

    JF - Annals of Operations Research

    SN - 0254-5330

    ER -