A lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem

Yi Min Fu, Ali Diabat

    Research output: Contribution to journalArticle

    Abstract

    Decisions on the quay crane assignment problem and the quay crane scheduling problem are typically made independently. However, the efficiency of container terminals can be increased when these decisions are made simultaneously due to the interrelation between quay crane assignment and scheduling. A mathematical formulation for the integrated quay crane assignment and scheduling problem (QCASP) is developed in this paper. Practical considerations are incorporated in the model, such as quay crane (QC) interference. A Lagrangian relaxation is proposed for the model. Feasible solutions are then obtained from the proposed heuristic. Computational results are provided for the proposed Lagrangian relaxation.

    Original languageEnglish (US)
    Pages (from-to)1194-1201
    Number of pages8
    JournalApplied Mathematical Modelling
    Volume39
    Issue number3-4
    DOIs
    StatePublished - Jan 1 2015

    Fingerprint

    Lagrangian Relaxation
    Cranes
    Assignment Problem
    Scheduling Problem
    Scheduling
    Container Terminal
    Computational Results
    Assignment
    Interference
    Heuristics
    Formulation
    Model
    Containers

    Keywords

    • Integer programming
    • Integrated models
    • Lagrangian relaxation
    • Quay crane assignment
    • Quay crane scheduling

    ASJC Scopus subject areas

    • Modeling and Simulation
    • Applied Mathematics

    Cite this

    A lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. / Fu, Yi Min; Diabat, Ali.

    In: Applied Mathematical Modelling, Vol. 39, No. 3-4, 01.01.2015, p. 1194-1201.

    Research output: Contribution to journalArticle

    @article{98c41ba49b9d461bbf1e3c3ad03dcb31,
    title = "A lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem",
    abstract = "Decisions on the quay crane assignment problem and the quay crane scheduling problem are typically made independently. However, the efficiency of container terminals can be increased when these decisions are made simultaneously due to the interrelation between quay crane assignment and scheduling. A mathematical formulation for the integrated quay crane assignment and scheduling problem (QCASP) is developed in this paper. Practical considerations are incorporated in the model, such as quay crane (QC) interference. A Lagrangian relaxation is proposed for the model. Feasible solutions are then obtained from the proposed heuristic. Computational results are provided for the proposed Lagrangian relaxation.",
    keywords = "Integer programming, Integrated models, Lagrangian relaxation, Quay crane assignment, Quay crane scheduling",
    author = "Fu, {Yi Min} and Ali Diabat",
    year = "2015",
    month = "1",
    day = "1",
    doi = "10.1016/j.apm.2014.07.006",
    language = "English (US)",
    volume = "39",
    pages = "1194--1201",
    journal = "Applied Mathematical Modelling",
    issn = "0307-904X",
    publisher = "Elsevier Inc.",
    number = "3-4",

    }

    TY - JOUR

    T1 - A lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem

    AU - Fu, Yi Min

    AU - Diabat, Ali

    PY - 2015/1/1

    Y1 - 2015/1/1

    N2 - Decisions on the quay crane assignment problem and the quay crane scheduling problem are typically made independently. However, the efficiency of container terminals can be increased when these decisions are made simultaneously due to the interrelation between quay crane assignment and scheduling. A mathematical formulation for the integrated quay crane assignment and scheduling problem (QCASP) is developed in this paper. Practical considerations are incorporated in the model, such as quay crane (QC) interference. A Lagrangian relaxation is proposed for the model. Feasible solutions are then obtained from the proposed heuristic. Computational results are provided for the proposed Lagrangian relaxation.

    AB - Decisions on the quay crane assignment problem and the quay crane scheduling problem are typically made independently. However, the efficiency of container terminals can be increased when these decisions are made simultaneously due to the interrelation between quay crane assignment and scheduling. A mathematical formulation for the integrated quay crane assignment and scheduling problem (QCASP) is developed in this paper. Practical considerations are incorporated in the model, such as quay crane (QC) interference. A Lagrangian relaxation is proposed for the model. Feasible solutions are then obtained from the proposed heuristic. Computational results are provided for the proposed Lagrangian relaxation.

    KW - Integer programming

    KW - Integrated models

    KW - Lagrangian relaxation

    KW - Quay crane assignment

    KW - Quay crane scheduling

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

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

    U2 - 10.1016/j.apm.2014.07.006

    DO - 10.1016/j.apm.2014.07.006

    M3 - Article

    AN - SCOPUS:84919843081

    VL - 39

    SP - 1194

    EP - 1201

    JO - Applied Mathematical Modelling

    JF - Applied Mathematical Modelling

    SN - 0307-904X

    IS - 3-4

    ER -