An Integrated Quay Crane Assignment and Scheduling Problem

  • Yi-Min Fu

Student thesis: Master's Thesis

Abstract

Around 90% of world trade is carried by the international shipping industry, and standard containers comprise an essential element in that industry. Containerization was developed as a means to provide cost-effective material delivery because such containers can be loaded, unloaded, stacked, and transported efficiently over long distances. Quay cranes (QC) have been utilized to enhance performance at container terminals, by optimizing crane schedules effectively. Therefore, both the Quay Crane Assignment Problem and the Quay Crane Scheduling Problem are important topics addressed in the literature. This thesis proposes a new approach for integrating the quay crane assignment and scheduling problems (QCASP), and for considering safety margins between QCs and ordering conditions. The priority of ships is also taken into consideration in the model. Because a QC may be deployed at any time, the model presented decides the number of QCs to be assigned to each vessel as well as the sequence of operation for each QC. Then, two different solution methods, namely genetic algorithm (GA) and Lagrangian relaxation, are developed to solve the integrated QCASP presented. To verify the accuracy of the proposed solution approaches, computational experiments on small-size instances are carried out, and the results are compared to the optimal solutions obtained using GAMS.
Date of Award2013
Original languageAmerican English
SupervisorAli Diabat (Supervisor)

Keywords

  • Systems engineering; Trade relations
  • Logistics
  • Computational Science.

Cite this

'