检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曹茜 于志勇 荆世博 李忠政 王威[2] CAO Qian;YU Zhi-yong;JING Shi-bo;LI Zhong-zheng;WANG Wei(Economic Research Institute,State Grid Xinjiang Electric Power Company,Urumqi 830002 China;Shandong University of Science and Technology Intelligent Equipment College,Taian 271019 China)
机构地区:[1]国网新疆电力有限公司经济技术研究院,新疆乌鲁木齐830002 [2]山东科技大学智能装备学院,山东泰安271019
出 处:《自动化技术与应用》2024年第7期79-83,共5页Techniques of Automation and Applications
基 金:国网新疆电力有限公司科技项目(SGXJJY00SJJS2100028)。
摘 要:为提高配电网运行的经济性、可靠性,提出基于改进和声搜索算法的配电网智能规划方法。采用线性潮流计算模式分析配电网当前负荷数据变化状态,以负荷数据作为配电网多目标规划基础,采用网损、开关动作次数最小化、电压平稳定最大化作为目标函数设计配电网多目标智能规划模型,使用改进和声算法以模型进行求解,得到最优配电网多目标智能规划方案。测试结果表明,所提方法可准确计算配电网当前电压幅值与电压相角数据,配电网无功优化容量补偿后,网损与开关动作次数均减小,电压平稳定得以保证。In order to improve the economy and reliability of distribution network operation,an intelligent distribution network planning method based on improved harmony search algorithm is proposed.The linear power flow calculation mode is used to analyze the current load data change state of the distribution network.Taking the load data as the multi-objective planning basis of the distribution network,the multi-objective intelligent planning model of the distribution network is designed with the minimization of network loss,switching action times and the maximization of voltage stability as the objective function.The improved harmonic algorithm is used to solve the model,and the optimal multi-objective intelligent planning scheme of the distribution network is obtained.The test results show that,this method can accurately calculate the current voltage amplitude and voltage phase angle data of distribution network.After the reactive power optimization capacity compensation of distribution network,the network loss and switching action times are reduced,and the voltage stability is guaranteed.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.22.42.249