BTEX biodegradation by bacteria from effluents of petroleum refinery

Groundwater contamination with benzene, toluene, ethylbenzene and xylene (BTEX) has been increasing, thus requiring an urgent development of methodologies that are able to remove or minimize the damages these compounds can cause to the environment. The biodegradation process using microorganisms has been regarded as an efficient technology to treat places contaminated with hydrocarbons, since they are able to biotransform and/or biodegrade target pollutants. To prove the efficiency of this process, besides chemical analysis, the use of biological assessments has been indicated. This work identified and selected BTEX-biodegrading microorganisms present in effluents from petroleum refinery, and evaluated the efficiency of microorganism biodegradation process for reducing genotoxic and mutagenic BTEX damage through two test-systems: Allium cepa and hepatoma tissue culture (HTC) cells. Five different non-biodegraded BTEX concentrations were evaluated in relation to biodegraded concentrations. The biodegradation process was performed in a BOO Trak Apparatus (HACH) for 20 days, using microorganisms pre-selected through enrichment. Although the biodegradation usually occurs by a consortium of different microorganisms, the consortium in this study was composed exclusively of five bacteria species and the bacteria Pseudomonas putida was held responsible for the BTEX biodegradation. The chemical analyses showed that BTEX was reduced in the biodegraded concentrations. The results obtained with genotoxicity assays, carried out with both A. cepa and HTC cells, showed that the biodegradation process was able to decrease the genotoxic damages of BTEX. By mutagenic tests, we observed a decrease in damage only to the A. cepa organism. Although no decrease in mutagenicity was observed for HTC cells, no increase of this effect after the biodegradation process was observed either. The application of pre-selected bacteria in biodegradation processes can represent a reliable and effective tool in the treatment of water contaminated with BTEX mixture. Therefore, the raw petroleum refinery effluent might be a source of hydrocarbon-biodegrading microorganisms. (c) 2010 Elsevier B.A. All rights reserved.

Study of alternative schemes for the parameterization step of the continuation power flow method based on physical parameters, part I: Mathematical modeling

The conventional power flow method is considered to be inadequate to obtain the maximum loading point because of the singularity of Jacobian matrix. Continuation methods are efficient tools for solving this kind of problem since different parameterization schemes can be used to avoid such ill-conditioning problems. This paper presents the details of new schemes for the parameterization step of the continuation power flow method. The new parameterization options are based on physical parameters, namely, the total power losses (real and reactive), the power at the slack bus (real or reactive), the reactive power at generation buses, and transmission line power losses (real and reactive). The simulation results obtained with the new approach for the IEEE test systems (14, 30, 57, and 118 buses) are presented and discussed in the companion paper. The results show that the characteristics of the conventional method are not only preserved but also improved.

Study of alternative schemes for the parameterization step of the continuation power flow method based on physical parameters, part II: Performance evaluation

New parameterization schemes have been proposed by the authors in Part I of this paper. In this part these new options for the parameterization of power flow equations are tested, namely, the total power losses (real and reactive), the power at the slack bus (real or reactive), the reactive power at generation buses, and the transmission line power losses (real and reactive). These different parameterization schemes can be used to obtain the maximum loading point without ill-conditioning problems, once the singularity of Jacobian matrix is avoided. The results obtained with the new approach for the IEEE test systems (14, 30, 57, and 118 buses) show that the characteristics of the conventional method are not only preserved but also improved. In addition, it is shown that the proposed method and the conventional one can be switched during the tracing of PV curves to determine, with few iterations, all points of the PV curve. Several tests were also carried out to compare the performance of the proposed parameterization schemes for the continuation power flow method with the use of both the secant and tangent predictors.

Branch and bound algorithm for transmission system expansion planning using a transportation model

A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been rested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.

TWO DECOMPOSITION APPROACHES APPLIED TO THE MULTI-AREA OPTIMAL REACTIVE POWER FLOW PROBLEM

This paper applies two methods of mathematical decomposition to carry out an optimal reactive power flow (ORPF) in a coordinated decentralized way in the context of an interconnected multi-area power system. The first method is based on an augmented Lagrangian approach using the auxiliary problem principle (APP). The second method uses a decomposition technique based on the Karush-Kuhn-Tucker (KKT) first-order optimality conditions. The viability of each method to be used in the decomposition of multi-area ORPF is studied and the corresponding mathematical models are presented. The IEEE RTS-96, the IEEE 118-bus test systems and a 9-bus didactic system are used in order to show the operation and effectiveness of the decomposition methods.

Multiarea optimal power flow using multiobjective evolutionary algorithm

In this work the multiarea optimal power flow (OPF) problem is decoupled into areas creating a set of regional OPF subproblems. The objective is to solve the optimal dispatch of active and reactive power for a determined area, without interfering in the neighboring areas. The regional OPF subproblems are modeled as a large-scale nonlinear constrained optimization problem, with both continuous and discrete variables. Constraints violated are handled as objective functions of the problem. In this way the original problem is converted to a multiobjective optimization problem, and a specifically-designed multiobjective evolutionary algorithm is proposed for solving the regional OPF subproblems. The proposed approach has been examined and tested on the RTS-96 and IEEE 354-bus test systems. Good quality suboptimal solutions were obtained, proving the effectiveness and robustness of the proposed approach. ©2009 IEEE.

Flujo de potencia AC descentralizado para sistemas de potencia multi-área usando un método de descomposición basado en relajación Lagrangiana

A decentralized solution method to the AC power flow problem in power systems with interconnected areas is presented. The proposed methodology allows finding the operation point of a particular area without explicit knowledge of network data of adjacent areas, being only necessary to exchange border information related to the interconnection lines between areas. The methodology is based on the decomposition of the first-order optimality conditions of the AC power flow, which is formulated as a nonlinear programming problem. A 9-bus didactic system, the IEEE Three Area RTS-96 and the IEEE 118 bus test systems are used in order to show the operation and effectiveness of the distributed AC power flow.

Multi-area decentralized optimal VAr planning using the Dantzig-Wolfe decomposition principle

This paper presents a new methodology for solving the optimal VAr planning problem in multi-area electric power systems, using the Dantzig-Wolfe decomposition. The original multi-area problem is decomposed into subproblems (one for each area) and a master problem (coordinator). The solution of the VAr planning problem in each area is based on the application of successive linear programming, and the coordination scheme is based on the reactive power marginal costs in the border bus. The aim of the model is to provide coordinated mechanisms to carry out the VAr planning studies maximizing autonomy and confidentiality for each area, assuring global economy to the whole system. Using the mathematical model and computational implementation of the proposed methodology, numerical results are presented for two interconnected systems, each of them composed of three equal subsystems formed by IEEE30 and IEEE118 test systems. © 2011 IEEE.

A multi-objective programming approach for the optimal operation of distributed generation considering uncertainty

Due to the renewed interest in distributed generation (DG), the number of DG units incorporated in distribution systems has been rapidly increasing in the past few years. This situation requires new analysis tools for understanding system performance, and taking advantage of the potential benefits of DG. This paper presents an evolutionary multi-objective programming approach to determine the optimal operation of DG in distribution systems. The objectives are the minimization of the system power losses and operation cost of the DG units. The proposed approach also considers the inherent stochasticity of DG technologies powered by renewable resources. Some tests were carried out on the IEEE 34 bus distribution test system showing the robustness and applicability of the proposed methodology. © 2011 IEEE.

Distributed generation modelling for unbalanced three-phase power flow calculations in smart grids

Distributed Generators (DG) are generally modeled as PQ or PV buses in power flow studies. But in order to integrate DG units into the distribution systems and control the reactive power injection it is necessary to know the operation mode and the type of connection to the system. This paper presents a single-phase and a three-phase mathematical model to integrate DG in power flow calculations in distribution systems, especially suited for Smart Grid calculations. If the DG is in PV mode, each step of the power flow algorithm calculates the reactive power injection from the DG to the system to keep the voltage in the bus in a predefined level, if the DG is in PQ mode, the power injection is considered as a negative load. The method is tested on two well known test system, presenting single-phase results on 85 bus system, and three-phase results in the IEEE 34 bus test system. © 2011 IEEE.

Market-driven security-constrained transmission network expansion planning

This paper presents a Bi-level Programming (BP) approach to solve the Transmission Network Expansion Planning (TNEP) problem. The proposed model is envisaged under a market environment and considers security constraints. The upper-level of the BP problem corresponds to the transmission planner which procures the minimization of the total investment and load shedding cost. This upper-level problem is constrained by a single lower-level optimization problem which models a market clearing mechanism that includes security constraints. Results on the Garver's 6-bus and IEEE 24-bus RTS test systems are presented and discussed. Finally, some conclusions are drawn. © 2011 IEEE.

An unproblematic method to solve economic and emission dispatch

This paper proposes a method to determine the output of all online units with minimum total cost when the amount of emission is reasonable. A joint economic and emission dispatch is proposed in order to get a significant compromise between costs and emission such that real power supply-demand equilibrium is satisfied. In order to have a meaningful compromise between costs and emission in the problem formulation, two variables are used, weighting factor and price penalty factor. A case study comprising of a 3-unit power system is employed, where various demand is used. Results for the test system indicate the fastness and effectiveness of proposed method. © 2011 IEEE.

Fluxo de potência trifásico probabilístico para redes de distribuição usando o método de estimação por pontos

In this paper the point estimation method is applied to solve the probabilistic power flow problem for unbalanced three-phase distribution systems. Through the implementation of this method the probability distribution functions of voltages (magnitude and angle) as well as the active and reactive power flows in the branches of the distribution system are determined. Two different approaches of the point estimation method are presented (2m and 2m+1 point schemes). In order to test the proposed methodology, the IEEE 34 and 123 bus test systems are used. The results obtained with both schemes are compared with the ones obtained by a Monte Carlo Simulation (MCS).

Domain reduction using GRASP construction phase for transmission expansion planning problem

This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.

Optimal reactive power dispatch using stochastic chance-constrained programming

Deterministic Optimal Reactive Power Dispatch problem has been extensively studied, such that the demand power and the availability of shunt reactive power compensators are known and fixed. Give this background, a two-stage stochastic optimization model is first formulated under the presumption that the load demand can be modeled as specified random parameters. A second stochastic chance-constrained model is presented considering uncertainty on the demand and the equivalent availability of shunt reactive power compensators. Simulations on six-bus and 30-bus test systems are used to illustrate the validity and essential features of the proposed models. This simulations shows that the proposed models can prevent to the power system operator about of the deficit of reactive power in the power system and suggest that shunt reactive sourses must be dispatched against the unavailability of any reactive source. © 2012 IEEE.