Computation of multiple global optima through chaotic ant swarm

This paper proposes a technique aiming to compute all global minimizers, while avoiding local minimizers, through chaotic ant swarm (CAS) optimization method. This technique incorporates the recently proposed deflection and repulsion techniques to alleviate local minimizers. Those approaches can be used in combination with CAS to detect all global minimizers effectively. The performance of the algorithm is illustrated on test problems of global optimization. Experimental results indicate the effectiveness of the proposed algorithm.