基于并行禁忌搜索算法的配电网重构  

Distribution Network Reconfiguration Based on Parallel Tabu Search Algorithm

作　　者：武晓朦 李新桥 WU Xiaomeng;LI Xinqiao(Key Laboratory of Shaanxi Province for Gas-Oil Logging Technology/College of Electronic Engineering,Xi’an Shiyou University,Xi’an,Shaanxi 710065,China;Weinan Power Supply Company,State Grid Corporation of China,Weinan,Shaanxi 714000,China)

机构地区：[1]西安石油大学电子工程学院/陕西省油气井测控技术重点实验室,陕西西安710065 [2]国网渭南供电公司,陕西渭南714000

出　　处：《西安石油大学学报（自然科学版）》2021年第2期122-126,共5页Journal of Xi’an Shiyou University（Natural Science Edition）

基　　金：陕西省自然科学基础研究计划资助项目(2020JM-542);陕西省科技计划基础研究项目(2021JM-404)。

摘　　要：针对配电网重构过程中编码复杂和计算效率低等问题,采用并行禁忌搜索算法通过设置多个禁忌长度对解空间同时进行搜索,提高了搜索效率。在设计邻域结构时,采用N维坐标系的编码策略对网络中开关进行编码,其中坐标系的维数对应网络中联络开关的个数,在每维坐标中针对每个状态量分别进行加1和减1操作,对应网络拓扑图中的开关的移动操作,在该种邻域结构下进行寻优并得到全局最优解。最后采用2个IEEE经典算例进行仿真,验证了该算法的可行性。In order to solving the problems of complex coding and low computing efficiency during the reconstruction process of distribution network,a parallel tabu search algorithm is adopted,which improves the search efficiency by setting multiple tabu lengths to search the solution space simultaneously.In the design of the neighborhood structure,the coding of the switches in the distribution network is finished by the coding strategy of the N-dimensional coordinate system,where the dimension number of coordinate system corresponds to the number of contact switches in the network.In each dimension coordinate,the operations of adding 1 and subtracting 1 for each state quantity respectively correspond to the movement of switches in the network topology graph,and the global optimal solution is obtained under this kind of neighborhood structure.Finally,two IEEE classic examples are used to verify the feasibility and effectivenessof the algorithm.

关 键 词：配电网重构 并行禁忌搜索算法 N维坐标系 

分 类 号：TM727[电气工程—电力系统及自动化]