Other approaches include: Various branch-and-bound algorithms, which can be used to process TSPs containing 40–60 cities. Solution of a TSP with 7 cities using a simple Branch and bound algorithm. The ...

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