Finding the shortest path to the 9 temples in Phra Nakhon Si Ayutthaya By using the Traveling Salesman Problem model

Abstract

Phra Nakhon Si Ayutthaya is one of the provinces that has outstanding tourism features. One activity that most tourists like to visit is cultural tourism to pay homage to the 9 temples, which is one day trip tourism. Tourists can find basic travel information on many travel websites to guide their travel planning. Since the information available on each website is different. There is quite specific and limited information. Many web sites will only recommend places but do not tell travel sequences and times it takes. Including the recommended temples, may not be temples that meets the needs of all travelers. The researcher therefore surveyed and compiled a list of 9 temples that were recommended for worship activities from various websites, totaling 8 websites. Choose the 11 most recommended temples. Consider all possible options for selecting 9 temples from the recommended temples above. There will have a total of 55 options. Each alternative uses the concept of modeling “Traveling Salesman Problems”. Find a route with the least total distance to worship at 9 temples. By using the excel solver program. And collect results in every case. Including total distance, total time spent on that route, order of travel and the time spent in each range with the Excel program. Apply the INDEX and MATCH commands to call each alternative data. To make travel plans more efficiently.