A population based metaheuristic for the minimum latency problem

Abstract

In this paper we present a population based metaheuristic for solving the Minimum Latency Problem, which is the combination of bacterial evolutionary algorithm with local search techniques. The algorithm was tested on TSPLIB benchmark instances, and the results are competitive in terms of accuracy and runtimes with the state-of-the art methods. Except for two instances our algorithm found the best-known solution, and for the biggest tested instance it outperformed the best-known solution. The runtime was on average 30% faster than the most efficient method in the literature.