Particle swarm optimization algorithm based on divided-interval chaotic search

Though chaotic particle swarm optimization algorithm lets particles search in the whole variable space, the search scale is too large and the high precision of solution is hard to achieve. This paper proposes a particle swarm optimization algorithm based on divide-interval chaotic search, it lets the particles search in the selected interval, reduces the scope of the search space, and makes the solution more approximate to the global optimum. And the comparable experiment shows that the algorithm has preferable results.