in particle swarm optimization algorithms some particles get stuck in their personal-best , what are the available technics and the most efficient ones
Genetic algorithm with migration added. This way every few generations (generally generation numbers in multiples of tens) will have new incoming chromosomes that did not evolve with the current ones. This way mating with the new "immigrants" take the current members that are stuck in local optima away from their current positions.
The first thing I would try is to increase the weight assigned to the random movement behaviour and see if that increases diversification. This could be done adaptively, whenever the swarm converges too much. For this case, you would need to implement some function that measures the diversity of the swarm.
I think if you adaptively change inertia weight, cognitive and social parameters you can avoid stuck into local minima. Another suggestion to add position update mechanism like Wind Dispersion, to increase the swarm diversity.
The algorithm described in the following paper of ours may be useful in your work. Further, we have an Excel-based program for BBPSO;, which can be obtained by contact me.
Zhang H., Kennedy D.D., Rangaiah G.P. and Bonilla-Petriciolet A., Novel Bare-Bones Particle Swarm Optimization and its Performance for Modeling Vapor-Liquid Equilibrium Data, Fluid Phase Equilibria, 301, 33-45 (2011).
An approach that is also widely used is to perturb the individuals every n iterations. This some times is applied to all individuals or a percentage of them. Such perturbations could be derived from different random number distributions.
Y. del Valle, G. Venayagamoorthy, S. Mohagheghi, J.-C. Hernandez, R. Harley, Particle swarm optimization: Basic concepts, variants and applications in power systems, IEEE Transactions on Evolutionary Computation, 12 (2) (2008) 171-195.