We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Artificial Intelligence & Machine Learning/A graph search algorithm: Optimal placement of passive harmonic filters in a power system
MagazinesArtificial Intelligence & Machine Learning

A graph search algorithm: Optimal placement of passive harmonic filters in a power system

Checking your access to this record.

Abstract & Overview

The harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. This paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. The objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic distortion of voltage, and also enhances voltage profile at each bus effectively. Four types of sub-graph have been used for search space of optimization. The method handles standard capacitor sizes in planning filters and associated costs. In this paper, objective function is not differential but eases solving process. The IEEE 30 bus test system is used for the placement of passive filter. The simulation has been done to show applicability of the proposed method. Simulation results prove that the method is effective and suitable for the passive filter planning in a power system.

Cite this record

M. Aghaei, A. Dastfan (2015). A graph search algorithm: Optimal placement of passive harmonic filters in a power system. Shahrood University of Technology. https://library.shubhaarti.in/content/3977f1fe-315b-46d5-8901-ded6cee5df38

Copy in another style

Aghaei, M., & Dastfan, A. (2015). A graph search algorithm: Optimal placement of passive harmonic filters in a power system. Shahrood University of Technology. https://library.shubhaarti.in/content/3977f1fe-315b-46d5-8901-ded6cee5df38
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.