Parallel simulated annealing applied to long term transmission network expansion planning

The simulated annealing optimization technique has been successfully applied to a number of electrical engineering problems, including transmission system expansion planning. The method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Moreover, it has the ability to provide solutions arbitrarily close to an optimum (i.e. it is asymptotically convergent) as the cooling process slows down. The drawback of the approach is the computational burden: finding optimal solutions may be extremely expensive in some cases. This paper presents a Parallel Simulated Annealing, PSA, algorithm for solving the long term transmission network expansion planning problem. A strategy that does not affect the basic convergence properties of the Sequential Simulated Annealing algorithm have been implementeded and tested. The paper investigates the conditions under which the parallel algorithm is most efficient. The parallel implementations have been tested on three example networks: a small 6-bus network, and two complex real-life networks. Excellent results are reported in the test section of the paper: in addition to reductions in computing times, the Parallel Simulated Annealing algorithm proposed in the paper has shown significant improvements in solution quality for the largest of the test networks.

Allocation of the costs of transmission losses

An analysis of the performance of six major methods of loss allocation for generators and demands was conducted, based on pro-rata (two), on incremental factors (two), on proportional sharing (PS) (one), and on electric circuit theory (one). Using relatively simple examples which can easily be checked, the advantages and disadvantages of each were ascertained and the results confirmed using a larger sample system (IEEE-118). The discussion considers the location and size of generators and demands, as well as the merits of the location of these agents for each configuration based on an analysis of the effect of various network modifications. Furthermore, an application in the South-Southeastern Brazilian Systems is performed. Conclusions and recommendations are presented. (C) 2004 Elsevier B.V. All rights reserved.

Incorporating voltage/reactive representation to short-term generation scheduling models

This paper proposes a methodology to incorporate voltage/reactive representation to Short Term Generation Scheduling (STGS) models, which is based on active/reactive decoupling characteristics of power systems. In such approach STGS is decoupled in both Active (AGS) and Reactive (RGS) Generation Scheduling models. AGS model establishes an initial active generation scheduling through a traditional dispatch model. The scheduling proposed by AGS model is evaluated from the voltage/reactive points of view, through the proposed RGS model. RGS is formulated as a sequence of T nonlinear OPF problems, solved separately but taking into account load tracking between consecutive time intervals. This approach considerably reduces computational effort to perform the reactive analysis of the RGS problem as a whole. When necessary, RGS model is capable to propose active generation redispatches, such that critical reactive problems (in which all reactive variables have been insufficient to control the reactive problems) can be overcome. The formulation and solution methodology proposed are evaluated in the IEEE30 system in two case studies. These studies show that the methodology is robust enough to incorporate reactive aspects to STGS problem.

Optimal capacitor placement in radial distribution networks

The capacitor placement (replacement) problem for radial distribution networks determines capacitor types, sizes, locations and control schemes. Optimal capacitor placement is a hard combinatorial problem that can be formulated as a mixed integer nonlinear program. Since this is a NP complete problem (Non Polynomial time) the solution approach uses a combinatorial search algorithm. The paper proposes a hybrid method drawn upon the Tabu Search approach, extended with features taken from other combinatorial approaches such as genetic algorithms and simulated annealing, and from practical heuristic approaches. The proposed method has been tested in a range of networks available in the literature with superior results regarding both quality and cost of solutions.

An alternative modal representation of a symmetrical nontransposed three-phase transmission line

The objective of this letter is to propose an alternative modal representation of a nontransposed three-phase transmission line with a vertical symmetry plane by using two transformation matrices. Initially, Clarke's matrix is used to separate the line into components a, 0, and zero. Because a and zero components are not exact modes, they can be considered as being a two-phase line that will be decomposed in its exact modes by using a 2 x 2 modal transformation matrix. This letter will describe the characteristics of the two-phase line before mentioned. This modal representation is applied to decouple a nontransposed three-phase transmission line with a vertical symmetry plane whose nominal voltage is 440 kV.

An approach of optimal sensitivity applied in the tertiary loop of the automatic generation control

This paper proposes an approach of optimal sensitivity applied in the tertiary loop of the automatic generation control. The approach is based on the theorem of non-linear perturbation. From an optimal operation point obtained by an optimal power flow a new optimal operation point is directly determined after a perturbation, i.e., without the necessity of an iterative process. This new optimal operation point satisfies the constraints of the problem for small perturbation in the loads. The participation factors and the voltage set point of the automatic voltage regulators (AVR) of the generators are determined by the technique of optimal sensitivity, considering the effects of the active power losses minimization and the network constraints. The participation factors and voltage set point of the generators are supplied directly to a computational program of dynamic simulation of the automatic generation control, named by power sensitivity mode. Test results are presented to show the good performance of this approach. (C) 2008 Elsevier B.V. All rights reserved.

Optimal Contract Pricing of Distributed Generation in Distribution Networks

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A cooperative game theory analysis for transmission loss allocation

This paper presents an analysis and discussion, based on cooperative game theory, for the allocation of the cost of losses to generators and demands in transmission systems. We construct a cooperative game theory model in which the players are represented by equivalent bilateral exchanges and we search for a unique loss allocation solution, the Core. Other solution concepts, such as the Shapley Value, the Bilateral Shapley Value and the Kernel are also explored. Our main objective is to illustrate why is not possible to find an optimal solution for allocating the cost of losses to the users of a network. Results and relevant conclusions are presented for a 4-bus system and a 14-bus system. (c) 2007 Elsevier B.V. All rights reserved.

An overview on network cost allocation methods

This work is devoted to Study and discuss the main methods to solve the network cost allocation problem both for generators and demands. From the presented, compared and discussed methods, the first one is based on power injections, the second deals with proportional sharing factors, the third is based upon Equivalent Bilateral Exchanges, the fourth analyzes the power How sensitivity in relation to the power injected, and the last one is based on Z(bus) network matrix. All the methods are initially illustrated using a 4-bus system. In addition, the IEEE 24-bus RTS system is presented for further comparisons and analysis. Appropriate conclusions are finally drawn. (C) 2008 Elsevier B.V. All rights reserved.