If the computation of each path were to take one microsecond in the travelling salesman problem, then trying to solve the problem using brute force becomes practically impossible beyond perhaps 12 ...

The Travelling Salesman Problem with Pickups and Deliveries (TSPPD) consists in designing a minimum cost tour that starts at the depot, provides either a pickup or delivery service to each of the ...

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 ...