Simulated annealing metaheuristic to solve the optimal power flow

The optimal power flow problem has been widely studied in order to improve power systems operation and planning. For real power systems, the problem is formulated as a non-linear and as a large combinatorial problem. The first approaches used to solve this problem were based on mathematical methods which required huge computational efforts. Lately, artificial intelligence techniques, such as metaheuristics based on biological processes, were adopted. Metaheuristics require lower computational resources, which is a clear advantage for addressing the problem in large power systems. This paper proposes a methodology to solve optimal power flow on economic dispatch context using a Simulated Annealing algorithm inspired on the cooling temperature process seen in metallurgy. The main contribution of the proposed method is the specific neighborhood generation according to the optimal power flow problem characteristics. The proposed methodology has been tested with IEEE 6 bus and 30 bus networks. The obtained results are compared with other wellknown methodologies presented in the literature, showing the effectiveness of the proposed method.

Ant colony search algorithm for the optimal power flow problem

To maintain a power system within operation limits, a level ahead planning it is necessary to apply competitive techniques to solve the optimal power flow (OPF). OPF is a non-linear and a large combinatorial problem. The Ant Colony Search (ACS) optimization algorithm is inspired by the organized natural movement of real ants and has been successfully applied to different large combinatorial optimization problems. This paper presents an implementation of Ant Colony optimization to solve the OPF in an economic dispatch context. The proposed methodology has been developed to be used for maintenance and repairing planning with 48 to 24 hours antecipation. The main advantage of this method is its low execution time that allows the use of OPF when a large set of scenarios has to be analyzed. The paper includes a case study using the IEEE 30 bus network. The results are compared with other well-known methodologies presented in the literature.

Determination of chitin content in fungal cell wall: an alternative flow cytometric method

The conventional methods used to evaluate chitin content in fungi, such as biochemical assessment of glucosamine release after acid hydrolysis or epifluorescence microscopy, are low throughput, laborious, time-consuming, and cannot evaluate a large number of cells. We developed a flow cytometric assay, efficient, and fast, based on Calcofluor White staining to measure chitin content in yeast cells. A staining index was defined, its value was directly related to chitin amount and taking into consideration the different levels of autofluorecence. Twenty-two Candida spp. and four Cryptococcus neoformans clinical isolates with distinct susceptibility profiles to caspofungin were evaluated. Candida albicans clinical isolate SC5314, and isogenic strains with deletions in chitin synthase 3 (chs3Δ/chs3Δ) and genes encoding predicted Glycosyl Phosphatidyl Inositol (GPI)-anchored proteins (pga31Δ/Δ and pga62Δ/Δ), were used as controls. As expected, the wild-type strain displayed a significant higher chitin content (P < 0.001) than chs3Δ/chs3Δ and pga31Δ/Δ especially in the presence of caspofungin. Ca. parapsilosis, Ca. tropicalis, and Ca. albicans showed higher cell wall chitin content. Although no relationship between chitin content and antifungal drug susceptibility phenotype was found, an association was established between the paradoxical growth effect in the presence of high caspofungin concentrations and the chitin content. This novel flow cytometry protocol revealed to be a simple and reliable assay to estimate cell wall chitin content of fungi.

A novel flow cytometric protocol for assessment of yeast cell adhesion

Microbial adhesion is a field of recognized relevance and, as such, an impressive array of tools has been developed to understand its molecular mechanisms and ultimately for its quantification. Some of the major limitations found within these methodologies concern the incubation time, the small number of cells analyzed, and the operator's subjectivity. To overcome these aspects, we have developed a quantitative method to measure yeast cells' adhesion through flow cytometry. In this methodology, a suspension of yeast cells is mixed with green fluorescent polystyrene microspheres (uncoated or coated with host proteins). Within 2 h, an adhesion profile is obtained based on two parameters: percentage and cells-microsphere population's distribution pattern. This flow cytometry protocol represents a useful tool to quantify yeast adhesion to different substrata in a large scale, providing manifold data in a speedy and informative manner.

Derivative-free optimization and filter methods to solve nonlinear constrained problems

In real optimization problems, usually the analytical expression of the objective function is not known, nor its derivatives, or they are complex. In these cases it becomes essential to use optimization methods where the calculation of the derivatives, or the verification of their existence, is not necessary: the Direct Search Methods or Derivative-free Methods are one solution. When the problem has constraints, penalty functions are often used. Unfortunately the choice of the penalty parameters is, frequently, very difficult, because most strategies for choosing it are heuristics strategies. As an alternative to penalty function appeared the filter methods. A filter algorithm introduces a function that aggregates the constrained violations and constructs a biobjective problem. In this problem the step is accepted if it either reduces the objective function or the constrained violation. This implies that the filter methods are less parameter dependent than a penalty function. In this work, we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of the simplex method and filter methods. This method does not compute or approximate any derivatives, penalty constants or Lagrange multipliers. The basic idea of simplex filter algorithm is to construct an initial simplex and use the simplex to drive the search. We illustrate the behavior of our algorithm through some examples. The proposed methods were implemented in Java.

Derivative-free nonlinear optimization filter simplex

The filter method is a technique for solving nonlinear programming problems. The filter algorithm has two phases in each iteration. The first one reduces a measure of infeasibility, while in the second the objective function value is reduced. In real optimization problems, usually the objective function is not differentiable or its derivatives are unknown. In these cases it becomes essential to use optimization methods where the calculation of the derivatives or the verification of their existence is not necessary: direct search methods or derivative-free methods are examples of such techniques. In this work we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of simplex and filter methods. This method neither computes nor approximates derivatives, penalty constants or Lagrange multipliers.

Gestão e monitorização de uma rede departamental: um caso de estudo

Mestrado em Engenharia Electrotécnica e de Computadores

Funções penalidade para o tratamento das variáveis discretas do problema de fluxo de potência ótimo reativo

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Climatic patterns and physical controls of chlorophyll-a in the Northeast Atlantic

Tese de Doutoramento, Física, 17 de Dezembro de 2013, Universidade dos Açores.