Abstract
Nature shows many examples where the specialisation of elements aimed to solve different problems is successful. There are explorer ants, worker bees, etc., where a group of individuals is assigned a specific task. This paper will extrapolate this philosophy, applying it to a multiobjective genetic algorithm. The problem to be solved is the design of Radial Basis Function Neural Networks (RBFNNs) that approximate a function. A non distributed multiobjective algorithm will be compared against a parallel approach that emerges as a straight forward specialisation of the crossover and mutation operators in different islands. The experiments will show how, as in the real world, if the different islands evolve specific aspects of the RBFNNs, the results are improved.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bors, A.G.: Introduction of the Radial Basis Function (RBF) networks. In: OnLine Symposium for Electronics Engineers, vol. 1, pp. 1–7 (February 2001)
Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolutionary Computation 6(2), 182–197 (2002)
González, J., Rojas, I., Ortega, J., Pomares, H., Fernández, F.J., Díaz, A.: Multiobjective evolutionary optimization of the size, shape, and position parameters of radial basis function networks for function approximation. IEEE Transactions on Neural Networks 14(6), 1478–1495 (2003)
Hancock, P.J.B.: Genetic Algorithms and Permutation Problems: a Comparison of Recombination Operators for Neural Net Structure Specification. In: Whitley, D. (ed.) Proceedings of COGANN workshop, IJCNN, Baltimore, IEEE, Los Alamitos (1992)
Herrera, F., Lozano, M., Verdegay, J.L.: Tackling real-coded genetic algorithms: operators and tools for the behavioural analysis. Artificial Intelligence Reviews 12(4), 265–319 (1998)
Knowles, J., Corne, D.: On metrics for comparing non-dominated sets. In: Congress on Evolutionary Computation (CEC 2002) (2002)
Pareto, V.: Cours D’Economie Politique, vol. I, II. F. Rouge, Lausanne (1896)
Park, J., Sandberg, J.W.: Universal approximation using radial basis functions network. Neural Computation 3, 246–257 (1991)
van Veldhuizen, D.A., Zydallis, J.B., Lamont, G.B.: Considerations in engineering parallel multiobjective evolutionary algorithms. IEEE Trans. Evolutionary Computation 7(2), 144–173 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guillén, A., Rojas, I., González, J., Pomares, H., Herrera, L.J., Paechter, B. (2006). Improving the Performance of Multi-objective Genetic Algorithm for Function Approximation Through Parallel Islands Specialisation. In: Sattar, A., Kang, Bh. (eds) AI 2006: Advances in Artificial Intelligence. AI 2006. Lecture Notes in Computer Science(), vol 4304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11941439_135
Download citation
DOI: https://doi.org/10.1007/11941439_135
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49787-5
Online ISBN: 978-3-540-49788-2
eBook Packages: Computer ScienceComputer Science (R0)