“…Albeit, at the expense of any guarantee on optimality. To this end, Genetic Algorithms (GAs) have been the most frequently applied heuristic [8], [9], [12]- [16], but a wide range of alternative algorithms have also been investigated within the literature, including particle swarm [20], simulated annealing [21], modified bat algorithm [22], modified Clark and Wright's savings algorithm [23], minimal spanning tree [24], branch exchange [30] and path search [31]. In addition to heuristics, classical mathematical formulations have received attention.…”