A unified ant colony optimization algorithm for continuous optimization

In this article, we propose UACOR, a unified ant colony optimization (ACO) algorithm for continuous optimization. UACOR includes algorithmic components from ${\mathrm{ACO}}_{‐{R}}\text{,}{\mathrm{DACO}}_{‐{R}}$ and ${\mathrm{IACO}}_{‐{R}}$ ‐LS, three ACO algorithms for continuous optimization that have been proposed previously. Thus, it can be used to instantiate each of these three earlier algorithms; in addition, from UACOR we can also generate new continuous ACO algorithms that have not been considered before in the literature. In fact, UACOR allows the usage of automatic algorithm configuration techniques to automatically derive new ACO algorithms. To show the benefits of UACOR’s flexibility, we automatically configure two new ACO algorithms, UACOR‐s and UACOR‐c, and evaluate them on two sets of benchmark functions from a recent special issue of the Soft Computing (SOCO) journal and the IEEE 2005 Congress on Evolutionary Computation (CEC’05), respectively. We show that UACOR‐s is competitive with the best of the 19 algorithms benchmarked on the SOCO benchmark set and that UACOR‐c performs superior to IPOP‐CMA‐ES and statistically significantly better than five other algorithms benchmarked on the CEC’05 set. These results show the high potential ACO algorithms have for continuous optimization and suggest that automatic algorithm configuration is a viable approach for designing state‐of‐the‐art continuous optimizers.