Particle Swarm Optimization Algorithm Based on Divided-interval Chaotic Search

Qiushi Xu; Xiangdong Wang

2nd International ICST Conference on Bio-Inspired Models of Network, Information, and Computing Systems

Research Article

Particle Swarm Optimization Algorithm Based on Divided-interval Chaotic Search

Download745 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/ICST.BIONETICS2007.2337,
    author={Qiushi Xu and Xiangdong Wang},
    title={Particle Swarm Optimization Algorithm Based on Divided-interval Chaotic Search},
    proceedings={2nd International ICST Conference on Bio-Inspired Models of Network, Information, and Computing Systems},
    proceedings_a={BIONETICS},
    year={2008},
    month={8},
    keywords={Chaos  divided-interval  particle swarm optimization},
    doi={10.4108/ICST.BIONETICS2007.2337}
}

Qiushi Xu
Xiangdong Wang
Year: 2008
Particle Swarm Optimization Algorithm Based on Divided-interval Chaotic Search
BIONETICS
ICST
DOI: 10.4108/ICST.BIONETICS2007.2337

Qiushi Xu¹^,*, Xiangdong Wang¹^,*

1: Shenyang University of Technology No.58 South Xinghua Street, Tiexi Dist. Shenyang, 110023, P.R.China

*Contact email: wlss198089@sohu.com, wangxd2007@163.com

Abstract

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.

Keywords: Chaos divided-interval particle swarm optimization

Published: 2008-08-29
Modified: 2011-07-10

: http://dx.doi.org/10.4108/ICST.BIONETICS2007.2337