Solving 0-1 Integer Programming Problem by Hybrid Particle Swarm Optimization Algorithm
Shang Gao · Computing Technology and Automation · 2011
The classical particle swarm optimization is a powerful method to find the minimum of a numerical function,on a continuous definition domain.The particle swarm optimization algorithm combine the ideal of the genetic algorithm is recommended to solve 0-1 integer programming problem.All the 6 hybrid particle swarm optimization algorithms are proved effective.Especially the hybrid particle swarm optimization algorithm with across strategy A and mutation strategy C is a simple and effective better algorithm than others.It can easily be modified for any combinatorial problem for which we have no good specialized algorithm.