Buscar
Mostrando ítems 1-10 de 661
Strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem
(2013-01-04)
This paper proposes strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem (TEP). The concept of the binary numeral system (BNS) is used ...
Strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem
(2013-01-04)
This paper proposes strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem (TEP). The concept of the binary numeral system (BNS) is used ...
A Strategy to Solve the Multistage Transmission Expansion Planning Problem
(Institute of Electrical and Electronics Engineers (IEEE), 2011-11-01)
In this letter, a heuristic to reduce the combinatorial search space (CSS) of the multistage transmission expansion planning (MTEP) problem is presented. The aim is to solve the MTEP modeled like a mixed binary linear ...
A Strategy to Solve the Multistage Transmission Expansion Planning Problem
(Institute of Electrical and Electronics Engineers (IEEE), 2011-11-01)
In this letter, a heuristic to reduce the combinatorial search space (CSS) of the multistage transmission expansion planning (MTEP) problem is presented. The aim is to solve the MTEP modeled like a mixed binary linear ...
A Multi-Stage Stochastic Non-Linear Model for Reactive Power Planning Under Contingencies
(Institute of Electrical and Electronics Engineers (IEEE), 2013-05-01)
This paper presents a model for long-term reactive power planning where a deterministic nonlinear model is expanded into a multi-stage stochastic model under load uncertainty and an N-k contingency analysis. Reactive load ...
A branch-and-bound algorithm for the multi-stage transmission expansion planning
(2005-10-31)
This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models ...
A branch-and-bound algorithm for the multi-stage transmission expansion planning
(2005-10-31)
This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models ...