Identification of Microturbine Model for Long-term Dynamic Analysis of Distribution Networks

As one of the most successfully commercialized distributed energy resources, the long-term effects of microturbines (MTs) on the distribution network has not been fully investigated due to the complex thermo-fluid-mechanical energy conversion processes. This is further complicated by the fact that the parameter and internal data of MTs are not always available to the electric utility, due to different ownerships and confidentiality concerns. To address this issue, a general modeling approach for MTs is proposed in this paper, which allows for the long-term simulation of the distribution network with multiple MTs. First, the feasibility of deriving a simplified MT model for long-term dynamic analysis of the distribution network is discussed, based on the physical understanding of dynamic processes that occurred within MTs. Then a three-stage identification method is developed in order to obtain a piecewise MT model and predict electro-mechanical system behaviors with saturation. Next, assisted with the electric power flow calculation tool, a fast simulation methodology is proposed to evaluate the long-term impact of multiple MTs on the distribution network. Finally, the model is verified by using Capstone C30 microturbine experiments, and further applied to the dynamic simulation of a modified IEEE 37-node test feeder with promising results.

An Estimation of Distribution Algorithm for Nurse Scheduling

Schedules can be built in a similar way to a human scheduler by using a set of rules that involve domain knowledge. This paper presents an Estimation of Distribution Algorithm (EDA) for the nurse scheduling problem, which involves choosing a suitable scheduling rule from a set for the assignment of each nurse. Unlike previous work that used Genetic Algorithms (GAs) to implement implicit learning, the learning in the proposed algorithm is explicit, i.e. we identify and mix building blocks directly. The EDA is applied to implement such explicit learning by building a Bayesian network of the joint distribution of solutions. The conditional probability of each variable in the network is computed according to an initial set of promising solutions. Subsequently, each new instance for each variable is generated by using the corresponding conditional probabilities, until all variables have been generated, i.e. in our case, a new rule string has been obtained. Another set of rule strings will be generated in this way, some of which will replace previous strings based on fitness selection. If stopping conditions are not met, the conditional probabilities for all nodes in the Bayesian network are updated again using the current set of promising rule strings. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed approach might be suitable for other scheduling problems.

An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering

This paper proposes a new memetic evolutionary algorithm to achieve explicit learning in rule-based nurse rostering, which involves applying a set of heuristic rules for each nurse's assignment. The main framework of the algorithm is an estimation of distribution algorithm, in which an ant-miner methodology improves the individual solutions produced in each generation. Unlike our previous work (where learning is implicit), the learning in the memetic estimation of distribution algorithm is explicit, i.e. we are able to identify building blocks directly. The overall approach learns by building a probabilistic model, i.e. an estimation of the probability distribution of individual nurse-rule pairs that are used to construct schedules. The local search processor (i.e. the ant-miner) reinforces nurse-rule pairs that receive higher rewards. A challenging real world nurse rostering problem is used as the test problem. Computational results show that the proposed approach outperforms most existing approaches. It is suggested that the learning methodologies suggested in this paper may be applied to other scheduling problems where schedules are built systematically according to specific rules.

An Estimation of Distribution Algorithm for Nurse Scheduling

Schedules can be built in a similar way to a human scheduler by using a set of rules that involve domain knowledge. This paper presents an Estimation of Distribution Algorithm (EDA) for the nurse scheduling problem, which involves choosing a suitable scheduling rule from a set for the assignment of each nurse. Unlike previous work that used Genetic Algorithms (GAs) to implement implicit learning, the learning in the proposed algorithm is explicit, i.e. we identify and mix building blocks directly. The EDA is applied to implement such explicit learning by building a Bayesian network of the joint distribution of solutions. The conditional probability of each variable in the network is computed according to an initial set of promising solutions. Subsequently, each new instance for each variable is generated by using the corresponding conditional probabilities, until all variables have been generated, i.e. in our case, a new rule string has been obtained. Another set of rule strings will be generated in this way, some of which will replace previous strings based on fitness selection. If stopping conditions are not met, the conditional probabilities for all nodes in the Bayesian network are updated again using the current set of promising rule strings. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed approach might be suitable for other scheduling problems.

An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering

This paper proposes a new memetic evolutionary algorithm to achieve explicit learning in rule-based nurse rostering, which involves applying a set of heuristic rules for each nurse's assignment. The main framework of the algorithm is an estimation of distribution algorithm, in which an ant-miner methodology improves the individual solutions produced in each generation. Unlike our previous work (where learning is implicit), the learning in the memetic estimation of distribution algorithm is explicit, i.e. we are able to identify building blocks directly. The overall approach learns by building a probabilistic model, i.e. an estimation of the probability distribution of individual nurse-rule pairs that are used to construct schedules. The local search processor (i.e. the ant-miner) reinforces nurse-rule pairs that receive higher rewards. A challenging real world nurse rostering problem is used as the test problem. Computational results show that the proposed approach outperforms most existing approaches. It is suggested that the learning methodologies suggested in this paper may be applied to other scheduling problems where schedules are built systematically according to specific rules.

An Estimation of Distribution Algorithm for Nurse Scheduling

Schedules can be built in a similar way to a human scheduler by using a set of rules that involve domain knowledge. This paper presents an Estimation of Distribution Algorithm (EDA) for the nurse scheduling problem, which involves choosing a suitable scheduling rule from a set for the assignment of each nurse. Unlike previous work that used Genetic Algorithms (GAs) to implement implicit learning, the learning in the proposed algorithm is explicit, i.e. we identify and mix building blocks directly. The EDA is applied to implement such explicit learning by building a Bayesian network of the joint distribution of solutions. The conditional probability of each variable in the network is computed according to an initial set of promising solutions. Subsequently, each new instance for each variable is generated by using the corresponding conditional probabilities, until all variables have been generated, i.e. in our case, a new rule string has been obtained. Another set of rule strings will be generated in this way, some of which will replace previous strings based on fitness selection. If stopping conditions are not met, the conditional probabilities for all nodes in the Bayesian network are updated again using the current set of promising rule strings. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed approach might be suitable for other scheduling problems.

How to observe : architecture : or, questions upon various subjects connected therewith, suggested for the direction of correspondents and travellers, and for the purpose of eliciting uniformity of observation and intelligence in their communications to the Institute /

Mode of access: Internet.

Design Optimization of Nozzle Shapes for Maximum Uniformity of Exit Flow

The objective of this study is to identify the optimal designs of converging-diverging supersonic and hypersonic nozzles that perform at maximum uniformity of thermodynamic and flow-field properties with respect to their average values at the nozzle exit. Since this is a multi-objective design optimization problem, the design variables used are parameters defining the shape of the nozzle. This work presents how variation of such parameters can influence the nozzle exit flow non-uniformities. A Computational Fluid Dynamics (CFD) software package, ANSYS FLUENT, was used to simulate the compressible, viscous gas flow-field in forty nozzle shapes, including the heat transfer analysis. The results of two turbulence models, k-e and k-ω, were computed and compared. With the analysis results obtained, the Response Surface Methodology (RSM) was applied for the purpose of performing a multi-objective optimization. The optimization was performed with ModeFrontier software package using Kriging and Radial Basis Functions (RBF) response surfaces. Final Pareto optimal nozzle shapes were then analyzed with ANSYS FLUENT to confirm the accuracy of the optimization process.

Assessing the contribution of microgrids to the reliability of distribution networks

The emergence of microgeneration has recently lead to the concept of microgrid, a network of LV consumers and producers able to export electric energy in some circumstances and also to work in an isolated way in emergency situations. Research on the organization of microgrids, control devices, functionalities and other technical aspects is presently being carried out, in order to establish a consistent technical framework to support the concept. The successful development of the microgrid concept implies the definition of a suitable regulation for its integration on distribution systems. In order to define such a regulation, the identification of costs and benefits that microgrids may bring is a crucial task. Actually, this is the basis for a discussion about the way global costs could be divided among the different agents that benefit from the development of microgrids. Among other aspects, the effect of microgrids on the reliability of the distribution network has been pointed out as an important advantage, due to the ability of isolated operation in emergency situations. This paper identifies the situations where the existence of a microgrid may reduce the interruption rate and duration and thus improve the reliability indices of the distribution network. The relevant expressions necessary to quantify the reliability are presented. An illustrative example is included, where the global influence of the microgrid in the reliability is commented.

L’opération 5000/15000 logements sociaux et communautaires : une réponse au besoin en logements des ménages immigrants récents à Montréal, le cas de Côte-des-Neiges

Les cartes sur ce document ont été toutes conçues par l'auteur avec la logiciel ARCGIS version 9.3.

Variabilidade espacial na produção da alface em ambiente protegido

Este artigo mostra a dinâmica da água após ser aplicada sobre a superfície de um solo cultivado com alface, num sistema fechado de um ambiente protegido. A aplicação de água se deu por meio de um sistema de irrigação por gotejamento, com o CUD ( Coeficiente de Uniformidade de Distribuição ) igual a 97,06 %, o que garantiu uma ótima uniformidade de distribuição, desconsiderando como possíveis causas das variações de umidade do solo, a aplicação de lâminas variadas. Fazendo uso de técnicas de geoestatística, interpolando sessenta pontos amostrais de evaporação, umidade do solo e produtividade da alface, com as mesmas sessenta coordenadas para os três atributos, verificou-se que a umidade do solo, mesmo momentos após a irrigação, não permanece uniforme ao longo do sistema de irrigação, constatando-se que a evaporação local exerce influência de forma predominante sobre a dinâmica da água na superfície do solo. Concluiu-se que as regiões no interior da estufa de maiores evaporações, foram as de maiores variações de umidade do solo e na produção de massa verde da alface.

Avaliação qualitativa e quantitativa na deposição de calda de pulverização em quatro espécies do gênero commelina

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

Diferentes concentrações de ferro na água, seu efeito na cultura do girassol ornamental e no desempenho de gotejador

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

Uniformidade de distribuição temporal e espacial do KCL na fertirrigação, em um sistema de irrigação por gotejamento

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

Uso de inversor de frequência em sistema de irrigação do tipo pivô central e seu efeito na lâmina e uniformidade de distribuição de água

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