Interior point algorithm for linear programming used in transmission network synthesis

This article presents a well-known interior point method (IPM) used to solve problems of linear programming that appear as sub-problems in the solution of the long-term transmission network expansion planning problem. The linear programming problem appears when the transportation model is used, and when there is the intention to solve the planning problem using a constructive heuristic algorithm (CHA), ora branch-and-bound algorithm. This paper shows the application of the IPM in a CHA. A good performance of the IPM was obtained, and then it can be used as tool inside algorithm, used to solve the planning problem. Illustrative tests are shown, using electrical systems known in the specialized literature. (C) 2005 Elsevier B.V. All rights reserved.

Transmission system expansion planning by an extended genetic algorithm

The paper presents an extended genetic algorithm for solving the optimal transmission network expansion planning problem. Two main improvements have been introduced in the genetic algorithm: (a) initial population obtained by conventional optimisation based methods; (b) mutation approach inspired in the simulated annealing technique, the proposed method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Excellent performance is reported in the test results section of the paper for a difficult large-scale real-life problem: a substantial reduction in investment costs has been obtained with regard to previous solutions obtained via conventional optimisation methods and simulated annealing algorithms; statistical comparison procedures have been employed in benchmarking different versions of the genetic algorithm and simulated annealing methods.

Reactive power dispatch and planning using a non-linear branch-and-bound algorithm

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

Optimised placement of control and protective devices in electric distribution systems through reactive tabu search algorithm

Optimised placement of control and protective devices in distribution networks allows for a better operation and improvement of the reliability indices of the system. Control devices (used to reconfigure the feeders) are placed in distribution networks to obtain an optimal operation strategy to facilitate power supply restoration in the case of a contingency. Protective devices (used to isolate faults) are placed in distribution systems to improve the reliability and continuity of the power supply, significantly reducing the impacts that a fault can have in terms of customer outages, and the time needed for fault location and system restoration. This paper presents a novel technique to optimally place both control and protective devices in the same optimisation process on radial distribution feeders. The problem is modelled through mixed integer non-linear programming (MINLP) with real and binary variables. The reactive tabu search algorithm (RTS) is proposed to solve this problem. Results and optimised strategies for placing control and protective devices considering a practical feeder are presented. (c) 2007 Elsevier B.V. All rights reserved.

LMI-based algorithm for strictly positive real systems with static output feedback

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

A Constructive Heuristic Algorithm for Distribution System Planning

A constructive heuristic algorithm (CHA) to solve distribution system planning (DSP) problem is presented. The DSP is a very complex mixed binary nonlinear programming problem. A CHA is aimed at obtaining an excellent quality solution for the DSP problem. However, a local improvement phase and a branching technique were implemented in the CHA to improve its solution. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution system. This sensitivity index is obtained by solving the DSP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. Results of two tests systems and one real distribution system are presented in this paper in order to show the ability of the proposed algorithm.

Fault section estimation in electric power systems using an optimization immune algorithm

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

Efficient heuristic algorithm used for optimal capacitor placement in distribution systems

An efficient heuristic algorithm is presented in this work in order to solve the optimal capacitor placement problem in radial distribution systems. The proposal uses the solution from the mathematical model after relaxing the integrality of the discrete variables as a strategy to identify the most attractive bus to add capacitors to each step of the heuristic algorithm. The relaxed mathematical model is a nonlinear programming problem and is solved using a specialized interior point method, The algorithm still incorporates an additional strategy of local search that enables the finding of a group of quality solutions after small alterations in the optimization strategy. Proposed solution methodology has been implemented and tested in known electric systems getting a satisfactory outcome compared with metaheuristic methods.The tests carried out in electric systems known in specialized literature reveal the satisfactory outcome of the proposed algorithm compared with metaheuristic methods. (C) 2009 Elsevier Ltd. All rights reserved.

Multi Objective Evolutionary Algorithm Applied to the Optimal Power Flow Problem

This work presents the application of a multiobjective evolutionary algorithm (MOEA) for optimal power flow (OPF) solution. The OPF is modeled as a constrained nonlinear optimization problem, non-convex of large-scale, with continuous and discrete variables. The violated inequality constraints are treated as objective function of the problem. This strategy allows attending the physical and operational restrictions without compromise the quality of the found solutions. The developed MOEA is based on the theory of Pareto and employs a diversity-preserving mechanism to overcome the premature convergence of algorithm and local optimal solutions. Fuzzy set theory is employed to extract the best compromises of the Pareto set. Results for the IEEE-30, RTS-96 and IEEE-354 test systems are presents to validate the efficiency of proposed model and solution technique.

ALGORITHM FOR PROBABILISTIC ANALYSIS of DISTRIBUTION SYSTEMS WITH DISTRIBUTED GENERATION

In this paper an efficient algorithm for probabilistic analysis of unbalanced three-phase weakly-meshed distribution systems is presented. This algorithm uses the technique of Two-Point Estimate Method for calculating the probabilistic behavior of the system random variables. Additionally, the deterministic analysis of the state variables is performed by means of a Compensation-Based Radial Load Flow (CBRLF). Such load flow efficiently exploits the topological characteristics of the network. To deal with distributed generation, a strategy to incorporate a simplified model of a generator in the CBRLF is proposed. Thus, depending on the type of control and generator operation conditions, the node with distributed generation can be modeled either as a PV or PQ node. To validate the efficiency of the proposed algorithm, the IEEE 37 bus test system is used. The probabilistic results are compared with those obtained using the Monte Carlo method.

Feature selection through gravitational search algorithm

In this paper we deal with the problem of feature selection by introducing a new approach based on Gravitational Search Algorithm (GSA). The proposed algorithm combines the optimization behavior of GSA together with the speed of Optimum-Path Forest (OPF) classifier in order to provide a fast and accurate framework for feature selection. Experiments on datasets obtained from a wide range of applications, such as vowel recognition, image classification and fraud detection in power distribution systems are conducted in order to asses the robustness of the proposed technique against Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA) and a Particle Swarm Optimization (PSO)-based algorithm for feature selection.

Effect of management practices on screw-worm among sheep in São Paulo State, Brazil

The screw-worm Cochliomyia hominivorax (Coquerel), whose larvae develop in wild and domestic animals as well as in man, is one of the major causes of myiasis in Brazil. Sheep raising is expanding in the state of São Paulo, where information about the infestation of screw-worm is necessary for appropriate control measures. The present data were obtained from questionnaires sent to all sheep breeders belonging to 'Associação Paulista de Criadores de Ovinos' - ASPACO (São Paulo State Association of Sheep Breeders). Response reliability was tested by random visits paid to 10.6% of the respondents. The results show that screw-worm is the most frequent ectoparasite in the flocks and is responsible for the greatest economic losses. Its occurrence is strongly associated with flock size, reaching 100% in hocks consisting of more than 500 animals. Infestation is higher in spring and summer and lowest in the fall. The number of cases increases in the presence of some management practices such as tail amputation. Furthermore, several other associations between the indicators surveyed were also found to be significant. The data obtained will permit the elaboration of strategies for the control of this parasitosis.

An algorithm for arranging response surface designs in small blocks

We consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss of information due to blocking is related to scores defined by Mead and present an interchange algorithm based on scores to improve a given blocked design. Examples illustrating the performance of the algorithm are given and some comparisons with other designs are made. (C) 2000 Elsevier B.V. B.V. All rights reserved.

Worm burden and immunological responses in Corriedale and Crioula Lanada sheep following natural infection with Haemonchus contortus

The effects of natural infection with Haemonchus contortus were compared in 15 Corriedale lambs and 18 Crioula Lanada lambs kept in the grazing conditions after weaning. The following parameters were assessed weekly for 9 consecutive weeks: number of eggs per gram of feces (EPG), packed cell volume (PCV), total serum proteins (TSP) and albumin (ALB). At 10 weeks, the animals were slaughtered and autopsied to evaluate to the worm burden and eosinophil, mast cell and globule leukocyte counts in histological sections of the abomasum. EPG counts and worm burden were significantly lower in Crioula lambs, which also showed higher levels of PCV, TSP and ALB, as well as higher eosinophil and globule leukocyte counts. Mast cell counts were similar for the two breeds. These results indicate that, under intensive pasture conditions, the Crioula Lanada breed shows a better response to natural infection with H. contortus, suggesting greater resistance to parasitism. (C) 2003 Elsevier B.V. All rights reserved.

Active-site properties of Phrixotrix railroad worm green and red bioluminescence-eliciting luciferases

The luciferases of the railroad worm Phrixotrix (Coleoptera: Phengodidae) are the only beetle luciferases that naturally produce true red bioluminescence. Previously, we cloned the green- (PxGR) and red-emitting (PxRE) luciferases of railroad worms Phrixotrix viviani and P. hirtus[OLE1]. These luciferases were expressed and purified, and their active-site properties were determined. The red-emitting PxRE luciferase displays flash-like kinetics, whereas PxGR luciferase displays slow-type kinetics. The substrate affinities and catalytic efficiency of PxRE luciferase are also higher than those of PxGR luciferase. Fluorescence studies with 8-anilino-1-naphthalene sulfonic acid and 6-p-toluidino-2-naphthalene sulfonic acid showed that the PxRE luciferase luciferin-binding site is more polar than that of PxGR luciferase, and it is sensitive to guanidine. Alutagenesis and modelling studies suggest that several invariant residues in the putative luciferin-binding site of PxRE luciferase cannot interact with excited oxyluciferin. These results suggest that one portion of the luciferin-binding site of the red-emitting luciferase is tighter than that of PxGR luciferase, whereas the other portion could be more open and polar.