Advertisement

Applications of Travelling Salesman Problem in Optimizing Tourist Destinations Visit in Langkawi

  • Zakiah HashimEmail author
  • Wan Rosmanira Ismail
Conference paper

Abstract

This paper discusses about finding the best possible route for self-drive tourism in Langkawi which focused on land transportation and road network. The problem of finding the best tourism route was formulated based on the travelling salesman problem (TSP) model. This work was developed in order to determine the best route that includes all the 19 most attractive tourist destinations in Langkawi. This is because in this way, the time spent in travelling and the total travelling cost of the tourist can be minimized. It will also optimize the leisure moments as well as taking to know all the tourist destinations. The Langkawi tourism data were used to obtain the self-drive tourism route in Langkawi. This model has been solved by using LINGO12.0 software. Results from the study found that tourist need to spend 4 days to visit all 19 tourist destinations in Langkawi with the total travelling cost of RM 856.55.

Keywords

Self-drive tourism Tourism route Travelling salesman problem (TSP) 

Notes

Acknowledgments

The authors would like to thank to Department of Tourism Malaysia for providing the tourist destination data in Langkawi Island for this study. Special thanks also to Universiti Utara Malaysia, Universiti Kebangsaan Malaysia, and Ministry of Higher Education, Malaysia for their sponsorship.

References

  1. Alkallak IN, Sha’ban RZ (2008) Tabu search method for solving traveling salesman problem. Al-Rafiden J Comput Sci Math 5(2):141–153Google Scholar
  2. Balas E, Christofides N (1981) A restricted lagrangean approach to the traveling salesman problem. Math Program 21:19–46CrossRefGoogle Scholar
  3. Bruce P (2000) The role of the transport system in destination development. Tour Manag 21:53–63CrossRefGoogle Scholar
  4. Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am 2(4):393–410Google Scholar
  5. Dean C, Iain W, Noel S (2002) Drive tourism: up the wall and around the bend. Common Ground Publishing Pty Ltd, AustraliaGoogle Scholar
  6. Diaby M (2007) The traveling salesman problem: a linear programming formulation. WSEAS Trans Math 6(6):745–753Google Scholar
  7. Dziauddin MF, Alvanides S, Powe N (2013) Estimating the effects of light rail transit (LRT) system on the property values in the Klang Valley, Malaysia: a hedonic house price approach. J Teknologi (Sci Eng) 61(1):35–47Google Scholar
  8. Földesi P, Botzheim J (2008) Solution for modified traveling salesman problem with variable cost matrix using bacterial evalutionary algorithm. Acta Tecnica Jaurinensis Series Logistica 1(2):159–171Google Scholar
  9. Jain L, Bahnot A (2012) Traveling salesman problem: a case study. Int J Comput Technol 3(1):167–169Google Scholar
  10. Kedar SN, Tuzun D (1995) Initializing the hopfield-tank network for the tsp using a convex hull: a computational study. In: Proceedings of the artificial neural networks in engineering (ANNIE’95) conference, pp 399–404Google Scholar
  11. Lawler EL, Lenstra JK, Rinnooy AHGK, Shmoys DB (1985) The traveling salesman problem. A Wiley-Interscience PublicationGoogle Scholar
  12. Ministry of Tourism website. http://www.tourism.gov.my/destinations. Accessed 30 January 2012
  13. Neto JC, Almeida CAD, Roveroto G, Tavares JDH (2012) Applications of operational research techniques in optimization to visit tourist points of Viña del Mar. Informatica Economicã 16(2):5–13Google Scholar
  14. Olsen M (2002) Keeping track of the self drive market. In: Dean C, Iain W, Noel S (eds) Drive tourism: up the wall and around the bend, pp 10–24. Common Ground Publishing Pty Ltd, AustraliaGoogle Scholar
  15. Sadiq S (2012) The traveling salesman problem: optimizing delivery routes using genetic algorithms. SAS Global Forum, Chicago, IL, USA, pp 1–6Google Scholar
  16. Schrage L (2006) Optimization modelling with lingo, 6th edn. Lindo System Inc, USAGoogle Scholar
  17. Taplin JHE, McGinley C (2000) A linear program to model daily car touring choices. Ann Tourism Res 27(2):451–467CrossRefGoogle Scholar
  18. Winston WL (2004) Operations research: application and algorithm, 4th edn. Brooks/Cole-Thomson Learning, CanadaGoogle Scholar

Copyright information

© Springer Science+Business Media Singapore 2016

Authors and Affiliations

  1. 1.School of Quantitative Sciences, College of Art and SciencesUniversiti Utara MalaysiaSintokMalaysia
  2. 2.School of Mathematical Sciences, Faculty of Science and TechnologyUniversiti Kebangsaan MalaysiaBangiMalaysia

Personalised recommendations