A Hybrid Discrete Particle Swarm Algorithm for Hard Binary CSPs

  • Qingyun Yang
  • Jigui Sun
  • Juyang Zhang
  • Chunjie Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4222)


The discrete particle swarm algorithm for binary constraint satisfaction problems (CSPs) is analyzed in this paper. The analysis denotes that ϕ 1 and ϕ 2 are set to 0 may be a heuristic similar to min-conflict heuristic. The further observation is the impact of local best positions. A control parameter p b is introduced to reduce the effect of the local best positions. To improve the performance, simulated annealing algorithm is combined with the discrete particle swarm algorithm, and the neighborhood exploring in simulated annealing is carried out by ERA model. Eliminating repeated particles and Tabu list avoiding cycling are also introduced in this paper. Our hybrid algorithm is tested with random constraint satisfaction problem instances based on phase transition theory. The experimental results indicate that our hybrid discrete particle swarm algorithm is able to solve hard binary CSPs.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: IEEE Int. Conf. on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)Google Scholar
  2. 2.
    Parsopoulos, K.E., Vrahatis, M.N.: Particle swarm optimization method for constrained optimization problems. In: Sincak, P., Vascak, J., Kvasnicka, V., Pospichal, J. (eds.) Intelligent Technologies-—Theory and Application: New Trends in Intelligent Technologies, Frontiers in Artificial Intelligence and Applications, vol. 76, pp. 214–220. IOS Press, Amsterdam (2002)Google Scholar
  3. 3.
    Hu, X., Eberhart, R.C.: Solving constrained nonlinear optimization problems with particle swarm optimization. In: Proc. of the Sixth World Multiconference on Systemics, Cybernetics and Informatics 2002 (SCI 2002), Orlando, USA, pp. 203–206 (2002)Google Scholar
  4. 4.
    Laskari, E.C., Parsopoulos, K.E., Vrahatis, M.N.: Particle swarm optimization for integer programming. In: Proc. of the IEEE Congress on Evolutionary Computation (CEC 2002), Honolulu, Hawaii, USA, pp. 1582–1587 (2002)Google Scholar
  5. 5.
    Schoofs, L., Naudts, B.: Swarm intelligence on the binary constraint satisfaction problem. In: Proc. of the IEEE Congress on Evolutionary Computation (CEC 2002), Honolulu, Hawaii, USA, pp. 1444–1449 (2002)Google Scholar
  6. 6.
    Clerc, M.: Discrete Particle Swarm Optimization: A Fuzzy Combinatorial Black Box,
  7. 7.
    Solon, C.: Ants Can Solve Constraint Satisfaction Problems. IEEE Trans. Evolutionary Computation 2002 6(4), 347–357 (2002)CrossRefGoogle Scholar
  8. 8.
    Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proc. of International Conference on Systems. Man, and Cybernetics, Piscataway, NJ, USA, pp. 4104–4109 (1997)Google Scholar
  9. 9.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(13), 671–680 (1983)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Liu, J., Jing, H., Tang, Y.Y.: Multi-agent oriented constraint satisfaction. Artificial Intelligence 136, 101–104 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: A heuristic repair method for constraint–satisfaction and scheduling problems. Artificial Intelligence 58, 161–205 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Achlioptas, D., Kirousis, L.M., Kranakis, E., Krizanc, D., Molloy, M.S.O., Stamaiou, Y.C.: Random constraint satisfaction: a more accurate picture. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 107–120. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  13. 13.
    Xu, K., Li, W.: Exact Phase Transitions in Random Constraint Satisfaction Problems. Journal of Artificial Intelligence Research 12, 93–103 (2000)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: A Simple Model to Generate Hard Satisfiable Instances. In: Proc. of 19th International Joint Conference on Artificial Intelligence (IJCAI), Edinburgh, Scotland, pp. 337–342 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Qingyun Yang
    • 1
    • 2
  • Jigui Sun
    • 1
    • 2
    • 3
  • Juyang Zhang
    • 1
    • 2
  • Chunjie Wang
    • 4
  1. 1.College of Computer Science and TechnologyJilin UniversityChangchunChina
  2. 2.Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of EducationJilin UniversityChangchunChina
  3. 3.Open Laboratory for Intelligence Information ProcessingFudan UniversityShanghaiChina
  4. 4.Basic Sciences of ChangChun University of TechnologyChangChun University of TechnologyChangchunChina

Personalised recommendations