Quay crane scheduling with draft and trim constraints

Lingxiao Wu, Weimin Ma

Research output: Journal article publicationJournal articleAcademic researchpeer-review

14 Citations (Scopus)

Abstract

This paper discusses the quay crane scheduling problem with draft and trim constraints (QCSPDT), an extension to the current quay crane scheduling problem. We propose a linear mixed integer programming model with the objective to minimize the total handling time for the considered problem. A branch and bound method and a hybrid genetic algorithm are developed to solve the studied problem with different sizes. Computational experiments are conducted to examine the proposed model and solution algorithms. The computational results show that the solution methods are effective and efficient in solving the QCSPDT.

Original languageEnglish
Pages (from-to)38-68
Number of pages31
JournalTransportation Research Part E: Logistics and Transportation Review
Volume97
DOIs
Publication statusPublished - 1 Jan 2017
Externally publishedYes

Keywords

  • Branch and bound
  • Container terminals
  • Draft and trim constraints
  • Genetic algorithm
  • Quay crane scheduling

ASJC Scopus subject areas

  • Business and International Management
  • Civil and Structural Engineering
  • Transportation

Fingerprint

Dive into the research topics of 'Quay crane scheduling with draft and trim constraints'. Together they form a unique fingerprint.

Cite this