Vectorized candidate set selection for parallel ant colony optimization
Joshua Peake, Martyn Amos, Paraskevas Yiapanis, Huw Lloyd · Proceedings of the Genetic and Evolutionary Computation Conference Companion · 2018
Ant Colony Optimization (ACO) is a well-established nature-inspired heuristic, and parallel versions of the algorithm now exist to take advantage of emerging high-performance computing processors. However, careful attention must be paid to parallel components of such implementations if the full benefit of these platforms is to be obtained. One such component of the ACO algorithm is next node selection, which presents unique challenges in a parallel setting. In this paper, we present a new node selection method for ACO, Vectorized Candidate Set Selection (VCSS), which achieves significant speedup over existing selection methods on a test set of Traveling Salesman Problem instances.