检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:徐文彬 马立新[1] XU Wenbin;MA Lixin(School of Oplical-Electrical and Computer Engineering, University of Shanghai forScience and Technology, Shanghai 200093, Chin)
机构地区:[1]上海理工大学光电信息与计算机工程学院,上海200093
出 处:《电力科学与工程》2018年第4期35-40,共6页Electric Power Science and Engineering
基 金:上海市张江国家自主创新重点项目(201310-PI-B2-008)
摘 要:随着分布式新能源的接入,电动汽车等随机负荷的广泛应用,如何进行配电网重构是系统面临的重要课题。考虑到风力光伏发电以及电动汽车等随机负荷,同时在满足电力系统安全稳定运行的条件下,以配网运行最优成本为目标,确定最优经济性的开关组合方案。针对配电网重构这一复杂的非线性组合优化问题,提出了一种改进的混沌粒子群优化(CPSO)算法。通过建模及仿真计算,在IEEE33节点系统中对比粒子群算法,验证了在配电网动态分时重构问题中,优化了网络结构,得到了最佳效益,具有较好的实际应用和理论指导意义。With the widespread access of distributed new energy and the application of random loads such as electric vehicles,how to reconfigure the distribution network becomes an important issue for the power system. Taking into account the random load of wind photovoltaic power generation and electric vehicles,and ensuring the safe and stable operation of the power system,the optimal economical switch combination scheme is determined to optimize the cost of distribution network operation. For the complex nonlinear optimization problem of distribution network reconfiguration,an improved chaotic particle swarm optimization( CPSO) algorithm is proposed. Through modeling and simulation and by comparing the comparative particle swarm algorithm in the IEEE33 node system,our algorithm is then verified. In the dynamic time-sharing reconstruction problem of the distribution network,by using the proposed algorithm,the network structure is optimized,and the best benefit is obtained. And it is of a good prospect for practical application and significance for theory guiding.
关 键 词:配电网重构 分布式能源 随机负荷 蒙特卡洛模拟 混沌粒子群算法
分 类 号:TM731[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.185