Multi-phase discrete particle swarm optimization
B. Al-kazemi, Chilukuri Krishna Mohan · Syracuse University Libraries (Syracuse University) · 2002
This paper describes a successful adaptation of the Particle Swarm Optimization algorithm to discrete optimization problems. In the proposed algorithm, particles cycle through multiple phases with differing goals. We also exploit hill climbing. On benchmark problems, this algorithm outperforms a genetic algorithm and a previous discrete PSO formulation.