Identification of Wheeling Paths and MW- Redispatching for Transmission Loading Relief by Extended Sensitivity Analysis

2008 
This paper proposes the practical method for MWredispatching and identifying wheeling paths taking transmission line constraint into account based on an extended sensitivity analysis. Because the decision for the MWdispatch/ scheduling is requested to be very fast, the method proposed here brings the efficiency of computations by utilizing the existing practical approaches for obtaining the optimal solution. So, in this paper, a method of MWredispatching by using the practical sensitivity-based technique, which is used for identifying the wheeling paths in overloaded states is proposed. By the proposed method, the MWredispatching problem without using OPF solutions can be solved. On the other hand, in deregulated electricity markets, appropriate and efficient levying of the wheeling rate is one of the critical issues. It is obvious that if wheeling paths from suppliers to customers could be identified appropriately, it becomes possible to set up the proper and fair wheeling rate according to the degree of power flow in each wheeling path. Until now, we have reported that it is possible to identify paths of the wheeling in any situation effectively by making use of the sensitivities calculated by an extended sensitivity analysis. In the previous research based on the sensitivity analysis, constrains on transmission lines have not been taken into consideration. Then, in this paper, the method of identifying wheeling paths is presented taking transmission line constrains into account based on an extended sensitivity analysis. In order to show the validity of the proposed method, a series of simulations on the IEEE 30-bus test system are conducted and numerical results are demonstrated. Key-Words: Wheeling path, Sensitivity analysis, Wheeling rate, Congestion management, Deregulation, Electricity market
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    19
    References
    0
    Citations
    NaN
    KQI
    []