Using particle swarm optimization for finding robust optima

@inproceedings{Dippel2010UsingPS,
  title={Using particle swarm optimization for finding robust optima},
  author={C. J. Dippel},
  year={2010}
}
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

References

Publications referenced by this paper.
Showing 1-10 of 14 references

The fully informed particle swarm: simpler, maybe better

IEEE Transactions on Evolutionary Computation • 2004
View 20 Excerpts
Highly Influenced

Dynamic Search With Charged Swarms

View 20 Excerpts
Highly Influenced

An archive based method for applying evolutionary algorithms to find robust optima

T. Bäck
Liacs Technical Report, • 2009
View 8 Excerpts
Highly Influenced

Particle swarm optimization

Swarm Intelligence • 2007
View 3 Excerpts

Robust optimization - a comprehensive survey

H.-G. Beyer, B. Sendhoff
Computer Methods in Applied Mechanics and Engineering, • 2007
View 2 Excerpts

Evolutionary optimization in uncertain environments-a survey

IEEE Transactions on Evolutionary Computation • 2005
View 2 Excerpts

Similar Papers

Loading similar papers…