TY - GEN
T1 - Distributed choice function hyper-heuristics for timetabling and scheduling
AU - Rattadilok, Prapa
AU - Gaw, Andy
AU - Kwan, Raymond S.K.
PY - 2005
Y1 - 2005
N2 - This paper investigates an emerging class of search algorithms, in which high-level domain independent heuristics, called hyper-heuristics, iteratively select and execute a set of application specific but simple search moves, called low-level heuristics, working toward achieving improved or even optimal solutions. Parallel architectures have been designed and evaluated. Results based on a university timetabling problem show an important relationship between performance, algorithm software and hardware implementation.
AB - This paper investigates an emerging class of search algorithms, in which high-level domain independent heuristics, called hyper-heuristics, iteratively select and execute a set of application specific but simple search moves, called low-level heuristics, working toward achieving improved or even optimal solutions. Parallel architectures have been designed and evaluated. Results based on a university timetabling problem show an important relationship between performance, algorithm software and hardware implementation.
UR - http://www.scopus.com/inward/record.url?scp=33645995704&partnerID=8YFLogxK
U2 - 10.1007/11593577_4
DO - 10.1007/11593577_4
M3 - Conference contribution
AN - SCOPUS:33645995704
SN - 3540307052
SN - 9783540307051
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 51
EP - 67
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
T2 - 5th International Conference on Practice and Theory of Automated Timetabling, PATAT 2004
Y2 - 18 August 2004 through 20 August 2004
ER -