Skip to main content
SpringerLink
Log in

A Clonal Selection Algorithm for Coloring, Hitting Set and Satisfiability Problems

  • Conference paper
Book cover Neural Nets (WIRN 2005, NAIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3931))

Abstract

In this keynote paper we present an Immune Algorithm based on the Clonal Selection Principle to explore the combinatorial optimization capability. We consider only two immunological entities, antigens and B cells, three parameters, and the cloning, hypermutation and aging immune operators. The experimental results shows how these immune operators couple the clonal expansion dynamics are sufficient to obtain optimal solutions for graph coloring problem, minimum hitting set problem and satisfiability hard instances, and that the IA designed is very competitive with the best evolutionary algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bäck, T., Eiben, A.E., Vink, M.E.: A superior evolutionary algorithm for 3- SAT. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Barbosa, V.C., Assis, C.A.G., do Nascimento, J.O.: Two Novel Evolutionary Formulations of the Graph Coloring Problem. Journal of Combinatorial Optimization (in press)

    Google Scholar 

  3. Burnet, F.M.: The Clonal Selection Theory of Acquired Immunity. Cambridge University Press, Cambridge (1959)

    Book  Google Scholar 

  4. Caramia, M., Dell’Olmo, P.: Iterative Coloring Extension of a Maximum Clique. Naval Research Logistics 48, 518–550 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cutello, V., Nicosia, G., Pavone, M.: A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723. Springer, Heidelberg (2003)

    Google Scholar 

  6. Cutello, V., Nicosia, G.: An Immunological approach to Combinatorial Optimization Problems. In: Garijo, F.J., Riquelme, J.-C., Toro, M. (eds.) IBERAMIA 2002. LNCS, vol. 2527, pp. 361–370. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Cutello, V., Nicosia, G.: Multiple Learning using Immune Algorithms. In: Proceedings of the 4th International Conference on Recent Advances in Soft Computing (2002)

    Google Scholar 

  8. Cutello, V., Pappalardo, F., Mastriani, E.: An Evolutionary Algorithm for the Tconstrained variation of the Minimum Hitting Set Problem. In: Proceedigns of the IEEE World Congress on Computational Intelligence, Congress on Evolutionary Computation (CEC 2002), Honolulu, HI (2002)

    Google Scholar 

  9. Dasgupta, D. (ed.): Artificial Immune Systems and their Applications. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  10. De Castro, L.N., Von Zuben, F.J.: The Clonal Selection Algorithm with Engineering Applications. In: Proceedings of GECCO 2000, Workshop on Artificial Immune Systems and Their Applications (2000)

    Google Scholar 

  11. De Castro, L.N., Timmis, J.: Artificial Immune Systems: A New Computational Intelligence Paradigm. Springer, UK (2002)

    MATH  Google Scholar 

  12. De Castro, L.N., Von Zuben, F.J.: Learning and optimization using the clonal selection principle. IEEE Transaction on Evolutionary Computation 6(3), 239–251 (2002)

    Article  Google Scholar 

  13. Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Transaction on Evolutionary Computation 3(2), 124–141 (1999)

    Article  Google Scholar 

  14. Eiben, A.E., van der Hauw, J.K., van Hemert, J.I.: Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics (4), 25–46 (1998)

    Google Scholar 

  15. Forrest, S., Hofmeyr, S.A.: Immunology as Information Processing. In: Segel, L.A., Cohen, I.R. (eds.) Design Principles for Immune System & Other Distributed Autonomous Systems. Oxford University Press, New York (2000)

    Google Scholar 

  16. Galinier, P., Hao, J.: Hybrid Evolutionary Algorithms for Graph Coloring. Journal of Combinatorial Optimization 3(4), 379–397 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  17. Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  18. Johnson, D.R., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning. Operations Research 39, 378–406 (1991)

    Article  MATH  Google Scholar 

  19. Johnson, D.S., Trick, M.A. (eds.): Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge. American Mathematical Society, Providence (1996)

    MATH  Google Scholar 

  20. Leung, K., Duan, Q., Xu, Z., Wong, C.W.: A New Model of Simulated Evolutionary Computation – Convergence Analysis and Specifications. IEEE Transaction on Evolutionary Computation 5(1), 3–16 (2001)

    Article  Google Scholar 

  21. Marino, A., Damper, R.I.: Breaking the Symmetry of the Graph Colouring Problem with Genetic Algorithms. In: Whitley, D., Goldberg, D., Cantu-Paz, E., Spector, L., Parmee, I., Beyer, H.-G. (eds.) Workshop Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), Las Vegas, NV. Morgan Kaufmann, San Francisco (2000)

    Google Scholar 

  22. Mehrotra, A., Trick, M.A.: A Column Generation Approach for Graph Coloring. Journal of Computing 8, 344–354 (1996)

    MATH  Google Scholar 

  23. Mitchell, D., Selman, B., Levesque, H.J.: Hard and easy distributions of SAT problems. In: Proceedigns of the AAAI, San Jose, CA, pp. 459–465 (1992)

    Google Scholar 

  24. Nicosia, G., Castiglione, F., Motta, S.: Pattern Recognition by primary and secondary response of an Artificial Immune System. Theory in Biosciences 120(2), 93–106 (2001)

    Article  Google Scholar 

  25. Nicosia, G., Castiglione, F., Motta, S.: Pattern Recognition with a Multi–Agent model of the Immune System. In: International NAISO Symposium, ENAIS 2001 (2001)

    Google Scholar 

  26. Perelson, A.S., Weisbuch, G., Coutinho, A. (eds.): Theoretical and Experimental Insights into Immunology. Springer, New York (1992)

    Google Scholar 

  27. Rogers, A., Prügel-Bennett, A.: Genetic Drift in Genetic Algorithm Selection Schemes. IEEE Transactions on Evolutionary Computation 3, 298–303 (1999)

    Article  Google Scholar 

  28. Seiden, P.E., Celada, F.: A Model for Simulating Cognate Recognition and Response in the Immune System. Journal of Theoretical Biology 158, 329–357 (1992)

    Article  Google Scholar 

  29. Tan, K.C., Lee, T.H., Khor, E.F.: Evolutionary Algorithms with Dynamic Population Size and Local Exploration for Multiobjective Optimization. IEEE Transactions on Evolutionary Computation 5(6), 565–588 (2001)

    Article  Google Scholar 

  30. Timmis, J., Knight, T., de Castro, L.N., Hart, E.: An Overview of Artificial Immune Systems. In: Paton, R., Bolouri, H., Holcombe, M., Parish, H., Tateson, R. (eds.) Computation in Cells and Tissues: Perspectives and Tools of Thought. Natural Computation Series. Springer, Heidelberg (2003) (in press)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Catania, V.le A. Doria 6, 95125, Catania, Italy

    Vincenzo Cutello & Giuseppe Nicosia

Authors
  1. Vincenzo Cutello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giuseppe Nicosia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimentimento di Scienze dell’Informazione, via Comelico 39/41, 20135, Milano, Italy

    Bruno Apolloni

  2. Dipartimento di Fisica “E.R. Caianiello”, Università degli Studi di Salerno, Via S. Allende, 84081, Baronissi (SA), Italy

    Maria Marinaro

  3. Department of Mathematics and Computer Science, University of Catania, Viale A. Doria 6, 95125, Catania, Italy

    Giuseppe Nicosia

  4. Department of Mathematics and Informatics, University of Salerno, Via Ponte Don Melillo, 84084, Fisciano (SA), Italy

    Roberto Tagliaferri

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cutello, V., Nicosia, G. (2006). A Clonal Selection Algorithm for Coloring, Hitting Set and Satisfiability Problems. In: Apolloni, B., Marinaro, M., Nicosia, G., Tagliaferri, R. (eds) Neural Nets. WIRN NAIS 2005 2005. Lecture Notes in Computer Science, vol 3931. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11731177_39

Download citation

  • DOI: https://doi.org/10.1007/11731177_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33183-4

  • Online ISBN: 978-3-540-33184-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation