Septia Rani
ABSTRACT
In this paper, a mobile application that could assist tourists in arranging travel itineraries has been developed. In the case of making an itinerary, often tourists have been determined the tourist destinations they want to visit, but they confused in determining the order of efficient visits. Balanced clustering is an approach to classify tourist destinations based on the proximity of their location, which gives the results of a cluster whose cardinality between members of the cluster is balanced. Furthermore, each cluster group from the results of this clustering will be seen as a case of the Traveling Salesman Problem (TSP), which we need to find the most efficient sequence of visits in each cluster that contains a list of tourist destinations. The algorithm used for the completion of the TSP is the Held-Karp algorithm. From the running time measurement test, it is obtained that the Held-Karp algorithm solves the problem of finding the TSP route faster than using the Brute Force approach. In addition, the implementation of balanced clustering using the Hungarian algorithm can make the number of tourist destinations to be visited in each day become balance.
- Rizzo, C. 2017. This App Will Help You Effortlessly Plan a Multi-city European Vacation. http://www.travelandleisure.com/travel-tips/mobile- apps/eightydays-app-plans- european-vacation, acessed 15 August 2019.Google Scholar
- Hsu, F. C., & Chen, P. 2000. Interactive genetic algorithms for a travel itinerary planning problem. TSP, 1, 13.Google Scholar
- Xiang, L., Zhou, J., & Zhao, X. 2016. Travel itinerary problem. Transportation Research Part B: Methodological Volume 91, September 2016, Pages 332--343.Google Scholar
- ani, S., Kholidah, K. N., & Huda, S. N. 2018. A Development of Travel Itinerary Planning Application using Traveling Salesman Problem and K-Means Clustering Approach. In Proceedings of the 2018 7th International Conference on Software and Computer Applications (pp.Google Scholar
- 327--331) ACM.Google Scholar
- Belaidan, S. L. M. 2019. Implementing K-Means Clustering Algorithm in Collaborative Trip Advisory and Planning System. Periodicals of Engineering and Natural Sciences, 7(2), 723--740.Google ScholarCross Ref
- Joshi, V. 2017. Speeding Up The Traveling Salesman Using Dynamic Programming. https://medium.com/basecs/speeding-up-the-traveling- salesman-using-dynamic-programming-b76d7552e8dd, accessed 8 February 2019.Google Scholar
- Malinen, M. I., & Fränti, P. 2014. Balanced k-means for clustering. In Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR) (pp. 32--41). Springer, Berlin, Heidelberg.Google ScholarDigital Library
- Kuhn, H.W. 1955. "The Hungarian Method for the assignment problem", Naval Research Logistics Quarterly, 2: 83--97, 1955.Google ScholarCross Ref
- Kuhn, H.W. 1956. "Variants of the Hungarian method for assignment problems", Naval Research Logistics Quarterly, 3: 253--258, 1956.Google Scholar
- Munkres, J. 1957. "Algorithms for the Assignment and Transportation Problems", Journal of the Society for Industrial and Applied Mathematics, 5(1):32--38, 1957 March.Google Scholar
Index Terms
- Smart Travel Itinerary Planning Application using Held-Karp Algorithm and Balanced Clustering Approach
Recommendations
A Development of Travel Itinerary Planning Application using Traveling Salesman Problem and K-Means Clustering Approach
ICSCA '18: Proceedings of the 2018 7th International Conference on Software and Computer ApplicationsIn this paper, an algorithm for making travel itinerary using traveling salesman problem (TSP) and k-means clustering technique is proposed. We employ the algorithm to develop a web based application that can help travelers to plan their travel ...
Travel Itinerary Recommendations with Must-see Points-of-Interest
WWW '18: Companion Proceedings of the The Web Conference 2018Travelling and touring are popular leisure activities enjoyed by millions of tourists around the world. However, the task of travel itinerary recommendation and planning is tedious and challenging for tourists, who are often unfamiliar with the various ...
Travel planning problem considering site selection and itinerary making
RACS '18: Proceedings of the 2018 Conference on Research in Adaptive and Convergent SystemsTourism development has become indispensable activity for people's daily life, especially self-driving travel. We study destination choice and itinerary problem for self-driving travel planning. A fuzzy analytic hierarchy process (FAHP) is utilized to ...
Comments