CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Dealing with Boundary Constraint Violations in Particle Swarm Optimization with Aging Leader and Challengers (ALC-PSO)

by Avneet Kaur, Mandeep Kaur
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 121 - Number 11
Year of Publication: 2015
Authors: Avneet Kaur, Mandeep Kaur
10.5120/21584-4653

Avneet Kaur, Mandeep Kaur . Dealing with Boundary Constraint Violations in Particle Swarm Optimization with Aging Leader and Challengers (ALC-PSO). International Journal of Computer Applications. 121, 11 ( July 2015), 13-19. DOI=10.5120/21584-4653

@article{ 10.5120/21584-4653,
author = { Avneet Kaur, Mandeep Kaur },
title = { Dealing with Boundary Constraint Violations in Particle Swarm Optimization with Aging Leader and Challengers (ALC-PSO) },
journal = { International Journal of Computer Applications },
issue_date = { July 2015 },
volume = { 121 },
number = { 11 },
month = { July },
year = { 2015 },
issn = { 0975-8887 },
pages = { 13-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume121/number11/21584-4653/ },
doi = { 10.5120/21584-4653 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:08:10.392021+05:30
%A Avneet Kaur
%A Mandeep Kaur
%T Dealing with Boundary Constraint Violations in Particle Swarm Optimization with Aging Leader and Challengers (ALC-PSO)
%J International Journal of Computer Applications
%@ 0975-8887
%V 121
%N 11
%P 13-19
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Boundary violation is a common process in optimization problems. This problem can be seen in Particle Swarm Optimization(PSO) and its variants too. An aging based variant of PSO called, PSO with Aging Leader and Challengers(ALC-PSO) overcomes the stagnation problem that existed in PSO. To avoid the problem of random particles, some bound handling mechanisms need to be applied to Particle Swarm Optimization with Aging Leader and Challengers (ALC-PSO) to improve its performance. During the search process, some particles may leave the search boundaries within which the optimal solution is to be found. It becomes essential to handle such boundary constraint violations and some boundary handling strategies are required to be implemented. This paper presents some of these bound handling methods applied to ALC-PSO algorithm and comparisons are made with PSO. These methods include velocity initialization, velocity clamping and bound handling methods. The results are simulated on MATLAB R2011b for Ackley benchmark problem.

References
  1. Qinghai Bai, "Analysis of Particle Swarm Optimization Algorithm" Volume 3, no. 1, February 2010.
  2. A. E. Smith, "Swarm intelligence: from natural to artificial systems [book reviews]," IEEE Transactions on Evolutionary Computation, vol. 4, no. 2, pp. 192–193, 2000.
  3. Avneet Kaur "Particle Swarm Optimization with Aging Leader Algorithm : A Review ", International Journal of Engineering Research & Technology (IJERT), ISSN: 2278-0181, Vol. 4 Issue 02, February-2015.
  4. Woo Nam Lee and Jong Bae Park, "Educational Simulator for Particle Swarm Optimization and Economic Dispatch Applications ", IEEE Transactions on Power Systems, 03/2005.
  5. Wei-Neng Chen , Jun Zhang, Ni Chen, Zhi-Hui Zhan , Henry Shu-Hung Chung , Yun Li, Yu-Hui Shi "Particle Swarm Optimization with an Aging Leader and Challengers" , IEEE, 2013.
  6. Andries Engelbrecht, "Particle Swarm Optimization: Velocity Initialization", WCCI 2012 IEEE World Congress on Computational Intelligence, June 2012.
  7. Y. Shi and R. C. Eberhart, "Empirical study of particle swarm optimization," Proc. IEEE Congr. Evol. Comput, pp. 1945–1950, Jul. 1999.
  8. Daniel Bratton, James Kennedy, "Defining a Standard for Particle Swarm Optimization", Proceedings of the 2007 IEEE Swarm Intelligence Symposium (SIS), 2007.
  9. Avneet Kaur, "Particle Swarm Optimization with Aging Leader Algorithm : A Review", International Journal of Engineering Research & Technology (IJERT), ISSN: 2278-0181, Vol. 4 Issue 02, February-2015.
  10. Farrukh Shahzad, A. Rauf Baig, Sohail Masood, Muhammad Kamran,Nawazish Naveed, "Opposition-Based Particle Swarm Optimization with Velocity Clamping (OVCPSO)", Advances in Computational Sciences, Advances in Computational Intelligence , Advances in Intelligent and Soft Computing Volume 116, pp 339-348
  11. Juan C. Fuentes Cabrera and Carlos A. Coello Coello, "Handling Constraints in Particle Swarm Optimization using a Small Population Size", Advances in Artificial Intelligence , Lecture Notes in Computer Science, Volume 4827 , pp 41-51
  12. Jian Li, Bo Ren, and Cheng Wang, "A Random Velocity Boundary Condition for Robust Particle Swarm Optimization" Bio-Inspired Computational Intelligence and Applications, , Lecture Notes in Computer Science, Volume 4688, pp 92-99
  13. Analyzing the Effects of Bound Handling in Particle Swarm Optimization.
  14. Wei Chu, Xiaogang Gao, Soroosh Sorooshian, Handling boundary constraints for particle swarm optimization in high-dimensional search space, Springer, Information Sciences 181 (2011) 4569–4581, October 2010.
Index Terms

Computer Science
Information Sciences

Keywords

Search Space Particle Velocity Boundaries Random Particles.

Powered by PhDFocusTM