A Hybrid of Genetic Algorithm and Particle Swarm Optimization for Recurrent Network Design
Top Cited Papers
- 22 March 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
- Vol. 34 (2), 997-1006
- https://doi.org/10.1109/tsmcb.2003.818557
Abstract
An evolutionary recurrent network which automates the design of recurrent neural/fuzzy networks using a new evolutionary learning algorithm is proposed in this paper. This new evolutionary learning algorithm is based on a hybrid of genetic algorithm (GA) and particle swarm optimization (PSO), and is thus called HGAPSO. In HGAPSO, individuals in a new generation are created, not only by crossover and mutation operation as in GA, but also by PSO. The concept of elite strategy is adopted in HGAPSO, where the upper-half of the best-performing individuals in a population are regarded as elites. However, instead of being reproduced directly to the next generation, these elites are first enhanced. The group constituted by the elites is regarded as a swarm, and each elite corresponds to a particle within it. In this regard, the elites are enhanced by PSO, an operation which mimics the maturing phenomenon in nature. These enhanced elites constitute half of the population in the new generation, whereas the other half is generated by performing crossover and mutation operation on these enhanced elites. HGAPSO is applied to recurrent neural/fuzzy network design as follows. For recurrent neural network, a fully connected recurrent neural network is designed and applied to a temporal sequence production problem. For recurrent fuzzy network design, a Takagi-Sugeno-Kang-type recurrent fuzzy network is designed and applied to dynamic plant control. The performance of HGAPSO is compared to both GA and PSO in these recurrent networks design problems, demonstrating its superiority.Keywords
This publication has 39 references indexed in Scilit:
- Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop schedulingIEEE Transactions on Evolutionary Computation, 2003
- Genetic local search for the TSP: new resultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- M-PAES: a memetic algorithm for multiobjective optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A TSK-type recurrent fuzzy network for dynamic systems processing by neural network and genetic algorithmsIEEE Transactions on Fuzzy Systems, 2002
- Adding learning to cellular genetic algorithms for training recurrent neural networksIEEE Transactions on Neural Networks, 1999
- An evolutionary algorithm that constructs recurrent neural networksIEEE Transactions on Neural Networks, 1994
- An Overview of Evolutionary Algorithms for Parameter OptimizationEvolutionary Computation, 1993
- Genetic algorithms and neural networks: optimizing connections and connectivityParallel Computing, 1990
- A Learning Algorithm for Continually Running Fully Recurrent Neural NetworksNeural Computation, 1989
- Learning State Space Trajectories in Recurrent Neural NetworksNeural Computation, 1989