Advertisement

Neural Computing and Applications

, Volume 19, Issue 8, pp 1133–1142 | Cite as

A graph-based immune-inspired constraint satisfaction search

  • María-Cristina Riff
  • Marcos Zúñiga
  • Elizabeth Montero
AIS

Abstract

We propose an artificial immune algorithm to solve constraint satisfaction problems (CSPs). Recently, bio-inspired algorithms have been proposed to solve CSPs. They have shown to be efficient in solving hard problem instances. Given that recent publications indicate that immune-inspired algorithms offer advantages to solve complex problems, our main goal is to propose an efficient immune algorithm which can solve CSPs. We have calibrated our algorithm using relevance estimation and value calibration (REVAC), which is a new technique recently introduced to find the parameter values for evolutionary algorithms. The tests were carried out using randomly generated binary constraint satisfaction problems and instances of the three-colouring problem with different constraint networks. The results suggest that the technique may be successfully applied to solve CSPs.

Keywords

Evolutionary Algorithm Constraint Satisfaction Problem Artificial Immune System Immune Network Immune Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Cheeseman P, Kanefsky B, Taylor W (1991) Where the really hard problems are. In: proceedings of the international joint conferences on artificial intelligence (IJCAI91), pp 163–169Google Scholar
  2. 2.
    Craenen BGW, Eiben AE, van Hemert JI (2003) Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Trans Evol Comput 7(5):424–444CrossRefGoogle Scholar
  3. 3.
    de Castro LN, Timmis J (eds) (2002) Artificial immune systems: a new computational intelligence approach. Springer, London, UKMATHGoogle Scholar
  4. 4.
    Brelaz D (1979) New methods to color the vertices of a graph. Commun ACM 22:251–256Google Scholar
  5. 5.
    Dasgupta D. (eds) (2000) Artificial immune systems and their applications. Springer, BerlinGoogle Scholar
  6. 6.
    Dozier G, Bowen J, Homaifar A (1998) Solving constraint satisfaction problems using hybrid evolutionary search. IEEE Trans Evol Comput 2(1):23–33CrossRefGoogle Scholar
  7. 7.
    Eiben AE, van Hemert JI, Marchiori E, Steenbeek AG (1998) Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function. In: Proceedings of the 5th international conference on parallel problem solving from nature (PPSN-V), LNCS 1498, pp 196–205Google Scholar
  8. 8.
    Garrett SM (2004) Parameter-free, adaptive clonal selection. In: Proceedings of the IEEE congress on evolutionary computation (CEC04), vol 1, pp 1052–1058Google Scholar
  9. 9.
    Mackworth AK (1977) Consistency in network of relations. Artificial Intelligence 8:99–118MATHCrossRefGoogle Scholar
  10. 10.
    Marchiori E (1977) Combining constraint processing and genetic algorithms for constraint satisfaction problems. In: Proceedings of the 7th international conference on genetic algorithms (ICGA97), pp 330–337Google Scholar
  11. 11.
    Nannen V, Eiben A (2007) Relevance estimation and value calibration of evolutionary algorithm parameters. Proceedings of the joint international conference for artificial intelligence (IJCAI), pp 975–980 (2007)Google Scholar
  12. 12.
    Riff MC (1998) A network-based adaptive evolutionary algorithm for csp. In: metaheuristics: advances and trends in local search paradigms for optimisation, chap 22. Kluwer Academic Publisher, Dordecht, pp 325–339Google Scholar
  13. 13.
    Riff MC, Zuniga M (2007) Towards an immune system to solve csp. Proceedings of the IEEE congress on evolutionary computation Singapur(In Press.)Google Scholar
  14. 14.
    Smith BM, Dyer ME (1996) Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence 81(1–2):155–181CrossRefMathSciNetGoogle Scholar
  15. 15.
    Solnon C (2002) Ants can solve constraint satisfaction problems. IEEE Trans Evol Comput 6(4):347–357CrossRefGoogle Scholar
  16. 16.
    Tsang EPK, Wang CJ, Davenport A, Voudouris C, Lau TL (1999) A family of stochastic methods for constraint satisfaction and optimization. In: Proceedings of the 1st international conference on the practical application of constraint technologies and logic programming (PACLP), London, pp 359–383Google Scholar

Copyright information

© Springer-Verlag London Limited 2010

Authors and Affiliations

  • María-Cristina Riff
    • 1
  • Marcos Zúñiga
    • 1
  • Elizabeth Montero
    • 1
  1. 1.Department of Computer ScienceTechnical University Federico Santa MaríaValparaísoChile

Personalised recommendations