A Hyperheuristic Approach to Scheduling a Sales Summit
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.
keywordshyperheuristics metaheuristics heuristics personnel scheduling local search choice function
Unable to display preview. Download preview PDF.
- 2.Burke, E.K.: Cowling, P., De Causmaecker, P., Vanden Berghe, G.A.: Memetic Approach to the Nurse Rostering Problem. Int. J. Appl. Intell. to appearGoogle Scholar
- 3.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–194Google Scholar
- 4.Back, T., Fogel, D.B., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. IOP Publishing and Oxford University Press (1997)Google Scholar
- 11.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–155Google Scholar