Wapee Manopiniwes
ABSTRACT
A well-planned vacation can bring every visitor not only higher enjoyment of his or her trip but allows to maximize efficiently spent time within the budget constraints. This research proposes the suggested routes for ecotourism destinations in Chiang Mai, Thailand by using the traveling salesman problem (TSP) method. Chiang Mai has been noticed as the destination of ecotourism because of a rich and beautiful natural resources. It is convenient for tourists to have a web-based platform providing all updated destinations and suggested plan about ecotourism. As a pilot study, the most popular ten ecotourism destinations were collected from the secondary data observation. The study is applied the advantages of TSP technique to the tourism context in order to create the optimal travel plans under the different time constrains. Then web-based programming show the created trip plan and travel itinerary available for all tourists to download.
- Neuhofer, B., Buhalis, D., & Ladkin, A. (2014). A typology of technology-enhanced tourism experiences. International Journal of Tourism Research, 16(4), 340--350.Google Scholar
Cross Ref
- Wang, D., Park, S., & Fesenmaier, D. R. (2012). The role of smartphones in mediating the touristic experience. Journal of Travel Research, 51(4), 371--387.Google ScholarCross Ref
- Law, R., Leung, R., & Buhalis, D. (2009). Information technology applications in hospitality and tourism: a review of publications from 2005 to 2007. Journal of travel & tourism marketing, 26(5--6), 599--623.Google ScholarCross Ref
- Buhalis, D., & O'Connor, P. (2005). Information communication technology revolutionizing tourism. Tourism Recreation Research, 30(3), 7--16.Google ScholarCross Ref
- Hoffman, A.J. and Wolfe, P. (1985). "History" in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys, eds., John Wiley, 1--16.Google Scholar
- Applegate, D., Bixby, R.E., Chvátal, V., and Cook, W. (2006). The Traveling Salesman Problem: A Computational Study, Princeton University Press, Princeton, USA. Google ScholarDigital Library
- Cook, W. (2011). In Pursuit of the Salesman: Mathematics at the Limits of Computation, Princeton University Press, Princeton, USA.Google Scholar
- da Silva, A. A., Morabito, R., & Pureza, V. (2018). Optimization approaches to support the planning and analysis of travel itineraries. Expert Systems with Applications.Google Scholar
- Fatthi, W. N. A. W. A., Haris, M. H. M., & Kahtan, H. (2018). Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus. In International Conference on Intelligent Computing & Optimization. Springer, Cham, 277--284.Google Scholar
- Hashim, Z., & Ismail, W. R. (2017). Self-Drive Tourism Route in Terengganu: An Application of Goal Programming Model. Sains Humanika, 9(1--5).Google Scholar
- Barrena, E., Laporte, G., Ortega, F. A., & Pozo, M. A. (2016). Planning ecotourism routes in nature parks. In Trends in Differential Equations and Applications. Springer, Cham. 189--202.Google ScholarCross Ref
- TIES Press Release. (2015). "TIES Announces Ecotourism Principles Revision", available at: http://www.ecotourism.org/what-is-ecotourism/ (accessed 30 April 2019).Google Scholar
Index Terms
- Smart Ecotourism Planning in Chiang Mai using Traveling Salesman Problem
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 ...
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
The traveling salesman problem (TSP) belongs to the most basic, most important, and most investigated problems in combinatorial optimization. Although it is an ${\cal NP}$-hard problem, many of its special cases can be solved efficiently in polynomial ...
Smart Travel Itinerary Planning Application using Held-Karp Algorithm and Balanced Clustering Approach
EBIMCS '19: Proceedings of the 2019 2nd International Conference on E-Business, Information Management and Computer ScienceIn 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 ...
Comments