The Ability of Learning Automata in Solving Constraint Satisfaction Problems

In this paper we have investigated the performance of some stochastic methods for solving constraint satisfaction (CSP) and fuzzy constraint satisfaction problems (FCSP). The purpose of this paper is to study the abilities of learning automaton in solving these problems and comparing it with other stochastic methods. The results confirm those of [2] and show its superiority to other methods.

کلیدواژه ها:

CSP ، FCSP ، Learning Automaton ، Stochastic Algorithms ، Genetic Algorithms