This algorithm simulates a flock of birds which communicate during flight. Each bird looks at a specific direction
(its best ever attained position Yi ), and later, when they communicate among themselves, the bird which is in the best position is identified.With coordination, each bird moves also towards the best bird using a velocity which depends on its present velocity. Thus, each bird examines the search space from its current local position, and this process repeats until the bird possibly reaches the desired position. Note that this process involves as much individual intelligence as social interactivity; the birds learn through their own experience (local search) and the experience of their peers (global search).