Power system reconfiguration and loss minimization for a distribution systems using “Catfish PSO” algorithm

Kumar, Kaushal; Naveen, S.

doi:10.1007/s11708-014-0313-y

Cited by 14 publications

(10 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many other approaches like genetic algorithms [18,19], particle swarm optimization [1], ant colony algorithms [20], artificial neural networks [21,22], etc. have been utilized to solve this problem.…”

Section: Related Workmentioning

confidence: 99%

“…1. The parameters of the network can be found in [1]. All the active and reactive power demands are positive for this network as assumed in Theorem 4.…”

Section: Algorithm and Performance Guaranteementioning

confidence: 99%

“…Distribution networks are usually built as interconnected mesh networks, but are normally configured (via switches) and operated as radial networks (i.e. trees, in graph theoretic terms), to simplify overload protection [1]. The entire network can be thought of as a forest consisting of rooted trees.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Submodular Approach for Electricity Distribution Network Reconfiguration

Khodabakhsh

Yang

Basu

et al. 2018

Proceedings of the 51st Hawaii International Conference on System Sciences

View full text Add to dashboard Cite

Distribution network reconfiguration (DNR) is a tool used by operators to balance line load flows and mitigate losses. As distributed generation and flexible load adoption increases, the impact of DNR on the security, efficiency, and reliability of the grid will increase as well. Today, heuristic-based actions like branch exchange are routinely taken, with no theoretical guarantee of their optimality. This paper considers loss minimization via DNR, which changes the on/off status of switches in the network. The goal is to ensure a radial final configuration (called a spanning tree in the algorithms literature) that spans all network buses and connects them to the substation (called the root of the tree) through a single path. We prove that the associated combinatorial optimization problem is strongly NP-hard and thus likely cannot be solved efficiently. We formulate the loss minimization problem as a supermodular function minimization under a single matroid basis constraint, and use existing algorithms to propose a polynomial time local search algorithm for the DNR problem at hand and derive performance bounds. We show that our algorithm is equivalent to the extensively used branch exchange algorithm, for which, to the best of our knowledge, we pioneer in proposing a theoretical performance bound. Finally, we use a 33-bus network to compare our algorithm's performance to several algorithms published in the literature.

show abstract

Section: Related Workmentioning

confidence: 99%

“…1. The parameters of the network can be found in [1]. All the active and reactive power demands are positive for this network as assumed in Theorem 4.…”

Section: Algorithm and Performance Guaranteementioning

confidence: 99%

See 1 more Smart Citation

A Submodular Approach for Electricity Distribution Network Reconfiguration

Khodabakhsh

Yang

Basu

et al. 2018

Proceedings of the 51st Hawaii International Conference on System Sciences

View full text Add to dashboard Cite

show abstract

“…Suppose hi(j, k, l) represents ith bacterium at jth chemotactic, kth reproductive and lth eliminationdispersal step. C(i) is the size of the step taken in the random direction specified by the tumble (run length unit) [11]. 2.…”

Section: Chemotaxismentioning

confidence: 99%

“…Events can take place in such a manner that all the bacteria in a region are killed or a group is dispersed into a new location. To simulate this phenomenon in BFOA some bacteria are liquidated at arbitrary with a very small probability while the new replacements are randomly initialized over the search space [11]. The ratio of the number of data packets delivered to the destination.…”

Section: Chemotaxismentioning

confidence: 99%

Enhance Security in MANET using Bacterial Foraging Optimization Algorithm

Gulia¹,

Sihag²

2013

IJCA

View full text Add to dashboard Cite

MANETs (Mobile Ad-hoc Networks) are one of the fastest emerging networks. MANET is an unstructured network in which nodes are mobile and autonomous. Nodes act as hosts as well as routers. This mobility may leads to insecurity in MANET. BFOA (Bacterial foraging optimization algorithm) is a Bio-inspired Algorithm. This algorithm simulates the behavior of bacteria that can be effectively applied in various fields. A new protocol is proposed here, named BFAODV by applying BFOA technique on AODV. The proposed protocol improves the performance metrics in comparisons to DSDV and AODV protocols. This paper detects and prevents from black hole attack using proposed BFAODV algorithm.

show abstract

Simultaneous feeder reconfiguration, DSTATCOM allocation, and sizing using seagull optimization algorithm in unbalanced radial distribution systems

Samal,

Panigrahy

2023

Soft Comput

View full text Add to dashboard Cite

Power system reconfiguration and loss minimization for a distribution systems using “Catfish PSO” algorithm

Cited by 14 publications

References 21 publications

A Submodular Approach for Electricity Distribution Network Reconfiguration

A Submodular Approach for Electricity Distribution Network Reconfiguration

Enhance Security in MANET using Bacterial Foraging Optimization Algorithm

Simultaneous feeder reconfiguration, DSTATCOM allocation, and sizing using seagull optimization algorithm in unbalanced radial distribution systems

Contact Info

Product

Resources

About