719 resultados para 3G PLANNING


Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present a bilevel model for transmission expansion planning within a market environment, where producers and consumers trade freely electric energy through a pool. The target of the transmission planner, modeled through the upper-level problem, is to minimize network investment cost while facilitating energy trading. This upper-level problem is constrained by a collection of lower-level market clearing problems representing pool trading, and whose individual objective functions correspond to social welfare. Using the duality theory the proposed bilevel model is recast as a mixed-integer linear programming problem, which is solvable using branch-and-cut solvers. Detailed results from an illustrative example and a case study are presented and discussed. Finally, some relevant conclusions are drawn.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper proposes a methodology to achieve integrated planning and projects for secondary distribution circuits. The planning model is formulated as a mixed integer nonlinear programming problem (MINLP). In order to resolve this problem, a tabu search (TS) algorithm is used, with a neighborhood structure developed to explore the physical characteristics of specific geographies included in the planning and expansion of secondary networks, thus obtaining effective solutions as well as low operating costs and investments. The project stage of secondary circuits consists of calculating the mechanical efforts to determine the support structures of the primary and secondary distribution systems and determining the types of structures that should be used in the system according to topological and electrical parameters of the network and, therefore, accurately assessing the costs involved in the construction and/or reform of secondary systems. A constructive heuristic based on information of the electrical and topological conditions between the medium voltage and low voltage systems is used to connect the primary systems and secondary circuits. The results obtained from planning and design simulations of a real secondary system of electric energy distribution are presented.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Neste trabalho é analisada a aplicação de algoritmos heurísticos para o Modelo Híbrido Linear - Hybrid Linear Model (HLM) - no problema de planejamento da expansão de sistemas de transmissão. O HLM é um modelo relaxado que ainda não foi suficientemente explorado. Assim, é realizada uma análise das características do modelo matemático e das técnicas de solução que podem ser usadas para resolver este tipo de modelo. O trabalho analisa em detalhes um algoritmo heurístico construtivo para o HLM e faz uma extensão da modelagem e da técnica de solução para o planejamento multi-estágio da expansão de sistemas de transmissão. Dentro deste contexto, também é realizada uma avaliação da qualidade das soluções encontradas pelo HLM e as possibilidades de aplicação deste modelo em planejamento de sistemas de transmissão. Finalmente, são apresentados testes com sistemas conhecidos na literatura especializada.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Veterinary surgery for treatment of wild animals is becoming an increasingly demanding task because it involves animals of different anatomy, many of them are already stressed and treatment must be performed to the highest standard in the minimum period of time. Craniofacial alterations may occur for three main reasons: genetic, functional or a combination of both. It is possible to modify the functional cause using intraoral devices like inclined plane. The treatment planning can be made based on virtual 3D models and rapid prototyping. An approximately 9 months old, 3.7 kg male Brazilian fox (Lycalopex vetulus) was referred to the Veterinary Hospital. Physical examination showed malocclusion with a deviation of the mandible to the right side. The virtual 3D model of the head was generated based on CT image data. The 3D models and rapid prototyping opened up new possibilities for the surgical planning and treatment of wild animals.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The aim of this study was to present the factors that influence planning for immediate loading of implants through a literature review for treatment success. Research was conducted in the PubMed database including the key words immediate implant loading, implant-supported prostheses, and implant planning for studies published from 2000 to 2011. Forty-eight articles were used in this review to describe the indications and counterindications, presurgical planning, and technologies available for planning of this treatment alternative.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the management branch model where the random resources of the subsystem are given by the exponential distributions. The determinate equivalent is a block structure problem of quadratic programming. It is solved effectively by means of the decomposition method, which is based on iterative aggregation. The aggregation problem of the upper level is resolved analytically. This overcomes all difficulties concerning the large dimension of the main problem.

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this letter, a genetic algorithm (GA) is applied to solve - the static and multistage transmission expansion planning (TEP) problem. The characteristics of the proposed GA to solve the TEP problem are presented. Results using some known systems show that the proposed GA solves a smaller number of linear programming problems in order to find the optimal solutions and obtains a better solution for the multistage TEP problem.