TY - GEN
T1 - A Conflict based SAW method for constraint satisfaction problems
AU - Shalom, Rafi
AU - Avigal, Mireille
AU - Unger, Ron
PY - 2009
Y1 - 2009
N2 - Evolutionary algorithms have employed the SAW (Stepwise Adaptation ofWeights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-climbing algorithms used to solve instances of 3-SAT by adapting a weight for each clause. Originally, adaptation of weights for solving CSPs was done by assigning a weight for each variable or each constraint. Here we investigate a SAW method which assigns a weight for each conflict. Two simple stochastic CSP solvers are presented. For both we show that constraint based SAW and conflict based SAW perform equally on easy CSP samples, but the conflict based SAW outperforms the constraint based SAW when applied to hard CSPs. Moreover, the best of the two suggested algorithms in its conflict based SAWversion performs better than the best known evolutionary algorithm for CSPs that uses weight adaptation, and even better than the best known evolutionary algorithmfor CSPs in general.
AB - Evolutionary algorithms have employed the SAW (Stepwise Adaptation ofWeights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-climbing algorithms used to solve instances of 3-SAT by adapting a weight for each clause. Originally, adaptation of weights for solving CSPs was done by assigning a weight for each variable or each constraint. Here we investigate a SAW method which assigns a weight for each conflict. Two simple stochastic CSP solvers are presented. For both we show that constraint based SAW and conflict based SAW perform equally on easy CSP samples, but the conflict based SAW outperforms the constraint based SAW when applied to hard CSPs. Moreover, the best of the two suggested algorithms in its conflict based SAWversion performs better than the best known evolutionary algorithm for CSPs that uses weight adaptation, and even better than the best known evolutionary algorithmfor CSPs in general.
UR - http://www.scopus.com/inward/record.url?scp=70449920960&partnerID=8YFLogxK
U2 - 10.1109/cec.2009.4982971
DO - 10.1109/cec.2009.4982971
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:70449920960
SN - 9781424429592
T3 - 2009 IEEE Congress on Evolutionary Computation, CEC 2009
SP - 373
EP - 380
BT - 2009 IEEE Congress on Evolutionary Computation, CEC 2009
T2 - 2009 IEEE Congress on Evolutionary Computation, CEC 2009
Y2 - 18 May 2009 through 21 May 2009
ER -