Skip to main content
Article thumbnail
Location of Repository

Low Discrepancy Initialized Particle Swarm Optimization for Solving Constrained Optimization Problems

By Millie Pant, Radha Thangaraj and Ajith Abraham

Abstract

Population based metaheuristics are commonly used for global optimization problems. These techniques depend largely on the generation of initial population. A good initial population may not only result in a better fitness function value but may also help in faster convergence. Although these techniques have been popular since more than three decades very little research has been done on the initialization of the population. In this paper, we propose a modified Particle Swarm Optimization (PSO) called Improved Constraint Particle Swarm Optimization (ICPSO) algorithm for solving constrained optimization. The proposed ICPSO algorithm is initialized using quasi random Vander Corput sequence and differs from unconstrained PSO algorithm in the phase of updating the position vectors and sorting every generation solutions. The performance of ICPSO algorithm is validated on eighteen constrained benchmark problems. The numerical results show that the proposed algorithm is a quite promising for solving constraint optimization problems

Topics: Particle Swarm Optimization, Constrained Optimization Problems, Quasi Random, Vander Corput Sequence
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.160.5891
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.softcomputing.net/p... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.