Management Science, Vol. 35, No. 11, Focussed Issue on Variance Reduction Methods in Simulation (Nov., 1989), pp. 1393-1412 (20 pages) A problem posed by O. L. Deutsch (1988) as the Artificial ...

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

Is it possible for humans to navigate in the natural environment wherein the path taken between various destinations is 'optimal' in some way? In the domain of optimization this challenge is ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...

Forget GPS. With no fancy maps or even brains, immune system cells can solve a simple version of the traveling salesman problem, a computational conundrum that has vexed mathematicians for decades.

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

Tackling the traveling salesman problem with chemotaxis is a nice example of when the suboptimal is optimal, says Bartumeus. Of course, with all the information, time and resources in the world, ...

We have found the best path to take between the stars. The travelling salesman problem, an infamous mathematical puzzle that seeks the shortest route between many locations while visiting each only ...