773 resultados para Collaborative Network Model
Resumo:
This paper presents an efficient neural network for solving constrained nonlinear optimization problems. More specifically, a two-stage neural network architecture is developed and its internal parameters are computed using the valid-subspace technique. The main advantage of the developed network is that it treats optimization and constraint terms in different stages with no interference with each other. Moreover, the proposed approach does not require specification of penalty or weighting parameters for its initialization.
Resumo:
Esse trabalho tem por objetivo o desenvolvimento de um sistema inteligente para detecção da queima no processo de retificação tangencial plana através da utilização de uma rede neural perceptron multi camadas, treinada para generalizar o processo e, conseqüentemente, obter o limiar de queima. em geral, a ocorrência da queima no processo de retificação pode ser detectada pelos parâmetros DPO e FKS. Porém esses parâmetros não são eficientes nas condições de usinagem usadas nesse trabalho. Os sinais de emissão acústica e potência elétrica do motor de acionamento do rebolo são variáveis de entrada e a variável de saída é a ocorrência da queima. No trabalho experimental, foram empregados um tipo de aço (ABNT 1045 temperado) e um tipo de rebolo denominado TARGA, modelo ART 3TG80.3 NVHB.
Resumo:
The photo-oxidation of acid orange 52 dye was performed in the presence of H2O2, utilizing UV light, aiming the discoloration process modeling and the process variable influence characterization. The discoloration process was modeled by the use of feedforward neural network. Each sample was characterized by five independent variables (dye concentration, pH, hydrogen peroxide volume, temperature and time of operation) and a dependent variable (absorbance). The neural model has also provided, through Garson Partition coefficients and the Pertubation method, the independent variable influence order determination. The results indicated that the time of operation was the predominant variable and reaction mean temperature was the lesser influent variable. The neural model obtained presented coefficients of correlation on the order 0.98, for sets of trainability, validation and testing, indicating the power of prediction of the model and its character of generalization. (c) 2007 Elsevier B.V. All rights reserved.
Resumo:
This article presents a well-known interior point method (IPM) used to solve problems of linear programming that appear as sub-problems in the solution of the long-term transmission network expansion planning problem. The linear programming problem appears when the transportation model is used, and when there is the intention to solve the planning problem using a constructive heuristic algorithm (CHA), ora branch-and-bound algorithm. This paper shows the application of the IPM in a CHA. A good performance of the IPM was obtained, and then it can be used as tool inside algorithm, used to solve the planning problem. Illustrative tests are shown, using electrical systems known in the specialized literature. (C) 2005 Elsevier B.V. All rights reserved.
Resumo:
This paper presents for the first time how to easily incorporate facts devices in an optimal active power flow model such that an efficient interior-point method may be applied. The optimal active power flow model is based on a network flow approach instead of the traditional nodal formulation that allows the use of an efficiently predictor-corrector interior point method speed up by sparsity exploitation. The mathematical equivalence between the network flow and the nodal models is addressed, as well as the computational advantages of the former considering the solution by interior point methods. The adequacy of the network flow model for representing facts devices is presented and illustrated on a small 5-bus system. The model was implemented using Matlab and its performance was evaluated with the 3,397-bus and 4,075-branch Brazilian power system which show the robustness and efficiency of the formulation proposed. The numerical results also indicate an efficient tool for optimal active power flow that is suitable for incorporating facts devices.
Resumo:
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.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
A gestão colaborativa é, atualmente, um elemento-chave no contexto da gestão da cadeia de suprimentos. Neste artigo, o tema é abordado mediante a análise de um caso real, em que uma grande rede mundial de fast-food e seu prestador de serviço logístico (PSL) trabalharam conjuntamente no Brasil em um projeto-piloto para a implementação de um collaborative planning, forecasting, and replenishment (CPFR). O trabalho faz uso de uma metodologia de pesquisa-ação e apresenta as principais variáveis que influenciaram o projeto, abordando os processos necessários para a implementação e os pontos que favorecem o CPFR. Com base no caso estudado, o trabalho apresenta um conjunto de propostas sobre o papel dos agentes da cadeia em projetos dessa natureza. A gestão da cadeia de suprimentos por intermédio da coordenação direta de um PSL também permite demonstrar as possibilidades e dificuldades desse sistema, contribuindo com a visão colaborativa na cadeia de suprimentos a partir da relação entre seus agentes.
Resumo:
OBJETIVO: Descrever o recrutamento de pacientes, instrumentos de avaliação, métodos para o desenvolvimento de estudos colaborativos multicêntricos e os resultados preliminares do Consórcio Brasileiro de Pesquisa em Transtornos do Espectro Obsessivo-Compulsivo, que inclui sete centros universitários. MÉTODO: Este estudo transversal incluiu entrevistas semi-estruturadas (dados sociodemográficos, histórico médico e psiquiátrico, curso da doença e diagnósticos psiquiátricos comórbidos) e instrumentos que avaliam os sintomas do transtorno obsessivo-compulsivo (Escala para Sintomas Obsessivo-Compulsivos de Yale-Brown e Escala Dimensional para Sintomas Obsessivo-Compulsivos de Yale-Brown), sintomas depressivos (Inventário de Depressão de Beck), sintomas ansiosos (Inventário de Ansiedade de Beck), fenômenos sensoriais (Escala de Fenômenos Sensoriais da Universidade de São Paulo), juízo crítico (Escala de Avaliação de Crenças de Brown), tiques (Escala de Gravidade Global de Tiques de Yale) e qualidade de vida (questionário genérico de avaliação de qualidade de vida, Medical Outcome Quality of Life Scale Short-form-36 e Escala de Avaliação Social). O treinamento dos avaliadores consistiu em assistir cinco entrevistas filmadas e entrevistar cinco pacientes junto com um pesquisador mais experiente, antes de entrevistar pacientes sozinhos. A confiabilidade entre todos os líderes de grupo para os instrumentos mais importantes (Structured Clinical Interview for DSM-IV, Dimensional Yale-Brown Obsessive-Compulsive Scale, Universidade de São Paulo Sensory Phenomena Scale ) foi medida após seis entrevistas completas. RESULTADOS: A confiabilidade entre avaliadores foi de 96%. Até março de 2008, 630 pacientes com transtorno obsessivo-compulsivo tinham sido sistematicamente avaliados. A média de idade (±SE) foi de 34,7 (±0,51), 56,3% eram do sexo feminino e 84,6% caucasianos. Os sintomas obsessivo-compulsivos mais prevalentes foram os de simetria e os de contaminação. As comorbidades psiquiátricas mais comuns foram depressão maior, ansiedade generalizada e transtorno de ansiedade social. O transtorno de controle de impulsos mais comum foi escoriação neurótica. CONCLUSÃO: Este consórcio de pesquisa, pioneiro no Brasil, permitiu delinear o perfil sociodemográfico, clínico e terapêutico do paciente com transtorno obsessivo-compulsivo em uma grande amostra clínica de pacientes. O Consórcio Brasileiro de Pesquisa em Transtornos do Espectro Obsessivo-Compulsivo estabeleceu uma importante rede de colaboração de investigação clínica padronizada sobre o transtorno obsessivo-compulsivo e pode abrir o caminho para projetos semelhantes destinados a integrar outros grupos de pesquisa no Brasil e em todo o mundo.
Resumo:
In this paper, short term hydroelectric scheduling is formulated as a network flow optimization model and solved by interior point methods. The primal-dual and predictor-corrector versions of such interior point methods are developed and the resulting matrix structure is explored. This structure leads to very fast iterations since it avoids computation and factorization of impedance matrices. For each time interval, the linear algebra reduces to the solution of two linear systems, either to the number of buses or to the number of independent loops. Either matrix is invariant and can be factored off-line. As a consequence of such matrix manipulations, a linear system which changes at each iteration has to be solved, although its size is reduced to the number of generating units and is not a function of time intervals. These methods were applied to IEEE and Brazilian power systems, and numerical results were obtained using a MATLAB implementation. Both interior point methods proved to be robust and achieved fast convergence for all instances tested. (C) 2004 Elsevier Ltd. All rights reserved.
Resumo:
A mathematical model and a methodology to solve the transmission network expansion planning problem with security constraints are presented. The methodology allows one to find an optimal and reliable transmission network expansion plan using a DC model to represent the electrical network. The security (n-1) criterion is used. The model presented is solved using a genetic algorithm designed to solve the reliable expansion planning in an efficient way. The results obtained for several known systems from literature show the excellent performance of the proposed methodology. A comparative analysis of the results obtained with the proposed methodology is also presented.
Resumo:
Systems based on artificial neural networks have high computational rates due to the use of a massive number of simple processing elements. Neural networks with feedback connections provide a computing model capable of solving a rich class of optimization problems. In this paper, a modified Hopfield network is developed for solving constrained nonlinear optimization problems. The internal parameters of the network are obtained using the valid-subspace technique. Simulated examples are presented as an illustration of the proposed approach.
Resumo:
A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.
Resumo:
A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been rested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.