Paper
17 May 2022 The traveling salesman problem of route optimization: a study on tourists' travel plan through Guangzhou subway networks
Yifei Jia, Jiaheng Li, Yiming Tan, Bowen Yao, Haolin Zeng
Author Affiliations +
Proceedings Volume 12259, 2nd International Conference on Applied Mathematics, Modelling, and Intelligent Computing (CAMMIC 2022); 122594B (2022) https://doi.org/10.1117/12.2639598
Event: 2nd International Conference on Applied Mathematics, Modelling, and Intelligent Computing, 2022, Kunming, China
Abstract
With the development of vaccines and the pandemic mitigation, travelling starts reviving. Choosing a hotel is one of the most important works, so our topic is born. Our topic is mainly about optimization, and the main aim is to take ILP theory into practice and solve a specific problem. The specific problem we chose is a TSP problem which can help others choose the most rational hotel in Guangzhou without any meditation. To solve this problem, we first transfer the connection between different scenic spots and hotels into a Hamiltonian graph and use the Held-Karp algorithm to give out the least transportation fee. Comparing the fee with each other, we can tell which one is the most reasonable one to choose.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yifei Jia, Jiaheng Li, Yiming Tan, Bowen Yao, and Haolin Zeng "The traveling salesman problem of route optimization: a study on tourists' travel plan through Guangzhou subway networks", Proc. SPIE 12259, 2nd International Conference on Applied Mathematics, Modelling, and Intelligent Computing (CAMMIC 2022), 122594B (17 May 2022); https://doi.org/10.1117/12.2639598
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer programming

Binary data

Chemical elements

Algorithms

Data modeling

Manufacturing

Mathematical modeling

Back to Top