A hybrid discrete particle swarm algorithm for hard binary CSPs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4222 LNCS - II, Issue , 2006, Pages 184-193

  Yang, Qingyun ^a   Sun, Jigui ^a,b   Zhang, Juyang ^a   Wang, Chunjie ^c  

^a JILIN UNIVERSITY   (China)

^b FUDAN UNIVERSITY   (China)

^c CHANGCHUN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; SIMULATED ANNEALING;

CONTROL PARAMETERS; ERA MODEL; SWARM ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 33750352065     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11881223_24     Document Type: Conference Paper

References (14)

1. Kennedy, J, Eberhart, R. C: Particle swarm optimization. In: IEEE Int. Conf. on Neural Networks, Perth, Australia. (1995) 1942-1948
2. K.E. Parsopoulos and M.N. Vrahatis: Particle swarm optimization method for constrained optimization problems. In P. Sincak, J. Vascak, V. Kvasnicka, and J. Pospichal, editors, Intelligent Technologies - Theory and Application: New Trends in Intelligent Technologies, volume 76 of Frontiers in Artificial Intelligence and Applications, IOS Press. (2002) 214-220
3. Hu, X. and 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. (2002) 203-206
4. Laskari, E. C., Parsopoulos, K. E., and Vrahatis, M. N: Particle swarm optimization for integer programming. In: Proc. of the IEEE Congress on Evolutionary Computation (CEC 2002), Honolulu, Hawaii, USA. (2002) 1582-1587
5. L. Schoofs, B. Naudts: Swarm intelligence on the binary constraint satisfaction problem. In: Proc. of the IEEE Congress on Evolutionary Computation (CEC 2002), Honolulu, Hawaii, USA. (2002) 1444-1449
6. M.Clerc: Discrete Particle Swarm Optimization: A Fuzzy Combinatorial Black Box. In. http://clerc.maurice.free.fr/pso/Fuzzy_Discrete_PSO/Fuzzy_DPSO. htm
7. C. Solon: Ants Can Solve Constraint Satisfaction Problems. In: IEEE Trans. Evolutionary Computation 2002, VOL. 6(4), (2002) 347-357
8. J. Kennedy and R. C. Eberhart: A discrete binary version of the particle swarm algorithm. In: Proc. of International Conference on Systems. Man, and Cybernetics, Piscataway, NJ, USA, (1997) 4104-4109
9. S.Kirkpatrick, C.D.Gelatt and M.P.Vecchi: Optimization by simulated annealing. Science, Vol. 220(13), (1983) 671-680
10. Jiming Liu, Han Jing, Y.Y.Tang: Multi-agent oriented constraint satisfaction. Artificial Intelligence, Vol. 136, (2002) 101-104
11. S.Minton, M.D.Johnston, A.B.Philips,P.Laird: Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems. Artificial Intelligence, Vol. 58, (1992) 161-205
12. D.Achlioptas, L.M.Kirousis, E.Kranakis, D.Krizanc, M.S.O.Molloy and Y.C.Stamaiou: Random constraint satisfaction: a more accurate picture. In: Proc. of CP'97, Schloss Hagenberg, Austria, (1997) 107-120
13. K. Xu and W. Li: Exact Phase Transitions in Random Constraint Satisfaction Problems. Journal of Artificial Intelligence Research, Vol. 12, (2000) 93-103
14. K. Xu, F. Boussemart, F. Hemery and C. Lecoutre: A Simple Model to Generate Hard Satisfiable Instances. In: Proc. of 19th International Joint Conference on Artificial Intelligence (IJCAI), Edinburgh, Scotland, (2005) 337-342