Reactive power planning under conditional-value-at-risk assessment using chance-constrained optimisation

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

A hybrid method for the probabilistic maximal covering location-allocation problem

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

An MILP model for the plug-in electric vehicle charging coordination problem in electrical distribution systems

A new mixed-integer linear programming (MILP) model is proposed to represent the plug-in electric vehicles (PEVs) charging coordination problem in electrical distribution systems. The proposed model defines the optimal charging schedule for each division of the considered period of time that minimizes the total energy costs. Moreover, priority charging criteria is taken into account. The steady-state operation of the electrical distribution system, as well as the PEV batteries charging is mathematically represented; furthermore, constraints related to limits of voltage, current and power generation are included. The proposed mathematical model was applied in an electrical distribution system used in the specialized literature and the results show that the model can be used in the solution of the PEVs charging problem.

The immune system is limited by oxidative stress: dietary selenium promotes optimal antioxidative status and greatest immune defense in pacu Piaractus mesopotamicus

Reactive oxygen species (ROS) are reactive molecules containing oxygen, that form as byproducts of aerobic metabolism, including immune system processes. Too much ROS may cause oxidative stress. In this study, we examined whether it can also limit the production of immune system compounds. To assess the relationship between antioxidant status and immunity we evaluated the effect of dietary supplementation with organic selenium, given at various levels for 10 days, on the antioxidant and immune system of the pacu fish (Piaractus mesopotamicus). Fish fed a diet containing 0.6 mg Se-yeast kg(-1) showed significant improvement in antioxidant status, as well as in hematological and immunological profiles. Specifically, they had the highest counts for catalase (CAT), glutathione peroxidase (GPx), glutathione S-transferase (GST), red blood cells, and thrombocytes; the highest leukocyte count (particularly for monocytes); and the highest serum lysozyme activity. There was also a positive correlation between GPx and lysozyme in this group of fish. These findings indicate that short-term supplementation with 0.6 mg Se-yeast kg(-1) reestablished the antioxidative status, allowing the production of innate components which can boost immunity without the risk of oxidative stress. This study shows a relationship between oxidative stress and immunity, and, from a practical perspective, shows that improving immunity and health in pacu through the administration of selenium could improve their growth performance.

Metaheuristics for a crop rotation problem

This paper presents a mathematical model adapted from literature for the crop rotation problem with demand constraints (CRP-D). The main aim of the present work is to study metaheuristics and their performance in a real context. The proposed algorithms for solution of the CRP-D are a genetic algorithm, a simulated annealing and hybrid approaches: a genetic algorithm with simulated annealing and a genetic algorithm with local search algorithm. A new constructive heuristic was also developed to provide initial solutions for the metaheuristics. Computational experiments were performed using a real planting area and semi-randomly generated instances created by varying the number, positions and dimensions of the lots. The computational results showed that these algorithms determined good feasible solutions in a short computing time as compared with the time spent to get optimal solutions, thus proving their efficacy for dealing with this practical application of the CRP-D.

Optimal Segment Size for Fixed-sized Segment Protection in Wavelength-routed Optical Networks

Protecting a network against link failures is a major challenge faced by network operators. The protection scheme has to address two important objectives - fast recovery and minimizing the amount of backup resources needed. Every protection algorithm is a tradeoff between these two objectives. In this paper, we study the problem of segment protection. In particular, we investigate what is the optimal segment size that obtains the best tradeoff between the time taken for recovery and minimizing the bandwidth used by the backup segments. We focus on the uniform fixed-length segment protection method, where each primary path is divided into fixed-length segments, with the exception of the last segment in the path. We observe that the optimal segment size for a given network depends on several factors such as the topology and the ratio of the costs involved.

Optimal mean-variance control for discrete-time linear systems with Markovian jumps and multiplicative noises

In this paper, we consider the stochastic optimal control problem of discrete-time linear systems subject to Markov jumps and multiplicative noises under two criteria. The first one is an unconstrained mean-variance trade-off performance criterion along the time, and the second one is a minimum variance criterion along the time with constraints on the expected output. We present explicit conditions for the existence of an optimal control strategy for the problems, generalizing previous results in the literature. We conclude the paper by presenting a numerical example of a multi-period portfolio selection problem with regime switching in which it is desired to minimize the sum of the variances of the portfolio along the time under the restriction of keeping the expected value of the portfolio greater than some minimum values specified by the investor. (C) 2011 Elsevier Ltd. All rights reserved.

Reactive sputter magnetron reactor for preparation of thin films and simultaneous in-situ structural study by X-ray diffraction.

Reactive Sputter Magnetron (RSM) is a widely used technique to thin films growing of compounds both, in research laboratories and in industrial processes. The nature of the deposited compound will depend then on the nature of the magnetron target and the nature of the ions generated in the plasma. One important aspect of the problem is the knowledge of the evolution of the film during the process of growing itself. In this work, we present the design, construction of a chamber to be installed in the Huber goniometer in the XRD2 line of LNLS in Campinas, which allows in situ growing kinetic studies of thin films.

Role of reactive oxygen and nitrogen species in the response of Prunus spp. to bicarbonate

In calcareous soils, which are a large share of agricultural soils worldwide, iron availability is limited. Consequently, the whole plant physiology is affected, because of the key role of iron in redox metabolism, resulting in reduced crop yield and quality. Peach cultivation is economically important in northern Italy, and is easily subjected to iron chlorosis. The management of iron nutrition in peach includes grafting on bicarbonate-tolerant rootstocks; other forms of management may be expensive and environmentally impacting. Four genotypes, used as rootstocks for peach and characterized by different degrees of tolerance to chlorosis, were tested in vitro on optimal and bicarbonate-enriched medium. Their redox status and antioxidant responses were assayed; the production and possible roles of nitric oxide (NO) and related compounds were also studied. The most sensitive genotypes show a stronger reduction of the antioxidant enzymatic activities and an increased oxidative stress. A high production of NO was found to be associated to resistant genotypes, whereas sensitive genotypes reacted to stress by downregulating nitrosoglutathione reductase activity. Therefore, NO is proposed to improve the internal iron availability, or to stimulate iron intake.

Analysis of optimal control problems for the incompressible MHD equations and implementation in a finite element multiphysics code

This thesis deals with the study of optimal control problems for the incompressible Magnetohydrodynamics (MHD) equations. Particular attention to these problems arises from several applications in science and engineering, such as fission nuclear reactors with liquid metal coolant and aluminum casting in metallurgy. In such applications it is of great interest to achieve the control on the fluid state variables through the action of the magnetic Lorentz force. In this thesis we investigate a class of boundary optimal control problems, in which the flow is controlled through the boundary conditions of the magnetic field. Due to their complexity, these problems present various challenges in the definition of an adequate solution approach, both from a theoretical and from a computational point of view. In this thesis we propose a new boundary control approach, based on lifting functions of the boundary conditions, which yields both theoretical and numerical advantages. With the introduction of lifting functions, boundary control problems can be formulated as extended distributed problems. We consider a systematic mathematical formulation of these problems in terms of the minimization of a cost functional constrained by the MHD equations. The existence of a solution to the flow equations and to the optimal control problem are shown. The Lagrange multiplier technique is used to derive an optimality system from which candidate solutions for the control problem can be obtained. In order to achieve the numerical solution of this system, a finite element approximation is considered for the discretization together with an appropriate gradient-type algorithm. A finite element object-oriented library has been developed to obtain a parallel and multigrid computational implementation of the optimality system based on a multiphysics approach. Numerical results of two- and three-dimensional computations show that a possible minimum for the control problem can be computed in a robust and accurate manner.

Cut-first branch-and-price-second for the capacitated arc-routing problem

This paper presents the first full-fledged branch-and-price (bap) algorithm for the capacitated arc-routing problem (CARP). Prior exact solution techniques either rely on cutting planes or the transformation of the CARP into a node-routing problem. The drawbacks are either models with inherent symmetry, dense underlying networks, or a formulation where edge flows in a potential solution do not allow the reconstruction of unique CARP tours. The proposed algorithm circumvents all these drawbacks by taking the beneficial ingredients from existing CARP methods and combining them in a new way. The first step is the solution of the one-index formulation of the CARP in order to produce strong cuts and an excellent lower bound. It is known that this bound is typically stronger than relaxations of a pure set-partitioning CARP model.rnSuch a set-partitioning master program results from a Dantzig-Wolfe decomposition. In the second phase, the master program is initialized with the strong cuts, CARP tours are iteratively generated by a pricing procedure, and branching is required to produce integer solutions. This is a cut-first bap-second algorithm and its main function is, in fact, the splitting of edge flows into unique CARP tours.

Two-Dimensional Bin Packing Problem with Guillotine Restrictions

This thesis, after presenting recent advances obtained for the two-dimensional bin packing problem, focuses on the case where guillotine restrictions are imposed. A mathematical characterization of non-guillotine patterns is provided and the relation between the solution value of the two-dimensional problem with guillotine restrictions and the two-dimensional problem unrestricted is being studied from a worst-case perspective. Finally it presents a new heuristic algorithm, for the two-dimensional problem with guillotine restrictions, based on partial enumeration, and computationally evaluates its performance on a large set of instances from the literature. Computational experiments show that the algorithm is able to produce proven optimal solutions for a large number of problems, and gives a tight approximation of the optimum in the remaining cases.

Problem-specific design of metaheuristics for constrained spanning tree problems

When designing metaheuristic optimization methods, there is a trade-off between application range and effectiveness. For large real-world instances of combinatorial optimization problems out-of-the-box metaheuristics often fail, and optimization methods need to be adapted to the problem at hand. Knowledge about the structure of high-quality solutions can be exploited by introducing a so called bias into one of the components of the metaheuristic used. These problem-specific adaptations allow to increase search performance. This thesis analyzes the characteristics of high-quality solutions for three constrained spanning tree problems: the optimal communication spanning tree problem, the quadratic minimum spanning tree problem and the bounded diameter minimum spanning tree problem. Several relevant tree properties, that should be explored when analyzing a constrained spanning tree problem, are identified. Based on the gained insights on the structure of high-quality solutions, efficient and robust solution approaches are designed for each of the three problems. Experimental studies analyze the performance of the developed approaches compared to the current state-of-the-art.

Applying the reactive programming paradigm: Toward a more declarative application development approach

After almost 10 years from “The Free Lunch Is Over” article, where the need to parallelize programs started to be a real and mainstream issue, a lot of stuffs did happened: • Processor manufacturers are reaching the physical limits with most of their approaches to boosting CPU performance, and are instead turning to hyperthreading and multicore architectures; • Applications are increasingly need to support concurrency; • Programming languages and systems are increasingly forced to deal well with concurrency. This thesis is an attempt to propose an overview of a paradigm that aims to properly abstract the problem of propagating data changes: Reactive Programming (RP). This paradigm proposes an asynchronous non-blocking approach to concurrency and computations, abstracting from the low-level concurrency mechanisms.

Population-based analysis of 4113 patients with acute cholecystitis: defining the optimal time-point for laparoscopic cholecystectomy

Objective: To compare clinical outcomes after laparoscopic cholecystectomy (LC) for acute cholecystitis performed at various time-points after hospital admission. Background: Symptomatic gallstones represent an important public health problem with LC the treatment of choice. LC is increasingly offered for acute cholecystitis, however, the optimal time-point for LC in this setting remains a matter of debate. Methods: Analysis was based on the prospective database of the Swiss Association of Laparoscopic and Thoracoscopic Surgery and included patients undergoing emergency LC for acute cholecystitis between 1995 and 2006, grouped according to the time-points of LC since hospital admission (admission day (d0), d1, d2, d3, d4/5, d ≥6). Linear and generalized linear regression models assessed the effect of timing of LC on intra- or postoperative complications, conversion and reoperation rates and length of postoperative hospital stay. Results: Of 4113 patients, 52.8% were female, median age was 59.8 years. Delaying LC resulted in significantly higher conversion rates (from 11.9% at d0 to 27.9% at d ≥6 days after admission, P < 0.001), surgical postoperative complications (5.7% to 13%, P < 0.001) and re-operation rates (0.9% to 3%, P = 0.007), with a significantly longer postoperative hospital stay (P < 0.001). Conclusions: Delaying LC for acute cholecystitis has no advantages, resulting in significantly increased conversion/re-operation rate, postoperative complications and longer postoperative hospital stay. This investigation—one of the largest in the literature—provides compelling evidence that acute cholecystitis merits surgery within 48 hours of hospital admission if impact on the patient and health care system is to be minimized.