Planejamento de Fontes Reativas em Sistemas de Energia Elétrica utilizando a técnica de Decomposição de Benders e o algoritmo de Branch-and-Bound

This paper presents the Benders decomposition technique and Branch and Bound algorithm used in the reactive power planning in electric energy systems. The Benders decomposition separates the planning problem into two subproblems: an investment subproblem (master) and the operation subproblem (slave), which are solved alternately. The operation subproblem is solved using a successive linear programming (SLP) algorithm while the investment subproblem, which is an integer linear programming (ILP) problem with discrete variables, is resolved using a Branch and Bound algorithm especially developed to resolve this type of problem.

Modified barrier method for optimal power flow problem

In this paper is presented a new approach for optimal power flow problem. This approach is based on the modified barrier function and the primal-dual logarithmic barrier method. A Lagrangian function is associated with the modified problem. The first-order necessary conditions for optimality are fulfilled by Newton's method, and by updating the barrier terms. The effectiveness of the proposed approach has been examined by solving the Brazilian 53-bus, IEEE118-bus and IEEE162-bus systems.

A constructive heuristic algorithm to Short Term Transmission Network Expansion Planning

In this paper a method for solving the Short Term Transmission Network Expansion Planning (STTNEP) problem is presented. The STTNEP is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In this work we present a constructive heuristic algorithm to find a solution of the STTNEP of excellent quality. In each step of the algorithm a sensitivity index is used to add a circuit (transmission line or transformer) to the system. This sensitivity index is obtained solving the STTNEP problem considering as a continuous variable the number of circuits to be added (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an interior points method that uses a combination of the multiple predictor corrector and multiple centrality corrections methods, both belonging to the family of higher order interior points method (HOIPM). Tests were carried out using a modified Carver system and the results presented show the good performance of both the constructive heuristic algorithm to solve the STTNEP problem and the HOIPM used in each step.

Defects location in power systems components through a dedicated genetic algorithm

In this work the problem of defects location in power systems is formulated through a binary linear programming (BLP) model based on alarms historical database of control and protection devices from the system control center, sets theory of minimal coverage (AI) and protection philosophy adopted by the electric utility. In this model, circuit breaker operations are compared to their expected states in a strictly mathematical manner. For solving this BLP problem, which presents a great number of decision variables, a dedicated Genetic Algorithm (GA), is proposed. Control parameters of the GA, such as crossing over and mutation rates, population size, iterations number and population diversification, are calibrated in order to obtain efficiency and robustness. Results for a test system found in literature, are presented and discussed. © 2004 IEEE.

Dynamic programming approach for road centerline extraction from digital images

This paper presents a dynamic programming approach for semi-automated road extraction from medium-and high-resolution images. This method is a modified version of a pre-existing dynamic programming method for road extraction from low-resolution images. The basic assumption of this pre-existing method is that roads manifest as lines in low-resolution images (pixel footprint> 2 m) and as such can be modeled and extracted as linear features. On the other hand, roads manifest as ribbon features in medium- and high-resolution images (pixel footprint ≤ 2 m) and, as a result, the focus of road extraction becomes the road centerlines. The original method can not accurately extract road centerlines from medium- and high- resolution images. In view of this, we propose a modification of the merit function of the original approach, which is carried out by a constraint function embedding road edge properties. Experimental results demonstrated the modified algorithm's potential in extracting road centerlines from medium- and high-resolution images.

Open and standardized tools for smart transducer networking

IEEE 1451 Standard is intended to address the smart transducer interfacing problematic in network environments. Usually, proprietary hardware and software is a very efficient solution to in planent the IEEE 1451 normative, although can be expensive and inflexible. In contrast, the use of open and standardized tools for implementing the IEEE 1451 normative is proposed in this paper. Tools such as Java and Phyton programming languages, Linux, programmable logic technology, Personal Computer resources and Ethernet architecture were integrated in order to constructa network node based on the IEEE 1451 standards. The node can be applied in systems based on the client-server communication model The evaluation of the employed tools and expermental results are presented. © 2005 IEEE.

Transmission network expansion planning in full open market considering security constraints

This paper presents a mathematical model and a methodology to solve the transmission network expansion planning problem with security constraints in full competitive market, assuming that all generation programming plans present in the system operation are known. The methodology let us find an optimal transmission network expansion plan that allows the power system to operate adequately in each one of the generation programming plans specified in the full competitive market case, including a single contingency situation with generation rescheduling using the security (n-1) criterion. In this context, the centralized expansion planning with security constraints and the expansion planning in full competitive market are subsets of the proposal presented in this paper. The model provides a solution using a genetic algorithm designed to efficiently solve the reliable expansion planning in full competitive market. The results obtained for several known systems from the literature show the excellent performance of the proposed methodology.

Mathematical optimisation techniques applied to power system operation and planning

Nowadays, power system operation becomes more complex because of the critical operating conditions resulting from the requirements of a market-driven operation. In this context, efficient methods for optimisation of power system operation and planning become critical to satisfy the operational (technical), financial and economic demands. Therefore, the detailed analysis of modern optimisation techniques as well as their application to the power system problems represent a relevant issue from the scientific and technological points of view. This paper presents a brief overview of the developments on modern mathematical optimisation methods applied to power system operation and planning. Copyright © 2007 Inderscience Enterprises Ltd.

Analysis of numeric conditioning of Hessian matrix of Lagrangian via singular values

This paper presents an analyze of numeric conditioning of the Hessian matrix of Lagrangian of modified barrier function Lagrangian method (MBFL) and primal-dual logarithmic barrier method (PDLB), which are obtained in the process of solution of an optimal power flow problem (OPF). This analyze is done by a comparative study through the singular values decomposition (SVD) of those matrixes. In the MBLF method the inequality constraints are treated by the modified barrier and PDLB methods. The inequality constraints are transformed into equalities by introducing positive auxiliary variables and are perturbed by the barrier parameter. The first-order necessary conditions of the Lagrangian function are solved by Newton's method. The perturbation of the auxiliary variables results in an expansion of the feasible set of the original problem, allowing the limits of the inequality constraints to be reached. The electric systems IEEE 14, 162 and 300 buses were used in the comparative analysis. ©2007 IEEE.

Heuristic algorithm to solve the short term transmission network expansion planning

In this paper, a method for solving the short term transmission network expansion planning problem is presented. This is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In order to And a solution of excellent quality for this problem, a constructive heuristic algorithm is presented in this paper. In each step of the algorithm, a sensitivity index is used to add a circuit (transmission line or transformer) or a capacitor bank (fixed or variable) to the system. This sensitivity index is obtained solving the problem considering the numbers of circuits and capacitors banks to be added (relaxed problem), as continuous variables. The relaxed problem is a large and complex nonlinear programming and was solved through a higher order interior point method. The paper shows results of several tests that were performed using three well-known electric energy systems in order to show the possibility and the advantages of using the AC model. ©2007 IEEE.

Detection of highways in high resolution images using Mathematical Morphology techniques

This paper seeks to apply a routine for highways detection through the mathematical morphology tools in high resolution image. The Mathematical Morphology theory consists of describing structures geometric presents quantitatively in the image (targets or features). This explains the use of the Mathematical Morphology in this work. As high resolution images will be used, the largest difficulty in the highways detection process is the presence of trees and automobiles in the borders tracks. Like this, for the obtaining of good results through the use of morphologic tools was necessary to choose the structuring element appropriately to be used in the functions. Through the appropriate choice of the morphologic operators and structuring elements it was possible to detect the highways tracks. The linear feature detection using mathematical morphology techniques, can contribute in cartographic applications, as cartographic products updating.

A structure excited by a DC motor of limited power supply and controlled by a pendulum like device

In this paper, a mathematical model is derived via Lagrange's Equation for a shear building structure that acts as a foundation of a non-ideal direct current electric motor, controlled by a mass loose inside a circular carving. Non-ideal sources of vibrations of structures are those whose characteristics are coupled to the motion of the structure, not being a function of time only as in the ideal case. Thus, in this case, an additional equation of motion is written, related to the motor rotation, coupled to the equation describing the horizontal motion of the shear building. This kind of problem can lead to the so-called Sommerfeld effect: steady state frequencies of the motor will usually increase as more power (voltage) is given to it in a step-by-step fashion. When a resonance condition with the structure is reached, the better part of this energy is consumed to generate large amplitude vibrations of the foundation without sensible change of the motor frequency as before. If additional increase steps in voltage are made, one may reach a situation where the rotor will jump to higher rotation regimes, no steady states being stable in between. As a device of passive control of both large amplitude vibrations and the Sommerfeld effect, a scheme is proposed using a point mass free to bounce back and forth inside a circular carving in the suspended mass of the structure. Numerical simulations of the model are also presented Copyright © 2007 by ASME.

Planeamiento de la expansión de sistemas de transmisión considerando contingencias y demanda incierta

This paper presents a methodology and a mathematical model to solve the expansion planning problem that takes into account the effect of contingencies in the planning stage, and considers the demand as a stochastic variable within a specified range. In this way, it is possible to find a solution that minimizes the investment costs guarantying reliability and minimizing future load shedding. The mathematical model of the expansion planning can be represented by a mixed integer nonlinear programming problem. To solve this problem a specialized Genetic Algorithm combined with Linear Programming was implemented.

Specialized genetic algorithm for transmission network expansion planning considering reliability

This paper presents a methodology to solve the transmission network expansion planning problem (TNEP) considering reliability and uncertainty in the demand. The proposed methodology provides an optimal expansion plan that allows the power system to operate adequately with an acceptable level of reliability and in an enviroment with uncertainness. The reliability criterion limits the expected value of the reliability index (LOLE - Loss Of Load Expectation) of the expanded system. The reliability is evaluated for the transmission system using an analytical technique based in enumeration. The mathematical model is solved, in a efficient way, using a specialized genetic algorithm of Chu-Beasley modified. Detailed results from an illustrative example are presented and discussed. © 2009 IEEE.