Comparative Research on Particle Swarm Optimization and Genetic Algorithm
- Zhijie Li
- Xiangdong Liu
- Xiaodong Duan
- Feixue Huang
Abstract
Genetic algorithm (GA) is a kind of method to simulate the natural evolvement process to search the optimal solution, and the algorithm can be evolved by four operations including coding, selecting, crossing and variation. The particle swarm optimization (PSO) is a kind of optimization tool based on iteration, and the particle has not only global searching ability, but also memory ability, and it can be convergent directionally. By analyzing and comparing two kinds of important swarm intelligent algorithm, the selecting operation in GA has the character of directivity, and the comparison experiment of two kinds of algorithm is designed in the article, and the simulation result shows that the GA has strong ability of global searching, and the convergence speed of PSO is very quick without too many parameters, and could achieve good global searching ability.
- Full Text: PDF
- DOI:10.5539/cis.v3n1p120
Journal Metrics
WJCI (2022): 0.636
Impact Factor 2022 (by WJCI): 0.419
h-index (January 2024): 43
i10-index (January 2024): 193
h5-index (January 2024): N/A
h5-median(January 2024): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- Academic Journals Database
- BASE (Bielefeld Academic Search Engine)
- CiteFactor
- CNKI Scholar
- COPAC
- CrossRef
- DBLP (2008-2019)
- EBSCOhost
- EuroPub Database
- Excellence in Research for Australia (ERA)
- Genamics JournalSeek
- Google Scholar
- Harvard Library
- Infotrieve
- LOCKSS
- Mendeley
- PKP Open Archives Harvester
- Publons
- ResearchGate
- Scilit
- SHERPA/RoMEO
- Standard Periodical Directory
- The Index of Information Systems Journals
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WJCI Report
- WorldCat
Contact
- Chris LeeEditorial Assistant
- cis@ccsenet.org