Skip to content
naulon
Not checkedNot checked for notices yet.

Adaptive Multi Objective Parallel Seeker Optimization Algorithm for Incorporating TCSC Devices into Optimal Power Flow Framework

M. B. Shafik, Hongkun Chen, Ghamgeen I. Rashed and 1 more

IEEE Access · 2019

doi:10.1109/access.2019.2905266 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Usually, the optimal integration of thyristor-controlled series compensators (TCSCs) aims at enhancing power system performance like all of flexible AC transmission systems (FACTS) devices. The insertion of TCSC unites targets to minimize active/reactive power losses, increase transmission-lines flow reserve beyond the thermal limit, and improve the voltage profile while maintaining the total generation cost of the system slightly affected compared to its single objective base case. In this paper, the optimal power flow (OPF) framework is considered to find the best site and size of the TCSCs devices considering techno-economic issues for reducing the costs of installed TCSCs devices as well as for generation costs. An adaptive parallel seeker optimization algorithm (APSOA) is investigated to employ this techno-economic study. The proposed APSOA is used to solve the multi-objective OPF problem while LSR reduces the search space. The proposed algorithm is tested over three IEEE standards with 9-, 30- and 57-bus test systems at normal and contingency operating conditions. Also, a large system of IEEE 118-bus is used also in order for the proposed technique to be adopted by industry, sound solutions for practical and realistic test systems are needed besides proof of concept on small IEEE test systems. Four-study cases considered to demonstrate the capabilities and gains of the proposed method from the point of view of reducing losses and total voltage deviation to lower levels as compared to those on literature for better energy utilization efficiency.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.