This report presents an in-depth look on methods on how to obtain robust optima in optimization problems via the family of particle swarm optimization (PSO) algorithms. Several members of this family, namely the canonical PSO, the fully-informed PSO, a multi-swarm PSO and the charged PSO, were tested on their usability for finding robust optima. To assess the usefulness of these algorithms, they were tested against each other (with different modifications) as well as against a current state-ofâ€¦Â CONTINUE READING