Search

This paper presents an optimization framework for sequential reconfiguration using an assortment of switching devices and repair process in distribution system restoration. Compared to existing studies, this paper considers types, capabilities and operational limits of different switching devices, making it applicable in practice. We develop a novel multi-phase method to find the optimal sequential operation of various switching devices and repair faulted areas. We consider circuit breakers, reclosers, sectionalizers, load breaker switches, and fuses. The switching operation problem is decomposed into two mixed-integer linear programming (MILP) subproblems. The first subproblem determines the optimal network topology and estimates the number of steps to reach that topology, while the second subproblem generates a sequence of switching operations to coordinate the switches. For repairing the faults, we design an MILP model that dispatches repair crews to clear faults and replace melted fuses. After clearing a fault, we update the topology of the network by generating a new sequence of switching operations, and the process continues until all faults are cleared. To improve the computational efficiency, a network reduction algorithm is developed to group line sections, such that only switchable sections are present in the reduced network. The proposed method is validated on the IEEE 123-bus and 8500-bus systems. [ABSTRACT FROM AUTHOR]

Optimal transmission switching (OTS) optimizes simultaneously the generation dispatch and the topology of a power system. It has been shown that taking some transmission lines out of service can significantly reduce the operating cost of the system while respecting the traditional deterministic N-1 security criterion of operational reliability. However, topology modifications could adversely affect probabilistic security metrics. The operational reliability of a power system can be translated into a cost by multiplying the expected energy not served by the value of lost load. This paper therefore explores whether it is possible to maintain a positive economic balance with OTS when considering not only the cost of generation but also the expected socio-economic cost of disruptions in the supply. This is done in two steps: the computation of an N-1 secure OTS and then the calculation of a probabilistic estimate of the operational reliability of the OTS solution. Based on the results obtained with two test systems, it is shown that OTS tends to significantly degrade probabilistic measures of security. It is thus not obvious that OTS can lead to a positive economic balance, even when N-1 security is enforced. Consequently, a probabilistic security analysis should be performed before implementing an OTS solution. [ABSTRACT FROM AUTHOR]

In this paper, a novel solution method is proposed for the optimal topology control problem in AC framework with N-1 reliability. The resultant new topology of the proposed method is guaranteed to yield a better objective function value than the global solution of the problem with the original topology. In order to prove our statement, semi-definite programming relaxation is formulated to find a lower bound to the objective function value of the problem. The proposed method is favorable for parallelization to increase the computational efficiency, and the parallel computing flowchart is presented. Computational time of the algorithm for IEEE test cases is reported. An in-house power market simulator is developed to simulate a market environment complete with optimal topology control mechanism. Simulations held by participating human subjects are analyzed under the subtitles of the total operating cost, real power losses, and locational marginal price (LMP) variance. A simple example is illustrated to show that the resultant network topology may increase the real power losses while still providing a lower operating system cost than that of the original topology. [ABSTRACT FROM PUBLISHER]

Distribution system reconfiguration (DSR) is a multi-objective, nonlinear problem. This paper introduces a new, fast, nondominated sorting genetic algorithm (FNSGA) for the purpose of solving the DSR problem in normal operation by satisfying all objectives simultaneously with a relatively small number of generations and relatively short computation time. The objectives of the problem are to minimize real power losses and improve the voltage profile and load balancing index with minimum switching operations. Instead of generating several ranks from the nondominated set of solutions, this algorithm deals with only one rank; then the most suitable solution is chosen according to the operator's wishes. If there is no preference and all objectives have the same degree of importance, the best solution is determined by simply considering the sum of the normalized objective values. Also, a guided mutation operation is applied instead of a random one to speed up convergence. Radial system topology is satisfied using graph theory by formulating the branch-bus incidence matrix (BBIM) and checking the rank of each topology. To test the algorithm, it was applied to two widely studied test systems and a real one. The results show the efficiency of this algorithm as compared to other methods in terms of achieving all the goals simultaneously with reasonable population and generation sizes and without using a mutation rate, which is usually problem-dependent. [ABSTRACT FROM PUBLISHER]