A rapid optimisation method of TSPs based on water centripetal motion
by Lv Chang; Shuo Liu; Jiang Chang
International Journal of Computing Science and Mathematics (IJCSM), Vol. 13, No. 1, 2021

Abstract: Travelling salesman problem (TSP) solutions are commonly used in many areas. We provide an innovative and optimal solution method of TSPs based on water flow centripetal motion, and is different from other algorithms. In the case of 34 cities in China, the centre hole is computed with a pentagon which formed by the outermost five cities. Place a string to enclose all rods in a circle after water fills the tank, and start to pump water at a steady rate. And a uniform and equal centripetal force is generated and the string will shrink uniformly until connect each of rods as well as water runs out. The string is the best route that connects the 34 cities. The method's optimal result is 15,759.75 km, which is 32.55 km shorter than the current optimal solution. The method eliminates the complex procedure, takes less time, and is highly feasible and reliable.

Online publication date: Tue, 13-Apr-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com