JSTOR Daily

Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection

The Journal of the Operational Research Society, Vol. 66, No. 4 (APRIL 2015), pp. 615-626 (12 pages) We introduce and study the Travelling Salesman Problem with Multiple Time Windows and Hotel ...
Science Daily

A Travelling Salesman Problem special case: 30-year-old problem solved

The science of computational complexity aims to solve the TSP -- the Travelling Salesman Problem -- when the time required to find an optimal solution is vital for practical solutions to modern-day ...
JSTOR Daily

An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries

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

Traveling Salesman: A Seemingly Unsolvable Problem Offers a Glimpse of the Limits of Computation

Is it hopeless to try to compute the shortest route to visit a large number of cities? Not just a good route but the guaranteed shortest. The task is the long-standing challenge known as the traveling ...