ACM Home Page
Please provide us with feedback. Feedback
A hybrid particle swarm optimization approach with prior crossover differential evolution
Full text PdfPdf (494 KB)
Source
ACM/SIGEVO Summit on Genetic and Evolutionary Computation archive
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation table of contents
Shanghai, China
SESSION: Full papers table of contents
Pages 671-678  
Year of Publication: 2009
ISBN:978-1-60558-326-6
Authors
Wei Xu  East China University of Science and Technology, Shanghai, China
Xingsheng Gu  East China University of Science and Technology, Shanghai, China
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): 11,   Downloads (12 Months): 52,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

Particle swarm optimization (PSO) is population-based heuristic searching algorithm. PSO has excellent ability of global optimization. However, there are some shortcomings of prematurity, low convergence accuracy and speed, similarly to other evolutionary algorithms (EA). To improve its performance, a hybrid particle swarm optimization is proposed in the paper. Firstly, the average position and velocity of particles are incorporated into basic PSO for concerning with the effect of the evolution of the whole swarm. Then a differential evolution (DE) computation, which introduces an extra population for prior crossover, is hybridized with the improved PSO to form a novel optimization algorithm, PSOPDE. The role of prior crossover is to appropriately diversify the population and increase the probability of reaching better solutions. DE component takes into account the stochastic differential variation, and enhances the exploitation in the neighborhoods of current solutions. PSOPDE is implemented on five typical benchmark functions, and compared with six other algorithms. The results indicate that PSOPDE behaves better, and greatly improve the searching efficiency and quality.


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
Eberhart RC, Kennedy J. 1995. A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science (Nagoya, Japan). IEEE Press, New Jersey, Piscataway, 39--43.
 
2
Kennedy J, Eberbart RC. 1995. Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, IV. IEEE Press, New Jersey, Piscataway, 1942--1948.
 
3
Millionas MM. 1994. Swarm, phase, transition, and collective intelligence. Artificial Life III. MA: Addison Wesley.
 
4
S. Kannan, S. Mary Raja Slochanal, P. Subbaraj, et al. 2004. Application of particle swarm optimization technique and its variants to generation expansion planning problem. Electric Power Systems Research. 70, 203--210.
 
5
Praveen Kumar Tripathi, Sanghamitra Bandyopadhyay, and Sankar Kumar Pal. 2007. Multi-objective particle swarm optimization with time variant inertia and acceleration coefficients. Information Sciences. 177, 5033--5049.
 
6
Yujia Wang, Yupu Yang, "An interactive multi-swarm PSO for multiobjective optimization problems", Expert Systems with Applications, 2008, in press.
 
7
Ali Karimi, Ali Feliachi. 2008. Decentralized adaptive backstepping control of electric power systems. Electric Power Systems Research. 78, 484--493.
 
8
Cláudia O. Ourique, Evaristo C. Biscaia, Jr and José Carlos Pinto. 2002. The use of particle swarm optimization for dynamical analysis in chemical processes. Computers and Chemical Engineering. 26, 1783--1793.
 
9
 
10
B.K. Panigrahi, V. Ravikumar Pandi, and Sanjoy Das. 2008. Adaptive particle swarm optimization approach for static and dynamic economic load dispatch. Energy Conversion and Management. 49, 1407--1415.
 
11
Clerc M, Kennedy J. 2002.The Particle Swarm-Explosion, Stability, and Convergence in Multidimensional Complex Space. IEEE Transactions on Evolutionary Computation. 6(1), 58--73.
 
12
Ratnaweera A, Halgamuge SK, and Watson HC. 2004. Self-Organizing Hierarchical Particle Swarm Optimizer with Time-Varying Acceleration Coefficients. IEEE Transactions on Evolutionary Computation. 8(3), 240--255.
 
13
S. He, Q. H. Wu, J. Y. Wen et al. 2004. A Particle Swarm Optimizer with Passive Congregation. BioSystems. 78, 135--147.
 
14
Bo Liu, Ling Wang, Yi-Hui Jin et al. 2005. Improved Particle Swarm Optimization Combined with Chaos. Chaos, Solitons and Fractal. 25, 1261--1271.
 
15
 
16
Storn R., Price K,.1995. Differential evolution -- a simple and efficient adaptive scheme for global optimization over continuous spaces. Technical Report TR-95-012, Berkeley: International Computer Science Institute.
 
17
Price, K., Storn, R. 1997. Differential evolution: a simple evolution strategy for fast optimization. Dr. Dobb's Journal of Software Tools. 22(4), 18--24.
 
18
 
19
M. M. Ali, A. Törn. 2002. Topographical differential evolution using pre-calculated differential. in:G. Dzemyda, V. Saltenis, A. Zilinskas (Eds.), Stochastic and Global Optimization, Kluwer Academic Publisher. 1--17.
 
20
M.M.Ali. 2007. Differential evolution with preferential crossover. European Journal of Operational Research. 181, 1137--1147.