检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:谭笑 王主丁[1] 舒东胜 孙杰 TAN Xiao;WANG Zhuding;SHU Dongsheng;SUN Jie(School of Electrical Engineering,Chongqing University,Chongqing 400044,China;State Grid Jingmen Power Supply Company,Jingmen 448000,China;State Grid Xi'an Power Supply Company,Xi'an 710048,China)
机构地区:[1]重庆大学电气工程学院,重庆市400044 [2]国网荆门供电公司,湖北省荆门市448000 [3]国网西安供电公司,陕西省西安市710048
出 处:《电力系统自动化》2020年第20期62-70,共9页Automation of Electric Power Systems
摘 要:随着分布式电源渗透率的提高,分布式电源对配电网规划方法和结果的影响研究更具现实意义。采用概率规划方法,建立了涉及分布式电源的变电站个数及馈线条数优化简化模型,模型目标为变电站和中压线路的相关总费用最小,并考虑了线路的容量约束;提出了中压主干线与分支线长度的近似计算模型,并考虑了负荷变化、分布式电源随机性和线路负荷转供率对停电时间和停电费用的影响。基于模型求解获得的变电站优化个数、馈线优化条数和最小总费用,定义了相应的三大类置信变量。算例表明了概率规划对于变电站个数和馈线条数选择的意义以及分布式电源的替代作用。With the increase of distributed generator(DG)penetration rates,the research on the impact of DG on the methods and results of distribution network planning has become more and more practical.A simplified optimization model for the number of substations and feeders with DGs is established by using a probabilistic planning method.The objective of the model is to minimize the related total cost of substations and medium-voltage lines,and the line capacity constraints are considered.An approximate calculation model of the length of medium-voltage trunk lines and branch lines is proposed,and the influence of load variation,DG randomness and line load transfer rate on the outage time and outage cost is considered.Based on the minimum total cost and the optimized number of substations and feeders obtained by model solution,three categories of credit variables are defined.The examples show the significance of probabilistic planning for the selection of the number of substations and feeders,and the substitution effects of DGs.
关 键 词:变电站规划 概率规划 分布式电源 置信度 变电站置信个数 馈线置信条数 置信费用
分 类 号:TM715[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3