Placement of Dg, Cb, and Tcsc in radial distribution system for power loss minimization using back-tracking search algorithm

The back-tracking search algorithm (BSA) is a new heuristic algorithm. BSA has two especially important properties: it is not sensitive to the initial value and has a single control parameter. This study presents the BSA-based optimal sizing and placement of distributed generations (DGs), capacitor...

Full description

Saved in:
Bibliographic Details
Published in:Electrical engineering 2017-09, Vol.99 (3), p.791-802
Main Authors: Fadel, Waleed, Kilic, Ulas, Taskin, Sezai
Format: Article
Language:English
Subjects:
Algorithms
Capacitor banks
Economics and Management
Electric power distribution
Electrical Engineering
Electrical Machines and Networks
Energy Policy
Engineering
Genetic algorithms
Heuristic methods
Optimization
Original Paper
Placement
Power Electronics
Power loss
Production scheduling
Radial distribution
Search algorithms
Sizing
Tracking
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The back-tracking search algorithm (BSA) is a new heuristic algorithm. BSA has two especially important properties: it is not sensitive to the initial value and has a single control parameter. This study presents the BSA-based optimal sizing and placement of distributed generations (DGs), capacitor banks (CBs), and thyristor-controlled series compensator (TCSC) in a radial distribution system (RDS). These elements are integrated separately and simultaneously in RDS. The objective function is power loss. The BSA is executed on IEEE 33 bus RDS. The obtained results are compared to a genetic algorithm (GA) and other algorithms in the literature. The results demonstrate that the BSA is more efficient and has the potential to find optimal solutions with less power loss. In this paper, optimal placement and sizing of DGs, TCSC, and CBs in a RDS is solved simultaneously using BSA for the first time.
ISSN:0948-7921
1432-0487
DOI:10.1007/s00202-016-0448-4