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

Author(s):
Abstract:
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.
Language:
English
Published:
Journal of Artificial Intelligence and Data Mining, Volume:3 Issue: 2, Summer-Autumn 2015
Pages:
217 to 224
magiran.com/p1538768  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!