Immune Algorithm Versus Differential Evolution: A Comparative Case Study Using High Dimensional Function Optimization
- Cite this paper as:
- Cutello V., Krasnogor N., Nicosia G., Pavone M. (2007) Immune Algorithm Versus Differential Evolution: A Comparative Case Study Using High Dimensional Function Optimization. In: Beliczynski B., Dzielinski A., Iwanowski M., Ribeiro B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2007. Lecture Notes in Computer Science, vol 4431. Springer, Berlin, Heidelberg
In this paper we propose an immune algorithm (IA) to solve high dimensional global optimization problems. To evaluate the effectiveness and quality of the IA we performed a large set of unconstrained numerical optimisation experiments, which is a crucial component of many real-world problem-solving settings. We extensively compare the IA against several Differential Evolution (DE) algorithms as these have been shown to perform better than many other Evolutionary Algorithms on similar problems. The DE algorithms were implemented using a range of recombination and mutation operators combinations. The algorithms were tested on 13 well known benchmark problems. Our results show that the proposed IA is effective, in terms of accuracy, and capable of solving large-scale instances of our benchmarks. We also show that the IA is comparable, and often outperforms, all the DE variants, including two Memetic algorithms.
Unable to display preview. Download preview PDF.