Almost all Particle Swarm Optimisation (PSO) algorithms use a number of identical, interchangeable particles that show the same behaviour throughout an optimisation. This paper describes a PSO algorithm in which the particles, while still identical, have two possible behaviours. Particles are not interchangeable as they make independent decisions when to change between the two possible behaviours. The difference between the two behaviours is that the attraction towards a particle’s personal best in one is changed in the other to repulsion from the personal best position. Results from experiments on three standard functions show that the introduction of repulsion enables the swarm to sequentially explore optima in problem space and enables it to outperform a conventional swarm with continuous attraction.
Lecture notes in computer science: Artificial Life: Borrowing from Biology: proceedings of the 4th Australian Conference, Melbourne, Australia, 01-04 December 2009. / K. Korb, M. Randall, and T. Hendtlass (eds.),
Vol. 5865, pp. 201-210