Given a graph whose arc traversal times vary over time, the time-dependent travelling salesman problem (TDTSP) consists in finding a Hamiltonian tour of least total duration covering the vertices of ...

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