A meta-heurística de busca dispersa aplicada no planejamento da expansão de sistemas de transmissão

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

Algoritmo tabu search especializado para o problema de planejamento da expansao de sistemas de transmissão

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

Constructive heuristic algorithm for the DC model in network transmission expansion planning

A novel constructive heuristic algorithm to the network expansion planning problem is presented the basic idea comes from Garver's work applied to the transportation model, nevertheless the proposed algorithm is for the DC model. Tests results with most known systems in the literature are carried out to show the efficiency of the method.

Multistage and coordinated planning of the expansion of transmission systems

In this paper, an efficient genetic algorithm (GA) is presented to solve the problem of multistage and coordinated transmission expansion planning. This is a mixed integer nonlinear programming problem, difficult for systems of medium and large size and high complexity. The GA presented has a set of specialized genetic operators and an efficient form of generation of the initial population that finds high quality suboptimal topologies for large size and high complexity systems. In these systems, multistage and coordinated planning present a lower investment than static planning. Tests results are shown in one medium complexity system and one large size high complexity system.

An application of a modified constructive heuristic algorithm to transmission expansion planning

Transmission expansion planning (TEP) is a non-convex optimization problem that can be solved via different heuristic algorithms. A variety of classical as well as heuristic algorithms in literature are addressed to solve TEP problem. In this paper a modified constructive heuristic algorithm (CHA) is proposed for solving such a crucial problem. Most of research papers handle TEP problem by linearization of the non-linear mathematical model while in this research TEP problem is solved via CHA using non-linear model. The proposed methodology is based upon Garver's algorithm capable of applying to a DC model. Simulation studies and tests results on the well known transmission network such as: Garver and IEEE 24-bus systems are carried out to show the significant performance as well as the effectiveness of the proposed algorithm. © 2011 IEEE.

Primary power distribution systems planning taking into account reliability, operation and expansion costs

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

Tabu search algorithm for network synthesis

Large scale combinatorial problems such as the network expansion problem present an amazingly high number of alternative configurations with practically the same investment, but with substantially different structures (configurations obtained with different sets of circuit/transformer additions). The proposed parallel tabu search algorithm has shown to be effective in exploring this type of optimization landscape. The algorithm is a third generation tabu search procedure with several advanced features. This is the most comprehensive combinatorial optimization technique available for treating difficult problems such as the transmission expansion planning. The method includes features of a variety of other approaches such as heuristic search, simulated annealing and genetic algorithms. In all test cases studied there are new generation, load sites which can be connected to an existing main network: such connections may require more than one line, transformer addition, which makes the problem harder in the sense that more combinations have to be considered.

Algoritmos busca tabu paralelos aplicados ao planejamento da expansão da transmissão de energia elétrica

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

Planejamento da expansão de sistemas de transmissão considerando análise de confiabilidade e incertezas na demanda futura

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

Planejamento da expansão do sistema de transmissão de energia elétrica utilizando controladores FACTS

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

Modelagem generalizada do problema de planejamento da expansão de sistemas de transmissão

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

Optimal contract pricing of distributed generation under a competitive framework

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.

Modelo de leilão multiperíodo para sistemas hidrotérmicos com representação da transmissão

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

Planejamento da expansão de sistemas de transmissão usando transformadores defasadores

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

Análise crítica de aspectos de modelagem matemática no planejamento da expansão a longo prazo de sistemas de transmissão

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