Randomized algorithms
Tabu Search
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
Artificial Immune Systems: A New Computational Intelligence Paradigm
Artificial Immune Systems: A New Computational Intelligence Paradigm
On the Choice of the Mutation Probability for the (1+1) EA
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Proceedings of the 2006 ACM symposium on Applied computing
Rigorous Runtime Analysis of Inversely Fitness Proportional Mutation Rates
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Immunological Computation: Theory and Applications
Immunological Computation: Theory and Applications
On the utility of the population size for inversely fitness proportional mutation rates
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Multiobjective optimization using ideas from the clonal selection principle
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Immune inspired somatic contiguous hypermutation for function optimisation
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Analyzing different variants of immune inspired somatic contiguous hypermutations
Theoretical Computer Science
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity
Theory of Randomized Search Heuristics: Foundations and Recent Developments
Theory of Randomized Search Heuristics: Foundations and Recent Developments
Clonal selection algorithms: a comparative case study using effective mutation potentials
ICARIS'05 Proceedings of the 4th international conference on Artificial Immune Systems
Learning and optimization using the clonal selection principle
IEEE Transactions on Evolutionary Computation
An Immune Algorithm for Protein Structure Prediction on Lattice Models
IEEE Transactions on Evolutionary Computation
Artificial immune systems for optimisation
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Artificial immune systems for optimisation
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
Specific hypermutation operators are one of the distinguishing features of artificial immune systems. They can be considered in isolation and compared with other variation operators. For a specific immune-inspired hypermutation operator, hypermutations with inversely proportional mutation potential, an analysis of its ability to locate optima precisely and in large distance from other promising regions of the search space is presented. Four different specific variants of this mutation operator are considered. Two of these turn out to be very inefficient in locating optima precisely while the other two are able to do this efficiently. Based on these findings an improved version of this kind of mutation is introduced that removes some of the deficiencies and allows to parameterize the trade-off between efficiency in local search and the ability to perform huge changes in single mutations.