Proceedings of the 2023 3rd International Conference on Public Management and Intelligent Society (PMIS 2023)

<Previous Article In Volume
Next Article In Volume>

Mudanjiang Travel Routing Problem by Simulated Annealing Approach

Authors
Yan Ma1, Wei Li2, *, Shufeng Li1, Peifu Zu1
1Mudanjiang Normal University, Mudanjiang, China
2Northeast Forestry University, Harbin, China
*Corresponding author. Email: li.wei.0214@163.com
Corresponding Author
Wei Li
Available Online 26 July 2023.
DOI
10.2991/978-94-6463-200-2_51How to use a DOI?
Keywords
TSP problem; Simulated annealing; Satisfactory solution
Abstract

With the improvement of people’s living standards and the increase of rural tourism quality requirements, Mudanjiang snow town tourism has become a popular tourist resort. The travel website provides plenty of information, and tourists can arrange the route according to their own plans. However, most of the tourists on the road trip are out-of-towners who do not know the local routes, which makes it difficult for tourists to develop a tourism planning. Therefore, snow and ice tourism route planning has attracted the attention of scholars. Ice and snow road trip route selection is a typical Traveling Salesman Problem (TSP) problem. In this paper, we propose the Traveling Salesman Problem of ice and snow tourism routes. The main purpose is to provide the maximum number of attractions and travel satisfaction for tourists. The distance between 15 tourist attractions in Mudanjiang selected in the experiment was used as data to establish the Traveling Salesman Problem model. To verify the feasibility and the effectiveness of the model, we use the Simulated Annealing (SA) to solve the model in this paper. The author uses Python software to simulate, and the result shows that the algorithm solves the TSP problem well.

Copyright
© 2023 The Author(s)
Open Access
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the 2023 3rd International Conference on Public Management and Intelligent Society (PMIS 2023)
Series
Atlantis Highlights in Intelligent Systems
Publication Date
26 July 2023
ISBN
978-94-6463-200-2
ISSN
2589-4919
DOI
10.2991/978-94-6463-200-2_51How to use a DOI?
Copyright
© 2023 The Author(s)
Open Access
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Cite this article

risenwbib
TY  - CONF
AU  - Yan Ma
AU  - Wei Li
AU  - Shufeng Li
AU  - Peifu Zu
PY  - 2023
DA  - 2023/07/26
TI  - Mudanjiang Travel Routing Problem by Simulated Annealing Approach
BT  - Proceedings of the 2023 3rd International Conference on Public Management and Intelligent Society (PMIS 2023)
PB  - Atlantis Press
SP  - 493
EP  - 499
SN  - 2589-4919
UR  - https://doi.org/10.2991/978-94-6463-200-2_51
DO  - 10.2991/978-94-6463-200-2_51
ID  - Ma2023
ER  -