Journal
APPLIED SOFT COMPUTING
Volume 40, Issue -, Pages 581-593Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.asoc.2015.11.043
Keywords
Hyper-heuristic; Iterated local search; Add delete list; Methodology of design; Educational timetabling
Categories
Funding
- Consejo Nacional de Ciencia y Tecnologia (CONACYT) Mexico
- Engineering and Physical Sciences Research Council (EPSRC) [GR/S70197/01]
- University of Stirling UK
- Engineering and Physical Sciences Research Council [GR/S70197/01, EP/J017515/1] Funding Source: researchfish
- EPSRC [EP/J017515/1] Funding Source: UKRI
Ask authors/readers for more resources
Hyper-heuristics are (meta-)heuristics that operate at a higher level to choose or generate a set of low-level (meta-)heuristics in an attempt of solve difficult optimization problems. Iterated local search (ILS) is a well-known approach for discrete optimization, combining perturbation and hill-climbing within an iterative framework. In this study, we introduce an ILS approach, strengthened by a hyper-heuristic which generates heuristics based on a fixed number of add and delete operations. The performance of the proposed hyper-heuristic is tested across two different problem domains using real world benchmark of course timetabling instances from the second International Timetabling Competition Tracks 2 and 3. The results show that mixing add and delete operations within an ILS framework yields an effective hyper-heuristic approach. (C) 2015 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available