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

This is a preview. Log in through your library . Abstract This paper elaborates a method of attack on traveling-salesman problems, proposed by the authors in an earlier paper, in which linear ...

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

Dr. James McCaffrey of Microsoft Research uses full code samples to detail an evolutionary algorithm technique that apparently hasn't been published before. The goal of a combinatorial optimization ...

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

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

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