欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为克服粒子群优化算法容易陷入局部最优、后期收敛慢等缺点,提出了一种修正的混沌粒子群优化算法.该算法通过修正粒子群迭代的行动策略,并引入遍历性较强的Tent混沌局部搜索机制,可以增强粒子的全局搜索能力,提高优化算法的全局寻优性能.将修正的混沌粒子群算法分别应用于6机组和15机组电力系统中求解经济负荷分配,在考虑系统网损和机组运行约束条件的情况下进行仿真实验.仿真结果表明：该算法用于求解高维、非凸、不连续等非线性复杂约束条件的电力系统经济负荷分配问题上,有着较快的收敛速度和较强的全局寻优能力.最后,通过与其它智能算法比较,验证了算法的有效性和优越性.
英文摘要：
A modified particle swarm optimization algorithm was presented in order to overcome the weakness of the particle swarm algorithm which has slown convergence rate and is easily trapped in local optimum. The global opti- mal performance of optimization algorithm was improved by revising the iterative strategy of the particle swarm and introducing the local, search mechanism by Tent chaotic map which has strong ergodicity to enhance the global searching of particles. The modified chaotic particle swarm optimization was applied to the simulation in economic load dispatch of 6 unit and 15unit power system respectively, considering the transmission network losses and con- strained conditions of the units operation. The results of the simulation show that the algorithm has a faster constrin- gency rate and better global optimization in solving the economic load dispatch problems in power systems, which were of complex .constraints such as ： high dimension, nonlinear, non-convex, and discrete characteristics etc. Finally, it proves the effectiveness and superiority of this algorithm compared with the other intelligence algorithms.
同期刊论文项目
同项目期刊论文
Fault-tolerant design of a limited universalfruit-picking end-effector based on visoin positioning e
期刊信息
位置：