A statistical analysis of parameter values for the rank‐based ant colony optimization algorithm for the traveling salesperson problem

Ant colony optimization (ACO) is a metaheuristic for solving combinatorial optimization problems that is based on the foraging behavior of biological ant colonies. Starting with the 1996 seminal paper by Dorigo, Maniezzo and Colorni, ACO techniques have been used to solve the traveling salesperson problem (TSP). In this paper, we focus on a particular type of the ACO algorithm, namely, the rank‐based ACO algorithm for the TSP. In particular, this paper identifies an optimal set of key parameters by statistical analysis applied to results of the rank‐based ACO for the TSP. Specifically, for six frequently used TSPs available on the World Wide Web, we will solve a total of 27000 instances for each problem.