Abstract
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.
Highlights
Kin Neng Tong 1, Iat In Fong 1, In Iat Li 1, Chi Him Anthony Cheng 1, Soi Chak Choi 1, Hau Xiang Ye 1, and Wei Shan Lee 1
After comparing the efficiency between brute-force enumeration and Simulated Annealing and Metropolis Algorithm (SAMA), we used SAMA to search for the routes with optimal time or distance for tourists to go over all the world heritage sites without repeating any site
For the first trial of SAMA, we introduced the latitudes and longitudes of the Macao World Heritage sites and calculated the optimal route with the minimum total distance by assuming that any pair of sites could be reached by a straight line
Summary
Macao Wikipedia of Macau Wiki, (2021), one of the two special administrative regions of People’s Republic of China, is a very famous historical city. Applications of Traveling Salesman Problem on the Optimal Sightseeing Orders of Macao World Heritage Sites with Actual Time or Distance. Kin Neng Tong, Iat In Fong, In Iat Li, Chi Him Anthony Cheng, Soi Chak Choi, Hau Xiang Ye, and Wei Shan Lee showed that there are roughly 30 million tourists a year visiting Macao during last decade. TSP study for Macao World Heritage sites remains unknown. We first collected data from GOOGLE MAP about the least time or shortest distance between pairs of Macao World Heritage Sites by either driving a car, taking a bus, or on foot. After comparing the efficiency between brute-force enumeration and SAMA, we used SAMA to search for the routes with optimal time or distance for tourists to go over all the world heritage sites without repeating any site. In certain transportation methods, we observed that there could be only one optimal route that is not circular or mirrored repetitive
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 Engineering Science Technologies
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.
