A Hybrid Monkey Search Algorithm for Clustering Analysis

Algorithm 1

(1) Set parameters: 𝑀, 𝐾, 𝑝

(2) For 𝑖=1 to 𝑀 do

(3)   For 𝑗=1 to 𝑝∗𝐾 do

(4)    Randomly generate a integer 𝑘 and a real ϕ  {1≤𝑘≤𝑀, 𝜙∈[−1,1]};

(5)    𝑇𝑒𝑚𝑝=𝑋_𝑖; 𝑇𝑒𝑚𝑝_𝑗=𝑥_𝑖𝑗+𝜙⋅(𝑥_𝑘𝑗−𝑥_𝑖𝑗);

(6)    Calculate the objective function value 𝑓(𝑇𝑒𝑚𝑝);

(7)    If 𝑓(𝑇𝑒𝑚𝑝)<𝑓(𝑋_𝑖) do

(8)     Update 𝑋_𝑖 with 𝑇𝑒𝑚𝑝;

(9)    End if

(10)   End for

(11) End for