USP Electronic Research Repository

An incremental approach to solving dynamic constraint satisfaction problems

Sharma, Anuraganand and Sharma, D.P. (2012) An incremental approach to solving dynamic constraint satisfaction problems. In: Neural Information Processing. Lecture Notes in Computer Science, 7665 . Springer International Publishing, Berlin, Heidelberg, pp. 445-455. ISBN 978-3-642-34486-2

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

Download (255Kb)

    Abstract

    Constraint satisfaction problems (CSPs) underpin many science and engineering applications. Recently introduced intelligent constraint handling evolutionary algorithm (ICHEA) in [14] has demonstrated strong potential in solving them through evolutionary algorithms (EAs). ICHEA outperforms many other evolutionary algorithms to solve CSPs with respect to success rate (SR) and efficiency. This paper is an enhancement of ICHEA to improve its efficiency and SR further by an enhancement of the algorithm to deal with local optima obstacles. The enhancement also includes a capability to handle dynamically introduced constraints without restarting the whole algorithm that uses the knowledge from already solved constraints using an incremental approach. Experiments on benchmark CSPs adapted as dynamic CSPs has shown very promising results.

    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: 04 Oct 2013 13:34
    Last Modified: 08 Oct 2018 10:54
    URI: http://repository.usp.ac.fj/id/eprint/6851
    UNSPECIFIED

    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...