Cuckoo Search Algorithm with Chaotic Maps

Algorithm 1

CCS.

;

Nest₀ = ( InitializeSolution();

Fitness Evaluation(Nest₀);

FES  NP;

FindBestSolutionByFitness();

InitializeChaoticSequence();

InitializeChaoticSequence();

WHILE (FES < MaxFES)

 G  G + 1;

  InitializeChaoticSequence();

  InitializeChaoticSequence();

 FOR (i from 1 to NP)

   Generating new solution with (8)

   EvaluatingAndSelecting(, );

  FES  FES + 1;

 ENDFOR

 FOR (i from 1 to NP)

   Generating new solution with (9)

   EvaluatingAndSelecting(, );

  FES  FES + 1;

 ENDFOR

  FindAndUpdateBestSolution();

ENDWHILE