liveBook · Manning

Particle swarm optimization

Also called PSO

Particle swarm optimization is a population-based optimization method in which candidate solutions adjust their positions using individual and collective search information.

How 3 Manning books explain it

Optimization Algorithms: AI techniques for design, planning, and control problems

Particle swarm optimization is a population-based optimization algorithm in which candidate particles adjust their movement using individual and collective experience.

How it is used
Uses cooperative population search for continuous and discrete optimization problems.
How deep it goes
Explains particle guidance and parameter trade-offs, with continuous, binary, permutation-based, and adaptive variants.
Examples
Illustrates cooperative treasure hunting and a 20-city route scored by tour distance.
What you can do after
Applies PSO via PySwarms to score candidate tours and obtain a city route.

Read how Optimization Algorithms: AI techniques for design, planning, and control problems explains particle swarm optimization →

Evolutionary Deep Learning: Genetic algorithms and neural networks

Particle swarm optimization is a population-based optimization algorithm in which candidate solutions move through a search space according to collective-swarm behavior.

How it is used
Applies population search to function parameters and automatic hyperparameter optimization.
How deep it goes
Works through DEAP particle generation, fitness evaluation, best tracking, velocity updates, and a complete swarm loop.
Examples
Uses cannon-shot velocity and angle to hit a target distance, plus loss-driven neural-network hyperparameter search.
What you can do after
Apply it via DEAP to optimize function inputs or map particle vectors to model hyperparameters.

Read how Evolutionary Deep Learning: Genetic algorithms and neural networks explains particle swarm optimization →

Grokking AI Algorithms, Second Edition

Particle swarm optimization is a swarm-intelligence optimization technique in which particles adjust candidate solutions using collective and individual search information.

How it is used
Uses a swarm to search large, multidimensional optimization spaces without exhaustively testing every value.
How deep it goes
Outlines initialization, fitness evaluation, iterative movement, stopping, and solution selection, while noting that movement details are intricate.
Examples
Uses drone material ratios, pepper attributes, and neural-network weights to illustrate search spaces and applications.
What you can do after
Evaluate/understand PSO as a way to search for good solutions and identify the main stages of a swarm search.

Read how Grokking AI Algorithms, Second Edition explains particle swarm optimization →

Also covered in

What to know first

Related concepts

Questions about particle swarm optimization

What is particle swarm optimization?

Particle swarm optimization is a population-based optimization method in which candidate solutions adjust their positions using individual and collective search information.

Which Manning books explain particle swarm optimization?

Optimization Algorithms: AI techniques for design, planning, and control problems, Evolutionary Deep Learning: Genetic algorithms and neural networks and Grokking AI Algorithms, Second Edition.

What should I know before learning particle swarm optimization?

Manning books that teach particle swarm optimization usually introduce genetic algorithm, artificial intelligence, evolutionary computation and fitness first.

What is particle swarm optimization also called?

Particle swarm optimization is also called PSO.

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.