File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Combining the Min-Conflicts and Look-Forward Heuristics to Effectively Solve A Set of Hard University Timetabling Problems

TitleCombining the Min-Conflicts and Look-Forward Heuristics to Effectively Solve A Set of Hard University Timetabling Problems
Authors
KeywordsLocal Search Methods
Scheduling
University Timetabling
Issue Date2003
PublisherIEEE.
Citation
Proceedings Of The International Conference On Tools With Artificial Intelligence, 2003, p. 492-496 How to Cite?
AbstractUniversity timetabling problems (UTPs) represent a class of challenging, high-dimensional and multi-objectives combinatorial optimization problems that are commonly solved by constructive search, local search methods or their hybrids. In this paper, we proposed to combine the min-conflicts and look-forward heuristics used in local search methods to effectively solve general university timetabling problems. Our combined heuristics when augmented with the k-reset operator, and appropriate heuristic variable ordering strategy achieved impressive results on a set of challenging UTPs obtained from an international timetabling competition. A preliminary analysis of the results was given. More importantly, our search proposal shed light on effectively solving other complex or large-scale scheduling problems.
Persistent Identifierhttp://hdl.handle.net/10722/46409
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorTam, Ven_HK
dc.contributor.authorTing, Den_HK
dc.date.accessioned2007-10-30T06:49:15Z-
dc.date.available2007-10-30T06:49:15Z-
dc.date.issued2003en_HK
dc.identifier.citationProceedings Of The International Conference On Tools With Artificial Intelligence, 2003, p. 492-496en_HK
dc.identifier.issn1063-6730en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46409-
dc.description.abstractUniversity timetabling problems (UTPs) represent a class of challenging, high-dimensional and multi-objectives combinatorial optimization problems that are commonly solved by constructive search, local search methods or their hybrids. In this paper, we proposed to combine the min-conflicts and look-forward heuristics used in local search methods to effectively solve general university timetabling problems. Our combined heuristics when augmented with the k-reset operator, and appropriate heuristic variable ordering strategy achieved impressive results on a set of challenging UTPs obtained from an international timetabling competition. A preliminary analysis of the results was given. More importantly, our search proposal shed light on effectively solving other complex or large-scale scheduling problems.en_HK
dc.format.extent239343 bytes-
dc.format.extent883769 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofProceedings of the International Conference on Tools with Artificial Intelligenceen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectLocal Search Methodsen_HK
dc.subjectSchedulingen_HK
dc.subjectUniversity Timetablingen_HK
dc.titleCombining the Min-Conflicts and Look-Forward Heuristics to Effectively Solve A Set of Hard University Timetabling Problemsen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1082-3409&volume=&spage=492&epage=496&date=2003&atitle=Combining+the+min-conflicts+and+look-forward+heuristics+to+effectively+solve+a+set+of+hard+university+timetabling+problemsen_HK
dc.identifier.emailTam, V:vtam@eee.hku.hken_HK
dc.identifier.authorityTam, V=rp00173en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.scopuseid_2-s2.0-0345529094en_HK
dc.identifier.hkuros89786-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0345529094&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage492en_HK
dc.identifier.epage496en_HK
dc.identifier.scopusauthoridTam, V=7005091988en_HK
dc.identifier.scopusauthoridTing, D=7006986145en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats