Abstract
The concept of a hyperheuristic is introduced as an approach that operates at a higher lever of abstraction than current metaheuristic approaches. The hyperheuristic manages the choice of which lowerlevel heuristic method should be applied at any given time, depending upon the characteristics of the region of the solution space currently under exploration. We analyse the behaviour of several different hyperheuristic approaches for a real-world personnel scheduling problem. Results obtained show the effectiveness of our approach for this problem and suggest wider applicability of hyperheuristic approaches to other problems of scheduling and combinatorial optimisation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aickelin, U., Dowsland, K.: Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem. J. Scheduling 3 (2000) 139–153
Burke, E.K.: Cowling, P., De Causmaecker, P., Vanden Berghe, G.A.: Memetic Approach to the Nurse Rostering Problem. Int. J. Appl. Intell. to appear
Burke, E., De Causmaecker, P., Vanden Berghe, G.A.: Hybrid Tabu Search Algorithm for the Nurse Rostering Problem. Selected Papers of the 2nd Asia-Pacific Conference on Simulated Evolution and Learning (SEAL’ 98). Lecture Notes in Artificial Intelligence, Vol. 1585: Springer, Berlin Heidelberg New York (1998) 186–194
Back, T., Fogel, D.B., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. IOP Publishing and Oxford University Press (1997)
Dodin, B., Elimam, A.A., Rolland, E.: Tabu Search in Audit Scheduling. Eur. J. Oper. Res. 106 (1998) 373–392
Dowsland, K.A.: Nurse Scheduling with Tabu Search and Strategic Oscillation. Eur. J. Oper. Res. 106 (1998) 393–407
Easton, F.F., Mansour, N.A.: Distributed Genetic Algorithm for Deterministic and Stochastic Labor Scheduling Problems. Eur. J. Oper. Res. 118 (1999) 505–523
Mladenovic, N., Hansen, P.: Variable Neighborhood Search. Comput. Oper. Res. 24 (1997) 1097–1100
Hart, E., Ross, P., Nelson, J.: Solving a Real-World Problem Using an Evolving Heuristically Driven Schedule. Evol. Comput. 6 (1998) 61–80
Mason, A.J., Ryan, D.M., Panton. D.M.: Integrated Simulation, Heuristic and Optimisation Approaches to Staff Scheduling. Oper. Res. 46 (1998) 161–175
Meisels, A., Lusternik, N.: Experiments on Networks of Employee Timetabling Problems. Practice And Theory of Automated Timetabling II: Selected papers. Lecture Notes in Computer Science, Vol. 408. Springer, Berlin Heidelberg New York (1997) 130–155
Tsang, E., Voudouris, C.: Fast Local Search and Guided Local Search and their Application to British Telecom’s Workforce Scheduling Problem. Oper. Res. Lett. 20 (1997) 119–127
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cowling, P., Kendall, G., Soubeiga, E. (2001). A Hyperheuristic Approach to Scheduling a Sales Summit. In: Burke, E., Erben, W. (eds) Practice and Theory of Automated Timetabling III. PATAT 2000. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44629-X_11
Download citation
DOI: https://doi.org/10.1007/3-540-44629-X_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42421-5
Online ISBN: 978-3-540-44629-3
eBook Packages: Springer Book Archive