C1.m

% AAA1 stands for IWO_MUX 2:1
clc;
clear;
%close all;

%% Problem Definition
VarMin=0.2;                                     % Lower Bound of Decision Variables
VarMax=2;                                    % Upper Bound of Decision Variables
%nVar=4;                                       % Number of Decision Variables
nVar=4;
VarSize=[1 nVar];                         % Decision Variables Matrix
VarRange=[VarMin VarMax];      % Range of Decision Variables

%% IWO Parameter

MaxIt=10;          % Maximum Number of Iterations

% Nweed== No
No= 2;               %    ( Number of initial population )
%50
Pmax=4;            % Maximum number of weed population     
%100
Smin=1;                % Minimum Number of Seeds
Smax=10;             % Maximum Number of Seeds

n=3;                        % Nonlinear modulation index

Initialsigma=0.3;         % Initial value of standard deviation
Finalsigma=0.001;     % Final value of standard deviation

%% Initialization

NFE=0;

individual.Position=[];
individual.Cost=[];

pop=repmat(individual,No,1);

for i=1:No
    pop(i).Position=unifrnd(VarMin,VarMax,VarSize);
    pop(i).Cost=C2(pop(i).Position);
end

% Sort Population
Costs=[pop.Cost];
[Costs SortOrder]=sort(Costs);
pop=pop(SortOrder);

BestSol=[];
WorstCost=zeros(MaxIt+1,1);
BestCost=zeros(MaxIt+1,1);
MeanCost=zeros(MaxIt+1,1);
Sigma=zeros(MaxIt,1);

WorstCost(1)=Costs(end);
BestCost(1)=Costs(1);

nfe=zeros(MaxIt,1);

%% IWO Main Loop

for it=1:MaxIt
    
    %Number Of seeds for each weed
    
    Costs=[pop.Cost];
    S=min(Smax,round(Smax-(Smax-Smin)*(Costs-BestCost(it))/(WorstCost(it)-BestCost(it))));
    
    %Iteration Sigma
    Sigma(it)=((((MaxIt-it)^n)/((MaxIt-1)^n))*(Initialsigma-Finalsigma))+Finalsigma;
    
    %Reproduction
    Ns=sum(S);
    pop2=repmat(individual,Ns,1);
    Positions=[pop.Position];
    Solution=zeros(1,nVar);
    number=1;
    for b=1:No 
        for c=1:S(b)
            for d=1:nVar
                Seed=normrnd(pop(b).Position(d),(Sigma(it))^2);
                
                while (Seed>VarMax) || (Seed<VarMin)
                    if Seed>VarMax
                       Seed=Seed-(Seed-VarMax);
                    end
                    if Seed<VarMin
                       Seed=Seed+(VarMin-Seed);
                    end
                end
                Solution(d)=Seed;
                  
            end
            pop2(number).Position=Solution;
            pop2(number).Cost=C2(pop2(number).Position);
            number=number+1;
        end
    end

    % Merge Populations
    pop=[pop
         pop2];  %#ok
    
    % Sort Population
    Costs=[pop.Cost];
    [Costs SortOrder]=sort(Costs);
    pop=pop(SortOrder);
   
    % Delete Extra Individuals
    pop=pop(1:Pmax);
    Costs=Costs(1:Pmax);
    
    % Save Results
    BestSol=pop(1);
    BestCost(it+1)=Costs(1);
    WorstCost(it+1)=Costs(end);
    MeanCost(it)=mean(Costs);
    nfe(it)=NFE;
    
    % Show Information
    disp(['Iteration ' num2str(it) ':   ' ...
          'Best Cost = ' num2str(BestCost(it)) '  , ' ...
          'Mean Cost = ' num2str(MeanCost(it))]);
end

 %% Results

%figure;
hold on;
%plot(BestCost(1:10),'LineWidth',2);
plot(BestCost,'g','LineWidth',2);
% semilogy(BestCost,'LineWidth',2);
%xlabel('Iteration');
%ylabel('Best Fitness = Best Average Power');