Universal approximation using radial-basis-function networks
Neural Computation
Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis
Artificial Intelligence Review
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Considerations in engineering parallel multiobjective evolutionary algorithms
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Neural Networks
Evolving neural networks for fractured domains
Proceedings of the 10th annual conference on Genetic and evolutionary computation
IWANN'07 Proceedings of the 9th international work conference on Artificial neural networks
Variable selection in a GPU cluster using delta test
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
Hi-index | 0.00 |
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.