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.

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

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

We designed a simple computational exercise to compare weak and strong integer programming formulations of the traveling salesman problem. Using commercial IP software, and a short (60 line long) ...

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

Bumblebees can find the solution to a complex mathematical problem which keeps computers busy for days. Scientists in the UK have discovered that bees learn to fly the shortest possible route between ...