基于混沌序列的自适应粒子群优化算法  

Adapting Particle Swarm Optimization Algorithm Based on Chaotic Series

作　　者：侯力[1] 王振雷[1] 钱锋[1] 

机构地区：[1]华东理工大学化学工程联合国家重点实验室,上海200237

出　　处：《计算机工程》2008年第18期210-211,214,共3页Computer Engineering

基　　金：国家"973"计划基金资助项目(2002CB3122000);国家"863"计划基金资助项目(20060104Z1081);国家杰出青年科学基金资助项目(60625302);上海市自然科学基金资助项目(05ZR14038);上海市科委重大基础研究基金资助项目(05DJ14002)

摘　　要：提出一种改进粒子群局部搜索能力的自适应优化算法。通过大量仿真试验,考察粒子平均速度和收敛性之间的关系,给出一种新的自适应调整权重策略。以粒子平均速度作为反馈信息,动态调整权重因子,控制粒子速度并使其沿理想速度曲线下降。在搜索过程中引入混沌序列以改进算法的局部搜索能力。对经典函数的测试结果表明,改进的混合算法通过微粒自适应更新机制确保了全局搜索性能和局部搜索性能的动态平衡,在稳定性和精度上均优于普通PSO算法。This paper proposes an improved adapting algorithm to enhance the local search ability of particle swarm. The relationship between swarm average velocity and convergence is studied through numerical simulations. A novel inertia weight adjusting method is proposed. In this algorithm, inertia weight is adjusted dynamically according to the absolute average velocity which is the feedback information, and the average velocity is controlled to follow a given ideal velocity curve. Chaotic series is introduced in search to improve the local search ability of the algorithm. The experimental results of classic functions show that the improved hybrid method keeps the balance between the global search and the local search, and has great advantage of convergence property and robustness compared with PSO algorithm.

关 键 词：粒子群算法 优化 混沌序列 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]