摘要
提出了一个中压配电网联络线优化的算法。在满足变电站以及变压器水平Ｎ—１准则前提下，该方法尽量减少专用联络干线数量以及变压器、线路备用容量，求得使空载联络线固定投资最小的联络方案，并且易于计算机实现。其核心思想为：每个变电站充分利用所有相邻站为备用，网络中各馈线树都有可能承担联络功能，故障时馈线树间一对一联络。
An algorithm for tie hues planning of power distribution systems, which can be realized easily by computers, is presented. In the algorithm, while N - 1 reliability constraints are satisfied, the number of exclusive tie lines, reserve capacities of feeders and transformers, and total cost of tie lines are minimized. The keys of the algorithm are as follows: each substation makes good use of the reserve capacities of all the substations around it; almost all feeder trees can work as tie lines; and the feeder trees will be tied in a one-to-one manner in an emergency.
出处
《电力系统自动化》
EI
CSCD
北大核心
1999年第15期10-14,36,共6页
Automation of Electric Power Systems
关键词
配电网规划
联络线
可靠性
启发式算法
遗传算法
power distribution planning tie lines reliability heuristic method genetic algorithm
