我要吃瓜

Citation

Bai R, Burke E, Gendreau M, Kendall G & McCollum B (2007) Memory length in hyper-heuristics: An empirical study. In: Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007. SCIS '07. IEEE Symposium on Computational Intelligence in Scheduling, 2007., Honolulu, HI, USA, 01.04.2007-05.04.2007. Piscataway, NJ, USA: IEEE, pp. 173-178. http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4218613; https://doi.org/10.1109/SCIS.2007.367686

Abstract
Hyper-heuristics are an emergent optimisation methodology which aims to give a higher level of flexibility and domain-independence than is currently possible. Hyper-heuristics are able to adapt to the different problems or problem instances by dynamically choosing between heuristics during the search. This paper is concerned with the issues of memory length on the performance of hyper-heuristics. We focus on a recently proposed simulated annealing hyper-heuristic and choose a set of hard university course timetabling problems as the test bed for this empirical study. The experimental results show that the memory length can affect the performance of hyper-heuristics and a good choice of memory length is able to improve solution quality. Finally, two dynamic approaches are investigated and one of the approaches is shown to be able to produce promising results without introducing extra sensitive algorithmic parameters.

Keywords
educational courses; educational institutions; simulated annealing