Chaotic-Search-Based Cultural Algorithm for Solving Unconstrained Optimization Problem

Algorithm 1

Begin

t=0;

Initialize Population POP(t);

Initialize Belief Space BLF(t);

Repeat

 Evaluate Population POP(t);

 Update (BLF(t), Accept (POP(t)));

 Variation (POP(t), Influence (BLF(t)));

 t = t + 1;

 Select(POP(t)from POP(t−1));

Until termination condition achieved

End