logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Dispersed generation planning using improved Hereford Ranch Algorithm

delete2024-09-08
delete4
PRE
AI
J
J.O. Kim *
S
S.K. Park
K
K.W. Park
C
Chanan Singh
DOI：10.1109/ICEC.1998.700121delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This paper presents a new approach to dispersed generation planning based on Hereford Ranch Algorithm in a subtransmission system. Dispersed generations could be photovoltaic cells, wind generation, battery storage, fuel cell, etc. A method to optimally locate such generation in a meshed network for maximizing the potential benefits is outlined using Hereford Ranch Algorithm and its improvement in this paper. The benefit expressed as a performance index is minimization of losses. The proposed method was tested for several sample power systems with 6, 14 and 30 bus types. Also, to show its effectiveness, the results of suggested algorithm are compared with those of classical genetic algorithm and conventional second order method.
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

I
IEEE International Conference on Evolutionary Computation Proceedings
IF:
0
Papers:
1
Citations:
0

Organization

No organization information available