Transmission Network Expansion Planning under Wind Farm Uncertainties Using Cuckoo Search Algorithm

2014 ◽  
Author(s):  
S.S. Taheri ◽  
M. Modiri-Delshad ◽  
S.J. Seyed-Shenava
Keyword(s):  
Wind Farm ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Transmission Network ◽  
Network Expansion ◽  
Expansion Planning

Rolling Window Based Dynamic Transmission Network Expansion Planning

2011 ◽  
Vol 12 (4) ◽  
Author(s):  
Ashu Verma ◽  
Pradeep R. Bijwe ◽  
Bijaya Ketan Panigrahi
Keyword(s):  
Search Algorithm ◽  
Harmony Search ◽  
Planning Horizon ◽  
Optimal Investment ◽  
Fixed Time ◽  
Harmony Search Algorithm ◽  
Transmission Network ◽  
Network Expansion ◽  
Expansion Planning ◽  
Rolling Window

Dynamic transmission network expansion planning (DTNEP) decides when (which year) and where (which R.O.W.), the new lines are to be built so that the overall cost of the plan is minimum and the system is secure. Generally, this is done for a fixed time horizon window (3/5 years) at a time. DTNEP has been proved to be better than the incremental approach in which optimal investment plans are found out for each year separately. In DTNEP, 1st year and last/terminal years are given different treatment, and there is a complete disconnect between two DTNEP windows. Also DTNEP assumes that the conditions during optimization like the earlier year generation, transmission expansion plans get\ executed exactly as per plan &/or the load forecast for the entire period remains unchanged. However, it is well known that this is generally not true. In view of above, this paper presents a rolling window based approach which treats every year of investment in exactly the same fashion. It also has an inherent capability to take care of such changes. It involves successive, overlapping DTNEP for 3/5 years planning horizon. A harmony search algorithm is used for the solution of the problem. Results for two test systems have been obtained to demonstrate the potential of the algorithm.

scholarly journals Cuckoo Search Algorithm for Congestion Alleviation with Incorporation of Wind Farm

2018 ◽  
Vol 8 (6) ◽  
pp. 4871
Author(s):  
Kaushik Paul ◽  
Niranjan Kumar
Keyword(s):  
Power System ◽  
Wind Farm ◽  
Search Algorithm ◽  
Past Research ◽  
Cuckoo Search ◽  
Congestion Management ◽  
Cuckoo Search Algorithm ◽  
Optimization Techniques ◽  
Management Approach ◽  
Sensitivity Factor

The issue to alleviate congestion in the power system framework has emerged as an alluring field for the power system researchers. The research conducted in this article proposes a cuckoo search algorithm based congestion alleviation strategy with the incorporation of wind farm. The bus sensitivity factor data are computed and utilized to sort out the sutiable position for the installation of the wind farm. The generators contributing in the real power rescheduleing process are selected as per the generator sensitivity values. The cuckoo search algorithm is implemented to minimize the congestion cost with the embodiment of the wind farm.The proposed method is tested on 39 bus New England framework and the results obtained with the cuckoo search based congestion management approach outperforms the results opted with other heuristic optimization techniques in the past research literatures.

Sign in / Sign up

Export Citation Format

Share Document