156 resultados para transmission network expansion planning


Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

A bilevel programming approach for the optimal contract pricing of distributed generation (DG) in distribution networks is presented. The outer optimization problem corresponds to the owner of the DG who must decide the contract price that would maximize his profits. The inner optimization problem corresponds to the distribution company (DisCo), which procures the minimization of the payments incurred in attending the expected demand while satisfying network constraints. The meet the expected demand the DisCo can purchase energy either form the transmission network through the substations or form the DG units within its network. The inner optimization problem is substituted by its Karush- Kuhn-Tucker optimality conditions, turning the bilevel programming problem into an equivalent single-level nonlinear programming problem which is solved using commercially available software. © 2010 IEEE.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Pós-graduação em Psicologia do Desenvolvimento e Aprendizagem - FC

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The spatial chaotic urban growth is an increasing and common problem in Brazilian cities, especially in the State of São Paulo. In order to assist the territorial expansion planning, the present study aimed to conduct the environmental diagnosis of urban expansion areas in the City of Jaguariúna – SP, bounded by the Municipal Plan. From the preparation and analysis of thematic maps, literature review and field analysis, data were collected for use and occupation, geology, geomorphology, pedology, vegetation, water resources and features surrounding the five urban sprawl existing areas. It was noted, in general, that these areas are suitable for urban occupation, since they show flat geomorphology characteristics, with flattened, medium to large hills, slightly undulated, with low slope, and soils that do not present risks to the deployment of buildings, once properly managed. It was also observed a few water bodies crossing these areas and a few areas with native vegetation beyond permanent protection areas along the rivers. By the analysis of these areas and their surroundings, it was possible to determine on which area the urbanization process can occur more quickly. Thus, the study allows the City of Jaguariúna to perform a more effective occupation planning in these areas, always aiming the sustainable development and, consequently, the improvement in population’s quality of life, as well as the maintenance of environmental quality.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Pós-graduação em Planejamento e Análise de Políticas Públicas - FCHS

Relevância:

50.00% 50.00%

Publicador:

Resumo:

In this work, a heuristic model for integrated planning of primary distribution network and secondary distribution circuits is proposed. A Tabu Search (TS) algorithm is employed to solve the planning of primary distribution networks. Evolutionary Algorithms (EA) are used to solve the planning model of secondary networks. The planning integration of both networks is carried out by means a constructive heuristic taking into account a set of integration alternatives between these networks. These integration alternatives are treated in a hierarchical way. The planning of primary networks and secondary distribution circuits is carried out based on assessment of the effects of the alternative solutions in the expansion costs of both networks simultaneously. In order to evaluate this methodology, tests were performed for a real-life distribution system taking into account the primary and secondary networks.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Economic dispatch (ED) problems have recently been solved by artificial neural network approaches. Systems based on artificial neural networks have high computational rates due to the use of a massive number of simple processing elements and the high degree of connectivity between these elements. The ability of neural networks to realize some complex non-linear function makes them attractive for system optimization. All ED models solved by neural approaches described in the literature fail to represent the transmission system. Therefore, such procedures may calculate dispatch policies, which do not take into account important active power constraints. Another drawback pointed out in the literature is that some of the neural approaches fail to converge efficiently toward feasible equilibrium points. A modified Hopfield approach designed to solve ED problems with transmission system representation is presented in this paper. The transmission system is represented through linear load flow equations and constraints on active power flows. The internal parameters of such modified Hopfield networks are computed using the valid-subspace technique. These parameters guarantee the network convergence to feasible equilibrium points, which represent the solution for the ED problem. Simulation results and a sensitivity analysis involving IEEE 14-bus test system are presented to illustrate efficiency of the proposed approach. (C) 2004 Elsevier Ltd. All rights reserved.