By Topic

A new particle swarm optimization algorithm for solving constraint and mixed variables optimization problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Weigang Wang ; Mechanical Science and Engineering College, Daqing Petroleum Institute, China ; Hongmei Ni

Many engineering optimization problems frequently encounter mixed variables and nonlinear constraints, which add considerably to the solution complexity. Very few of the existing methods can yield a globally optimal solution when the objective functions are non-convex and non-differentiable. We developed a new particle swarm optimization (PSO) algorithm. The algorithm introduced a mechanism of simulated annealing (SA), crossover and mutation operator. It may improve the evolutionary rate and precision of the algorithm. We put forward a method of stochastic approximation, in order to realize the transformation from continuous variable to discrete variable. For handling constraints, we used death penalty function method. Based on engineering design problem, computational result was better than the other solutions reported in the literature. Therefore, the new algorithm is feasible, and its accuracy and robustness are obviously superior to the other algorithms.

Published in:

Computational Intelligence and Natural Computing Proceedings (CINC), 2010 Second International Conference on  (Volume:1 )

Date of Conference:

13-14 Sept. 2010