A tabu search heuristic for the quay crane scheduling problem
Journal of Scheduling
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
A unified approach for the evaluation of quay crane scheduling models and algorithms
Computers and Operations Research
A modified genetic algorithm for quay crane scheduling operations
Expert Systems with Applications: An International Journal
Modeling and solving rich quay crane scheduling problems
Computers and Operations Research
An efficient genetic algorithm for solving the quay crane scheduling problem
Expert Systems with Applications: An International Journal
Hybrid evolutionary computation methods for quay crane scheduling problems
Computers and Operations Research
Hybrid Estimation of Distribution Algorithm for the Quay Crane Scheduling Problem
Applied Soft Computing
A metaheuristic approach for the seaside operations in maritime container terminals
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II
Hi-index | 0.00 |
This paper considers the problem of scheduling quay cranes which are used at sea port container terminals to load and unload containers. This problem is studied intensively in a recent stream of research but still lacks a correct treatment of crane interference constraints. We present a revised optimization model for the scheduling of quay cranes and propose a heuristic solution procedure. At its core a Branch-and-Bound algorithm is applied for searching a subset of above average quality schedules. The heuristic takes advantage from efficient criteria for branching and bounding the search with respect to the impact of crane interference. Although the used techniques are quite standard, the new heuristic produces much better solutions in considerably shorter run times than all algorithms known from the literature.