Stochastic Learning for SAT-Encoded Graph Coloring Problems

Authors:
Noureddine Bouhmala;Ole-Christoffer Granmo
Affiliations:
Vestfold University College, Norway;University of Agder, Norway
Venue:
International Journal of Applied Metaheuristic Computing
Year:
2010

Citing 35
Cited 0

List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations

SIAM Journal on Computing
Using tabu search techniques for graph coloring

Computing
Deterministic Learning Automata Solutions to the Equipartitioning Problem

IEEE Transactions on Computers
Learning automata: an introduction

Learning automata: an introduction
Improvements to an Algorithm for Equipartitioning

IEEE Transactions on Computers
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
New methods to color the vertices of a graph

Communications of the ACM
Graph Partitioning Using Learning Automata

IEEE Transactions on Computers
An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Local Search Characteristics of Incomplete SAT Procedures

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
An adaptive noise mechanism for walkSAT

Eighteenth national conference on Artificial intelligence
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
A survey of local search methods for graph coloring

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Networks of Learning Automata: Techniques for Online Stochastic Optimization

Networks of Learning Automata: Techniques for Online Stochastic Optimization
Routing Bandwidth-Guaranteed Paths in MPLS Traffic Engineering: A Multiple Race Track Learning Approach

IEEE Transactions on Computers
An adaptive memory algorithm for the k-coloring problem

Discrete Applied Mathematics
Preface: Special issue on computational methods for graph coloring and its generalizations

Discrete Applied Mathematics
A cutting plane algorithm for graph coloring

Discrete Applied Mathematics
Variable space search for graph coloring

Discrete Applied Mathematics
Additive versus multiplicative clause weighting for SAT

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
SATzilla: portfolio-based algorithm selection for SAT

Journal of Artificial Intelligence Research
Domain-independent extensions to GSAT: solving large structured satisfiability problems

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
The exponentiated subgradient algorithm for heuristic Boolean programming

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
SATenstein: automatically building local search SAT solvers from components

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Solving Stochastic Nonlinear Resource Allocation Problems Using a Hierarchy of Twofold Resource Allocation Automata

IEEE Transactions on Computers
Combining adaptive noise and look-ahead in local search for SAT

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A new method for solving hard satisfiability problems

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Towards an understanding of hill-climbing procedures for SAT

AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Evidence for invariants in local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Diversification and determinism in local search for satisfiability

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Random walk with continuously smoothed variable weights

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Learning Automata-Based Solutions to the Nonlinear Fractional Knapsack Problem With Applications to Optimal Resource Allocation

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.