Distributed choice function hyper-heuristics for timetabling and scheduling

Prapa Rattadilok, Andy Gaw, Raymond S.K. Kwan

Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

32 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages51-67
Number of pages17
DOIs
Publication statusPublished - 2005
Externally publishedYes
Event5th International Conference on Practice and Theory of Automated Timetabling, PATAT 2004 - Pittsburgh, PA, United States
Duration: 18 Aug 200420 Aug 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3616 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Practice and Theory of Automated Timetabling, PATAT 2004
Country/TerritoryUnited States
CityPittsburgh, PA
Period18/08/0420/08/04

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Distributed choice function hyper-heuristics for timetabling and scheduling'. Together they form a unique fingerprint.

Cite this