A Novel Salp Swarm Algorithm for Expansion Planning with Security Constraints
- PDF / 1,028,929 Bytes
- 10 Pages / 595.276 x 790.866 pts Page_size
- 61 Downloads / 152 Views
RESEARCH PAPER
A Novel Salp Swarm Algorithm for Expansion Planning with Security Constraints Sumit Verma1 • Chandan Kumar Shiva2 Received: 13 April 2019 / Accepted: 14 January 2020 Ó Shiraz University 2020
Abstract Transmission expansion planning (TEP) is one of the critical issues of the deregulated electricity market. In view of this, a salp swarm algorithm (SSA) is being considered in the present work for the solution of TEP problem with the added security constraint. The features of SSA algorithm are its foraging behavior of salps swarming in the oceans. Under the TEP problem, the work considered here is to determine the cost-effective expansion planning in the deregulated electricity market. For this act, some of the important constraints such as power flow of the lines, right-of-way’s validity and maximum line addition are taken into consideration. The studied power system networks are IEEE 25-bus system, Brazilian 46-bus system and Columbian 93-bus system for the study of TEP problem. The results are compared to those offered by some other state-of-the-art algorithms. It showed that SSA is effective algorithm for the TEP problem. Keywords DC power flow Optimal power flow Optimization Salp swarm Security Transmission expansion planning
1 Introduction 1.1 General The objective of transmission expansion planning (TEP) problem is to suggest the best optimal plan for expansion of electrical networks such that no overloading condition may occur during the planning horizon. The TEP may be studied in two classes, i.e., static TEP (STEP) and dynamic TEP (DTEP). In STEP problem, the planning is made for a specific planning horizon or for fixed planning years. As concerned to DTEP problem, the planning is made by dividing the total planning horizon into the multiple stages. Due to uncertainty about load and generation level in deregulated electricity environment, TEP problem has attained degree of complexities in its nature. The problem & Chandan Kumar Shiva [email protected] Sumit Verma [email protected] 1
Department of Industrial & Management Engineering, Indian Institute of Technology, Kanpur, Uttar Pradesh, India
2
Department of Electrical and Electronics Engineering, S R Engineering College, Warangal, Telangana 506371, India
is considered to be very complex due to its discrete nature and involvement of number of possible investigation, especially, for large networks, as it requires high computational efforts. A reliable plan is extremely desired to handle such problems. Overall expansion planning involves two steps. In first, the planning is performed considering the security constraints while in the preceding step, the best optimal plan obtained in the earlier step is tested with outage of each circuit, eventually, selecting the best optimal plan (Seifu et al. 1989). Single line outage or N - 1 contingency is the most followed security criterion in the domain of TEP problem study. Optimal expansion plan is such that it should respond adequately if a line is removed from the circu
Data Loading...
