Artficial Immune Systems and Their Applications
Artficial Immune Systems and Their Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Artificial Immune Systems: A New Computational Intelligence Paradigm
Artificial Immune Systems: A New Computational Intelligence Paradigm
Graph Coloring with Adaptive Evolutionary Algorithms
Journal of Heuristics
An Immunological Approach to Combinatorial Optimization Problems
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
A Superior Evolutionary Algorithm for 3-SAT
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
A hybrid immune algorithm with information gain for the graph coloring problem
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Hard and easy distributions of SAT problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Parameter control in evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Genetic drift in genetic algorithm selection schemes
IEEE Transactions on Evolutionary Computation
A new model of simulated evolutionary computation-convergenceanalysis and specifications
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Learning and optimization using the clonal selection principle
IEEE Transactions on Evolutionary Computation
A review of clonal selection algorithm and its applications
Artificial Intelligence Review
Hi-index | 0.00 |
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.