USP Electronic Research Repository

Constraint Optimization for Timetabling Problems using a Constraint Driven Solution Model

Sharma, Anuraganand and Sharma, Dharmendra (2013) Constraint Optimization for Timetabling Problems using a Constraint Driven Solution Model. In: Advances in Artificial Intelligence. Springer International Publishing, Dunedin, New Zealand, pp. 196-201. ISBN 978-3-319-03679-3

[img] PDF - Published Version
Restricted to Registered users only

Download (176Kb)

    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.

    Item Type: Book Chapter
    Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
    Q Science > QA Mathematics > QA76 Computer software
    Divisions: Faculty of Science, Technology and Environment (FSTE) > School of Computing, Information and Mathematical Sciences
    Depositing User: Anuraganand Sharma
    Date Deposited: 02 Dec 2015 15:04
    Last Modified: 20 Oct 2016 17:03
    URI: http://repository.usp.ac.fj/id/eprint/8615
    UNSPECIFIED

    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...