ACM Home Page
Please provide us with feedback. Feedback
Breeding swarms: a GA/PSO hybrid
Full text PdfPdf (277 KB)
Source Genetic And Evolutionary Computation Conference archive
Proceedings of the 2005 conference on Genetic and evolutionary computation table of contents
Washington DC, USA
SESSION: Ant colony optimization and swarm intelligence table of contents
Pages: 161 - 168  
Year of Publication: 2005
ISBN:1-59593-010-8
Authors
Matthew Settles  University of Idaho, Moscow, ID
Terence Soule  University of Idaho, Moscow, ID
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 118,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1068009.1068035
What is a DOI?

ABSTRACT

In this paper we propose a novel hybrid (GA/PSO) algorithm, Breeding Swarms, combining the strengths of particle swarm optimization with genetic algorithms. The hybrid algorithm combines the standard velocity and position update rules of PSOs with the ideas of selection, crossover and mutation from GAs. We propose a new crossover operator, Velocity Propelled Averaged Crossover (VPAC), incorporating the PSO velocity vector. The VPAC crossover operator actively disperses the population preventing premature convergence. We compare the hybrid algorithm to both the standard GA and PSO models in evolving solutions to five standard function minimization problems. Results show the algorithm to be highly competitive, often outperforming both the GA and PSO.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
M. Clerc. The swarm and the queen: Towards a determininistic and adaptive particle swarm optimization. In Congress on Evolutionary Computation (CEC99), pages 1951--1957, 1999.
 
3
 
4
L. Eshelman and J. Schaffer. Real-coded genetic algorithms and interval-schemata. In L. D. Whitley, editor, Foundations of Genetic Algorithms 2, pages 187--202. Morgan Kaufmann, San Mateo, CA, 1993.
 
5
D. Fogel and H. Beyer. A note on the empirical evaluation of intermediate recombination. Evolutionary Computation, 3(4):491--495, 1996.
 
6
 
7
 
8
M. Lvbjerg, T. Rasmussen, and T. Krink. Hybrid particle swarm optimiser with breeding and subpopulations. In Proceedings of the Genetic and Evolutionary Computation Conference -- GECCO-2001, LNCS. Springer-Verlag, 2001.
 
9
G. Mahinthakumar and M. Sayeed. Hybrid genetic algorithm - local search approaches for groundwater source identification problems. Special Issue on Evolutionary Computation, ASCE Jounal of Water Resources Planning and Management, In Press, 2004.
 
10
J. Robinson, S. Sinton, and Y. Rahmat-Samii. Particle swarm, genetic algorithm, and their hybrids: Optimization of a profiled corrugated horn antenna. In IEEE Antennas and Propagation Society International Symposium and URSI National Radio Science Meeting, San Antonio, TX, 2002.
 
11
M. Settles, B. Rodebaugh, and T. Soule. Comparison of genetic algorithm and particle swarm optimizer when evolving a recurrent neural network. In E. Cantú-Paz and et. al., editors, Genetic and Evolutionary Computation -- GECCO-2003, volume 2723 of LNCS, pages 148--149, Chicago, 12-16 July 2003. Springer-Verlag.
 
12
M. Settles and T. Soule. A hybrid ga/pso to evolve artificial recurrent neural networks. In C. Dagli and et. al., editors, Intelligent Engineering Systems Through Aritificial Neural Networks (ANNIE-2003), volume 13, pages 51--56, St. Louis, 2-5 Nov. 2003. ASME Press.
 
13


Collaborative Colleagues:
Matthew Settles: colleagues
Terence Soule: colleagues