Abstract
Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. The main motivation behind the development of such approaches is the goal of developing automated scheduling methods which are not restricted to one problem. In this paper we report the investigation of a hyperheuristic approach and evaluate it on various instances of two distinct timetabling and rostering problems. In the framework of our hyperheuristic approach, heuristics compete using rules based on the principles of reinforcement learning. A tabu list of heuristics is also maintained which prevents certain heuristics from being chosen at certain times during the search. We demonstrate that this tabu-search hyperheuristic is an easily re-usable method which can produce solutions of at least acceptable quality across a variety of problems and instances. In effect the proposed method is capable of producing solutions that are competitive with those obtained using state-of-the-art problem-specific techniques for the problems studied here, but is fundamentally more general than those techniques.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aickelin, U. (1999). "Genetic Algorithms for Multiple-Choice Optimisation Problems." <nt>Ph.D. Thesis</nt>, European Business Management School, University of Wales Swansea, Sept. 1999.
Aickelin, U. and K.A. Dowsland. (2000). "Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem." Journal of Scheduling3, 139–153.
Burke, E., P. De Causmaecker, and G. Vanden Berghe. (1998). "A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem." <In> Selected Papers of the 2nd Asia-Pacific Conference on Simulated Evolution and Learning (SEAL'98), <nt>Lecture Notes in Artificial Intelligence</nt>, New York: Springer, Berlin Heidelberg, pp. 186–194.
Burke, E., P. Cowling, P. De Causmaecker, and G. Vanden Berghe. (2001). "A Memetic Approach to the Nurse Rostering Problem." Applied Intelligence15(3), 199–214.
Burke, E.K., S. Petrovic, and R. Qu. (2004). "Case Based Heuristic Selection for Timetabling Problems." <nt>Accepted for Publication in Journal of Scheduling</nt>.
Burke, E., G. Kendall, J. Newall, E. Hart, P. Ross, and S. Schulenburg. (2003a). Handbook of Metaheuristics, <nt>chapter 16</nt>, Hyper-Heuristics: An Emerging Direction in Modern Search Technology, pp. 457–474. Kluwer Academic Publishers.
Burke, E.K., B.L. MacCarthy, S. Petrovic, and R. Qu. (2003b). "Knowledge Discovery in a Hyper-Heuristic for Course Timetabling Using Case Based Reasoning." <In> Selected papers of the 4th International Conference. on the Practice And Theory of Automated Timetabling (PATAT 2002), Lecture Notes in Computer Science, Vol. 2740, Springer, <nt>to appear</nt>.
Burke, E.K. and E. Soubeiga. (2003c). "Scheduling Nurses Using a Tabu-Search Hyperheuristic." <In> Proceedings of the 1st Multi-Disciplinary International Scheduling Conference: Theory and Applications (MISTA 2003), Aug. 2003, <nt>to appear</nt>.
Cowling, P., G. Kendall, and L. Han. (2002). "An Investigation of a Hyperheuristic Genetic Algorithm Applied to a Trainer Scheduling Problem." <In> Congress on Evolutionary Computation, CEC'02, pp. 1185–1190, Hilton Hawaiian Village Hotel, Honolulu, Hawaii, May 12–17.
Cowling, P., G. Kendall, and E. Soubeiga. (2000). "A Hyperheuristic Approach to Scheduling a Sales Sum-mit." <In> E. Burke and W. Erben <nt>(eds.)</nt>, Selected Papers of the Third International Conference on the Practice And Theory of Automated Timetabling PATAT'2000, Lecture Notes in Computer Science, Vol. 2079, pp. 176–190.
Cowling, P., G. Kendall, and E. Soubeiga. (2001). "Hyperheuristics: ATool for Rapid Prototyping in Scheduling and Optimisation." <In> Second European Conference on Evolutionary Computing for Combinatorial Optimisation, EvoCop 2002, Lecture Notes in Computer Science, Kinsale, Ireland: Springer, pp. 1–10, April 2001.
Cowling, P., G. Kendall, and E. Soubeiga. (2002). "Hyperheuristics: A Robust Optimisation Method Applied to Nurse Scheduling." <In> Parallel Problem Solving from Nature VII, PPSN 2002, Lecture Notes in Computer Science, Vol. 2439, Granada, Spain: Springer-Verlag, pp. 851–860, Sept. 7–11.
Crowston, W.B., F. Glover, G.L. Thompson, and J.D. Trawick. (1963). "Probabilistic and Parametric Learning Combinations of Local Job Shop Scheduling Rules." ONR Research Memorandum, GSIA, Carnegie Mellon University, Pittsburgh (117).
Dowsland, K.A. (1998). "Nurse Scheduling with Tabu Search and Strategic Oscillation." European Journal of Operational Research106, 393–407.
Fang, H.L., P. Ross, and D. Corne. (1994). "APromising Hybrid g.a./Heuristic Approach for Open-Shop Scheduling Problems." <In> A. Cohn <nt>(ed.)</nt>, Eleventh European Conference on Artificial Intelligence, John Wiley & Sons Ltd., pp. 590–594.
Fisher, H. and G.L. Thompson. (1961). "Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules." <In> Factory Scheduling Conference, Carnegie Institute of Technology, May 10–12.
Fisher, H. and G.L. Thompson. (1963). "Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules." <In> J.F. Muth and G.L. Thompson <nt>(eds.)</nt>, Industrial Scheduling, New Jersey: Prentice-Hall, Inc., pp. 225–251.
Glover, F. and G.A. Kochenberger <nt>(eds.)</nt> (2003). Handbook of Metaheuristics. Kluwer Academic Publisher.
Hart, E. and P. Ross. (1998). "A Heuristic Combination Method for Solving Job-Shop Scheduling Problems." <In> A.E. Eiben, T. Back, M. Schoenauer, and H.P. Schwefel <nt>(eds.)</nt>, Parallel Problem Solving from NatureV, Lecture Notes in Computer Science, Vol. 1498, Springer-Verlag, pp. 845–854.
Kaelbling, L.P., M.L. Littman, and A.W. Moore. (1996). "Reinforcement Learning: A Survey." Journal of Artificial Intelligence Research4, 237–285.
Mockus, J. (1989). Bayesian Approach to Global Optimization. Kluwer Academic Publishers, <nt>254 pages and a disk with the software system</nt>.
Mockus, J., W. Eddy, A. Mockus, L. Mockus, and G. Reklaitis. (1997). Bayesian Heuristic Approach to Discrete and Global Optimization. Kluwer Academic Publishers.
Mockus, J. and L. Mockus. (1991). "Bayesian Approach to Global Optimization and Applications to Multi-Objective Constrained Problems." Journal of Optimization Theory and Applications70(1), 155–170.
Nareyek, A. (2001). "An Empirical Analysis of Weight-Adaptation Strategies for Neighborhoods of Heuristics." <In> Fourth Metaheuristic International Conference MIC'2001, Porto, Portugal, pp. 211–215, July 16–20.
Nareyek, A. (2003). "Choosing Search Heuristics by Non-Stationary Reinforcement Learning." <In> M. Resende and J. Pinho de Sousa <nt>(eds.)</nt>, METAHEURISTICS: Computer Decision Making, Kluwer.
Norenkov, I.P. (1994). "Scheduling and Allocation for Simulation and Synthesis of Cad System Hardware." <In> Proceedings EWITD 94, East-West International Conference, ICSTI, Moscow, pp. 20–24.
Osman, I.H. and G. Laporte. (1996). "Meta-Heuristics: A Bibliography." Annals of Operations Research63, 513–628.
Petrovic, S. and R. Qu. (2002). "Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling." <In> Proceedings of the 6th International Conference on Knowledge-Based Intelligent. Information & Engineering Systems and Applied Technologies (KES 2002), Italy: Milan, Vol. 82, pp. 336–340, Sept. 16–18.
Rayward-Smith, V.J., I.H. Osman, C.R. Reeves, and G.D. Smith <nt>(eds.)</nt> (1996). Modern Heuristic Search. John Wiley and Sons.
Reeves, C.R. <nt>(ed.)</nt> (1993). Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell.
Ross, P., S. Schulenburg, J.G. Marin-Blazquez, and E. Hart. (2002). "Hyper-Heuristics: Learning to Combine Simple Heuristics in Bin-Packing Problem." <In> Proceedings of the Genetic and Evolutionary Computation Conference, GECCO'02, Morgan-Kauffman, pp. 942–948.
Rossi-Doria, O., C. Blum, J. Knowles, M. Sampels, K. Socha, and B. Paechter. (2002). "A Local Search for the Timetabling Problem." <In> Proceedings of the 4th International Conference on the Practice And Theory of Automated Timetabling, PATAT 2002, Aug. 2002, pp. 124–127.
Schaffer, J.D. and L.J. Eshelman. (1996). "Combinatorial Optimisation by Genetic Algorithms: The Value of the Genotype/Phenotype Distinction." <In> First International Conference on Evolutionary Computation and its Applications EvCA'96, Moscow, Russia, June 24–27, pp. 110–120. Presidium of the Russian Academy of Sciences, Springer-Verlag.
Socha, K., J. Knowles, and M. Sampels. (2002). "A Max-Min Ant System for the University Course Timetabling Problem." <In> Proceedings of the 3rd International Workshop on Ant Algorithms, ANTS 2002, Lecture Notes in Computer Science, Vol. 2463, Springer, pp. 1–13. Sept. 2002.
Storer, R.H., S.D. Wu, and R. Vaccari. (1992). "New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling." Management Science38(10), 1495–1509.
Sutton, R.S. and A.G. Barto. (1998). Reinforcement Learning. MIT Press.
Terashima-Marin, H., P. Ross, and M. Valenzuela-Rendon. (1999). "Evolution of Constraint Satisfaction Strategies in Examination Timetabling." <In> Genetic and Evolutionary Computation Conference, GECCO'99, pp. 635–642.
Voss, S., S. Martello, I.H. Osman, and C. Roucairol <nt>(eds.)</nt> (1999). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimisation. Kluwer Academic Publishers.
Wolpert, D. and W.G. MacReady. (1997). "No Free Lunch Theorems for Optimization." IEEE Transactions on Evolutionary Computation1(1), 67–82.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Burke, E., Kendall, G. & Soubeiga, E. A Tabu-Search Hyperheuristic for Timetabling and Rostering. Journal of Heuristics 9, 451–470 (2003). https://doi.org/10.1023/B:HEUR.0000012446.94732.b6
Issue Date:
DOI: https://doi.org/10.1023/B:HEUR.0000012446.94732.b6