Stochastic Learning for SAT- Encoded Graph Coloring Problems
2010 ◽
Vol 1
(3)
◽
pp. 1-19
◽
Keyword(s):
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.
2012 ◽
pp. 306-325
Keyword(s):
2010 ◽
Vol 34
(4)
◽
pp. 289-297
2003 ◽
Vol 186
(2)
◽
pp. 527-544
◽
2014 ◽
Vol 38
(8)
◽
pp. 753-763
◽
2013 ◽
Vol 06
(06)
◽
pp. 1350043
◽
2006 ◽
Vol 57
◽
pp. 237-252
◽
Keyword(s):