Paper
28 March 2023 Extension of the Traveling Salesman Problem on Tourism in California
Bojun Cui, Siyuan Lang, Baolong Huang, Weiyuan Cao
Author Affiliations +
Proceedings Volume 12566, Fifth International Conference on Computer Information Science and Artificial Intelligence (CISAI 2022); 125664X (2023) https://doi.org/10.1117/12.2669336
Event: Fifth International Conference on Computer Information Science and Artificial Intelligence (CISAI 2022), 2022, Chongqing, China
Abstract
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.
© (2023) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Bojun Cui, Siyuan Lang, Baolong Huang, and 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
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Bridges

Algorithms

Printing

Matrices

Computer science

Industry

Internet

RELATED CONTENT

Rate-based reliable multicast congestion control
Proceedings of SPIE (July 25 2001)
Quantum hidden subgroup algorithms The devil is in the...
Proceedings of SPIE (August 24 2004)
Two-step Gram-Schmidt downdating methods
Proceedings of SPIE (November 20 2001)
Some fast Toeplitz least-squares algorithms
Proceedings of SPIE (December 01 1991)
Parallel QR Decomposition Of Toeplitz Matrices
Proceedings of SPIE (April 04 1986)
Quantum algorithms for the Jones polynomial
Proceedings of SPIE (April 16 2010)

Back to Top