摘要
针对配电网故障恢复的经济性和实用性,建立了计及失负荷最小、网损最小以及开关操作次数最少的多目标配电网故障恢复的数学模型。对于配电网故障恢复中产生的不可行解,研究了一种基于邻接矩阵的供电孤岛的验算方法,提出了随机生成树策略。最后应用改进的膜计算算法对IEEE33节点系统进行了故障恢复重构,给出了文中方法与遗传算法的比较,重构结果显示了所提算法的正确性和可行性。
In order to minimize the loss of load,network loss and number of switching operation,a multi-objective mathematical model of distribution network fault recovery is set up to enhance the cost-effectiveness and practicality.To deal with the infeasible solutions generated by distribution network fault restoration,a method of the power island checking based on the adjacency matrix is studied and random spanning tree strategy is proposed.Finally,the improved membrane algorithm is applied to the IEEE33 node system＇s restorational reconstruction.The results are compared with those derived from genetic algorithm,which validates the accuracy and feasibility of the presented method.
出处
《电力系统及其自动化学报》
CSCD
北大核心
2014年第6期37-41,46,共6页
Proceedings of the CSU-EPSA
基金
国家自然科学基金项目(51007006)
四川省教育厅重点项目(11za002)
四川省科技厅基础应用项目(2009JY0139)
西华大学2009人才培养项目(R0920906)
关键词
膜计算
供电孤岛
配电网
故障恢复
membrane computing
power island
distribution network
fault restoratio
