Constraint Optimization for Timetabling Problems using a Contraint Driven Solution Model

Anurag Sharma, Dharmendra SHARMA

Research output: A Conference proceeding or a Chapter in BookConference contribution

3 Downloads (Pure)

Abstract

Many science and engineering applications require finding solutions to planning and optimization problems by satisfying a set of constraints. These constraint problems (CPs) are typically NP-complete and can be formalized as constraint satisfaction problems (CSPs) or constraint optimization problems (COPs). Evolutionary algorithms (EAs) are good solvers for optimization problems ubiquitous in various problem domains. A variation of EA - Intelligent constraint handling evolutionary algorithm (ICHEA) has been demonstrated to be a versatile constraints-guided EA for all forms of continuous constrained problems in our earlier works. In this paper we investigate an incremental approach through ICHEA in solving benchmark exam timetabling problems which is a classic discrete COP and compare its performance with other well-known EAs. Incremental and exploratory search in constraint solving has shown improvement in the quality of solutions.
Original languageEnglish
Title of host publication26th Australasian Joint Conference on Artificial Intelligence (AI 2013)
EditorsStephen Cranefield, Abhaya Nayak
Place of PublicationBerlin/Heidelberg
PublisherSpringer
Pages196-201
Number of pages6
Volume8272
ISBN (Print)9783319036793
DOIs
Publication statusPublished - 2013
Event26th Australasian Joint Conference on Artificial Intelligence (AI 2013) - Dunedin, Dunedin, New Zealand
Duration: 6 Dec 2013 → …

Conference

Conference26th Australasian Joint Conference on Artificial Intelligence (AI 2013)
CountryNew Zealand
CityDunedin
Period6/12/13 → …

Fingerprint Dive into the research topics of 'Constraint Optimization for Timetabling Problems using a Contraint Driven Solution Model'. Together they form a unique fingerprint.

  • Cite this

    Sharma, A., & SHARMA, D. (2013). Constraint Optimization for Timetabling Problems using a Contraint Driven Solution Model. In S. Cranefield, & A. Nayak (Eds.), 26th Australasian Joint Conference on Artificial Intelligence (AI 2013) (Vol. 8272, pp. 196-201). Springer. https://doi.org/10.1007/978-3-319-03680-9_21