An Asynchronous Parallel Particle Swarm Optimization Algorithm for a Scheduling Problem

Hernane, Soumeya Leila; Hernane, Y.; Benyettou, M.

doi:10.3923/jas.2010.664.669

Cited by 4 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several asynchronous PSO variants have been proposed in the literature (Akat 2008;Desell et al 2009;Gaz 2007;Hernane et al 2010;Koh et al 2006). Most of these approaches refer to parallel implementations of PSO that were shown to be competitive or even superior to the synchronous ones.…”

Section: Asynchronous Particle Swarm Optimizationmentioning

confidence: 98%

Particle swarm optimization with deliberate loss of information

2012

View full text Add to dashboard Cite

We introduce a new variant for the constriction coefficient model of the established particle swarm optimization (PSO) algorithm. The new variant stands between the synchronous and asynchronous version of PSO, combining their operation regarding the update and evaluation frequency of the particles. Yet, the proposed variant has a unique feature that distinguishes it from other approaches. Specifically, it allows the undisrupted move of all particles even though evaluating only a portion of them. Apparently, this implies a loss of information for PSO, but it also allows the full exploitation of the convergence dynamic of the constriction coefficient model. Moreover, it requires only minor modifications to the original PSO algorithm since it does not introduce complicated procedures. Experimental results on widely used benchmark problems as well as on problems drawn from real-life applications, reveal that the proposed approach is efficient and can be very competitive to other PSO variants as well as to more specialized approaches.

show abstract

Section: Asynchronous Particle Swarm Optimizationmentioning

confidence: 98%