A tabu search heuristic for the quay crane scheduling problem
- 581 Downloads
This paper proposes a tabu search heuristic for the Quay Crane Scheduling Problem (QCSP), the problem of scheduling a fixed number of quay cranes in order to load and unload containers into and from a ship. The optimality criterion considered is the minimum completion time. Precedence and non-simultaneity constraints between tasks are taken into account. The former originate from the different kind of operations that each crane has to perform; the latter are needed in order to avoid interferences between the cranes. The QCSP is decomposed into a routing problem and a scheduling problem. The routing problem is solved by a tabu search heuristic, while a local search technique is used to generate the solution of the scheduling problem. This is done by minimizing the longest path length in a disjunctive graph. The effectiveness of our algorithm is assessed by comparing it to a branch-and-cut algorithm and to a Greedy Randomized Adaptive Search Procedure (GRASP).
KeywordsContainer terminal Crane scheduling Disjunctive graph Tabu search
Unable to display preview. Download preview PDF.
- Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows—theory, algorithms and applications. Englewood Cliffs: Prentice Hall. Google Scholar
- Gendreau, M., & Potvin, J.-Y. (2005). Tabu search. In E. K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimization and decision support techniques. Berlin: Springer. Google Scholar
- Glover, F., & Laguna, M. (1993). Tabu search. In C. R. Reeves (Ed.), Modern heuristics techniques for combinatorial problems. Oxford: Blackwell. Google Scholar
- Glover, F., & Laguna, M. (1998). Tabu search. Boston: Kluwer. Google Scholar
- Pinedo, M. (1995). Scheduling—theory, algorithms and systems. Englewood Cliffs: Prentice Hall. Google Scholar
- Roy, B., & Soussmann, B. (1964). Les problèmes d’ordonnancement avec constraintes disjonctives. Note D.S. 9 bis, SEMA, Paris. Google Scholar
- Steenken, D., Voss, S., & Stahlbock, R. (2004). Container terminal operation and operations research—a classification and literature review. Operations Research Spectrum, 26, 3–49. Google Scholar
- Van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992). Job shop scheduling by simulated annealing. Operations Research, 40, 113–125. Google Scholar