<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Swarm behaviour - Page 24 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=swarm_behaviour&amp;p=23">1.Previous</a><br />
<a accesskey="3" href="page.php?w=swarm_behaviour&amp;p=25">3.Next</a>
</p>
<p>is another algorithm widely used to solve problems related to swarms. It was developed in 1995 by <a href="page.php?w=James_Kennedy_%28social_psychologist%29">Kennedy</a> and <a href="page.php?w=Russell_C._Eberhart">Eberhart</a> and was first aimed at <a href="page.php?w=computer_simulation">simulating</a> the social behaviour and choreography of bird flocks and fish schools. The algorithm was simplified and it was observed to be performing optimization. The system initially seeds a population with random solutions. It then searches in the <a href="page.php?w=candidate_solution">problem space</a></p><p>
<a accesskey="1" href="page.php?w=swarm_behaviour&amp;p=23">1.Previous</a><br />
<a accesskey="3" href="page.php?w=swarm_behaviour&amp;p=25">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
