%% 基于遗传算法(genetic algorithm, GA))优化变分模态分解(variational mode decomposition,VMD)参数
clc
clear
close all
addpath('toolf')
warning off
% 读取数据
[file,path,indx] = uigetfile({'*.xlsx';'*.xls';'*.txt';'*.*'},'File Selector');
if indx == 1||indx==2
data=xlsread(strcat(path, file));
elseif indx == 3
data=load(strcat(path, file));
else
disp('请选择数据集进行实验');
return;
end
%采样频率
fs=12800;
% 读取前1000长度的信号
len=1000;
s=data(1:len);
% 采样时间
t = (0:len-1)/fs;
%% 设定遗传算法参数
popsize =8; % 种群大小
iter =30; % 最大迭代次数
dim = 2; % 变量个数
lb = [100 3]; % alpha范围 K范围 下限
ub = [2000 7]; % 上限
pc=0.8; %交叉概率,0和1之间
pm=0.2; %变异概率,0和1之间
%% 遗传算法GA优化VMD参数
tic , % 开始计时
GA_VMD(popsize,iter,dim,lb,ub,pc,pm,0); % 0表示不保存IMF,1,导出IMF并保存
toc, % 结束计时
function ret = Cross(pcross, lenchrom, chrom, sizepop, bound)
for i = 1:sizepop
pick = rand(1, 2);
while prod(pick) == 0
pick = rand(1, 2);
end
index = ceil(pick .* sizepop);
pick = rand;
while pick == 0
pick = rand;
end
if pick > pcross
continue;
end
flag = 0;
while flag == 0
pick = rand;
while pick == 0
pick = rand;
end
pos = ceil(pick .* sum(lenchrom));
pick = rand;
v1 = chrom(index(1), pos);
v2 = chrom(index(2), pos);
chrom(index(1), pos) = pick * v2 + (1 - pick) * v1;
chrom(index(2), pos) = pick * v1 + (1 - pick) * v2;
flag1 = test(lenchrom, bound, chrom(index(1), :));
flag2 = test(lenchrom, bound, chrom(index(2), :));
if flag1 * flag2 == 0
flag = 0;
else
flag = 1;
end
end
end
ret = chrom;
end
function ret = Mutation(pmutation, lenchrom, chrom, sizepop, pop, bound)
for i = 1:sizepop
pick = rand;
while pick == 0
pick = rand;
end
index = ceil(pick * sizepop);
pick = rand;
if pick > pmutation
continue;
end
flag = 0;
while flag == 0
pick = rand;
while pick == 0
pick = rand;
end
pos = ceil(pick * sum(lenchrom));
v = chrom(i, pos);
v1 = v - bound(pos, 1);
v2 = bound(pos, 2) - v;
pick = rand;
if pick > 0.5
delta = v2 * (1 - pick^((1 - pop(1) / pop(2))^2));
chrom(i, pos) = v + delta;
else
delta = v1 * (1 - pick^((1 - pop(1) / pop(2))^2));
chrom(i, pos) = v - delta;
end
flag = test(lenchrom, bound, chrom(i, :));
end
end
ret = chrom;