File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Applying an improved heuristic based optimiser to solve a set of challenging University timetabling problems: An experience report

TitleApplying an improved heuristic based optimiser to solve a set of challenging University timetabling problems: An experience report
Authors
Issue Date2004
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
Lecture Notes In Artificial Intelligence (Subseries Of Lecture Notes In Computer Science), 2004, v. 3157, p. 164-172 How to Cite?
AbstractUniversity timetabling problems (UTPs) represent a class of challenging and practical constrained optimization problems with its unique requirements when compared to school timetabling. In the past, researchers had proposed different intelligent search methods, that can be generally classified as the constructive or local search methods, to automate school and/or university timetabling. In this paper, we considered a flexible local search scheme combining both min-conflicts and look-forward heuristics to effectively solve general university timetabling problems. Our search proposal augmented with a k-reset repair operator achieved impressive results when compared to that of a general finite-domain constraint solving system, namely the ZDC, on a set of challenging UTPs obtained from an international timetabling competition. A preliminary analysis of their search results was conducted.More importantly, our search proposal of combined heuristics sheds light on various directions to effectively handle other complex or large-scale scheduling problems. © Springer-Verlag Berlin Heidelberg 2004.
Persistent Identifierhttp://hdl.handle.net/10722/99192
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorTam, Ven_HK
dc.contributor.authorHo, Jen_HK
dc.contributor.authorKwan, Aen_HK
dc.date.accessioned2010-09-25T18:19:35Z-
dc.date.available2010-09-25T18:19:35Z-
dc.date.issued2004en_HK
dc.identifier.citationLecture Notes In Artificial Intelligence (Subseries Of Lecture Notes In Computer Science), 2004, v. 3157, p. 164-172en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/99192-
dc.description.abstractUniversity timetabling problems (UTPs) represent a class of challenging and practical constrained optimization problems with its unique requirements when compared to school timetabling. In the past, researchers had proposed different intelligent search methods, that can be generally classified as the constructive or local search methods, to automate school and/or university timetabling. In this paper, we considered a flexible local search scheme combining both min-conflicts and look-forward heuristics to effectively solve general university timetabling problems. Our search proposal augmented with a k-reset repair operator achieved impressive results when compared to that of a general finite-domain constraint solving system, namely the ZDC, on a set of challenging UTPs obtained from an international timetabling competition. A preliminary analysis of their search results was conducted.More importantly, our search proposal of combined heuristics sheds light on various directions to effectively handle other complex or large-scale scheduling problems. © Springer-Verlag Berlin Heidelberg 2004.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)en_HK
dc.titleApplying an improved heuristic based optimiser to solve a set of challenging University timetabling problems: An experience reporten_HK
dc.typeConference_Paperen_HK
dc.identifier.emailTam, V:vtam@eee.hku.hken_HK
dc.identifier.authorityTam, V=rp00173en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-22944464722en_HK
dc.identifier.hkuros103178en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-22944464722&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume3157en_HK
dc.identifier.spage164en_HK
dc.identifier.epage172en_HK
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridTam, V=7005091988en_HK
dc.identifier.scopusauthoridHo, J=7402649875en_HK
dc.identifier.scopusauthoridKwan, A=7101738201en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats