A fast heuristic for quay crane scheduling with interference constraints
- 854 Downloads
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.
KeywordsContainer terminal operations Quay crane interference Unidirectional schedule Disjunctive graph model
Unable to display preview. Download preview PDF.
- Bierwirth, C., & Meisel, F. (2009). A survey of berth allocation and quay crane scheduling problems in container terminals (Working paper). Martin-Luther-University Halle-Wittenberg, submitted for publication. Google Scholar
- Meersmans, P. J. M., & Dekker, R. (2001). Operations research supports container handling (Econometric Institute Report 234). Erasmus University Rotterdam. Google Scholar
- Pinedo, M. (2002). Scheduling—theory, algorithms, and systems (2nd ed.). Englewood Cliffs: Prentice Hall. Google Scholar
- Steenken, D., Winter, T., & Zimmermann, U. T. (2001). Stowage and transport optimization in ship planning. In M. Grötschel, S. Krumke, & J. Rambau (Eds.), Online optimization of large scale systems (pp. 731–745). Berlin: Springer. Google Scholar
- Winter, T. (1999). Online and real-time dispatching problems. PhD thesis, Technical University Braunschweig. Google Scholar