HighlightsWe study the quay crane scheduling problem with draft and trim constraints.We present a MIP formulation which incorporates the draft and trim constraints in a novel and effective way.We propose a branch and bound method and a hybrid genetic algorithm to solve the problem with different sizes.Computational experiments show that our solution methods are effective and efficient.
AbstractThis 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.
Quay crane scheduling with draft and trim constraints
2016-10-24
31 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Quay crane scheduling with draft and trim constraints
Online Contents | 2017
|Next-generation quay crane scheduling
Elsevier | 2020
|Quay crane scheduling with non-interference constraints in port container terminals
Online Contents | 2008
|