Skip to main content
Erschienen in: Neural Computing and Applications 8/2010

01.11.2010 | AIS

A graph-based immune-inspired constraint satisfaction search

verfasst von: María-Cristina Riff, Marcos Zúñiga, Elizabeth Montero

Erschienen in: Neural Computing and Applications | Ausgabe 8/2010

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat 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–169 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–169
2.
Zurück zum Zitat Craenen BGW, Eiben AE, van Hemert JI (2003) Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Trans Evol Comput 7(5):424–444CrossRef Craenen BGW, Eiben AE, van Hemert JI (2003) Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Trans Evol Comput 7(5):424–444CrossRef
3.
Zurück zum Zitat de Castro LN, Timmis J (eds) (2002) Artificial immune systems: a new computational intelligence approach. Springer, London, UKMATH de Castro LN, Timmis J (eds) (2002) Artificial immune systems: a new computational intelligence approach. Springer, London, UKMATH
4.
Zurück zum Zitat Brelaz D (1979) New methods to color the vertices of a graph. Commun ACM 22:251–256 Brelaz D (1979) New methods to color the vertices of a graph. Commun ACM 22:251–256
5.
Zurück zum Zitat Dasgupta D. (eds) (2000) Artificial immune systems and their applications. Springer, Berlin Dasgupta D. (eds) (2000) Artificial immune systems and their applications. Springer, Berlin
6.
Zurück zum Zitat Dozier G, Bowen J, Homaifar A (1998) Solving constraint satisfaction problems using hybrid evolutionary search. IEEE Trans Evol Comput 2(1):23–33CrossRef Dozier G, Bowen J, Homaifar A (1998) Solving constraint satisfaction problems using hybrid evolutionary search. IEEE Trans Evol Comput 2(1):23–33CrossRef
7.
Zurück zum Zitat 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–205 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–205
8.
Zurück zum Zitat Garrett SM (2004) Parameter-free, adaptive clonal selection. In: Proceedings of the IEEE congress on evolutionary computation (CEC04), vol 1, pp 1052–1058 Garrett SM (2004) Parameter-free, adaptive clonal selection. In: Proceedings of the IEEE congress on evolutionary computation (CEC04), vol 1, pp 1052–1058
9.
Zurück zum Zitat Mackworth AK (1977) Consistency in network of relations. Artificial Intelligence 8:99–118MATHCrossRef Mackworth AK (1977) Consistency in network of relations. Artificial Intelligence 8:99–118MATHCrossRef
10.
Zurück zum Zitat 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–337 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–337
11.
Zurück zum Zitat 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) 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)
12.
Zurück zum Zitat 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–339 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–339
13.
Zurück zum Zitat Riff MC, Zuniga M (2007) Towards an immune system to solve csp. Proceedings of the IEEE congress on evolutionary computation Singapur(In Press.) Riff MC, Zuniga M (2007) Towards an immune system to solve csp. Proceedings of the IEEE congress on evolutionary computation Singapur(In Press.)
14.
Zurück zum Zitat Smith BM, Dyer ME (1996) Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence 81(1–2):155–181CrossRefMathSciNet Smith BM, Dyer ME (1996) Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence 81(1–2):155–181CrossRefMathSciNet
15.
Zurück zum Zitat Solnon C (2002) Ants can solve constraint satisfaction problems. IEEE Trans Evol Comput 6(4):347–357CrossRef Solnon C (2002) Ants can solve constraint satisfaction problems. IEEE Trans Evol Comput 6(4):347–357CrossRef
16.
Zurück zum Zitat 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–383 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–383
Metadaten
Titel
A graph-based immune-inspired constraint satisfaction search
verfasst von
María-Cristina Riff
Marcos Zúñiga
Elizabeth Montero
Publikationsdatum
01.11.2010
Verlag
Springer-Verlag
Erschienen in
Neural Computing and Applications / Ausgabe 8/2010
Print ISSN: 0941-0643
Elektronische ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-010-0390-8

Weitere Artikel der Ausgabe 8/2010

Neural Computing and Applications 8/2010 Zur Ausgabe

Premium Partner