资源简介
This paper propose a Firefly algorithm (FA) for optimal placement and sizing of distributed generation (DG) in radial distribution system to minimize the total real power losses and to improve the voltage profile. FA is a metaheuristic algorithm which is inspired by the flashing behavior of fireflies. The primary purpose of firefly’s flash is to act as a signal system to attract other fireflies. Metaheuristic algorithms are widely recognized as one of the most practical approaches for hard optimization problems. The most attractive feature of a metaheuristic is that its application requires no special knowledge on the optimization problem. In this paper, IEEE 33- bus distribution test system is used to show the effectiveness of the FA. Comparison with Shuffled Frog Leaping Algorithm (SFLA) is also given.
代码片段和文件信息
%% Initalization of Paraneters
clc
clear
%% ANN Structure
Thresh = .92;
NumofParticles = 30;
NPar = 240; % Number of Optimization Parameters
VarLow = 0; % Lower Limmit of problem
VarHigh = 1; % Upper Limmit of problem
ff = ‘costFinal‘;
GlobalBestP = rand(1NPar); % Global Best Position
GlobalBestP(GlobalBestP>Thresh) = 1;
GlobalBestP(GlobalBestP
GlobalBestC = feval(ffGlobalBestP0); % Global Best Cost
MaxIterations = 70;
DampCoef = 0.9999999;
C1 = 1.5;
C2 = 4 - C1;
%% Particles initialization
for i = 1:NumofParticles
Particles{i}.Velocity = (rand(1NPar)+2)*2;
R = rand(1NPar);
Particles{i}.Position = R > 1./(1 + exp(-Particles{i}.Velocity));
% sum(Particles{i}.Position==1)
Particles{i}.Cost = feval(ffParticles{i}.Position0)
属性 大小 日期 时间 名称
----------- --------- ---------- ----- ----
文件 3390 2011-02-13 21:08 PSO.m
----------- --------- ---------- ----- ----
3390 1
评论
共有 条评论