Stochastic Learning for SAT- Encoded Graph Coloring Problems


The graph coloring problem (GCP) is a widely studied combinatorial optimization problem due to its numerous applications in many areas, including time tabling, frequency assignment, and register allocation. The need for more efficient algorithms has led to the development of several GC solvers. In this paper, the authors introduce a team of Finite Learning Automata, combined with the random walk algorithm, using Boolean satisfiability encoding for the GCP. The authors present an experimental analysis of the new algorithm’s performance compared to the random walk technique, using a benchmark set containing SAT-encoding graph coloring test sets. DOI: 10.4018/978-1-4666-0270-0.ch017

DOI: 10.4018/jamc.2010070101

Extracted Key Phrases

Cite this paper

@article{Bouhmala2010StochasticLF, title={Stochastic Learning for SAT- Encoded Graph Coloring Problems}, author={Noureddine Bouhmala and Ole-Christoffer Granmo}, journal={Int. J. of Applied Metaheuristic Computing}, year={2010}, volume={1}, pages={1-19} }