EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Optimal algorithm of the traveling salesman problem for tourist location selection

Md. Riad Hossen, Hami Jafar Koushik, Mohammed Forhad Uddin, Md. Atiqur Rahman, Md. Abdul Hye

International Journal for Simulation and Multidisciplinary Design Optimization · 2025 · 16 · 11

DOI: 10.1051/smdo/2025011 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal for Simulation and Multidisciplinary Design Optimization, online erschienen am 25.08.2025. Verfasst von Md. Riad Hossen und 4 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 46 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This study explores the Traveling Salesman Problem (TSP) by applying both deterministic and stochastic algorithms. The deterministic algorithms include the Greedy Algorithm (GrA), Brute Force (BF), Branch and Bound (B&B), Dynamic Programming (DP), and Nearest Neighbor (NN), while the stochastic algorithms include Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing (SA), and Particle Swarm Optimization (PSO). The research addresses limitations in the practical application of optimization algorithms in the tourism industry by focusing on minimizing travel distance, time, and cost across eight tourist locations using multi-objective optimization. Unlike most studies that focus solely on theoretical models, this work offers a comprehensive real-world comparison of algorithm performance for tourism route planning. The analysis shows that BF, B&B, and DP achieve optimal results in distance, time, and cost. Among stochastic methods, SA performs competitively alongside GA and PSO for smaller datasets. Notably, DP emerges as the most practical solution for small to medium-sized TSP instances, balancing computational efficiency and optimality. This highlights DP's potential as an effective and efficient algorithm for real-world tourism applications, offering optimal solutions with minimal execution time.

Zitieren

APA

Hossen, M. R., Koushik, H. J., Uddin, M. F., Rahman, M. A., & Hye, M. A. (2025). Optimal algorithm of the traveling salesman problem for tourist location selection. International Journal for Simulation and Multidisciplinary Design Optimization, 16, 11. https://doi.org/10.1051/smdo/2025011

Vancouver

Hossen MR, Koushik HJ, Uddin MF, Rahman MA, Hye MA. Optimal algorithm of the traveling salesman problem for tourist location selection. International Journal for Simulation and Multidisciplinary Design Optimization. 2025;16:11. doi:10.1051/smdo/2025011

BibTeX
@article{Hossen2025,
  author = {Hossen, Md. Riad and Koushik, Hami Jafar and Uddin, Mohammed Forhad and Rahman, Md. Atiqur and Hye, Md. Abdul},
  title = {Optimal algorithm of the traveling salesman problem for tourist location selection},
  journal = {International Journal for Simulation and Multidisciplinary Design Optimization},
  year = {2025},
  volume = {16},
  pages = {11},
  doi = {10.1051/smdo/2025011}
}
Kostenlos starten →