Research Of The Decision Methods For Power Transmission Network Optimal Planning

The transmission network expansion planning is an optimization problem with highly combination, because of the large number of reinforcement possibilities. The planning can be classified into two types: static expansion planning and dynamic expansion planning. Each of them can be classified also: general planning and planning under special constraints. For static expansion planning, two-step method?has been used to solve this problem. The first step is called ower-cost method? A set of very economical lines are chosen at this step. And many uneconomical lines are discarded from the selectable lines?collection. The second step is called ethod of successive and backward deduction? It can get results from a lesser new lines?collection. For dynamic expansion planning, the seudodynamic matching method between critical feasible configurations of each stage(PMM)?is used. The matching calculation of critical feasible configurations are used to meet the concordance of critical feasible configurations between all stages. To cope with different situations, the power transmission network ?1? limited "N-1 ?" and ?N-expansion planning are presented. The solutions can satist the "N-1" limited "N-1" and "N-1 safety" constraints. safety adjustment is equal to unity fault checkout. Limited N-1?safety adjustment is limited in a set of lines chosen by user. Satisfuing "N-?" safety checkout means that the network is still safety after cutting some lines chosen by user together. Some problems confronted by the author to realize the ideas on personal computer has been discussed in this thesis. Seven typical case studies has been presented and discussed to check the program.