Towards an immune system that solves CSP

Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently, bio-inspired algorithms have been proposed to solve CSP. They have shown to be more efficient than systematic approaches in solving hard instances. Given that recent publications indicate that Immune systems offer advantages to solve complex problems, our aim here is to propose an efficient immune system which can solve CSPs. We propose an immune system which is able to solve hard constraint satisfaction problems. The tests were carried out using random generated binary constraint satisfaction problems on the transition phase.

[1]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[2]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[3]  Simon M. Garrett.  Parameter-free, adaptive clonal selection , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[4]  Mark Neal,et al.  Investigating the evolution and stability of a resource limited artificial immune system. , 2000 .

[5]  Jonathan Timmis,et al.  Artificial Immune Systems: A New Computational Intelligence Approach , 2003 .

[6]  Jano I. van Hemert,et al.  Comparing evolutionary algorithms on binary constraint satisfaction problems , 2003, IEEE Trans. Evol. Comput..

[7]  D. Dasgupta.  Artificial Immune Systems and Their Applications , 1998, Springer Berlin Heidelberg.

[8]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[9]  E. Tsang.  A Family of Stochastic Methods For Constraint Satisfaction and Optimisation , 2001 .

[10]  James Bowen,et al.  Solving constraint satisfaction problems using hybrid evolutionary search , 1998, IEEE Trans. Evol. Comput..

[11]  Elena Marchiori,et al.  Combining Constraint Processing and Genetic Algorithms for Constraint Satisfaction Problems , 1997, ICGA.

[12]  Elena Marchiori,et al.  Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function , 1998, PPSN.

[13]  Christine Solnon,et al.  Ants can solve constraint satisfaction problems , 2002, IEEE Trans. Evol. Comput..

[14]  Fernando José Von Zuben,et al.  Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..

[15]  A. E. Eiben,et al.  Efficient relevance estimation and value calibration of evolutionary algorithm parameters , 2007, 2007 IEEE Congress on Evolutionary Computation.

[16]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[17]  Vincenzo Cutello,et al.  A Clonal Selection Algorithm for Coloring, Hitting Set and Satisfiability Problems , 2005, WIRN/NAIS.