Data Structures and Algorithms


Efficiently Solving Traveling Salesman Problem in a Computer Network. (Internet)

Authors: Oscar E. Chamizo Sánchez

Traveling salesman problem (TSP for short) is perhaps the most widely known and deeply investigated problem in computation. Given a set of cities, the simple goal is to find the cheapest way of visiting all cities and returning to the starting one. The optimal (in case of a simetric euclidean TSP the shortest) path from the starting city to itself through all the remaining cities is, in general, only one from the (n-1)!/2 set of possible tours or circuits. In our seminal paper A new approach: A hardware device model solving TSP in O(n2) time we presented a physically realizable computation model solving any instance of TSP in O(n2) time, a model that can´t be efficiently simulated by a single TM, thus proving the fallacy of the so called strong form of Church-Turing thesis. In this paper we present a model of network computation that solves TSP in O(n2) time, model that could be implemented with some technical adjustments in a global system like internet. This network with five billions interconnected devices provides boundless possibilities in order to solve unprecedented instances of the TSP and therefore of other NP problems. In section 1 we go directly to the device model and prove mathematically its validity. In section 2 we explain the basic ideas behind the physical model. In section 3 we outline the key aspects to put into practice the theoretical model in a computer network.

Comments: 4 Pages.

Download: PDF

Submission history

[v1] 2018-04-28 04:57:56

Unique-IP document downloads: 10 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus