A Free Search Krill Herd Algorithm for Functions Optimization

Algorithm 2

Free search operator.

Begin

    Initialize 𝑥_𝑖min, 𝑥_𝑖max, NK, NP, 𝐺, 𝑥_0𝑗𝑖, 𝑇, 𝑅_𝑗𝑖;

    Take initial walks 𝑓_𝑡𝑗(𝑥_0𝑗𝑖+Δ𝑥_𝑡);

    Generate the initial pheromone 𝑃_𝑘;

    Distribute the initial pheromone 𝑃_𝑘→𝑥_𝑘𝑃;

    Learn the initial achievements 𝑃_𝑘→𝑥_𝑗𝑘𝑃;

  While  (𝑡≤𝑇)

     Generate sensibility 𝑆_𝑗

      Select start locations for a walk 𝑥^′_0𝑗=𝑥_𝑘(𝑆_𝑗,𝑃_𝑘);

      Take exploration walks 𝑓_𝑡𝑗(𝑥_0𝑗𝑖+Δ𝑥_𝑡);

      Generate a pheromone 𝑃_𝑘;

      Distribute the pheromone 𝑃_𝑘→𝑥_𝑘𝑃;

      Learn the achievements 𝑃_𝑘→𝑥_𝑗𝑘𝑃;

  End While

End