Transmission Network Expansion Planning Considering Optimal Allocation of Series Capacitive Compensation and Active Power Losses

2021 ◽  
Vol 12 (1) ◽  
pp. 388
Author(s):  
Dany H. Huanca ◽  
Luis A. Gallego ◽  
Jesús M. López-Lezama

This paper presents a modeling and solution approach to the static and multistage transmission network expansion planning problem considering series capacitive compensation and active power losses. The transmission network expansion planning is formulated as a mixed integer nonlinear programming problem and solved through a highly efficient genetic algorithm. Furthermore, the Villasana Garver’s constructive heuristic algorithm is implemented to render the configurations of the genetic algorithm feasible. The installation of series capacitive compensation devices is carried out with the aim of modifying the reactance of the original circuit. The linearization of active power losses is done through piecewise linear functions. The proposed model was implemented in C++ language programming. To show the applicability and effectiveness of the proposed methodology several tests are performed on the 6-bus Garver system, the IEEE 24-bus test system, and the South Brazilian 46-bus test system, presenting costs reductions in their multi-stage expansion planning of 7.4%, 4.65% and 1.74%, respectively.

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Celso T. Miasaki ◽  
Edgar M. C. Franco ◽  
Ruben A. Romero

This paper presents a novel mathematical model for the transmission network expansion planning problem. Main idea is to consider phase-shifter (PS) transformers as a new element of the transmission system expansion together with other traditional components such as transmission lines and conventional transformers. In this way, PS are added in order to redistribute active power flows in the system and, consequently, to diminish the total investment costs due to new transmission lines. Proposed mathematical model presents the structure of a mixed-integer nonlinear programming (MINLP) problem and is based on the standard DC model. In this paper, there is also applied a specialized genetic algorithm aimed at optimizing the allocation of candidate components in the network. Results obtained from computational simulations carried out with IEEE-24 bus system show an outstanding performance of the proposed methodology and model, indicating the technical viability of using these nonconventional devices during the planning process.


Author(s):  
Ashu Verma ◽  
Pradeep R. Bijwe ◽  
Bijaya Ketan Panigrahi

Transmission network expansion planning is a very critical problem due to not only the huge investment cost involved, but also the associated security issues. Any long range planning problem is confronted with the challenge of non-statistical uncertainty in the data. Although large number of papers have been published in this area, the efforts to tackle the above mentioned security and uncertainty issues have been relatively very few, due to the formidable complexity involved. This paper tries to bridge this gap by proposing a technique to tackle these problems. Boundary DC power flow is used to ascertain the worst power flows on the lines. A simple basic binary Genetic algorithm is used to solve the optimization problem as an illustration. Results for two sample test systems have been obtained to demonstrate the potential of the proposed method.


2011 ◽  
Vol 347-353 ◽  
pp. 1458-1461
Author(s):  
Hong Fan ◽  
Yi Xiong Jin

Improved genetic algorithm for solving the transmission network expansion planning is presented in the paper. The module which considered the investment costs of new transmission facilities. It is a large integer linear optimization problem. In this work we present improved genetic algorithm to find the solution of excellent quality. This method adopts integer parameter encoded style and has nonlinear crossover and mutation operators, owns strong global search capability. Tests are carried out using a Brazilian Southern System and the results show the good performance.


2001 ◽  
Vol 16 (4) ◽  
pp. 930-931 ◽  
Author(s):  
H. Rudnick ◽  
R. Palma ◽  
E.L. da Silva ◽  
H.A. Gil ◽  
J.M. Areiza

Sign in / Sign up

Export Citation Format

Share Document