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.

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

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

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