Power transmission network expansion planning: A semidefinite programming branch-and-bound approach

2019 ◽  
Vol 274 (3) ◽  
pp. 837-844 ◽  
Author(s):  
Bissan Ghaddar ◽  
Rabih A. Jabr
Keyword(s):  
Semidefinite Programming ◽  
Branch And Bound ◽  
Power Transmission ◽  
Transmission Network ◽  
Network Expansion ◽  
Expansion Planning

scholarly journals Techno-economic based static and dynamic transmission network expansion planning using improved binary bat algorithm

2021 ◽  
Author(s):  
Mohamed T. Mouwafi ◽  
Adel A. Abou El-Ela ◽  
Ragab A. El-Sehiemy ◽  
Waleed K. Al-Zahar
Keyword(s):  
Bat Algorithm ◽  
Transmission Network ◽  
Network Expansion ◽  
Expansion Planning

Transmission Network Expansion Planning with Security Constraints and Uncertainty in Load Specifications

2008 ◽  
Vol 9 (4) ◽  
Author(s):  
Ashu Verma ◽  
Pradeep R. Bijwe ◽  
Bijaya Ketan Panigrahi
Keyword(s):  
Power Flow ◽  
Planning Problem ◽  
Transmission Network ◽  
Network Expansion ◽  
Security Issues ◽  
Expansion Planning ◽  
Dc Power ◽  
Sample Test ◽  
Binary Genetic Algorithm ◽  
Long Range Planning

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.

Sign in / Sign up

Export Citation Format

Share Document