An Integrated Quay Crane An Integrated Quay Crane Problem: A Novel Formulation and Heuristic Approaches

Abstract

As maritime container transport is rapidly developing due to globalization, the need arises for efficient operations at container terminals. The role of optimization becomes indispensable as port operators aim to maximize the efficiency of accommodating inbound and outbound containers. Quay cranes are a significant determinant of container handling efficiency and as a result, problems such as the Quay Crane Assignment Problem (QCAP) and the Quay Crane Scheduling Problem (QCSP) are receiving increasing attention in the literature. However, although these problems are interrelated, they are generally considered independently. The present work integrates these problems and addresses the Quay Crane Assignment and Scheduling Problem (QCASP) in a novel formulation, with the objective of achieving improved solutions and ultimately increasing container terminal efficiency. This thesis, therefore, consists of modeling and solving the QCASP. Two heuristic approaches are developed, namely a Lagrangian relaxation heuristic, which is employed to achieve optimal solutions or bounds to the QCASP, and a Genetic Algorithm (GA), which is implemented to produce good or near-optimal solutions within shorter computational time. The methodologies of both techniques are outlined in detail, and the methods are then evaluated and compared through computational experiments.

Date of Award	Jun 2013
Original language	American English
Supervisor	Ali Diabat (Supervisor)