【优化求解】基于蝗虫算法求解多目标问题matlab源码

一、蝗虫算法

 

 

2.算法流程

二、部分代码

%_________________________________________________________________________________
%  Multi-objective Grasshopper Optimization Algorithm (MOGOA) source codes version 1.0
%
%  Developed in MATLAB R2016a

%
%   Main paper:
%   S. Z. Mirjalili, S. Mirjalili, S. Saremi, H. Fatis, H. Aljarah, 
%   Grasshopper optimization algorithm for multi-objective optimization problems, 
%   Applied Intelligence, 2017, DOI: http://dx.doi.org/10.1007/s10489-017-1019-8
%____________________________________________________________________________________

clc;
clear;
close all;

% Change these details with respect to your problem%%%%%%%%%%%%%%
ObjectiveFunction=@ZDT1;
dim=5;
lb=0;
ub=1;
obj_no=2;

if size(ub,2)==1
    ub=ones(1,dim)*ub;
    lb=ones(1,dim)*lb;
end
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
flag=0;
if (rem(dim,2)~=0)
    dim = dim+1;
    ub = [ub, 1];
    lb = [lb, 0];
    flag=1;
end


max_iter=100;
N=200;
ArchiveMaxSize=100;

Archive_X=zeros(100,dim);
Archive_F=ones(100,obj_no)*inf;

Archive_member_no=0;

%Initialize the positions of artificial whales
GrassHopperPositions=initialization(N,dim,ub,lb);

TargetPosition=zeros(dim,1);
TargetFitness=inf*ones(1,obj_no);

cMax=1;
cMin=0.00004;
%calculate the fitness of initial grasshoppers

for iter=1:max_iter
    for i=1:N
        
        Flag4ub=GrassHopperPositions(:,i)>ub';
        Flag4lb=GrassHopperPositions(:,i)<lb';
        GrassHopperPositions(:,i)=(GrassHopperPositions(:,i).*(~(Flag4ub+Flag4lb)))+ub'.*Flag4ub+lb'.*Flag4lb;
        
        GrassHopperFitness(i,:)=ObjectiveFunction(GrassHopperPositions(:,i)');
        if dominates(GrassHopperFitness(i,:),TargetFitness)
            TargetFitness=GrassHopperFitness(i,:);
            TargetPosition=GrassHopperPositions(:,i);
        end
        
    end
    
    [Archive_X, Archive_F, Archive_member_no]=UpdateArchive(Archive_X, Archive_F, GrassHopperPositions, GrassHopperFitness, Archive_member_no);
    
    if Archive_member_no>ArchiveMaxSize
        Archive_mem_ranks=RankingProcess(Archive_F, ArchiveMaxSize, obj_no);
        [Archive_X, Archive_F, Archive_mem_ranks, Archive_member_no]=HandleFullArchive(Archive_X, Archive_F, Archive_member_no, Archive_mem_ranks, ArchiveMaxSize);
    else
        Archive_mem_ranks=RankingProcess(Archive_F, ArchiveMaxSize, obj_no);
    end
    
    Archive_mem_ranks=RankingProcess(Archive_F, ArchiveMaxSize, obj_no);
    index=RouletteWheelSelection(1./Archive_mem_ranks);
    if index==-1
        index=1;
    end
    TargetFitness=Archive_F(index,:);
    TargetPosition=Archive_X(index,:)';
    
    c=cMax-iter*((cMax-cMin)/max_iter); % Eq. (3.8) in the paper
    
    for i=1:N
        
        temp= GrassHopperPositions;
        
        for k=1:2:dim
            S_i=zeros(2,1);
            for j=1:N
                if i~=j
                    Dist=distance(temp(k:k+1,j), temp(k:k+1,i));
                    r_ij_vec=(temp(k:k+1,j)-temp(k:k+1,i))/(Dist+eps);
                    xj_xi=2+rem(Dist,2);
                       
                    %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Eq. (3.2) in the paper 
                    s_ij=((ub(k:k+1)' - lb(k:k+1)') .*c/2)*S_func(xj_xi).*r_ij_vec;
                    S_i=S_i+s_ij;
                    %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
                end
            end
            S_i_total(k:k+1, :) = S_i;
            
        end
        
        X_new=c*S_i_total'+(TargetPosition)'; % Eq. (3.7) in the paper
        GrassHopperPositions_temp(i,:)=X_new';
    end
    % GrassHopperPositions
    GrassHopperPositions=GrassHopperPositions_temp';
    
    display(['At the iteration ', num2str(iter), ' there are ', num2str(Archive_member_no), ' non-dominated solutions in the archive']);
end


if (flag==1)
    TargetPosition = TargetPosition(1:dim-1);
end

figure

Draw_ZDT1();

hold on

plot(Archive_F(:,1),Archive_F(:,2),'ro','MarkerSize',8,'markerfacecolor','k');

legend('True PF','Obtained PF');
title('MOGOA');

set(gcf, 'pos', [403   466   230   200])

三、仿真结果

 

四、参考文献

 S. Z. Mirjalili, S. Mirjalili, S. Saremi, H. Fatis, H. Aljarah,  Grasshopper optimization algorithm for multi-objective optimization problems,   Applied Intelligence, 2017, DOI: http://dx.doi.org/10.1007/s10489-017-1019-8

 

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
粒子群算法(Particle Swarm Optimization, PSO)是一种基于群体智能的优化算法,常用于解决传感器覆盖优化问题。下面是使用Matlab实现PSO算法求解传感器覆盖优化问题源码示例。 ```matlab function [bestPosition, bestFitness] = PSO(sensorPositions, targetPositions, numParticles, numIterations) % 粒子群算法求解传感器覆盖优化问题 % 输入参数: % sensorPositions - 传感器位置矩阵,每一行表示一个传感器的位置 % targetPositions - 目标位置矩阵,每一行表示一个目标的位置 % numParticles - 粒子数 % numIterations - 迭代次数 % 输出参数: % bestPosition - 最优解(传感器位置) % bestFitness - 最优解对应的适应度值 % 初始化粒子位置和速度 numSensors = size(sensorPositions, 1); positions = rand(numParticles, numSensors); velocities = rand(numParticles, numSensors); % 初始化个体最优位置和适应度值 pBestPositions = positions; pBestFitnesses = evaluateFitness(pBestPositions, sensorPositions, targetPositions); % 寻找全局最优位置和适应度值 [bestFitness, bestParticle] = min(pBestFitnesses); bestPosition = pBestPositions(bestParticle, :); % 迭代更新粒子位置和速度 for iter = 1:numIterations inertiaWeight = 0.5; % 惯性权重 cognitiveWeight = 1; % 认知权重 socialWeight = 1; % 社会权重 % 更新速度 velocities = inertiaWeight * velocities + ... cognitiveWeight * rand(numParticles, numSensors) .* (pBestPositions - positions) + ... socialWeight * rand(numParticles, numSensors) .* (repmat(bestPosition, numParticles, 1) - positions); % 更新位置 positions = positions + velocities; % 限制粒子位置在取值范围内 positions = max(positions, 0); positions = min(positions, 1); % 更新个体最优位置和适应度值 fitnesses = evaluateFitness(positions, sensorPositions, targetPositions); updateIndices = fitnesses < pBestFitnesses; pBestPositions(updateIndices, :) = positions(updateIndices, :); pBestFitnesses(updateIndices) = fitnesses(updateIndices); % 更新全局最优位置和适应度值 [minFitness, minParticle] = min(pBestFitnesses); if minFitness < bestFitness bestFitness = minFitness; bestPosition = pBestPositions(minParticle, :); end end end function fitnesses = evaluateFitness(positions, sensorPositions, targetPositions) % 计算适应度值 numParticles = size(positions, 1); fitnesses = zeros(numParticles, 1); for i = 1:numParticles selectedSensors = sensorPositions(positions(i, :) > 0.5, :); coveredTargets = zeros(size(targetPositions, 1), 1); for j = 1:size(selectedSensors, 1) distances = sqrt(sum((repmat(selectedSensors(j, :), size(targetPositions, 1), 1) - targetPositions).^2, 2)); coveredTargets(distances <= positions(i, j)) = 1; end fitnesses(i) = sum(coveredTargets) / size(targetPositions, 1); end end ``` 上述代码为一个函数,输入传感器位置矩阵、目标位置矩阵、粒子数和迭代次数,输出最优解(传感器位置)和最优解对应的适应度值。具体实现过程如下: 1. 首先,根据传感器位置矩阵的行数获得传感器数目,并初始化粒子位置和速度矩阵。 2. 初始化个体最优位置矩阵和适应度值矩阵,各自与粒子位置矩阵相同。 3. 初始化全局最优适应度值和最优粒子索引,分别为个体最优适应度值矩阵的最小值和对应索引。 4. 开始迭代更新,根据惯性权重、认知权重和社会权重,更新粒子速度和位置。 5. 更新粒子位置后,将超过取值范围的位置调整回区间[0,1]内。 6. 针对所有粒子,计算每个粒子对应的适应度值,并更新个体最优适应度值和位置。 7. 更新个体最优适应度值和位置后,检查是否有更优解出现,若有则更新全局最优适应度值和位置。 8. 迭代结束后,返回最优解(传感器位置)和最优解对应的适应度值。 使用以上源码,可以求解传感器覆盖优化问题

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

Matlab科研辅导帮

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值