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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computing Science and Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
