Swarm Intelligence and PSO
Swarm Intelligence and PSO
Key Characteristics:
- Distributed control: No central leader.
- Local interactions among individuals.
- Simple individual rules lead to complex group behavior.
- Robustness and adaptability.
Examples:
2. Bee Algorithm:
- Inspired by the foraging behavior of honey bees.
- Used in optimization problems like feature selection and neural network training.
Key Characteristics:
- Each particle represents a potential solution.
- Particles move through the search space based on:
- Their own best known position (pBest).
- The best position found by the swarm (gBest).
- Velocity and position are updated iteratively.
Formulas:
Velocity Update:
v_i(t+1) = w * v_i(t) + c1 * r1 * (pBest_i - x_i(t)) + c2 * r2 * (gBest - x_i(t))
Position Update:
x_i(t+1) = x_i(t) + v_i(t+1)
Example:
Problem: Minimize the function:
f(x, y) = x^2 + y^2
The global minimum is at (0, 0). PSO particles will 'fly' over the 2D plane and converge
towards this point by updating positions and velocities.