A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints

Noura Al-Dhaheri, Ali Diabat

    Research output: Contribution to journalArticle

    Abstract

    The quay crane scheduling problem is one of the major problems of quayside operational planning in container terminals. The operational efficiency of quay cranes is a large determinant of the overall container terminal efficiency; thus, in an effort to maximize throughput, more and more emphasis is placed on systematically addressing and improving quay crane operations. However, the resulting formulations are highly complex and thus not solvable using commercial software. In the first part of the present paper, we develop a formulation that overcomes this challenge. This allows for solving the model using CPLEX, even for large size instances, which other notable work from the literature fails to solve. The second part of this paper addresses a crucial point which has rarely been accounted for, which is ship stability. A heuristic is developed to solve the extended problem, as it is no longer solvable in CPLEX. The remaining objective of this work is to extend this problem to the multi-ship case. However, once again the problem is insolvable for large instances using CPLEX, even without accounting for stability constraints. We develop a Lagrangian relaxation based algorithm that decomposes the problem by ship, which is solved efficiently as a single ship case. The Lagrangian multipliers are updated using the cutting plane method and the solution of the Lagrangian master problem provides an upper bound on the optimal value of the Lagrangian lower bound. Upper bounds on the optimal value of the original problem are obtained using a constructive heuristic, and through computational experiments we demonstrate the performance of the Lagrangian relaxation-based procedures.

    Original languageEnglish (US)
    JournalAnnals of Operations Research
    Volume248
    Issue number1-2
    DOIs
    StatePublished - Jan 1 2017

    Fingerprint

    Lagrangian relaxation
    Heuristics
    Ship
    Container terminal
    Upper bound
    Lower bounds
    Software
    Throughput
    Cutting planes
    Experiment
    Multiplier
    Operational efficiency
    Operational planning

    Keywords

    • Container terminals
    • Lagrangian relaxation
    • Maritime logistics
    • Quay crane scheduling
    • Ship stability

    ASJC Scopus subject areas

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

    Cite this

    A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints. / Al-Dhaheri, Noura; Diabat, Ali.

    In: Annals of Operations Research, Vol. 248, No. 1-2, 01.01.2017.

    Research output: Contribution to journalArticle

    @article{9879643414dd468fbd9fe75fef536fbc,
    title = "A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints",
    abstract = "The quay crane scheduling problem is one of the major problems of quayside operational planning in container terminals. The operational efficiency of quay cranes is a large determinant of the overall container terminal efficiency; thus, in an effort to maximize throughput, more and more emphasis is placed on systematically addressing and improving quay crane operations. However, the resulting formulations are highly complex and thus not solvable using commercial software. In the first part of the present paper, we develop a formulation that overcomes this challenge. This allows for solving the model using CPLEX, even for large size instances, which other notable work from the literature fails to solve. The second part of this paper addresses a crucial point which has rarely been accounted for, which is ship stability. A heuristic is developed to solve the extended problem, as it is no longer solvable in CPLEX. The remaining objective of this work is to extend this problem to the multi-ship case. However, once again the problem is insolvable for large instances using CPLEX, even without accounting for stability constraints. We develop a Lagrangian relaxation based algorithm that decomposes the problem by ship, which is solved efficiently as a single ship case. The Lagrangian multipliers are updated using the cutting plane method and the solution of the Lagrangian master problem provides an upper bound on the optimal value of the Lagrangian lower bound. Upper bounds on the optimal value of the original problem are obtained using a constructive heuristic, and through computational experiments we demonstrate the performance of the Lagrangian relaxation-based procedures.",
    keywords = "Container terminals, Lagrangian relaxation, Maritime logistics, Quay crane scheduling, Ship stability",
    author = "Noura Al-Dhaheri and Ali Diabat",
    year = "2017",
    month = "1",
    day = "1",
    doi = "10.1007/s10479-016-2239-8",
    language = "English (US)",
    volume = "248",
    journal = "Annals of Operations Research",
    issn = "0254-5330",
    publisher = "Springer Netherlands",
    number = "1-2",

    }

    TY - JOUR

    T1 - A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints

    AU - Al-Dhaheri, Noura

    AU - Diabat, Ali

    PY - 2017/1/1

    Y1 - 2017/1/1

    N2 - The quay crane scheduling problem is one of the major problems of quayside operational planning in container terminals. The operational efficiency of quay cranes is a large determinant of the overall container terminal efficiency; thus, in an effort to maximize throughput, more and more emphasis is placed on systematically addressing and improving quay crane operations. However, the resulting formulations are highly complex and thus not solvable using commercial software. In the first part of the present paper, we develop a formulation that overcomes this challenge. This allows for solving the model using CPLEX, even for large size instances, which other notable work from the literature fails to solve. The second part of this paper addresses a crucial point which has rarely been accounted for, which is ship stability. A heuristic is developed to solve the extended problem, as it is no longer solvable in CPLEX. The remaining objective of this work is to extend this problem to the multi-ship case. However, once again the problem is insolvable for large instances using CPLEX, even without accounting for stability constraints. We develop a Lagrangian relaxation based algorithm that decomposes the problem by ship, which is solved efficiently as a single ship case. The Lagrangian multipliers are updated using the cutting plane method and the solution of the Lagrangian master problem provides an upper bound on the optimal value of the Lagrangian lower bound. Upper bounds on the optimal value of the original problem are obtained using a constructive heuristic, and through computational experiments we demonstrate the performance of the Lagrangian relaxation-based procedures.

    AB - The quay crane scheduling problem is one of the major problems of quayside operational planning in container terminals. The operational efficiency of quay cranes is a large determinant of the overall container terminal efficiency; thus, in an effort to maximize throughput, more and more emphasis is placed on systematically addressing and improving quay crane operations. However, the resulting formulations are highly complex and thus not solvable using commercial software. In the first part of the present paper, we develop a formulation that overcomes this challenge. This allows for solving the model using CPLEX, even for large size instances, which other notable work from the literature fails to solve. The second part of this paper addresses a crucial point which has rarely been accounted for, which is ship stability. A heuristic is developed to solve the extended problem, as it is no longer solvable in CPLEX. The remaining objective of this work is to extend this problem to the multi-ship case. However, once again the problem is insolvable for large instances using CPLEX, even without accounting for stability constraints. We develop a Lagrangian relaxation based algorithm that decomposes the problem by ship, which is solved efficiently as a single ship case. The Lagrangian multipliers are updated using the cutting plane method and the solution of the Lagrangian master problem provides an upper bound on the optimal value of the Lagrangian lower bound. Upper bounds on the optimal value of the original problem are obtained using a constructive heuristic, and through computational experiments we demonstrate the performance of the Lagrangian relaxation-based procedures.

    KW - Container terminals

    KW - Lagrangian relaxation

    KW - Maritime logistics

    KW - Quay crane scheduling

    KW - Ship stability

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

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

    U2 - 10.1007/s10479-016-2239-8

    DO - 10.1007/s10479-016-2239-8

    M3 - Article

    VL - 248

    JO - Annals of Operations Research

    JF - Annals of Operations Research

    SN - 0254-5330

    IS - 1-2

    ER -