Evolving hyper-heuristics for the uncapacitated examination timetabling problem / N. Pillay in Journal of the operational research society (JORS), Vol. 63 N° 1 (Janvier 2012)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 63 N° 1 (Janvier 2012) . - pp. 47–58 Titre : Evolving hyper-heuristics for the uncapacitated examination timetabling problem Type de document : texte imprimé Auteurs : N. Pillay, Auteur Année de publication : 2012 Article en page(s) : pp. 47–58 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Hyper-heuristics Uncapacitated examination timetabling problem Evolutionary algorithms Index. décimale : 001.424 Résumé : This paper reports on the use of an evolutionary algorithm (EA) to search a space of heuristic combinations for the uncapacitated examination timetabling problem. The representation used by an EA has an effect on the difficulty of the search and hence the overall success of the system. The paper examines three different representations of heuristic combinations for this problem and compares their performance on a set of benchmark problems for the uncapacitated examination timetabling problem. The study has revealed that certain representations do result in a better performance and generalization of the hyper-heuristic. An EA-based hyper-heuristic combining the use of all three representations (CEA) was implemented and found to generalize better than the EA using each of the representations separately. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n1/abs/jors201112a.html [article] Evolving hyper-heuristics for the uncapacitated examination timetabling problem [texte imprimé] / N. Pillay, Auteur . - 2012 . - pp. 47–58. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 1 (Janvier 2012) . - pp. 47–58 Mots-clés : Hyper-heuristics Uncapacitated examination timetabling problem Evolutionary algorithms Index. décimale : 001.424 Résumé : This paper reports on the use of an evolutionary algorithm (EA) to search a space of heuristic combinations for the uncapacitated examination timetabling problem. The representation used by an EA has an effect on the difficulty of the search and hence the overall success of the system. The paper examines three different representations of heuristic combinations for this problem and compares their performance on a set of benchmark problems for the uncapacitated examination timetabling problem. The study has revealed that certain representations do result in a better performance and generalization of the hyper-heuristic. An EA-based hyper-heuristic combining the use of all three representations (CEA) was implemented and found to generalize better than the EA using each of the representations separately. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n1/abs/jors201112a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire