Research on the Evaluation of Tourist City Attractiveness and Optimal Tourism Route Planning Based on Topsis and Greedy Algorithm

This study aims to evaluate the attractiveness of Chinese tourist cities and plan the optimal tourism routes to enhance the travel experience of international tourists. Initially, we collected and integrated tourist attraction data from 352 cities, forming a unified dataset containing 35,200 attractions. Through data cleaning and preprocessing, we ensured the completeness and accuracy of the data. Subsequently, we calculated the weights of 20 relevant indicators using the Entropy Weight Method and the CRITIC Weight Method, which cover aspects such as city size, environmental protection, cultural heritage, transportation convenience, climate, and culinary offerings. By employing a hybrid weighting method, we enhanced the scientific rigor of the weight distribution. Furthermore, this study utilized the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) for comprehensive city evaluation and optimized the tourism route based on the Greedy Algorithm. The Greedy Algorithm selects the optimal solution at each step, hoping to achieve a globally optimal outcome while considering travel costs and time constraints. Using this method, we planned an efficient tourism route covering 11 cities, with a total time consumption of 143.19 hours and a total cost of 1196.46 yuan, achieving an optimized balance between travel experience and cost-effectiveness.

Authors

Institutions

Publication Details

Published
2024-12-29
DOI
https://doi.org/10.1109/icirdc65564.2024.00161
Primary Topic
E-commerce and Technology Innovations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on the Evaluation of Tourist City Attractiveness and Optimal Tourism Route Planning Based on Topsis and Greedy Algorithm

Zifan Liu
E-commerce and Technology Innovations
article

Research on the Evaluation of Tourist City Attractiveness and Optimal Tourism Route Planning Based on Topsis and Greedy Algorithm

Zifan Liu
article en

Abstract

This study aims to evaluate the attractiveness of Chinese tourist cities and plan the optimal tourism routes to enhance the travel experience of international tourists. Initially, we collected and integrated tourist attraction data from 352 cities, forming a unified dataset containing 35,200 attractions. Through data cleaning and preprocessing, we ensured the completeness and accuracy of the data. Subsequently, we calculated the weights of 20 relevant indicators using the Entropy Weight Method and the CRITIC Weight Method, which cover aspects such as city size, environmental protection, cultural heritage, transportation convenience, climate, and culinary offerings. By employing a hybrid weighting method, we enhanced the scientific rigor of the weight distribution. Furthermore, this study utilized the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) for comprehensive city evaluation and optimized the tourism route based on the Greedy Algorithm. The Greedy Algorithm selects the optimal solution at each step, hoping to achieve a globally optimal outcome while considering travel costs and time constraints. Using this method, we planned an efficient tourism route covering 11 cities, with a total time consumption of 143.19 hours and a total cost of 1196.46 yuan, achieving an optimized balance between travel experience and cost-effectiveness.

Jilin University (CN)
Openalex Percentile: Top 44%
E-commerce and Technology Innovations
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.