Solving Tourist Route Planning in Safari World with Hungarian and Greedy Algorithm
Keywords:
Safari world, the assignment problem, greedy algorithmAbstract
The objective of this research is to find the shortest route for touring animal exhibits and attending all shows at Safari World. This problem is addressed by applying the assignment problem and a greedy algorithm. Initially, the assignment problem is utilized to determine the sequence of show visits. Following that, the greedy algorithm is employed to find the optimal route for visiting animal exhibits, maximizing the coverage between the routes to the shows. After executing these two steps, the research produces the shortest route, with a total distance of 7.578 kilometers, and tour starts at 9:00 AM and ends at 4:48 PM.
References
G. N. Frederickson, M. S. Hecht and C. E. Kim, "Approximation algorithms for some routing problems", in 17th Annual Symposium on Foundations of Computer Science, United State, 1976.
O. Michail and P. G. Spirakis, “Traveling salesman problems in temporal graphs,” Theoretical Computer Science., Vol. 634, pp. 1-23, 2016.
O. Pedro, R. Saldanha and R. Camargo, “A Tabu search approach for the prize collecting traveling salesman problem,” Electronic Notes in Discrete Mathematics., Vol. 41, pp. 261-268, 2013.
X.H. Shi, Y.C. Liang, H.P. Lee, C. Lu and Q.X. Wang, “Particle swarm optimization-based algorithms for TSP and generalized TSP,” Information Processing Letters., Vol. 103, no. 5, pp. 169-176, 2007.
X. Geng, Z. Chen, W. Yang, D. Shi and K. Zhao, “Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search,” Applied Soft Computing., Vol. 11, no. 4, pp. 3680-3689, 2011.
C. Murat and A. Ekici, “Solving a modified TSP problem by a Greedy heuristic for cost minimization,” International Journal of Modeling and Optimization., Vol. 8, no. 3, pp. 138-144, 2018.
ธัญภัส เมืองปัน, ฐิติมา วงศ์อินตา, และ เทอดพงศ์ เมืองปัน, “กรอบแนวคิดการจัดเส้นทางสายตรวจรถจักรยานยนต์ :กรณีศึกษาสถานีตำรวจภูธรเสม็ด จังหวัดชลบุรี,” วารสารการขนส่งและโลจิสติกส์., ปีที่ 1, ฉบับที่ 9, น. 30-42, 2559.
วิรัลพัชร สว่างญาติ, “การเปรียบเทียบ 3 วิธี ในการออกแบบเส้นทางท่องเที่ยว กรณีศึกษาจังหวัดพระนครศรีอยุธยา,” วารสารรังสิตบัณฑิตศึกษาในกลุ่มธุรกิจและสังคมศาสตร์., ปีที่ 4, ฉบับที่ 2, น. 64-77, 2561.
D. Gavalas, C. Konstantopoulos, K.Mastakas, G. Pantziou and N. Vathis, “Heuristics for the time dependent team orienteering problem: application to tourist route planning,” Computers & Operations Research., Vol. 62, pp. 36-50, 2015.
T. Tlili and S. Krichen, “A simulated annealing-based recommender system for solving the tourist trip design problem,” Expert Systems with Applications., Vol. 186, no. 2, 2021.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
