According to researches, activation was a minor strategy of improving Particle Swarm Algorithm. For proofing the possibility of activation strategy could be a main strategy for improving Particle Swarm Algorithm, this article adopt the concept of mutation in Genetic Algorithm to improve Particle Swarm Optimization. The experimental results show three advantages for the activation strategies. Fi...

Particle swarm optimization (PSO) is a popular and robust strategy for optimization problems. One main difficulty in applying PSO to real-world applications is that PSO usually need a large number of fitness evaluations before a satisfying result can be obtained. This paper introduces a new ”fast particle swarm optimization” (FPSO) that does not evaluate all new positions owning a fitness and a...

We propose a novel generalized algorithmic framework to utilize particle filter for optimization incorporated with the swarm move method in particle swarm optimization (PSO). In this way, the PSO update equation is treated as the system dynamic in the state space model, while the objective function in optimization problem is designed as the observation/measurement in the state space model. Part...

This paper presents an optimal design of linear phase digital low pass finite impulse response (FIR) filter using Novel Particle Swarm Optimization (NPSO). NPSO is an improved particle swarm optimization (PSO) that proposes a new definition for the velocity vector and swarm updating and hence the solution quality is improved. The inertia weight has been modified in the PSO to enhance its search...

A branch and bound-PSO hybrid algorithm for solving integer separable concave programming problems is proposed, in which the lower bound of the optimal value was determined by solving linear programming relax and the upper bound of the optimal value and the best feasible solution at present were found and renewed with particle swarm optimization (PSO). It is shown by the numerical results that ...

Based on introducing two optimization algorithms, group search optimization (GSO) algorithm and particle swarm optimization (PSO) algorithm, a new hybrid optimization algorithm which named particle swarm-group search optimization (PS-GSO) algorithm is presented and its application to optimal structural design is analyzed. The PS-GSO is used to investigate the spatial truss structures with discr...

The particle swarm optimization algorithm was showed to converge rapidly during the initial stages of a global search, but around global optimum, the search process will become very slow. On the contrary, the gradient descending method can achieve faster convergent speed around global optimum, and at the same time, the convergent accuracy can be higher. So in this paper, a hybrid algorithm comb...

Quantum-behaved particle swarm optimization (QPSO) algorithm is a variant of the traditional particle swarm optimization (PSO). The QPSO that was originally developed for continuous search spaces outperforms the traditional PSO in search ability. This paper analyzes the main factors that impact the search ability of QPSO and converts the particle movement formula to the mutation condition by in...

Particle swarm optimization (PSO) is becoming one of the most important swarm intelligent paradigms for solving global optimization problems. Although some progress has been made to improve PSO algorithms over the last two decades, additional work is still needed to balance parameters to achieve better numerical properties of accuracy, efficiency, and stability. In the optimal PSO algorithm, th...

This paper presented a new particle swarm optimization based on evolutionary game theory (EPSO) for the traveling salesman problem (TSP) to overcome the disadvantages of premature convergence and stagnation phenomenon of traditional particle swarm optimization algorithm (PSO). In addition ,we make a mapping among the three parts discrete particle swarm optimization (DPSO)、 evolutionary game the...