The paper describes a new algorithm to produce r-optimal tours for the travelling salesman problem. This algorithm is faster than the original r-optimal method, and computation times increase much ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route ...

We consider a variant of the classical symmetric Traveling Salesman Problem in which the nodes are partitioned into clusters and the salesman has to visit at least one node for each cluster. This ...