Uma metodologia para o controle de seguranca dinamica de sistemas de energia eletrica

This work presents an algorithm for the security control of electric power systems using control actions like generation reallocation, determined by sensitivity analysis (linearized model) and optimization by neural networks. The model is developed taking into account the dynamic network aspects. The preventive control methodology is developed by means of sensitivity analysis of the security margin related with the mechanical power of the system synchronous machines. The reallocation power in each machine is determined using neural networks. The neural network used in this work is of Hopfield type. These networks are dedicated electric circuits which simulate the constraint set and the objective function of an optimization problem. The advantage of using these networks is the higher speed in getting the solutions when compared to conventional optimization algorithms due to the great convergence rate of the process and the facility of the method parallelization. Then, the objectives are: formulate and investigate these networks implementations in determining. The generation reallocation in digital computers. Aiming to illustrate the proposed methodology an application considering a multi-machine system is presented.

Active control in flexible plates with piezoelectric actuators using linear matrix inequalities

The study of algorithms for active vibrations control in flexible structures became an area of enormous interest, mainly due to the countless demands of an optimal performance of mechanical systems as aircraft, aerospace and automotive structures. Smart structures, formed by a structure base, coupled with piezoelectric actuators and sensor are capable to guarantee the conditions demanded through the application of several types of controllers. The actuator/sensor materials are composed by piezoelectric ceramic (PZT - Lead Zirconate Titanate), commonly used as distributed actuators, and piezoelectric plastic films (PVDF-PolyVinyliDeno Floride), highly indicated for distributed sensors. The design process of such system encompasses three main phases: structural design; optimal placement of sensor/actuator (PVDF and PZT); and controller design. Consequently, for optimal design purposes, the structure, the sensor/actuator placement and the controller have to be considered simultaneously. This article addresses the optimal placement of actuators and sensors for design of controller for vibration attenuation in a flexible plate. Techniques involving linear matrix inequalities (LMI) to solve the Riccati's equation are used. The controller's gain is calculated using the linear quadratic regulator (LQR). The major advantage of LMI design is to enable specifications such as stability degree requirements, decay rate, input force limitation in the actuators and output peak bounder. It is also possible to assume that the model parameters involve uncertainties. LMI is a very useful tool for problems with constraints, where the parameters vary in a range of values. Once formulated in terms of LMI a problem can be solved efficiently by convex optimization algorithms.

Problem of assignment cells to switches in a cellular mobile network via beam search method

The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.

GRASP with evolutionary path-relinking for the capacitated arc routing problem

The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found. © 2011 Elsevier Ltd. All rights reserved.

The integrated lot sizing and cutting stock problem in a furniture factory

This work studies the integrated lot sizing and cutting stock problem, where the goal is to capture the dependency that exists between two important decisions in the production process, in order to economize raw materials and also reduce production and inventory costs. The integrated lot sizing and cutting stock problem is studied in a small furniture factory that produces wardrobes, dressing tables and cupboards and the lot sizing and cutting stock decisions are taken by the production manager. A column-generation technique is used to solve a linear relaxation of the proposed model. The computational results, using real data from the factory, show that it is possible to reduce total inventory and raw material costs when integrated planning is used. © 2013 IFAC.

A hybrid image restoration algorithm based on Projections onto Convex Sets and Harmony Search

Image restoration is a research field that attempts to recover a blurred and noisy image. Since it can be modeled as a linear system, we propose in this paper to use the meta-heuristics optimization algorithm Harmony Search (HS) to find out near-optimal solutions in a Projections Onto Convex Sets-based formulation to solve this problem. The experiments using HS and four of its variants have shown that we can obtain near-optimal and faster restored images than other evolutionary optimization approach. © 2013 IEEE.

Método de detecção interferométrica de fase, com baixa profundidade de modulação, aplicado à medição de deslocamentos nanométricos em atuadores e mini-manipuladores piezoelétricos

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

Metaheurística GRASP para o problema de planejamento da expansão de sistemas de transmissão de energia elétrica

Pós-graduação em Engenharia Elétrica - FEIS

Uma investigação da influência do parâmetro de barreira na solução do problema de fluxo de potência ótimo

Pós-graduação em Engenharia Elétrica - FEB

Abordagens de sistemas inteligentes para a solução do problema de despacho econômico de geração

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

Sequenciamento de lotes em prensas de alta capacidade com tempo de setup dependente da sequência

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

Heurísticas especializadas aplicadas ao problema de carregamento de contêiner

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

Aeroelastic stability analysis using linear matrix inequalities

The present work describes an alternative methodology for identification of aeroelastic stability in a range of varying parameters. Analysis is performed in time domain based on Lyapunov stability and solved by convex optimization algorithms. The theory is outlined and simulations are carried out on a benchmark system to illustrate the method. The classical methodology with the analysis of the system's eigenvalues is presented for comparing the results and validating the approach. The aeroelastic model is represented in state space format and the unsteady aerodynamic forces are written in time domain using rational function approximation. The problem is formulated as a polytopic differential inclusion system and the conceptual idea can be used in two different applications. In the first application the method verifies the aeroelastic stability in a range of air density (or its equivalent altitude range). In the second one, the stability is verified for a rage of velocities. These analyses are in contrast to the classical discrete analysis performed at fixed air density/velocity values. It is shown that this method is efficient to identify stability regions in the flight envelope and it offers promise for robust flutter identification.

Relax and cut: limitantes duais para o problema do caixeiro viajante

Pós-graduação em Matemática - IBILCE

Estudo dos problemas de corte e empacotamento

Pós-graduação em Engenharia Elétrica - FEIS