Skip to main content

Research Repository

Advanced Search

All Outputs (1)

Computation of the travelling salesman problem by a shrinking blob (2013)
Journal Article
Jones, J., & Adamatzky, A. (2014). Computation of the travelling salesman problem by a shrinking blob. Natural Computing, 13(1), 1-16. https://doi.org/10.1007/s11047-013-9401-x

The travelling salesman problem (TSP) is a well known and challenging combinatorial optimisation problem. Its computational intractability has attracted a number of heuristic approaches to generate satisfactory, if not optimal, candidate solutions. S... Read More about Computation of the travelling salesman problem by a shrinking blob.