This paper analyzes theoretically the exact sampling distribution of the particle swarm optimization (PSO) without any assumption imposed by all current analyses. The distribution...
—In this paper we present a multi-agent search technique to face the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent setup ti...
Davide Anghinolfi, Antonio Boccalatte, Alberto Gro...
This paper presents a particle swarm optimizer for solving constrained optimization problems which adopts a very small population size (five particles). The proposed approach uses...
Juan Carlos Fuentes Cabrera, Carlos A. Coello Coel...
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
Arvind S. Mohais, Rui Mendes, Christopher Ward, Ch...
Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In ...