Heuristics for quay crane scheduling at indented berth

Heuristics for quay crane scheduling at indented berth

0.00 Avg rating0 Votes
Article ID: iaor20117536
Volume: 47
Issue: 6
Start Page Number: 1005
End Page Number: 1020
Publication Date: Nov 2011
Journal: Transportation Research Part E
Authors: , ,
Keywords: programming: integer, heuristics: tabu search
Abstract:

This paper discusses the quay crane scheduling problem at indented berth, an extension to the current quay crane scheduling problem in the field of container terminal operation. A mixed integer programming model by considering the unique features of the quay crane scheduling problem at indented berth is formulated. For solution, decomposition heuristic framework is developed and enhanced by Tabu search. To evaluate the performance of the proposed heuristic framework, a comprehensive numerical test is carried out and its results show the good quality of the proposed heuristic framework.

Reviews

Required fields are marked *. Your email address will not be published.