Control parameter optimisation using the evidence framework for the ant colony optimisation algorithm

Abstract

The ant colony optimization (ACO) algorithm is a metaheuristic initially designed to solve the travelling salesman problem (TSP). The design of experiments, finding the suitable ACO algorithm configuration, and calibrating the adaptive control parameters are exhaustive and time-consuming exercises, especially for TSPs where the number of cities can exceed 1000. This paper presents an evidence framework driven control parameter optimisation (EFCPO) algorithm for an ACO algorithm solving TSPs. EFCPO performs auto-tuning of the adaptive control parameters and makes recommendations about the ACO algorithms that are best suited for the TSPs in question using the log evidence. In addition, with this ability, the algorithm can take a solution provided by an ACO algorithm and improve the results. The EFCPO accomplishes this over a number of cycles through auto-tuning of the control parameters and re-running the ACO until the process is completed. The capabilities of EFCPO are compared to another configuration tool, irace, using benchmark ACO algorithms to test the efficiency of the framework. The benchmark algorithms make use of a local search strategy to solve TSPs. The results show that ACO algorithms are able to find new and improved solution tours within reasonable times. The improvements are also significant. In addition, ACO algorithms that are best suited for the TSP in question are preferred, making the EFCPO an effective tool for real-time configuration of ACO algorithms for solving TSPs .