Parallel cooperative-competitive self-adaptive mutation in genetic algorithms

In previous work we have presented a model of genetic algorithm (GA) that applies varying mutations parallel to standard crossover & mutation putting them in a cooperative-competitive standing with each other (Aguirre et al., 1999). An improved GA based on this model (GA-SRM) using an adaptive mechanism for parallel mutation significantly improves the performance of GAs (Aguirre et al., 2001). Now, we introduce a self-adaptive mechanism within the parallel mutation operator of GA-SRM and show that the model is an appropriate framework to effectively use and develop further self-adaptation within GAs