A multiple ant colony optimization algorithm for the capacitated location routing problem

► We propose a multiple ant colony optimization (MACO) algorithm for the capacitated location routing problem. ► Four sets of benchmark instances from the literature are tested. The results are also compared with other leading algorithms from the literature. ► Our MACO is competitive with the well-known algorithms. The overall average gap by our MACO outperforms other algorithms.