Abstract
The term hyperheuristic was introduced by the authors as a high-level heuristic that adaptively controls several low-level knowledgepoor heuristics so that while using only cheap, easy-to-implement low-level heuristics, we may achieve solution quality approaching that of an expensive knowledge-rich approach. For certain classes of problems, this allows us to rapidly produce effective solutions, in a fraction of the time needed for other approaches, and using a level of expertise common among non-academic IT professionals. Hyperheuristics have been successfully applied by the authors to a real-world problem of personnel scheduling. In this paper, the authors report another successful application of hyperheuristics to a rather different real-world problem of personnel scheduling occuring at a UK academic institution. Not only did the hyperheuristics produce results of a quality much superior to that of a manual solution but also these results were produced within a period of only three weeks due to the savings resulting from using the existing hyperheuristic software framework.
Key words
Corresponding author
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K. Baker. Workforce allocation in cyclical scheduling problems: A survey. Operational Research Quarterly, 27(1):155–167, 1976.
J. M. Tien and A. Kamiyama. On manpower scheduling algorithms. SIAM Review, 24(3):275–287, July 1982.
D. J. Bradley and J. B. Martin. Continuous personnel scheduling algorithms: a literature review. Journal Of The Society For Health Systems, 2(2):8–23, 1990.
G. M. Thompson. A simulated-annealing heuristic for shift scheduling using noncontinuously available employees. Computers and Operations Research, 23(3):275–288, 1996.
U. Aickelin and K. A. Dowsland. Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling, 3:139–153, 2000.
K. A. Dowsland. Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research, 106:393–407, 1998.
B. Dodin, A. A. Elimam, and E. Rolland. Tabu search in audit scheduling. European Journal of Operational Research, 106:373–392, 1998.
J. E. Beasley and B. Cao. A tree search algorithm for the crew scheduling problem. European Journal of Operational Research, 94:517–526, 1996.
D. Levine. Application of a hybrid genetic algorithm to airline crew scheduling. Computers and operations research, 23(6):547–558, 1996.
P. Cowling, G. Kendall, and E. Soubeiga. A hyperheuristic approach to scheduling a sales summit. In E. Burke and W. Erben, editors, Selected Papers of the Third International Conference on the Practice And Theory of Automated Timetabling PATAT’2000, Springer Lecture Notes in Computer Science, 176–190, 2001.
P. Cowling, G. Kendall, and E. Soubeiga. A parameter-free hyperheuristic for scheduling a sales summit. Proceedings of the 4th Metaheuristic International Conference, MIC 2001, 127–131.
S. C. Wheelwright and S. Makridakis. Forecasting methods for management. John Wiley & Sons Inc, 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cowling, P., Kendall, G., Soubeiga, E. (2002). Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds) Applications of Evolutionary Computing. EvoWorkshops 2002. Lecture Notes in Computer Science, vol 2279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46004-7_1
Download citation
DOI: https://doi.org/10.1007/3-540-46004-7_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43432-0
Online ISBN: 978-3-540-46004-6
eBook Packages: Springer Book Archive