The quay crane scheduling problem with non-crossing and safety clearance constraints: An exact solution approach

Omar Abou Kasm, Ali Diabat

Research output: Contribution to journalArticle

Abstract

This paper considers the Quay Crane Scheduling Problem (QCSP) with non-crossing and safety clearance constraints for a single vessel. The problem determines the order of unloading and loading operations that a specific number of quay cranes (QCs) perform to serve a vessel in minimum time. The QCs move on a single rail and therefore cannot cross each other, and every two consecutive cranes must leave a specific safety distance between them. Due to the difficulty of this problem, most researchers have used heuristics to solve it. However, the QCSP is normally used as a building block of bigger ports’ optimization problems that are very difficult to solve without some decomposition techniques like Lagrangian relaxation. For these methods to succeed, the sub-problems must be solved to optimality in reasonable computational time. This paper presents an improvement on a recent novel formulation for the problem, followed by a new exact and computationally fast technique to solve it. The technique is a two-step approach initiated by a partitioning heuristic and terminated by a Branch and Price algorithm. Through computational experiments, we demonstrate that the proposed solution approach can solve real-sized cases in a fast computational time and has low sensitivity to all parameters. Finally, we introduce a method, formulated as a traveling salesman problem, to acquire operationally practical solutions by minimizing crane re-positioning movements and accounting for crane initial positions.

Original languageEnglish (US)
Pages (from-to)189-199
Number of pages11
JournalComputers and Operations Research
Volume107
DOIs
StatePublished - Jul 1 2019

Fingerprint

Cranes
Clearance
Scheduling Problem
Exact Solution
Safety
Scheduling
Vessel
Heuristics
Branch-and-price
Lagrangian Relaxation
Decomposition Techniques
Travelling salesman problems
Computational Experiments
Building Blocks
Positioning
Consecutive
Partitioning
Optimality
Optimization Problem
Traveling salesman problem

Keywords

  • Branch and Price
  • Exact technique
  • Large-scale optimization
  • Maritime logistics
  • Partitioning approach
  • QCSP

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research

Cite this

The quay crane scheduling problem with non-crossing and safety clearance constraints : An exact solution approach. / Abou Kasm, Omar; Diabat, Ali.

In: Computers and Operations Research, Vol. 107, 01.07.2019, p. 189-199.

Research output: Contribution to journalArticle

@article{7382c1dd799f477996a85787dc401286,
title = "The quay crane scheduling problem with non-crossing and safety clearance constraints: An exact solution approach",
abstract = "This paper considers the Quay Crane Scheduling Problem (QCSP) with non-crossing and safety clearance constraints for a single vessel. The problem determines the order of unloading and loading operations that a specific number of quay cranes (QCs) perform to serve a vessel in minimum time. The QCs move on a single rail and therefore cannot cross each other, and every two consecutive cranes must leave a specific safety distance between them. Due to the difficulty of this problem, most researchers have used heuristics to solve it. However, the QCSP is normally used as a building block of bigger ports’ optimization problems that are very difficult to solve without some decomposition techniques like Lagrangian relaxation. For these methods to succeed, the sub-problems must be solved to optimality in reasonable computational time. This paper presents an improvement on a recent novel formulation for the problem, followed by a new exact and computationally fast technique to solve it. The technique is a two-step approach initiated by a partitioning heuristic and terminated by a Branch and Price algorithm. Through computational experiments, we demonstrate that the proposed solution approach can solve real-sized cases in a fast computational time and has low sensitivity to all parameters. Finally, we introduce a method, formulated as a traveling salesman problem, to acquire operationally practical solutions by minimizing crane re-positioning movements and accounting for crane initial positions.",
keywords = "Branch and Price, Exact technique, Large-scale optimization, Maritime logistics, Partitioning approach, QCSP",
author = "{Abou Kasm}, Omar and Ali Diabat",
year = "2019",
month = "7",
day = "1",
doi = "10.1016/j.cor.2019.03.014",
language = "English (US)",
volume = "107",
pages = "189--199",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - The quay crane scheduling problem with non-crossing and safety clearance constraints

T2 - An exact solution approach

AU - Abou Kasm, Omar

AU - Diabat, Ali

PY - 2019/7/1

Y1 - 2019/7/1

N2 - This paper considers the Quay Crane Scheduling Problem (QCSP) with non-crossing and safety clearance constraints for a single vessel. The problem determines the order of unloading and loading operations that a specific number of quay cranes (QCs) perform to serve a vessel in minimum time. The QCs move on a single rail and therefore cannot cross each other, and every two consecutive cranes must leave a specific safety distance between them. Due to the difficulty of this problem, most researchers have used heuristics to solve it. However, the QCSP is normally used as a building block of bigger ports’ optimization problems that are very difficult to solve without some decomposition techniques like Lagrangian relaxation. For these methods to succeed, the sub-problems must be solved to optimality in reasonable computational time. This paper presents an improvement on a recent novel formulation for the problem, followed by a new exact and computationally fast technique to solve it. The technique is a two-step approach initiated by a partitioning heuristic and terminated by a Branch and Price algorithm. Through computational experiments, we demonstrate that the proposed solution approach can solve real-sized cases in a fast computational time and has low sensitivity to all parameters. Finally, we introduce a method, formulated as a traveling salesman problem, to acquire operationally practical solutions by minimizing crane re-positioning movements and accounting for crane initial positions.

AB - This paper considers the Quay Crane Scheduling Problem (QCSP) with non-crossing and safety clearance constraints for a single vessel. The problem determines the order of unloading and loading operations that a specific number of quay cranes (QCs) perform to serve a vessel in minimum time. The QCs move on a single rail and therefore cannot cross each other, and every two consecutive cranes must leave a specific safety distance between them. Due to the difficulty of this problem, most researchers have used heuristics to solve it. However, the QCSP is normally used as a building block of bigger ports’ optimization problems that are very difficult to solve without some decomposition techniques like Lagrangian relaxation. For these methods to succeed, the sub-problems must be solved to optimality in reasonable computational time. This paper presents an improvement on a recent novel formulation for the problem, followed by a new exact and computationally fast technique to solve it. The technique is a two-step approach initiated by a partitioning heuristic and terminated by a Branch and Price algorithm. Through computational experiments, we demonstrate that the proposed solution approach can solve real-sized cases in a fast computational time and has low sensitivity to all parameters. Finally, we introduce a method, formulated as a traveling salesman problem, to acquire operationally practical solutions by minimizing crane re-positioning movements and accounting for crane initial positions.

KW - Branch and Price

KW - Exact technique

KW - Large-scale optimization

KW - Maritime logistics

KW - Partitioning approach

KW - QCSP

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

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

U2 - 10.1016/j.cor.2019.03.014

DO - 10.1016/j.cor.2019.03.014

M3 - Article

AN - SCOPUS:85063678557

VL - 107

SP - 189

EP - 199

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

ER -