摘要
针对配电网重构问题,提出了一种以有功损耗最小为优化目标的、全新的二进制纵横交叉算法(binary crisscross optimization,BCSO)。该算法在纵横交叉算法(crisscross optimization,CSO)的基础上进行了二进制化研究,解决了二进制优化的难题;同时继承了纵横交叉算法的双交叉机制,其中横向交叉机制增强了全局搜索能力,提高了全局收敛速度,纵向交叉机制保持了种群的多样性,避免陷入局部最优;通过横、纵交叉机制的配合能够快速寻找到全局最优解。最后,在IEEE 33节点和美国PG&E69节点系统上对二进制纵横交叉算法进行仿真试验,试验结果分析表明:BCSO对解决配电网重构具有可行性,同时具有收敛速度快、全局寻优能力强以及良好稳定性的优点。
In allusion to distribution network reconfiguration, taking minimized network loss as objective function, a binary crisscross optimization algorithm（BCSO） was proposed. The proposed algorithm is based on novel crisscross optimization algorithm（CSO） with advantage in solution accuracy and convergence speed by adopting dual search mechanism including horizontal and vertical crossovers. The former has powerful global search ability while the latter keeps swarm diversity and avoids local optima problem. However, CSO is more appropriate for solving continuous problems. To handle binary optimization problem, a discrete method applied to CSO was put forward. Finally, the proposed algorithm was simulated on standard IEEE and PG＆E systems with 33 and 69 nodes respectively. Simulation results demonstrated feasibility of BCSO to solve distribution network reconfiguration problem. Compared with other methods, the proposed algorithm has significant advantage in terms of global search ability, convergence speed and robustness.
出处
《电网技术》
EI
CSCD
北大核心
2016年第1期270-275,共6页
Power System Technology
关键词
配电网重构
二进制纵横交叉算法
纵横交叉算法
全局寻优
distribution network reconfiguration
binary crisscross optimization algorithm
crisscross optimization algorithm
global optimization.
