The Interval Minimum Load Cutting Problem in the Process of Transmission Network Expansion Planning Considering Uncertainty in Demand

This paper studies the minimum load cutting problem existing in the process of transmission network expansion planning when load is uncertain and expressed in interval number. The interval most minimum load cutting model is established and can be solved to get the maximum value of the minimum load cutting number when load is interval uncertain. The solution can be used to evaluate the safety of the planning schemes under interval uncertainty and guide the new plans´ making under interval load. The load values in the optimal solution of this problem have been proved to be at their lower or upper limits. Two different algorithms are proposed to solve this model. One is better in being capable of getting global optimal solution, while the other is better in calculation speed. Both of them are compared with two traditional methods that are generally used to evaluate the system´s safety under uncertainty in aspects of precision and speed. This evaluation method is applied to the greedy randomized adaptive search procedure algorithm to solve the transmission expansion planning problem under interval load. The case results show the rightness and validity of the model and algorithms proposed in this paper.