Greedy Algorithm Based Travel Route Planning under Multi-objective Decision Making
Scientific Journal of Technology · 21.01.2025 · 7 (1) · 135-141
DOI: 10.54691/nx787h98 ↗Kurz gefasst
Fachartikel in der Zeitschrift Scientific Journal of Technology, online erschienen am 21.01.2025. Verfasst von Xin Gao und 1 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 6 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
In this paper, greedy algorithm is used to optimize the planning of tourism routes based on multi-objective decision theory. The main goal of the research is to design the best travel route for foreign tourists by considering various factors such as time, cost and number of attractions. Firstly, this paper establishes a dataset including information of cities, attraction ratings, transportation time and cost through data integration and processing. Secondly, this paper used hierarchical analysis to evaluate 352 cities in multiple dimensions and identified the 50 cities that are most desirable to foreign tourists. Finally, combined with the greedy algorithm, this paper designed multiple optimization strategies under different constraints. The greedy algorithm used in the study can quickly provide tourist routes that meet the needs of tourists under multi-objective decision-making, and at the same time provides a new way of thinking for the planning of tourist routes.
Zitieren
APA
Gao, X., & Zhang, J. (2025). Greedy Algorithm Based Travel Route Planning under Multi-objective Decision Making. Scientific Journal of Technology, 7(1), 135-141. https://doi.org/10.54691/nx787h98
Vancouver
Gao X, Zhang J. Greedy Algorithm Based Travel Route Planning under Multi-objective Decision Making. Scientific Journal of Technology. 2025;7(1):135-141. doi:10.54691/nx787h98
BibTeX
@article{Gao2025,
author = {Gao, Xin and Zhang, Jianxin},
title = {Greedy Algorithm Based Travel Route Planning under Multi-objective Decision Making},
journal = {Scientific Journal of Technology},
year = {2025},
volume = {7},
number = {1},
pages = {135--141},
doi = {10.54691/nx787h98}
}
EUVIMED