Desenvolvimento de uma rede neuro-fuzzy para a previsão da carga

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

Refinamento geométrico de contornos e cumeeiras de telhados de edifícios extraídos de dados laser com uso de imagem aérea

In this paper, a method is proposed to refine the LASER 3D roofs geometrically by using a high-resolution aerial image and Markov Random Field (MRF) models. In order to do so, a MRF description for grouping straight lines is developed, assuming that each projected side contour and ridge is topologically correct and that it is only necessary to improve its accuracy. Although the combination of laser data with data from image is most justified for refining roof contour, the structure of ridges can give greater robustness in the topological description of the roof structure. The MRF model is formulated based on relationships (length, proximity, and orientation) between the straight lines extracted from the image and projected polygon and also on retangularity and corner injunctions. The energy function associated with MRF is minimized by the genetic algorithm optimization method, resulting in the grouping of straight lines for each roof object. Finally, each grouping of straight lines is topologically reconstructed based on the topology of the corresponding LASER scanning polygon projected onto the image-space. The results obtained were satisfactory. This method was able to provide polygons roof refined buildings in which most of its contour sides and ridges were geometrically improved.

Estudo da dinâmica de populações utilizando a técnica de polinômios de colocação

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

Evaluation of an average numerator relationship matrix model and a Bayesian hierarchical model for growth traits in Nellore cattle with uncertain paternity

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

Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem

The Capacitated Centered Clustering Problem (CCCP) consists of defining a set of p groups with minimum dissimilarity on a network with n points. Demand values are associated with each point and each group has a demand capacity. The problem is well known to be NP-hard and has many practical applications. In this paper, the hybrid method Clustering Search (CS) is implemented to solve the CCCP. This method identifies promising regions of the search space by generating solutions with a metaheuristic, such as Genetic Algorithm, and clustering them into clusters that are then explored further with local search heuristics. Computational results considering instances available in the literature are presented to demonstrate the efficacy of CS. (C) 2010 Elsevier Ltd. All rights reserved.

Allocation of protective devices in distribution circuits using nonlinear programming models and genetic algorithms

The optimized allocation of protective devices in strategic points of the circuit improves the quality of the energy supply and the system reliability index. This paper presents a nonlinear integer programming (NLIP) model with binary variables, to deal with the problem of protective device allocation in the main feeder and all branches of an overhead distribution circuit, to improve the reliability index and to provide customers with service of high quality and reliability. The constraints considered in the problem take into account technical and economical limitations, such as coordination problems of serial protective devices, available equipment, the importance of the feeder and the circuit topology. The use of genetic algorithms (GAs) is proposed to solve this problem, using a binary representation that does (1) or does not (0) show allocation of protective devices (reclosers, sectionalizers and fuses) in predefined points of the circuit. Results are presented for a real circuit (134 busses), with the possibility of protective device allocation in 29 points. Also the ability of the algorithm in finding good solutions while improving significantly the indicators of reliability is shown. (C) 2003 Elsevier B.V. All rights reserved.

Sensitivity analysis by neural networks applied to power systems transient stability

This work presents a procedure for transient stability analysis and preventive control of electric power systems, which is formulated by a multilayer feedforward neural network. The neural network training is realized by using the back-propagation algorithm with fuzzy controller and adaptation of the inclination and translation parameters of the nonlinear function. These procedures provide a faster convergence and more precise results, if compared to the traditional back-propagation algorithm. The adaptation of the training rate is effectuated by using the information of the global error and global error variation. After finishing the training, the neural network is capable of estimating the security margin and the sensitivity analysis. Considering this information, it is possible to develop a method for the realization of the security correction (preventive control) for levels considered appropriate to the system, based on generation reallocation and load shedding. An application for a multimachine power system is presented to illustrate the proposed methodology. (c) 2006 Elsevier B.V. All rights reserved.

Multistage and coordinated planning of the expansion of transmission systems

In this paper, an efficient genetic algorithm (GA) is presented to solve the problem of multistage and coordinated transmission expansion planning. This is a mixed integer nonlinear programming problem, difficult for systems of medium and large size and high complexity. The GA presented has a set of specialized genetic operators and an efficient form of generation of the initial population that finds high quality suboptimal topologies for large size and high complexity systems. In these systems, multistage and coordinated planning present a lower investment than static planning. Tests results are shown in one medium complexity system and one large size high complexity system.

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.

A Constructive Heuristic Algorithm for Distribution System Planning

A constructive heuristic algorithm (CHA) to solve distribution system planning (DSP) problem is presented. The DSP is a very complex mixed binary nonlinear programming problem. A CHA is aimed at obtaining an excellent quality solution for the DSP problem. However, a local improvement phase and a branching technique were implemented in the CHA to improve its solution. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution system. This sensitivity index is obtained by solving the DSP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. Results of two tests systems and one real distribution system are presented in this paper in order to show the ability of the proposed algorithm.

Efficient method for AC transmission network expansion planning

A combinatorial mathematical model in tandem with a metaheuristic technique for solving transmission network expansion planning (TNEP) using an AC model associated with reactive power planning (RPP) is presented in this paper. AC-TNEP is handled through a prior DC model while additional lines as well as VAr-plants are used as reinforcements to cope with real network requirements. The solution of the reinforcement stage can be obtained by assuming all reactive demands are supplied locally to achieve a solution for AC-TNEP and by neglecting the local reactive sources, a reactive power planning (RPP) will be managed to find the minimum required reactive power sources. Binary GA as well as a real genetic algorithm (RCA) are employed as metaheuristic optimization techniques for solving this combinatorial TNEP as well as the RPP problem. High quality results related with lower investment costs through case studies on test systems show the usefulness of the proposal when working directly with the AC model in transmission network expansion planning, instead of relaxed models. (C) 2010 Elsevier B.V. All rights reserved.

Modelo de programação matemática para controle do crescimento da vegetação sob redes de distribuição de energia elétrica

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

Vibration Attenuation in Rotating Machines Using Smart Spring Mechanism

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

Um algoritmo genético especializado aplicado ao planejamento da expansão do sistema de transmissão com alocação de dispositivos de compensação série

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

Comparação de diferentes estratégias para a análise de características de crescimento e de carcaça de suínos cruzados: modelos finito e infinitesimal poligênico

Foi utilizada uma análise de segregação com o uso da inferência Bayesiana para estimar componentes de variância e verificar a presença de genes de efeito principal (GEP) influenciando duas características de carcaça: gordura intramuscular (GIM), em %, e espessura de toucinho (ET), em mm; e uma de crescimento, ganho de peso (g/dia) dos 25 aos 90 kg de peso vivo (GP). Para este estudo, foram utilizadas informações de 1.257 animais provenientes de um delineamento de F2, obtidos do cruzamento de suínos machos Meishan e fêmeas Large White e Landrace. No melhoramento genético animal, os modelos poligênicos finitos (MPF) podem ser uma alternativa aos modelos poligênicos infinitesimais (MPI) para avaliação genética de características quantitativas usando pedigrees complexos. MPI, MPF e MPI combinado com MPF foram empiricamente testados para se estimar componentes de variâncias e número de genes no MPF. Para a estimação de médias marginais a posteriori de componentes de variância e de parâmetros, foi utilizada uma metodologia Bayesiana, por meio do uso da Cadeia de Markov, algoritmos de Monte Carlo (MCMC), via Amostrador de Gibbs e Reversible Jump Sampler (Metropolis-Hastings). em função dos resultados obtidos, pode-se evidenciar quatro GEP, sendo dois para GIM e dois para ET. Para ET, o GEP explicou a maior parte da variação genética, enquanto, para GIM, o GEP reduziu significativamente a variação poligênica. Para a variação do GP, não foi possível determinar a influência do GEP. As herdabilidades estimadas ajustando-se MPI para GIM, ET e GP foram de 0,37; 0,24 e 0,37, respectivamente. Estudos futuros com base neste experimento que usem marcadores moleculares para mapear os genes de efeito principal que afetem, principalmente GIM e ET, poderão lograr êxito.