function…
- User
function [Top_gazelle_fit,Top_gazelle_pos,Convergence_curve]=GOA2(SearchAgents_no,Max_iter,lb,ub,dim,fobj)
Top_gazelle_pos=zeros(1,dim); Top_gazelle_fit=inf;
Convergence_curve=zeros(1,Max_iter); stepsize=zeros(SearchAgents_no,dim); fitness=inf(SearchAgents_no,1);
gazelle=initialization(SearchAgents_no,dim,ub,lb);
Xmin=repmat(ones(1,dim).*lb,SearchAgents_no,1); Xmax=repmat(ones(1,dim).*ub,SearchAgents_no,1);
Iter=0; PSRs=0.34; S=0.88; s=rand();
while Iter<Max_iter
%------------------- Evaluating top gazelle -----------------
for i=1:size(gazelle,1)Flag4ub=gazelle(i,:)>ub; Flag4lb=gazelle(i,:)<lb; gazelle(i,:)=(gazelle(i,:).*(~(Flag4ub+Flag4lb)))+ub.*Flag4ub+lb.*Flag4lb; fitness(i,1)=fobj(gazelle(i,:)); if fitness(i,1)<Top_gazelle_fit Top_gazelle_fit=fitness(i,1); Top_gazelle_pos=gazelle(i,:); endend
%------------------- Keeping tract of fitness values-------------------if Iter==0 fit_old=fitness; Prey_old=gazelle; end
Inx=(fit_old<fitness); Indx=repmat(Inx,1,dim); gazelle=Indx.*Prey_old+~Indx.*gazelle; fitness=Inx.*fit_old+~Inx.*fitness;
fit_old=fitness; Prey_old=gazelle;
%------------------------------------------------------------Elite=repmat(Top_gazelle_pos,SearchAgents_no,1); %(Eq. 3) CF=(1-Iter/Max_iter)^(2*Iter/Max_iter);
RL=0.05*levy(SearchAgents_no,dim,1.5); %Levy random number vector RB=randn(SearchAgents_no,dim); %Brownian random number vector
for i=1:size(gazelle,1) for j=1:size(gazelle,2)
R=rand(); r=rand(); if mod(Iter,2)==0 mu=-1; else mu=1; end %------------------ Exploitation ------------------- if r>0.5 stepsize(i,j)=RB(i,j)(Elite(i,j)-RB(i,j)gazelle(i,j));
gazelle(i,j)=gazelle(i,j)+sRstepsize(i,j);%--------------- Exploration---------------- else if i>size(gazelle,1)/2 stepsize(i,j)=RB(i,j)*(RL(i,j)*Elite(i,j)-gazelle(i,j)); gazelle(i,j)=Elite(i,j)+S*mu*CF*stepsize(i,j); else stepsize(i,j)=RL(i,j)*(Elite(i,j)-RL(i,j)*gazelle(i,j)); gazelle(i,j)=gazelle(i,j)+S*mu*R*stepsize(i,j); end end endend
%------------------ Updating top gazelle ------------------for i=1:size(gazelle,1)
Flag4ub=gazelle(i,:)>ub; Flag4lb=gazelle(i,:)<lb; gazelle(i,:)=(gazelle(i,:).*(~(Flag4ub+Flag4lb)))+ub.*Flag4ub+lb.*Flag4lb; fitness(i,1)=fobj(gazelle(i,:)); if fitness(i,1)<Top_gazelle_fit Top_gazelle_fit=fitness(i,1); Top_gazelle_pos=gazelle(i,:); endend
%---------------------- Updating history of fitness values ----------------if Iter==0 fit_old=fitness; Prey_old=gazelle; end
Inx=(fit_old<fitness); Indx=repmat(Inx,1,dim); gazelle=Indx.*Prey_old+~Indx.*gazelle; fitness=Inx.*fit_old+~Inx.*fitness; fit_old=fitness; Prey_old=gazelle; %---------- Applying PSRs -----------if rand()<PSRs U=rand(SearchAgents_no,dim)<PSRs;
gazelle=gazelle+CF*((Xmin+rand(SearchAgents_no,dim).*(Xmax-Xmin)).*U);else r=rand(); Rs=size(gazelle,1); stepsize=(PSRs*(1-r)+r)*(gazelle(randperm(Rs),:)-gazelle(randperm(Rs),:)); gazelle=gazelle+stepsize; end
Iter=Iter+1;
Convergence_curve(Iter)=Top_gazelle_fit;end
- Assistant
% The above code implements the Goat Optimization Algorithm (GOA) for optimizing a given objective function.
% Inputs: % SearchAgents_no: Number of search agents % Max_iter: Maximum number of iterations % ub: Upper bound of search space % lb: Lower bound of search space % dim: Dimension of the search space % fobj: Objective function to be minimized
% Outputs: % Top_gazelle_fit: The best fitness value found by the algorithm % Top_gazelle_pos: The best solution found by the algorithm % Convergence_curve: The convergence curve of the algorithm
% Example usage: % dim = 10; % fobj = @sphere; % SearchAgents_no=30; % Max_iter=500; % ub=100ones(1,dim); % lb=-100ones(1,dim); % [Best_score,Best_pos,Convergence_curve]=GOA(SearchAgents_no,Max_iter,ub,lb,dim,fobj); % plot(Convergence_curve); xlabel('Iterations'); ylabel('Best Score Obtained');
% The above example optimizes the sphere function in 10 dimensions using GOA and plots the convergence curve. % Note that the sphere function is built-in and can be replaced with any other function.
Other models, same or similar prompt
Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.