Ant colony system for solving Quay Crane Scheduling Problem in container terminal

The Quay Crane Scheduling Problem (QCSP) is one of the most important issues treated in container terminals because of its influence on the efficiency of port. The main goal behind this planning problem is to find the handling sequence of tasks at ship bays by a set of cranes assigned to a container...

Full description

Saved in:
Bibliographic Details
Published in2014 International Conference on Logistics Operations Management pp. 176 - 180
Main Authors Azza, Lajjam, El merouani, Mohamed, Medouri, Adbdellatif
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2014
Subjects
Abstracts
ant colony optimization
container terminal
Cranes
mathematical formulation
Optimization
Processor scheduling
Quay crane scheduling
Online AccessGet full text
DOI10.1109/GOL.2014.6887437

Cover

More Information
Summary:The Quay Crane Scheduling Problem (QCSP) is one of the most important issues treated in container terminals because of its influence on the efficiency of port. The main goal behind this planning problem is to find the handling sequence of tasks at ship bays by a set of cranes assigned to a container vessel such that the time spent by vessels at berth is minimized. This study focused on optimizing quay crane scheduling in port container terminal to enhance their efficiency. So we provide a mixed-integer programming (MIP) model that takes into account non-crossing constraints, safety margin constraints and precedence constraints. To give a solution to this problem, we used a probabilistic technique for solving computational problems; this optimization methodology based on ant behaviors is named the Ant Colony Optimization (ACO).
DOI:10.1109/GOL.2014.6887437