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.

关键词： Chaos particle swarm optimization divided-interval

作者: Xu Qiushi Wang Xiangdong Lin Zhen Wang Lei Wang Junfeng

会议类型: 国际会议

会议名称: The International Conference Information Computing and Automation(2007国际信息计算与自动化会议)

会议地点: 成都

会议语种:英文

页码: 243-246

在线出版日期: 2007-12-19（万方平台首次上网日期，不代表论文的发表时间）