Transmission Network Expansion Planning of a Large Power System

2020 ◽  
pp. 39-71
Author(s):  
Gerald Sanchís
Keyword(s):  
Power System ◽  
Transmission Network ◽  
Large Power ◽  
Network Expansion ◽  
Expansion Planning

Computationally Efficient Hybrid Method for Transmission Network Expansion Planning

2017 ◽  
Vol 18 (2) ◽  
Author(s):  
Ashu Verma ◽  
Soumya Das ◽  
P. R. Bijwe
Keyword(s):  
Power System ◽  
Large Scale ◽  
Optimization Problems ◽  
Hybrid Approach ◽  
Solution Process ◽  
System Optimization ◽  
Mixed Integer ◽  
Transmission Network ◽  
Network Expansion ◽  
Expansion Planning

Abstract Transmission network expansion planning (TNEP) is an important and computationally very demanding problem in power system. Many computational approaches have been proposed to handle TNEP in the past. The problem is mixed integer, large scale and its complexity increases exponentially with the size of the system. Metaheuristic techniques have gained a lot of importance in last few years to solve the power system optimization problems, due to their ability to handle complex optimization functions and constraints. Many of them have been successfully applied for TNEP. The biggest challenge in these techniques is the requirement of large computational efforts. This paper uses a two-stage solution process to solve the TNEP problems. The first stage uses compensation based method to generate a quick, suboptimal solution. The valuable information contained in this solution is used to generate a set of heuristics aimed at drastically reducing the number of population for fitness evaluations required in the 2nd stage with application of metaheuristic method. The resulting hybrid approach produces very good quality solutions very efficiently. Results for 24 bus and 93 bus test systems have been obtained with the proposed method to ascertain the potential of the method in comparison to earlier approaches.

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