1Shandong Experimental High School (China) 2Ulink College (China) 3Shanghai United International School (China) 4Guangzhou Foreign Language School (China)
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
This paper focuses on a specific instance of the Traveling salesman problem (TSP). We want to find the route with the lowest cost of 10 places we select randomly. We chose this topic to investigate how we can use Travelling Salesman Problem, or an extension of it with more variables and constraints, to minimize the cost of tourists given certain tourist attractions they must visit. The proposed method to solve the problem uses Python's comparing method and loops method to find the best route. The result we get in this research is that we find the optimal solution of the example of TSP with all the data we have found.
Bojun Cui,Siyuan Lang,Baolong Huang, andWeiyuan Cao
"Extension of the Traveling Salesman Problem on Tourism in California", Proc. SPIE 12566, Fifth International Conference on Computer Information Science and Artificial Intelligence (CISAI 2022), 125664X (28 March 2023); https://doi.org/10.1117/12.2669336
ACCESS THE FULL ARTICLE
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
The alert did not successfully save. Please try again later.
Bojun Cui, Siyuan Lang, Baolong Huang, Weiyuan Cao, "Extension of the Traveling Salesman Problem on Tourism in California," Proc. SPIE 12566, Fifth International Conference on Computer Information Science and Artificial Intelligence (CISAI 2022), 125664X (28 March 2023); https://doi.org/10.1117/12.2669336