A constructive heuristic algorithm to Short Term Transmission Network Expansion Planning

In this paper a method for solving the Short Term Transmission Network Expansion Planning (STTNEP) problem is presented. The STTNEP is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In this work we present a constructive heuristic algorithm to find a solution of the STTNEP of excellent quality. In each step of the algorithm a sensitivity index is used to add a circuit (transmission line or transformer) to the system. This sensitivity index is obtained solving the STTNEP problem considering as a continuous variable the number of circuits to be added (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an interior points method that uses a combination of the multiple predictor corrector and multiple centrality corrections methods, both belonging to the family of higher order interior points method (HOIPM). Tests were carried out using a modified Carver system and the results presented show the good performance of both the constructive heuristic algorithm to solve the STTNEP problem and the HOIPM used in each step.

A new method for real time computation of power quality indices based on instantaneous space phasors

One of the important issues about using renewable energy is the integration of dispersed generation in the distribution networks. Previous experience has shown that the integration of dispersed generation can improve voltage profile in the network, decrease loss etc. but can create safety and technical problems as well, This work report the application of the instantaneous space phasors and the instantaneous complex power in observing performances of the distribution networks with dispersed generators in steady state. New IEEE apparent power definition, the so called Buccholz-Goodhue apparent power, as well as new proposed power quality (oscillation) index in the three-phase distribution systems with unbalanced loads and dispersed generators, are applied. Results obtained from several case studies using IEEE 34 nodes test network are presented and discussed.

A branch-and-bound algorithm for the multi-stage transmission expansion planning

This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models or to more complex ones such as the DC model. Tests with a realistic power system were carried out in order to show the performance of the algorithm for the expansion plan executed for different time frames. © 2005 IEEE.

Global optimization for the ℋ∞-norm model reduction problem

A branch and bound algorithm is proposed to solve the [image omitted]-norm model reduction problem for continuous and discrete-time linear systems, with convergence to the global optimum in a finite time. The lower and upper bounds in the optimization procedure are described by linear matrix inequalities (LMI). Also proposed are two methods with which to reduce the convergence time of the branch and bound algorithm: the first one uses the Hankel singular values as a sufficient condition to stop the algorithm, providing to the method a fast convergence to the global optimum. The second one assumes that the reduced model is in the controllable or observable canonical form. The [image omitted]-norm of the error between the original model and the reduced model is considered. Examples illustrate the application of the proposed method.

A genetic neuro-model reference adaptive controller for petroleum wells drilling operations

Motivated by rising drilling operation costs, the oil industry has shown a trend towards real-time measurements and control. In this scenario, drilling control becomes a challenging problem for the industry, especially due to the difficulty associated to parameters modeling. One of the drill-bit performance evaluators, the Rate of Penetration (ROP), has been used in the literature as a drilling control parameter. However, the relationships between the operational variables affecting the ROP are complex and not easily modeled. This work presents a neuro-genetic adaptive controller to treat this problem. It is based on the Auto-Regressive with Extra Input Signals model, or ARX model, to accomplish the system identification and on a Genetic Algorithm (GA) to provide a robust control for the ROP. Results of simulations run over a real offshore oil field data, consisted of seven wells drilled with equal diameter bits, are provided. © 2006 IEEE.

Heuristic algorithm to solve the short term transmission network expansion planning

In this paper, a method for solving the short term transmission network expansion planning problem is presented. This is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In order to And a solution of excellent quality for this problem, a constructive heuristic algorithm is presented in this paper. In each step of the algorithm, a sensitivity index is used to add a circuit (transmission line or transformer) or a capacitor bank (fixed or variable) to the system. This sensitivity index is obtained solving the problem considering the numbers of circuits and capacitors banks to be added (relaxed problem), as continuous variables. The relaxed problem is a large and complex nonlinear programming and was solved through a higher order interior point method. The paper shows results of several tests that were performed using three well-known electric energy systems in order to show the possibility and the advantages of using the AC model. ©2007 IEEE.

Distribution network reconfiguration using an efficient evolutionary algorithm

Network reconfiguration is an important tool to optimize the operating conditions of a distribution system. This is accomplished modifying the network structure of distribution feeders by changing the open/close status of sectionalizing switches. This not only reduces the power losses, but also relieves the overloading of the network components. Network reconfiguration belongs to a complex family of problems because of their combinatorial nature and multiple constraints. This paper proposes a solution to this problem, using a specialized evolutionary algorithm, with a novel codification, and a brand new way of implement the genetic operators considering the problem characteristics. The algorithm is presented and tested in a real distribution system, showing excellent results and computational efficiency. © 2007 IEEE.

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.

Mathematical decomposition technique applied to the probabilistic power flow problem

In this paper a framework based on the decomposition of the first-order optimality conditions is described and applied to solve the Probabilistic Power Flow (PPF) problem in a coordinated but decentralized way in the context of multi-area power systems. The purpose of the decomposition framework is to solve the problem through a process of solving smaller subproblems, associated with each area of the power system, iteratively. This strategy allows the probabilistic analysis of the variables of interest, in a particular area, without explicit knowledge of network data of the other interconnected areas, being only necessary to exchange border information related to the tie-lines between areas. An efficient method for probabilistic analysis, considering uncertainty in n system loads, is applied. The proposal is to use a particular case of the point estimate method, known as Two-Point Estimate Method (TPM), rather than the traditional approach based on Monte Carlo simulation. The main feature of the TPM is that it only requires resolve 2n power flows for to obtain the behavior of any random variable. An iterative coordination algorithm between areas is also presented. This algorithm solves the Multi-Area PPF problem in a decentralized way, ensures the independent operation of each area and integrates the decomposition framework and the TPM appropriately. The IEEE RTS-96 system is used in order to show the operation and effectiveness of the proposed approach and the Monte Carlo simulations are used to validation of the results. © 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.

Stress, sintomas físicos, psicológicos e enfrentamento de situações estressoras em profissionais da sáude que atuam em hospitais

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

A resolução de problemas na licenciatura em Matemática: análise de um processo de formação no contexto do estágio curricular supervisionado

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

Métodos de solução para um problema de sequenciamento da produção com sincronismo de execução de tarefas

Pós-graduação em Engenharia Mecânica - FEG

Geoprocessamento e computação inteligente: possibilidades, vantagens e necessidades

Pós-graduação em Geografia - IGCE

Avaliação do desenvolvimento de crianças em acolhimento institucional

O presente estudo aborda o desenvolvimento de crianças em instituição de acolhimento infantil (abrigo) a partir da utilização de escalas avaliativas. Destaca-se compreender o desenvolvimento, sob o enfoque de aspectos relacionados à comunicação, coordenação motora fina e grossa, resolução de problemas e comportamento pessoal-social. Participaram da pesquisa seis crianças com idades compreendidas entre 4 e 9 meses e as educadoras de referência dos dormitórios das crianças envolvidas no estudo. Para tanto, utilizou-se dados coletados da avaliação de crianças a partir da aplicação das escalas Ages and Stages Questionnaires third edition (ASQ- 3) e Bayley Scales of Infant Development second edition. As crianças selecionadas para o estudo também foram observadas através de um Roteiro de Observação Sistematizada, estruturado previamente com inspiração em três escalas de desenvolvimento para crianças de 1 a 12 meses. Dados referentes à história pregressa de todas as crianças envolvidas no estudo, também foram considerados e obtidos por meio de relatos informais da equipe da instituição de acolhimento e através de documentos (prontuários) junto à direção. A avaliação demonstrou que cinco das seis crianças avaliadas pela ASQ-3, tiveram seus resultados ratificados pelas escala Bayley II e destas, quatro estão em risco para o desenvolvimento e necessitariam de avaliação mais aprofundada nas áreas de coordenação motora ampla e resolução de problema. O estudo realizado, além de contribuir para a compreensão do desenvolvimento das crianças nessas instituições, principalmente, no sentido de prevenir os danos oriundos da ausência de atenção precoce, demonstra, ainda, que as educadoras presentes nesses locais podem ser capazes de avaliar alterações que possam surgir no curso do desenvolvimento das crianças sob sua responsabilidade, pois os resultados do instrumento de triagem utilizado pelas educadoras foram ratificados pela avaliação realizada por um profissional a partir da escala Bayley. Propõe-se que estudos futuros possam reconhecer a importância das educadoras neste processo.