A Branch-and-Price Algorithm to Solve a Quay Crane Scheduling Problem

Nabil Kenan, Ali Diabat

    Research output: Contribution to journalConference article

    Abstract

    As the maritime industry grows rapidly in size, more attention is being paid to to a wide range of aspects of problems faced at ports with respect to the efficient allocation of resources. A very important seaside planning problem that has received large attention in literature lately is the quay crane scheduling problem (QCSP). The problem involves the creation of a work schedule for the available quay cranes at the port to empty the containers from a vessel or given set of vessels. These optimization problems can be very complex and since they involve a large number of variables and constraints, the use of a commercial solver is impractical. In this paper, we reformulate a problem currently available in the literature to a Dantzig-Wolfe formulation that can be solved by column generation. We then develop a branch-and-price algorithm, which is an exact method, to effectively solve mixed integer programs with very large instances. The algorithm is first tested on a formulation currently available in literature with a small instance and will then be tested on large instances.

    Original languageEnglish (US)
    Pages (from-to)527-532
    Number of pages6
    JournalProcedia Computer Science
    Volume61
    DOIs
    StatePublished - Jan 1 2015
    EventComplex Adaptive Systems, 2015 - San Jose, United States
    Duration: Nov 2 2015Nov 4 2015

    Fingerprint

    Cranes
    Scheduling
    Containers
    Planning
    Industry

    Keywords

    • branch-and-price
    • column generation
    • dantzig-wolfe
    • martime logistics
    • quay crane scheduling problem

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    A Branch-and-Price Algorithm to Solve a Quay Crane Scheduling Problem. / Kenan, Nabil; Diabat, Ali.

    In: Procedia Computer Science, Vol. 61, 01.01.2015, p. 527-532.

    Research output: Contribution to journalConference article

    @article{e3cbf27fc0e94bfeaa4b5b95152ae63a,
    title = "A Branch-and-Price Algorithm to Solve a Quay Crane Scheduling Problem",
    abstract = "As the maritime industry grows rapidly in size, more attention is being paid to to a wide range of aspects of problems faced at ports with respect to the efficient allocation of resources. A very important seaside planning problem that has received large attention in literature lately is the quay crane scheduling problem (QCSP). The problem involves the creation of a work schedule for the available quay cranes at the port to empty the containers from a vessel or given set of vessels. These optimization problems can be very complex and since they involve a large number of variables and constraints, the use of a commercial solver is impractical. In this paper, we reformulate a problem currently available in the literature to a Dantzig-Wolfe formulation that can be solved by column generation. We then develop a branch-and-price algorithm, which is an exact method, to effectively solve mixed integer programs with very large instances. The algorithm is first tested on a formulation currently available in literature with a small instance and will then be tested on large instances.",
    keywords = "branch-and-price, column generation, dantzig-wolfe, martime logistics, quay crane scheduling problem",
    author = "Nabil Kenan and Ali Diabat",
    year = "2015",
    month = "1",
    day = "1",
    doi = "10.1016/j.procs.2015.09.210",
    language = "English (US)",
    volume = "61",
    pages = "527--532",
    journal = "Procedia Computer Science",
    issn = "1877-0509",
    publisher = "Elsevier BV",

    }

    TY - JOUR

    T1 - A Branch-and-Price Algorithm to Solve a Quay Crane Scheduling Problem

    AU - Kenan, Nabil

    AU - Diabat, Ali

    PY - 2015/1/1

    Y1 - 2015/1/1

    N2 - As the maritime industry grows rapidly in size, more attention is being paid to to a wide range of aspects of problems faced at ports with respect to the efficient allocation of resources. A very important seaside planning problem that has received large attention in literature lately is the quay crane scheduling problem (QCSP). The problem involves the creation of a work schedule for the available quay cranes at the port to empty the containers from a vessel or given set of vessels. These optimization problems can be very complex and since they involve a large number of variables and constraints, the use of a commercial solver is impractical. In this paper, we reformulate a problem currently available in the literature to a Dantzig-Wolfe formulation that can be solved by column generation. We then develop a branch-and-price algorithm, which is an exact method, to effectively solve mixed integer programs with very large instances. The algorithm is first tested on a formulation currently available in literature with a small instance and will then be tested on large instances.

    AB - As the maritime industry grows rapidly in size, more attention is being paid to to a wide range of aspects of problems faced at ports with respect to the efficient allocation of resources. A very important seaside planning problem that has received large attention in literature lately is the quay crane scheduling problem (QCSP). The problem involves the creation of a work schedule for the available quay cranes at the port to empty the containers from a vessel or given set of vessels. These optimization problems can be very complex and since they involve a large number of variables and constraints, the use of a commercial solver is impractical. In this paper, we reformulate a problem currently available in the literature to a Dantzig-Wolfe formulation that can be solved by column generation. We then develop a branch-and-price algorithm, which is an exact method, to effectively solve mixed integer programs with very large instances. The algorithm is first tested on a formulation currently available in literature with a small instance and will then be tested on large instances.

    KW - branch-and-price

    KW - column generation

    KW - dantzig-wolfe

    KW - martime logistics

    KW - quay crane scheduling problem

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

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

    U2 - 10.1016/j.procs.2015.09.210

    DO - 10.1016/j.procs.2015.09.210

    M3 - Conference article

    AN - SCOPUS:84962657524

    VL - 61

    SP - 527

    EP - 532

    JO - Procedia Computer Science

    JF - Procedia Computer Science

    SN - 1877-0509

    ER -