Abstract
The target of solving constraint satisfaction problems(CSP) is to satisfy all constraints simultaneously. The CSP model is transformed into a discrete optimization problem with boundary constraints and is solved by particle swarm optimization(PSO) in this paper. To improve the performance of the proposed PSO algorithm, ERA(Environment, Reactive rules, Agent) model is used to proceed with local search after the process of boundary constraints. Further improvement including nohope and tabu list are also combined with PSO. When particles can not explore more search space, nohope is introduced to improve the activities of particles. Tabu list is used to avoid cycling in the global best particle. We experiment with random constraint satisfaction problem instances based on phase transition theory. Experimental results indicate that the hybrid algorithm has advantages on the search capability and the iterative number.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: IEEE Int. Conf. on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)
Zhang, W.–J., Xie, X.–F., Bi, D.–C.: Handling Boundary Constraints for Numerical Optimization by Particle Swarm Flying in Periodic Search Space. In: IEEE CEC, Oregon, USA, pp. 2307–2311 (2004)
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)
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)
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)
Solnon, C.: Ants Can Solve Constraint Satisfaction Problems. In: Proc. of the IEEE Transactions on Evolutionary Computation (TEC 2002), vol. 6, pp. 347–357 (2002)
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)
Barnier, N., Brisset, P.: Optimization by Hybridization of a Genetic Algorithm with Constraint Satisfaction Techniques. In: Proc. of the IEEE Congress on Evolutionary Computation (CEC 1998) (1998)
Freuder, E.C.: A Sufficient Condition for Backtrack-free Search. J. ACM 29(1), 24–32 (1982)
Mackworth, A.K., Freuder, E.C.: The Complexity of Some Polynomial Consistency Algorithms for Constraint Satisfaction Problems. Artificial Intelligence 25, 65–74 (1985)
Pang, W., Goodwin, S.D.: A Graph Based Synthesis Algorithm for Solving CSPs. In: Proc. of the 16th International Florida Artificial Intelligence Research Society Conference, Florida, USA, pp. 197–201 (2003)
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)
Liu, J., Jing, H., Tang, Y.Y.: Multi-agent Oriented Constraint Satisfaction. Artificial Intelligence 136, 101–104 (2002)
Koziel, S., Michalewicz, Z.: Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization. Evolutionary Computation 7, 1944–(1999)
Xu, K., Li, W.: Exact Phase Transitions in Random Constraint Satisfaction Problems. Journal of Artificial Intelligence Research 12, 93–103 (2000)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, Q., Sun, J., Zhang, J., Wang, C. (2006). A Hybrid Particle Swarm Optimization for Binary CSPs. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence and Bioinformatics. ICIC 2006. Lecture Notes in Computer Science(), vol 4115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816102_5
Download citation
DOI: https://doi.org/10.1007/11816102_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37277-6
Online ISBN: 978-3-540-37282-0
eBook Packages: Computer ScienceComputer Science (R0)