N. Siyahia and M. Babes (Algeria)
CSP, genetic algorithm, Heuristic,graph colouring, Random CSP.
Within the framework of a CSP resolution, we propose a method based on the principle of the genetic algorithms. The resolution is done under two tests. Initially, we present a simple genetic algorithm, built around basic operators, and we propose, thereafter, an algorithm improved which uses original operators, based on personal heuristic. The obvious improvement noted as for the results obtained is very encouraging. Indeed, if the space of search is of significant size and if it is difficult to isolate an acceptable solution, which is the case of the CSP, the use of heuristic proposed is rather promising.
Important Links:
Go Back
