liveBook · Manning

Local-best PSO

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

Local-best PSO is a particle swarm optimization variant in which each particle follows the best solution found within its local neighborhood.

Local-best PSO is a particle swarm optimization variant where each particle follows the best solution discovered within its local neighborhood rather than the entire swarm. section 9.2.4

The usual ring topology lets each particle communicate only with immediately adjacent neighbors. This slows convergence compared with global-best PSO but explores more of the search space and is recommended for multimodal problems. section 9.2.4

A ring neighborhood

Arrange particles in a circle. At each update, particle 4 compares its performance with particles 3 and 5, then moves toward the best position found within that local group. Information spreads through the ring rather than reaching every particle immediately. section 9.2.4

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

How deep it goes
Defines local neighborhoods and compares topologies, but does not provide local-best-specific update code or parameter procedures.
Examples
Uses ring, star, Von Neumann, and wheel topology diagrams to compare neighborhood structures.
What it assumes
Assumes particle swarm optimization and neighborhood topology concepts while contrasting local and global information sharing.
What you can do after
Apply local-best PSO by selecting a ring neighborhood when broader exploration matters more than fastest convergence.
How it connects
Connects particle swarm optimization with ring topology, global-best PSO, exploration, convergence, and local minima.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Optimization Algorithms: AI techniques for design, planning, and control problems. The section links point to the parts of the book it draws on.