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.

• Type: Conference
• Year: 2007
• Where: CEC
• Authors: María-Cristina Riff, Marcos Zúñiga
• Keywords: Artificial Intelligence, CEC 2007, Constraint Satisfaction Problems, Immune System, Satisfaction Problems