Day-ahead Voltage-stability-constrained Network Topology Optimization with Uncertainties

A day-ahead voltage-stability-constrained network topology optimization(DVNTO)problem is proposed to find the day-ahead topology schemes with the minimum number of operations(including line switching and bus-bar splitting)while ensuring the sufficient hourly voltage stability margin and the engineering operation requirement of power systems.The AC continuation power flow and the uncertainty from both renewable energy sources and loads are incorporated into the formulation.The proposed DVNTO problem is a stochastic,largescale,nonlinear integer programming problem.To solve it tractably,a tailored three-stage solution methodology,including a scenario generation and reduction stage,a dynamic period partition stage,and a topology identification stage,is presented.First,to address the challenges posed by uncertainties,a novel problem-specified scenario reduction process is proposed to obtain the representative scenarios.Then,to obtain the minimum number of necessary operations to alter the network topologies for the next 24-hour horizon,a dynamic period partition strategy is presented to partition the hours into several periods according to the hourly voltage information based on the voltage stability problem.Finally,a topology identification stage is performed to identify the final network topology scheme.The effectiveness and robustness of the proposed three-stage solution methodology under different loading conditions and the effectiveness of the proposed partition strategy are evaluated on the IEEE 118-bus and 3120-bus power systems.

Short-term Transmission Maintenance Scheduling Considering Network Topology Optimization

With the increasing penetration of renewable energy sources,transmission maintenance scheduling(TMS)will have a larger impact on the accommodation of wind power.Meanwhile,the more flexible transmission network topology owing to the network topology optimization(NTO)technique can ensure the secure and economic operation of power systems.This paper proposes a TMS model considering NTO to decrease the wind curtailment without adding control devices.The problem is formulated as a two-stage stochastic mixed-integer programming model.The first stage arranges the maintenance periods of transmission lines.The second stage optimizes the transmission network topology to minimize the maintenance cost and system operation in different wind speed scenarios.The proposed model cannot be solved efficiently with off-theshelf solvers due to the binary variables in both stages.Therefore,the progressive hedging algorithm is applied.The results on the modified IEEE RTS-79 system show that the proposed method can reduce the negative impact of transmission maintenance on wind accommodation by 65.49%,which proves its effectiveness.

Optimization of a Network Topology Generation Algorithm Based on Spatial Information Network

Spatial information network(SIN)is a network with high speed and periodicity of node operation.In recent days,China will build a complete asteroid monitoring and warning system and a near-Earth asteroid defense system.This requires launching more low-Earth orbit satellites.In order to adapt to the increase in the number of near-Earth satellites,the dynamic optimization of space informa-tion network topology between satellites will have research significance.Consid-ering the visibility of satellite networking,the connectivity of satellite nodes,and the number of links connected to the whole network,with the goal of minimizing the end-to-end delay between satellite nodes in the network as the optimization goal,a network topology optimization model that meets multiple constraints is constructed,and the model is solved using greedy algorithm and simulated anneal-ing algorithm.In the process of simulated annealing,the networkflow algorithm is innovatively proposed for neighborhood solution.Experiments show that the simulated annealing hybrid neighborhood algorithm is significantly better than the simulated annealing random neighborhood algorithm.