Authors: Lv Chang; Shuo Liu; Jiang Chang
Addresses: Public Service Platform of Small and Medium Enterprises in Jiangsu Province, Huaian Vocational College of Information Technology, Huai'an, Jiangsu, 223003, China; Jiangsu Key Laboratory of Traffic and Transportation Security, Huaiyin Institute of Technology, Huai'an, Jiangsu, 223003, China ' Jiangsu Key Laboratory of Traffic and Transportation Security, Huaiyin Institute of Technology, Huai'an, Jiangsu, 223003, China ' Faculty of Information Engineering, Yangzhou University, Yang Zhou, Jiangsu, 225009, China
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.
Keywords: transportation economy; TSP; travelling salesman problem; optimal route; test solution; test devices; water centripetal motion; simulation.
International Journal of Computing Science and Mathematics, 2021 Vol.13 No.1, pp.10 - 21
Received: 30 Oct 2018
Accepted: 22 Aug 2019
Published online: 13 Apr 2021 *