Particle Swarm Optimization / Edition 1

Particle Swarm Optimization / Edition 1

by Maurice Clerc
ISBN-10:
1905209045
ISBN-13:
9781905209040
Pub. Date:
02/24/2006
Publisher:
Wiley
ISBN-10:
1905209045
ISBN-13:
9781905209040
Pub. Date:
02/24/2006
Publisher:
Wiley
Particle Swarm Optimization / Edition 1

Particle Swarm Optimization / Edition 1

by Maurice Clerc
$184.95 Current price is , Original price is $184.95. You
$184.95 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

Overview

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.


Product Details

ISBN-13: 9781905209040
Publisher: Wiley
Publication date: 02/24/2006
Series: ISTE Series , #627
Pages: 244
Product dimensions: 6.42(w) x 9.51(h) x 0.75(d)

About the Author

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.

Table of Contents

Foreword.

Introduction.

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.

Bibliography.

Index.

From the B&N Reads Blog

Customer Reviews