Academic
Publications
Solving Constraint Satisfaction Problems Using Genetic Algorithms

Solving Constraint Satisfaction Problems Using Genetic Algorithms,10.1109/ICEC.1994.350002,A. E. Eiben,Paul-erik Raué,Zsófia Ruttkay

Solving Constraint Satisfaction Problems Using Genetic Algorithms   (Citations: 38)
BibTex | RIS | RefWorks Download
This article discusses the applicability of genetic algorithms (GAs) to solve constraint satisfaction problems (CSPs). We discuss the requirements and possibilities of defining so-called heuristic GAs (HGAs), which can be expected to be effective and efficient methods to solve CSPs since they adopt heuristics used in classical CSP solving search techniques. We present and analyse experimental results gained by testing different heuristic GAs on the N-queens problem and on the graph 3-colouring problem
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...For example, Tsang [5] and Eiben et al. [6] apply heuristics in the GA mutation and crossover operators (e.g., for selection of genes to be mutated and selection of new values for these genes)...

    Jelena Sankoet al. Differential evolutionary approach guided by the Functional Constraint...

    • ...In [6] and [7], Eiben et al. propose to incorporate existing CSP heuristics into genetic operators...

    Bahareh Jafari Jashmiet al. Solving Temporal Constraint Satisfaction Problems with Heuristic Based...

    • ...Among the available methods, some put the emphasis on the usage of heuristics, such as ARC-GA [15], [16], COE-H GA [17], [18], Glass-Box [19], H-GA [20], [21], whereas others handle the constraints by fitness function adaptation, such as CCS [22], [23], MID [24]–[26], SAW [27], [28]...
    • ...1) Comparison Between MAEA-CSPs and the Existing Algorithms: Reference [29] has made a comparison among 11 available algorithms, and the results show that the best four algorithms are H-GA.1 [20], [21], H-GA.3 [20], [21], SAW [27], [28], and Glass-Box [19]...
    • ...1) Comparison Between MAEA-CSPs and the Existing Algorithms: Reference [29] has made a comparison among 11 available algorithms, and the results show that the best four algorithms are H-GA.1 [20], [21], H-GA.3 [20], [21], SAW [27], [28], and Glass-Box [19]...
    • ...The -queen problems are typical problems of CSPs, and have been studied in depth [20], [33], [56]–[59]...
    • ...Reference [20] designed a GA that can solve -queen problems, but the result was reported in a figure, and cannot be compared with that of MAEA-CSPs directly...

    Jing Liuet al. A multiagent evolutionary algorithm for constraint satisfaction proble...

    • ...In other words, genetic operators must be designed in such a way that if a constraint is not violated by the parents, it will not be violated by the children resulting from the operations [4]...

    Lionel C. Briandet al. Using genetic algorithms for early schedulability analysis and stress ...

    • ...A comprehensive survey has been published pertaining to the constrained handling techniques and several approaches have been introduced in dealing with solutions that violate the constraints (Michalewicz and Attia 1994; Le 1996; Homaifar et al. 1994; Eiben et al. 1994; Michalewicz 1995a; b; Schoenauer and Xanthakis 1993; Hai-Lin and Yu-Ping 2003)...
    • ...The taxonomy of constraints can be considered as (Eiben et al. 1994):...

    Elmer P. Dadioset al. Genetic algorithm with adaptive and dynamic penalty functions for the ...

Sort by: