A new fitness function for discovering a lot of satisfiable solutions in constraint satisfaction problems.
H. HandaO. KataiT. KonishiM. BabaPublished in: CEC (2000)
Keyphrases
- fitness function
- constraint satisfaction problems
- search space
- genetic operators
- sat problem
- genetic programming
- random instances
- combinatorial problems
- genetic algorithm
- constraint satisfaction
- evolutionary algorithm
- genetic algorithm ga
- np complete
- evolutionary search
- solving constraint satisfaction problems
- dynamic constraint satisfaction problems
- finding optimal solutions
- constraint propagation
- evolutionary computation
- multi objective evolutionary algorithms
- constraint programming
- optimal solution
- phase transition
- multiple objectives
- satisfiability problem
- crossover operator
- non binary
- heuristic search
- arc consistency
- constraint networks
- search algorithm
- backtracking search
- graph coloring problems
- multi objective
- configuration problems
- partial constraint satisfaction
- nsga ii
- particle swarm
- branch and bound
- metaheuristic
- simulated annealing
- np hard
- partial solutions
- max sat
- soft constraints
- constraint problems
- pseudo boolean optimization
- sat instances
- neural network
- randomly generated
- search tree
- differential evolution
- maintaining arc consistency