A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results

Effrosyni Theodorou, Ali Diabat

    Research output: Contribution to journalArticle

    Abstract

    Quay cranes constitute a significant determinant of container handling efficiency and for this reason the quay crane assignment problem (QCAP) and the quay crane scheduling problem (QCSP) have received great attention in research streams. However, these interdependent problems are usually solved sequentially, due to the high complexity of integration, leading to a potentially inefficient utilization of resources. This paper presents a simple approach for the integrated quay crane assignment and scheduling problem (QCASP), by transforming it into a crane-to-bay assignment problem, and develops a Lagrangian relaxation algorithm to solve it. In order to ensure feasibility, a restoration technique is also developed and this Lagrangian relaxation based heuristic is evaluated as a whole. The choice of constraints to be relaxed is justified and the sub- and master problems are derived. The relaxed problem is solved using the constraint generation method and computational results are conducted in order to evaluate the performance of the Lagrangian heuristic, in terms of computational time, Lagrangian bounds and gaps.

    Original languageEnglish (US)
    Pages (from-to)799-817
    Number of pages19
    JournalOptimization Letters
    Volume9
    Issue number4
    DOIs
    StatePublished - Jan 1 2015

    Fingerprint

    Assignment Problem
    Computational Results
    Scheduling Problem
    Lagrangian Relaxation
    Formulation
    Heuristics
    Container
    Restoration
    Determinant
    Resources
    Evaluate

    Keywords

    • Constraint generation
    • Container terminals
    • Lagrangian relaxation
    • Quay crane assignment
    • Quay crane scheduling
    • Restoration technique

    ASJC Scopus subject areas

    • Control and Optimization

    Cite this

    A joint quay crane assignment and scheduling problem : formulation, solution algorithm and computational results. / Theodorou, Effrosyni; Diabat, Ali.

    In: Optimization Letters, Vol. 9, No. 4, 01.01.2015, p. 799-817.

    Research output: Contribution to journalArticle

    @article{e21c033eb70c43cda6aa63f61aa85f4b,
    title = "A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results",
    abstract = "Quay cranes constitute a significant determinant of container handling efficiency and for this reason the quay crane assignment problem (QCAP) and the quay crane scheduling problem (QCSP) have received great attention in research streams. However, these interdependent problems are usually solved sequentially, due to the high complexity of integration, leading to a potentially inefficient utilization of resources. This paper presents a simple approach for the integrated quay crane assignment and scheduling problem (QCASP), by transforming it into a crane-to-bay assignment problem, and develops a Lagrangian relaxation algorithm to solve it. In order to ensure feasibility, a restoration technique is also developed and this Lagrangian relaxation based heuristic is evaluated as a whole. The choice of constraints to be relaxed is justified and the sub- and master problems are derived. The relaxed problem is solved using the constraint generation method and computational results are conducted in order to evaluate the performance of the Lagrangian heuristic, in terms of computational time, Lagrangian bounds and gaps.",
    keywords = "Constraint generation, Container terminals, Lagrangian relaxation, Quay crane assignment, Quay crane scheduling, Restoration technique",
    author = "Effrosyni Theodorou and Ali Diabat",
    year = "2015",
    month = "1",
    day = "1",
    doi = "10.1007/s11590-014-0787-x",
    language = "English (US)",
    volume = "9",
    pages = "799--817",
    journal = "Optimization Letters",
    issn = "1862-4472",
    publisher = "Springer Verlag",
    number = "4",

    }

    TY - JOUR

    T1 - A joint quay crane assignment and scheduling problem

    T2 - formulation, solution algorithm and computational results

    AU - Theodorou, Effrosyni

    AU - Diabat, Ali

    PY - 2015/1/1

    Y1 - 2015/1/1

    N2 - Quay cranes constitute a significant determinant of container handling efficiency and for this reason the quay crane assignment problem (QCAP) and the quay crane scheduling problem (QCSP) have received great attention in research streams. However, these interdependent problems are usually solved sequentially, due to the high complexity of integration, leading to a potentially inefficient utilization of resources. This paper presents a simple approach for the integrated quay crane assignment and scheduling problem (QCASP), by transforming it into a crane-to-bay assignment problem, and develops a Lagrangian relaxation algorithm to solve it. In order to ensure feasibility, a restoration technique is also developed and this Lagrangian relaxation based heuristic is evaluated as a whole. The choice of constraints to be relaxed is justified and the sub- and master problems are derived. The relaxed problem is solved using the constraint generation method and computational results are conducted in order to evaluate the performance of the Lagrangian heuristic, in terms of computational time, Lagrangian bounds and gaps.

    AB - Quay cranes constitute a significant determinant of container handling efficiency and for this reason the quay crane assignment problem (QCAP) and the quay crane scheduling problem (QCSP) have received great attention in research streams. However, these interdependent problems are usually solved sequentially, due to the high complexity of integration, leading to a potentially inefficient utilization of resources. This paper presents a simple approach for the integrated quay crane assignment and scheduling problem (QCASP), by transforming it into a crane-to-bay assignment problem, and develops a Lagrangian relaxation algorithm to solve it. In order to ensure feasibility, a restoration technique is also developed and this Lagrangian relaxation based heuristic is evaluated as a whole. The choice of constraints to be relaxed is justified and the sub- and master problems are derived. The relaxed problem is solved using the constraint generation method and computational results are conducted in order to evaluate the performance of the Lagrangian heuristic, in terms of computational time, Lagrangian bounds and gaps.

    KW - Constraint generation

    KW - Container terminals

    KW - Lagrangian relaxation

    KW - Quay crane assignment

    KW - Quay crane scheduling

    KW - Restoration technique

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

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

    U2 - 10.1007/s11590-014-0787-x

    DO - 10.1007/s11590-014-0787-x

    M3 - Article

    AN - SCOPUS:84925535305

    VL - 9

    SP - 799

    EP - 817

    JO - Optimization Letters

    JF - Optimization Letters

    SN - 1862-4472

    IS - 4

    ER -