Because of the randomness of wind power and photovoltaic(PV)output of new energy bases,the problem of peak regulation capability and voltage stability of ultra-high voltage direct current(UHVDC)transmission lines,we p...Because of the randomness of wind power and photovoltaic(PV)output of new energy bases,the problem of peak regulation capability and voltage stability of ultra-high voltage direct current(UHVDC)transmission lines,we proposed an optimum allocation method of installed capacity of the solar-thermal power station based on chance constrained programming in this work.Firstly,we established the uncertainty model of wind power and PV based on the chance constrained planning theory.Then we used the K-medoids clusteringmethod to cluster the scenarios considering the actual operation scenarios throughout the year.Secondly,we established the optimal configuration model based on the objective function of the strongest transient voltage stability and the lowest overall cost of operation.Finally,by quantitative analysis of actual wind power and photovoltaic new energy base,this work verified the feasibility of the proposed method.As a result of the simulations,we found that using the optimal configuration method of solar-thermal power stations could ensure an accurate allocation of installed capacity.When the installed capacity of the solar-thermal power station is 1×106 kW,the transient voltage recovery index(TVRI)is 0.359,which has a strong voltage support capacity for the system.Based on the results of this work,the optimal configuration of the installed capacity of the solar-thermal power plant can improve peak shaving performance,transient voltage support capability,and new energy consumption while satisfying the Direct Current(DC)outgoing transmission premise.展开更多
Selecting a cost optimum subset of discrete-value dispersion compensation modules (DV-DCMs) subject to maximum module count from an available set of DV-DCMs is a NP-hard problem. We derive a novel dynamic programming ...Selecting a cost optimum subset of discrete-value dispersion compensation modules (DV-DCMs) subject to maximum module count from an available set of DV-DCMs is a NP-hard problem. We derive a novel dynamic programming algorithm with pseudo-polynomial time bound and show that DV-DCM cost re-scaling can improve the running time.展开更多
基金funded by Major Science and Technology Projects in Gansu Province(19ZD2GA003).
文摘Because of the randomness of wind power and photovoltaic(PV)output of new energy bases,the problem of peak regulation capability and voltage stability of ultra-high voltage direct current(UHVDC)transmission lines,we proposed an optimum allocation method of installed capacity of the solar-thermal power station based on chance constrained programming in this work.Firstly,we established the uncertainty model of wind power and PV based on the chance constrained planning theory.Then we used the K-medoids clusteringmethod to cluster the scenarios considering the actual operation scenarios throughout the year.Secondly,we established the optimal configuration model based on the objective function of the strongest transient voltage stability and the lowest overall cost of operation.Finally,by quantitative analysis of actual wind power and photovoltaic new energy base,this work verified the feasibility of the proposed method.As a result of the simulations,we found that using the optimal configuration method of solar-thermal power stations could ensure an accurate allocation of installed capacity.When the installed capacity of the solar-thermal power station is 1×106 kW,the transient voltage recovery index(TVRI)is 0.359,which has a strong voltage support capacity for the system.Based on the results of this work,the optimal configuration of the installed capacity of the solar-thermal power plant can improve peak shaving performance,transient voltage support capability,and new energy consumption while satisfying the Direct Current(DC)outgoing transmission premise.
文摘Selecting a cost optimum subset of discrete-value dispersion compensation modules (DV-DCMs) subject to maximum module count from an available set of DV-DCMs is a NP-hard problem. We derive a novel dynamic programming algorithm with pseudo-polynomial time bound and show that DV-DCM cost re-scaling can improve the running time.
