Improving the Asymptotic Convergence of Memetic Algorithms - The SAT Problem Case Study.
Noureddine BouhmalaPublished in: IJCCI (2012)
Keyphrases
- asymptotic convergence
- memetic algorithm
- sat problem
- tabu search
- satisfiability problem
- max sat
- job shop scheduling problem
- particle swarm algorithm
- sat solvers
- np complete
- phase transition
- constraint satisfaction problems
- combinatorial optimization
- randomly generated
- genetic algorithm
- vehicle routing problem
- evolutionary computation
- scheduling problem
- propositional satisfiability
- search algorithm
- random sat instances
- branch and bound
- constraint programming
- decision problems
- search space
- machine learning