Particle Swarm Optimization by Maurice ClercParticle Swarm Optimization by Maurice Clerc

Particle Swarm Optimization

byMaurice Clerc

Hardcover | February 24, 2006

Pricing and Purchase Info

$188.45 online 
$198.00 list price
Earn 942 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


This is the first book devoted entirely to Particle Swarm Optimization (PSO), which is a non-specific algorithm, similar to evolutionary algorithms, such as taboo search and ant colonies.

Since its original development in 1995, PSO has mainly been applied to continuous-discrete heterogeneous strongly non-linear numerical optimization and it is thus used almost everywhere in the world. Its convergence rate also makes it a preferred tool in dynamic optimization.

Maurice Clerc is recognized as one of the foremost PSO specialists in the world. A former France Telecom Research and Development engineer, he maintains his research activities as a consultant for the XPS (eXtended Particle Swarm) project.
Title:Particle Swarm OptimizationFormat:HardcoverDimensions:243 pages, 9.51 × 6.42 × 0.75 inPublished:February 24, 2006Publisher:WileyLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:1905209045

ISBN - 13:9781905209040

Look for similar items by category:


Table of Contents



Part 1: Particle Swarm Optimization.

Chapter 1. What is a difficult problem?

Chapter 2. On a table corner.

Chapter 3. First formulations.

Chapter 4. Benchmark set.

Chapter 5. Mistrusting chance.

Chapter 6. First results.

Chapter 7. Swarm: memory and influence graphs.

Chapter 8. Distributions of proximity.

Chapter 9. Optimal parameter settings.

Chapter 10. Adaptations.

Chapter 11. TRIBES or co-operation of tribes.

Chapter 12. On the constraints.

Chapter 13. Problems and applications.

Chapter 14. Conclusion.

Part 2: Outlines.

Chapter 15. On parallelism.

Chapter 16. Combinatorial problems.

Chapter 17. Dynamics of a swarm.

Chapter 18. Techniques and alternatives.

Further Information.