Iterated local search using an add and delete hyper-heuristic for university course timetabling

[Display omitted] •Add and delete operations are encoded as a list/string of integers (ADL).•An effective hyper-heuristic approach operating with ADLs is proposed.•Low level heuristics perform search over the space of feasible solutions.•Proposed approach produces new best solutions to some instance...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied soft computing Jg. 40; S. 581 - 593
Hauptverfasser:	Soria-Alcaraz, Jorge A., Özcan, Ender, Swan, Jerry, Kendall, Graham, Carpio, Martin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.03.2016
Schlagworte:	Add–delete list Educational timetabling Hyper-heuristic Iterated local search Methodology of design Add–delete list Methodology of design Educational timetabling Iterated local search Hyper-heuristic
ISSN:	1568-4946, 1872-9681
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!