arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.04216physics.soc-ph
收藏

旅行商问题在澳门世界遗产地最优游览顺序中的应用

Applications of Traveling Salesman Problem on the Optimal Sightseeing Orders of Macao World Heritage Sites with Real Time or Distance Values Between Every Pair of Sites

Kin Neng Tong, Iat In Fong, In Iat Li, Chi Him Anthony Cheng, Soi Chak Choi, Hau Xiang Ye, Wei Shan Lee

摘要:

在考虑了驾车、乘车、步行等方式对景点间的实际时间和距离后,利用模拟退火算法和大都会算法(SAMA)计算了澳门世界遗产景点的最优游览路线。我们发现,在最佳旅游路线下,开车大约需要78分钟,步行需要115分钟,而乘坐公共汽车需要117分钟。另一方面,驾驶汽车的最佳总距离为13.918 km,而行人步行的最佳总距离为7.844 km。这些结果可能意味着这个城市的公共交通还有很大的改善空间。比较了穷举法和SAMA法的计算时间,并给出了算法求解最优路径的动画。预计对于具有更多站点数量的蛮力枚举,计算时间将以天文数字的方式增加,而对于更大数量的站点,SAMA仅需要更少的数量级的时间来计算最优解。在每种运输方法中,还提供了几种最佳路线选择。然而,在某些类型的运输中,可能只有一条最佳路线没有循环或镜像副本。

英文摘要:

The optimal route of sightseeing orders for visiting every Macao World Heritage Site at exactly once was calculated with Simulated Annealing and Metropolis Algorithm(SAMA) after considering real required time or traveling distance between pairs of sites by either driving a car, taking a bus, or on foot. We found out that, with the optimal tour path, it took roughly 78 minutes for driving a car, 115 minutes on foot, while 117 minutes for taking a bus. On the other hand, the optimal total distance for driving a car would be 13.918 km while for pedestrians to walk, 7.844 km. These results probably mean that there is large space for the improvement on public transportation in this city. Comparison of computation time demanded between the brute-force enumeration of all possible paths and SAMA was also presented, together with animation of the processes for the algorithm to find out the optimal route. It is expected that computation time is astronomically increasing for the brute-force enumeration with more number of sites, while it only takes SAMA much less order of magnitude in time to calculate the optimal solution for larger number of sites. Several optimal options of routes were also provided in each transportation method. However, it is possible that in some types of transportation there could be only one optimal route having no circular or mirrored duplicates.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑