Crow Search Algorithm (CSA);
Optimal Power Flow (OPF);
WIND;
D O I:
暂无
中图分类号:
TE [石油、天然气工业];
TK [能源与动力工程];
学科分类号:
0807 ;
0820 ;
摘要:
This paper presents the application of a meta-heuristic optimization method called Crow Search Algorithm (CSA) to solve real time Optimal Power Flow (OPF) problem. CSA is the population based algorithm which mimics the behavior of food foraging process of crows. To show the effectiveness of the algorithm it is first applied to benchmark function. Optimal Power Flow is the power system optimization problem. The CSA algorithm is applied to solve Optimal Power Flow considering different source such as thermal, wind and solar. The IEEE 30 bus system is taken for consideration. The results obtained are compared with other algorithm for defined optimization problem as well as benchmark functions. The result shows that CSA gives best solution as compared other algorithms.
机构:
North China Elect Power Univ, Sch Elect & Elect Engn, Beijing 102206, Peoples R ChinaNorth China Elect Power Univ, Sch Elect & Elect Engn, Beijing 102206, Peoples R China
Yin, Hao
Ding, Zhaohao
论文数: 0引用数: 0
h-index: 0
机构:
North China Elect Power Univ, Sch Elect & Elect Engn, Beijing 102206, Peoples R ChinaNorth China Elect Power Univ, Sch Elect & Elect Engn, Beijing 102206, Peoples R China
Ding, Zhaohao
Zhang, Dongying
论文数: 0引用数: 0
h-index: 0
机构:
North China Elect Power Univ, Sch Elect & Elect Engn, Beijing 102206, Peoples R ChinaNorth China Elect Power Univ, Sch Elect & Elect Engn, Beijing 102206, Peoples R China
Zhang, Dongying
Xia, Shiwei
论文数: 0引用数: 0
h-index: 0
机构:
North China Elect Power Univ, Sch Elect & Elect Engn, Beijing 102206, Peoples R ChinaNorth China Elect Power Univ, Sch Elect & Elect Engn, Beijing 102206, Peoples R China
Xia, Shiwei
Ting, Du
论文数: 0引用数: 0
h-index: 0
机构:
North China Elect Power Univ, Sch Elect & Elect Engn, Beijing 102206, Peoples R ChinaNorth China Elect Power Univ, Sch Elect & Elect Engn, Beijing 102206, Peoples R China
Ting, Du
2019 IEEE INDUSTRY APPLICATIONS SOCIETY ANNUAL MEETING,
2019,