Mistletoes Play Different Roles in a Modular Host-Parasite Network

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Constructive heuristic algorithm for the DC model in network transmission expansion planning

A novel constructive heuristic algorithm to the network expansion planning problem is presented the basic idea comes from Garver's work applied to the transportation model, nevertheless the proposed algorithm is for the DC model. Tests results with most known systems in the literature are carried out to show the efficiency of the method.

Fault analysis in four-wire distribution networks

The neutral wire in most existing power flow and fault analysis software is usually merged into phase wires using Kron's reduction method. In some applications, such as fault analysis, fault location, power quality studies, safety analysis, loss analysis etc., knowledge of the neutral wire and ground currents and voltages could be of particular interest. A general short-circuit analysis algorithm for three-phase four-wire distribution networks, based on the hybrid compensation method, is presented. In this novel use of the technique, the neutral wire and assumed ground conductor are explicitly represented. A generalised fault analysis method is applied to the distribution network for conditions with and without embedded generation. Results obtained from several case studies on medium- and low-voltage test networks with unbalanced loads, for isolated and multi-grounded neutral scenarios, are presented and discussed. Simulation results show the effects of neutrals and system grounding on the operation of the distribution feeders.

Transmission network expansion planning with security constraints

A mathematical model and a methodology to solve the transmission network expansion planning problem with security constraints are presented. The methodology allows one to find an optimal and reliable transmission network expansion plan using a DC model to represent the electrical network. The security (n-1) criterion is used. The model presented is solved using a genetic algorithm designed to solve the reliable expansion planning in an efficient way. The results obtained for several known systems from literature show the excellent performance of the proposed methodology. A comparative analysis of the results obtained with the proposed methodology is also presented.

Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning

A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.

Specialised branch-and-bound algorithm for transmission network expansion planning

An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.

Efficient linear programming algorithm for the transmission network expansion planning problem

The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.

Power system transmission network expansion planning using AC model

An optimisation technique to solve transmission network expansion planning problem, using the AC model, is presented. This is a very complex mixed integer nonlinear programming problem. A constructive heuristic algorithm aimed at obtaining an excellent quality solution for this problem is presented. An interior point method is employed to solve nonlinear programming problems during the solution steps of the algorithm. Results of the tests, carried out with three electrical energy systems, show the capabilities of the method and also the viability of using the AC model to solve the problem.

Power flow in distribution networks with earth return

The problems of wave propagation and power flow in the distribution network composed of an overhead wire parallel to the surface of the ground have not been satisfactorily solved. While a complete solution of the actual problem is impossible, as it is explained in the famous Carson's paper (1926), the solution of the problem, where the actual earth is replaced by a plane homogenous semi-infinite solid, is of considerable interest. In this paper, a power flow algorithm in distribution networks with earth return, based on backward-forward technique, is discussed. In this novel use of the technique, the ground is explicitly represented. In addition, an iterative method for determining impedance for modelling ground effect in the extended power flow algorithm is suggested. Results obtained from single-wire and three-wire studies using IEEE test networks are presented and discussed. (C) 2003 Elsevier Ltd. All rights reserved.

A new three-phase transformer modeling for three-phase harmonic analysis in distribution systems

This work presents a new three-phase transformer modeling suitable for simulations in Pspice environment, which until now represents the electrical characteristics of a real transformer. It is proposed the model comparison to a three-phase transformer modeling present in EMTP - ATP program, which includes the electrical and magnetic characteristics. In addition, a set including non-linear loads and a real three-phase transformer was prepared in order to compare and validate the results of this new proposed model. The three-phase Pspice transformer modeling, different from the conventional one using inductance coupling, is remarkable for its simplicity and ease in simulation process, since it uses available voltage and current sources present in Pspice program, enabling simulations of three-phase network system including the most common configuration, three wires in the primary side and four wires in the secondary side (three-phases and neutral). Finally, the proposed modeling becomes a powerful tool for three-phase network simulations due to its simplicity and accuracy, able to simulate and analyze harmonic flow in three-phase systems under balanced and unbalanced conditions.

Analysis of heuristic algorithms for the transportation model in static and multistage planning in network expansion systems

The usefulness of the application of heuristic algorithms in the transportation model, first proposed by Garver, is analysed in relation to planning for the expansion of transmission systems. The formulation of the mathematical model and the solution techniques proposed in the specialised literature are analysed in detail. Starting with the constructive heuristic algorithm proposed by Garver, an extension is made to the problem of multistage planning for transmission systems. The quality of the solutions found by heuristic algorithms for the transportation model is analysed, as are applications in problems of planning transmission systems.

Power flow in four-wire distribution networks - General approach

The neutral wire in most power flow software is usually merged into phase wires using Kron's reduction. Since the neutral wire and the ground are not explicitly represented, neutral wire and ground currents and voltages remain unknown. In some applications, like power quality and safety analyses, loss analysis, etc., knowing the neutral wire and ground currents and voltages could be of special interest. In this paper, a general power flow algorithm for three-phase four-wire radial distribution networks, considering neutral grounding, based on backward-forward technique, is proposed. In this novel use of the technique, both the neutral wire and ground are explicitly represented. A problem of three-phase distribution system with earth return, as a special case of a four-wire network, is also elucidated. Results obtained from several case studies using medium- and low-voltage test feeders with unbalanced load, are presented and discussed.

Test systems and mathematical models for transmission network expansion planning

The data of four networks that can be used in carrying out comparative studies with methods for transmission network expansion planning are given. These networks are of various types and different levels of complexity. The main mathematical formulations used in transmission expansion studies-transportation models, hybrid models, DC power flow models, and disjunctive models are also summarised and compared. The main algorithm families are reviewed-both analytical, combinatorial and heuristic approaches. Optimal solutions are not yet known for some of the four networks when more accurate models (e.g. The DC model) are used to represent the power flow equations-the state of the art with regard to this is also summarised. This should serve as a challenge to authors searching for new, more efficient methods.

A Top-Down Approach for Distribution Loss Evaluation

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

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.