[Home ] [Archive]   [ فارسی ]  
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Contact ::
Main Menu
Home::
Journal Information::
Articles archive::
For Authors::
For Reviewers::
Registration::
Contact us::
Site Facilities::
Publication Statistics::
List of Reviewers::
Social Networks::
::
Search in website

Advanced Search
..
Receive site information
Enter your Email in the following box to receive the site news and information.
..
:: Volume 7, Issue 2 (3-2021) ::
2021, 7(2): 38-63 Back to browse issues page
Robust optmization of distribution networks with DGs using two different patterns random clustering
Younes Gharedaghi , Javad Olamaei * , Sajjad Najafi ravadanegh
Department of Electrical Engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran , J_olamaei@azad.ac.ir
Abstract:   (824771 Views)
Robust algorithm is known as the one of high potential models for strengthening in optimization of large and complex distribution networks considering uncertainty. In this research we are looking for some suitable template and appropriate clustering pattern in order to analyze the operation of distribution network. The analysis of optimization process in both individual and adaptive cases of distributed generation sources applied to some standard distribution network shows that the adaptive case of DGs determines less partial and total operation cost. except in islanded case of DGs. The results of clustering approach based on choosing the candidate points which includes DGs and feeders are used in medium voltage (MV) network level. By investigating the software data in both single cluster with first up to fifth and tenth repeatition, one to five clusters and finally ten clusters case shows the superiority of mean data besed clustering. because of having the three following properties such as being sensitive to all weighted candidate points, the speed of acceptable operation and feeding the clusters in islanded case in multiplicity of clusters, it is suitable to designate the robust optimization method using pattern random clustering.
Keywords: K-MEANS, K-MEDOIDS, MINIMUM SPANNING TREE, ROBUST OPTIMIZATION, UNCERTINTY.
Full-Text [PDF 2344 kb]   (1774 Downloads)    
Type of Study: Research | Subject: Optimization
Received: 2020/04/5 | Accepted: 2020/12/5 | Published: 2021/08/2
Send email to the article author

Add your comments about this article
Your username or Email:

CAPTCHA


XML   Persian Abstract   Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

gharedaghi Y, olamaei J, najafi ravadanegh S. Robust optmization of distribution networks with DGs using two different patterns random clustering. Nonlinear Systems in Electrical Engineering 2021; 7 (2) :38-63
URL: http://journals.sut.ac.ir/jnsee/article-1-335-en.html


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 7, Issue 2 (3-2021) Back to browse issues page
سامانه های غیرخطی در مهندسی برق Journal of Nonlinear Systems in Electrical Engineering
نشریه سامانه‌های غیرخطی در مهندسی برق در خصوص اصول اخلاقی انتشار مقاله، از توصیه‌های «کمیته بین‌المللی اخلاق نشر» موسوم به COPE و «منشور و موازین اخلاق پژوهش» مصوب معاونت پژوهش و فناوری وزارت علوم، تحقیقات و فناوری تبعیت می‌کند.
Persian site map - English site map - Created in 0.15 seconds with 37 queries by YEKTAWEB 4642