An Ant Colony Algorithm for Both Robust and Global Optimizations of Inverse Problems

To address the computational inefficiencies of available robust oriented optimizers, a fast optimal algorithm based on ant colony optimization (ACO) algorithm for both robust and global optimizations of inverse problems is proposed. In the proposed algorithm, the structures of the algorithm are redesigned, and methodologies for efficient computations of the robust performance parameters are proposed. Numerical results are reported to positively showcase the merits of the proposed algorithm.