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

The most efficient path that visits each of 2 million stars just once We have found the best path to take between the stars. The travelling salesman problem, an infamous mathematical puzzle that ...