Particle Swarm Algorithm with Cycle-Cutset for Sparse Binary CSPs
Yang Qingyun · Journal of Guangxi Normal University · 2006
Discrete particle swarm algorithm combining the cycle-cutset is proposed to solve the binary constraint satisfaction problems.Coupling the cycle-cutset with the particle swarm,the cycle-cutset is set to decrease the particles' dimension in the particle swarm,and particle swarm algorithm is only used to solve the cycle-cutset and the rest variables are solved by arc consistency algorithm with polynomial time complexity.The experimental results indicate that the hybrid algorithm is effective,which can reduce the iterations and searching times dramatically.