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.

With neither minds nor maps- chemical-sensing immune players do well with decades-old mathematical problem, a computer simulation reveals.

AMOEBAS, one of the world’s most simple organisms, are able to solve a computationally complex problem – heralding the potential future of bio-computing.

This paper describes a new insertion procedure and a new postoptimization routine for the traveling salesman problem. The combination of the two methods results in an efficient algorithm (GENIUS) ...

The Traveling Salesman Problem is, on some level exactly the kind of thing where thinking about quantum computing as wave engineering makes it seem a prime candidate for a quantum speedup.

Tokyo University of Science researchers have built a chip-based quantum annealing processor that can solve the classically thorny ‘travelling salesman’ mathematical puzzle, which gets far more complex ...

The travelling salesman problem as applied to ants in an ant colony. The ants initially lay down a path (1) but wind up exploring a myriad of possible interconnected paths (2) over time.