XML A MULTISTAGE EXPANSION PLANNING METHOD FOR OPTIMAL SUBSTATION PLACEMENT

Message:
Abstract:
Optimal distribution substation placement is one of the major components of optimal distribution system planning projects. In this paper optimal substation placement problem is solved using Imperialist Competitive Algorithm (ICA) as a new developed heuristic optimization algorithm. This procedure gives the optimal size, site and installation time of medium voltage substation, using their related costs subject to operating and optimization constraints. A multistage and pseudo-dynamic expansion planning is applied to consider dynamic of the system parameters for example, load forecasting uncertainty, asset management and geographical constraints. In order to evaluate the effectiveness of the proposed method a sensitivity analysis of ICA parameters on obtained results is done. A graphical representation of obtained results is used to show the efficiency and capability of the proposed method both from the planning view and graphical aspects. The results show the efficiency and capability of the proposed method which has been tested on a real size distribution network.
Language:
English
Published:
Iranian Journal of Electrical and Electronic Engineering, Volume:10 Issue: 1, Mar 2014
Pages:
65 to 74
magiran.com/p1255366  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!