介绍一种经典的群智能算法-JAYA（MATALB实现）

直接给出matlab源码，运行JAYA.m即可得出优化结果

JAYA.m的代码

%% JAYA algorithms
clc
clear all
close all

%% Problem Definition

pop = 1000;               % Population size
var = 10;                 % Number of design variables
maxGen = 3000;            % Maximum number of iterations
mini = -100*ones(1,var);  % Lower Bound of Variables
maxi = 100*ones(1,var);   % Upper Bound of Variables
objective = @fitness;      % Cost Function
 
%% initialize
[row,var] = size(mini);
x = zeros(pop,var);
fnew = zeros(pop,1);
f = zeros(pop,1);
fopt= zeros(pop,1);
xopt=zeros(1,var);

%%  Generation and Initialize the positions 
for i=1:var
    x(:,i) = mini(i)+(maxi(i)-mini(i))*rand(pop,1);
end

for i=1:pop
    f(i) = objective(x(i,:));
end

%%  Main Loop
gen=1;
while(gen <= maxGen)

    [row,col]=size(x);
    [t,tindex]=min(f);
    Best=x(tindex,:);
    [w,windex]=max(f);
    worst=x(windex,:);
    xnew=zeros(row,col);
    
    for i=1:row
        for j=1:col
            xnew(i,j)=(x(i,j))+rand*(Best(j)-abs(x(i,j))) - (worst(j)-abs(x(i,j)));  % 
        end
    end 
    
    for i=1:row
        xnew(i,:) = max(min(xnew(i,:),maxi),mini);   
        fnew(i,:) = objective(xnew(i,:));
    end
    
    for i=1:pop
        if(fnew(i)<f(i))
            x(i,:) = xnew(i,:);
            f(i) = fnew(i);
        end
    end

    fnew = []; xnew = [];
    [fopt(gen),ind] = min(f);
    xopt(gen,:)= x(ind,:);
    gen = gen+1;  
    disp(['Iteration No. = ',num2str(gen), ',   Best Cost = ',num2str(min(f))])
    
end

%% 

[val,ind] = min(fopt);
Fes = pop*ind;
disp(['Optimum value = ',num2str(val,10)])



 figure(1)
 plot(fopt,'linewid',2)
 xlabel('Itteration')
 ylabel('Best Cost');
 legend('JAYA')
 disp(' ' )

目标函数fitness.m

function [f] = fitness(x)
f= sum(x.^2);
end