Uma aplicação da apredizagem por reforço na otimização da produção em um campo de petróleo

The objective of reservoir engineering is to manage fields of oil production in order to maximize the production of hydrocarbons according to economic and physical restrictions. The deciding of a production strategy is a complex activity involving several variables in the process. Thus, a smart system, which assists in the optimization of the options for developing of the field, is very useful in day-to-day of reservoir engineers. This paper proposes the development of an intelligent system to aid decision making, regarding the optimization of strategies of production in oil fields. The intelligence of this system will be implemented through the use of the technique of reinforcement learning, which is presented as a powerful tool in problems of multi-stage decision. The proposed system will allow the specialist to obtain, in time, a great alternative (or near-optimal) for the development of an oil field known

Real power losses reduction and loading margin improvement via continuation method

This letter presents an alternative approach for reducing the total real power losses by using a continuation method. Results for two simple test systems and for the IEEE 57-bus system show that this procedure results in larger voltage stability margin. Besides, the reduction of real power losses obtained with this procedure leads to significant money savings and, simultaneously, to voltage profile improvement. Comparison between the solution of an optimal power flow and the proposed method shows that the latter can provide near optimal results and so, it can be a reasonable alternative to power system voltage stability enhancement.

Controle ótimo H∞ de sistemas não-lineares com modelos fuzzy takagi-sugeno

Neste trabalho é proposta uma metodologia de rastreamento de sinais e rejeição de distúrbios aplicada a sistemas não-lineares. Para o projeto do sistema de rastreamento, projeta-se os controladores fuzzy M(a) e N(a) que minimizam o limitante superior da norma H∞ entre o sinal de referência r(t) e o sinal de erro de rastreamento e(t), sendo e(t) a diferença entre a entrada de referência e a saída do sistema z(t). No método de rejeição de distúrbio utiliza-se a realimentação dinâmica da saída através de um controlador fuzzy Kc(a) que minimiza o limitante superior da norma H∞ entre o sinal de entrada exógena w(t) e o sinal de saída z(t). O procedimento de projeto proposto considera as não-linearidades da planta através dos modelos fuzzy Takagi-Sugeno. Os métodos são equacionados utilizando-se inequações matriciais lineares (LMIs), que quando factíveis, podem ser facilmente solucionados por algoritmos de convergência polinomial. Por fim, um exemplo ilustra a viabilidade da metodologia proposta.

Time-series-based maximization of distributed wind power generation integration

Energy policies and technological progress in the development of wind turbines have made wind power the fastest growing renewable power source worldwide. The inherent variability of this resource requires special attention when analyzing the impacts of high penetration on the distribution network. A time-series steady-state analysis is proposed that assesses technical issues such as energy export, losses, and short-circuit levels. A multiobjective programming approach based on the nondominated sorting genetic algorithm (NSGA) is applied in order to find configurations that maximize the integration of distributed wind power generation (DWPG) while satisfying voltage and thermal limits. The approach has been applied to a medium voltage distribution network considering hourly demand and wind profiles for part of the U.K. The Pareto optimal solutions obtained highlight the drawbacks of using a single demand and generation scenario, and indicate the importance of appropriate substation voltage settings for maximizing the connection of MPG.

Umidificação e aquecimento do gás inalado durante ventilação artificial com baixo fluxo e fluxo mínimo de gases frescos

JUSTIFICATIVA E OBJETIVOS: em pacientes sob intubação traqueal ou traqueostomia, a umidificação e o aquecimento do gás inalado são necessários para a prevenção de lesões no sistema respiratório, conseqüentes ao contato do gás frio e seco com as vias aéreas. O objetivo da pesquisa foi avaliar o efeito do sistema respiratório circular com absorvedor de dióxido de carbono do aparelho de anestesia Cícero da Dräger, quanto à capacidade de aquecimento e umidificação dos gases inalados, utilizando-se fluxo baixo (1 L.min-1) ou mínimo (0,5 L.min-1) de gases frescos. MÉTODO: O estudo aleatório foi realizado em 24 pacientes, estado físico ASA I, com idades entre 18 e 65 anos, submetidos à anestesia geral, utilizando-se a Estação de Trabalho Cícero da Dräger (Alemanha), para realização de cirurgias abdominais, os quais foram distribuídos aleatoriamente em dois grupos: grupo de Baixo Fluxo (BF), no qual foi administrado 0,5 L.min-1 de oxigênio e 0,5 L.min-1 de óxido nitroso e fluxo mínimo (FM), administrando-se somente oxigênio a 0,5 L.min-1. Os atributos estudados foram temperatura, umidade relativa e absoluta da sala de operação e do gás no sistema inspiratório. RESULTADOS: Os valores da temperatura, umidade relativa e umidade absoluta no sistema inspiratório na saída do aparelho de anestesia e junto ao tubo traqueal não apresentaram diferença significante entre os grupos, mas aumentaram ao longo do tempo nos dois grupos (BF e FM), havendo influência da temperatura da sala de operação sobre a temperatura do gás inalado, nos dois grupos estudados. Níveis de umidade e temperatura próximos dos ideais foram alcançados, nos dois grupos, a partir de 90 minutos. CONCLUSÕES: Não há diferença significante da umidade e temperatura do gás inalado utilizando-se baixo fluxo e fluxo mínimo de gases frescos.

A metaheuristic to solve the transmission expansion planning

In this letter, a genetic algorithm (GA) is applied to solve - the static and multistage transmission expansion planning (TEP) problem. The characteristics of the proposed GA to solve the TEP problem are presented. Results using some known systems show that the proposed GA solves a smaller number of linear programming problems in order to find the optimal solutions and obtains a better solution for the multistage TEP problem.

Discrete approximations for strict convex continuous time problems and duality

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

Parallel simulated annealing applied to long term transmission network expansion planning

The simulated annealing optimization technique has been successfully applied to a number of electrical engineering problems, including transmission system expansion planning. The method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Moreover, it has the ability to provide solutions arbitrarily close to an optimum (i.e. it is asymptotically convergent) as the cooling process slows down. The drawback of the approach is the computational burden: finding optimal solutions may be extremely expensive in some cases. This paper presents a Parallel Simulated Annealing, PSA, algorithm for solving the long term transmission network expansion planning problem. A strategy that does not affect the basic convergence properties of the Sequential Simulated Annealing algorithm have been implementeded and tested. The paper investigates the conditions under which the parallel algorithm is most efficient. The parallel implementations have been tested on three example networks: a small 6-bus network, and two complex real-life networks. Excellent results are reported in the test section of the paper: in addition to reductions in computing times, the Parallel Simulated Annealing algorithm proposed in the paper has shown significant improvements in solution quality for the largest of the test networks.

Test systems and mathematical models for transmission network expansion planning

The data of four networks that can be used in carrying out comparative studies with methods for transmission network expansion planning are given. These networks are of various types and different levels of complexity. The main mathematical formulations used in transmission expansion studies-transportation models, hybrid models, DC power flow models, and disjunctive models are also summarised and compared. The main algorithm families are reviewed-both analytical, combinatorial and heuristic approaches. Optimal solutions are not yet known for some of the four networks when more accurate models (e.g. The DC model) are used to represent the power flow equations-the state of the art with regard to this is also summarised. This should serve as a challenge to authors searching for new, more efficient methods.

A class of multiobjective control problems

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

Transmission system expansion planning by a branch-and-bound algorithm

A branch and bound (B& B) algorithm using the DC model, to solve the power system transmission expansion planning by incorporating the electrical losses in network modelling problem is presented. This is a mixed integer nonlinear programming (MINLP) problem, and in this approach, the so-called fathoming tests in the B&B algorithm were redefined and a nonlinear programming (NLP) problem is solved in each node of the B& B tree, using an interior-point method. Pseudocosts were used to manage the development of the B&B tree and to decrease its size and the processing time. There is no guarantee of convergence towards global optimisation for the MINLP problem. However, preliminary tests show that the algorithm easily converges towards the best-known solutions or to the optimal solutions for all the tested systems neglecting the electrical losses. When the electrical losses are taken into account, the solution obtained using the Garver system is better than the best one known in the literature.

Distributed generation impact evaluation using a multi-objective tabu search

Distribution networks paradigm is changing currently requiring improved methodologies and tools for network analysis and planning. A relevant issue is analyzing the impact of the Distributed Generation penetration in passive networks considering different operation scenarios. Studying DG optimal siting and sizing the planner can identify the network behavior in presence of DG. Many approaches for the optimal DG allocation problem successfully used multi-objective optimization techniques. So this paper contributes to the fundamental stage of multi-objective optimization of finding the Pareto optimal solutions set. It is proposed the application of a Multi-objective Tabu Search and it was verified a better performance comparing to the NSGA-II method. © 2009 IEEE.

Evolutionary multi-move path-relinking for transmission network expansion planning

This paper presents the application of a new metaheuristic algorithm to solve the transmission expansion planning problem. A simple heuristic, using a relaxed network model associated with cost perturbation, is applied to generate a set of high quality initial solutions with different topologies. The population is evolved using a multi-move path-relinking with the objective of finding minimum investment cost for the transmission expansion planning problem employing the DC representation. The algorithm is tested on the southern Brazilian system, obtaining the optimal solution for the system with better performance than similar metaheuristics algorithms applied to the same problem. ©2010 IEEE.

Optimum-Path Forest pruning parameter estimation through Harmony Search

Pattern recognition in large amount of data has been paramount in the last decade, since that is not straightforward to design interactive and real time classification systems. Very recently, the Optimum-Path Forest classifier was proposed to overcome such limitations, together with its training set pruning algorithm, which requires a parameter that has been empirically set up to date. In this paper, we propose a Harmony Search-based algorithm that can find near optimal values for that. The experimental results have showed that our algorithm is able to find proper values for the OPF pruning algorithm parameter. © 2011 IEEE.

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.