CAJ | 학술논문

为高效求解复杂的非凸、非线性电力系统经济负荷分配问题，提出了一种混沌迭代粒子群算法：粒子群算法的全局搜索能力很强，但易陷入局部最优，混沌的遍历性特性可有效抑制早熟现象。将最优迭代因子引入粒子群算法，对经粒子群算法搜索后的先验解进行基于一种新Tent映射的混沌变异，并改进算法的迭代策略，以平衡粒子的全局和局部性搜索，避免了早熟收敛。通过6机组、15机组的仿真试验，以及同其他算法仿真结果的比较，验证了本算法良好的收敛性和寻优性。
위고효구해복잡적비철、비선성전력계통경제부하분배문제，제출료일충혼돈질대입자군산법：입자군산법적전국수색능력흔강，단역함입국부최우，혼돈적편력성특성가유효억제조숙현상。장최우질대인자인입입자군산법，대경입자군산법수색후적선험해진행기우일충신Tent영사적혼돈변이，병개진산법적질대책략，이평형입자적전국화국부성수색，피면료조숙수렴。통과6궤조、15궤조적방진시험，이급동기타산법방진결과적비교，험증료본산법량호적수렴성화심우성。
To solve the non-convex and non-linear economic dispatch problem efficiently,a chaotic iteration particle swarm optimization algorithm is presented.In the global research of particle swarm optimization and lo-cal optimum,ergodicity of chaos can effectively restrain premature.To balance the exploration and exploitation abilities and avoid being trapped into local optimal,a new index,called iteration best,is incorporated into particle swarm optimization,and chaotic mutation with a new Tent map imported can make local search within the prior knowledge,a new strategy is proposed in iteration strategy.The algorithm is validated for two test sys-tems consisting of 6 and 15 generators.Compared with other methods in this literature,the experimental resul demonstrates the high convergency and effectiveness of proposed algorithm.