No abstract

In the recent years, many heuristic optimization algorithms have been developed. A majority of these heuristic algorithms have been derived from the behavior of biological or physical systems in nature. In this paper, we propose a new optimization algorithm based on competitive behavior of animal groups. In the proposed algorithm, the whole population is divided into a number of groups. In each group, the best searching agent spreads its children in its owned territory. Any group which is not able to find rich resources will be eliminated form competition. The competition gradually results in an increase in population of wealthy group which gives a fast convergence to proposed optimization algorithm. In the following, after a detailed explanation of the algorithm and pseudo code, we compare it to other existing algorithms, including genetics and particle swarm optimizations. Applying the proposed algorithm on various benchmark cost functions, shows faster and superior results compared to other optimization algorithms.

No abstract

No abstract

No abstract