GREEDY METHOD FOR SOLVING THE LANGKAWI TOURIST ROUTE: A CASE STUDY

Authors

  • Zakiah Hashim School of Quantitative Sciences, College of Arts and Sciences, Universiti Utara Malaysia, 06010 Sintok, Kedah, Malaysia
  • Wan Laailatul Hanim Mat Desa School of Quantitative Sciences, College of Arts and Sciences, Universiti Utara Malaysia, 06010 Sintok, Kedah, Malaysia
  • Hurul Ain Aziz School of Quantitative Sciences, College of Arts and Sciences, Universiti Utara Malaysia, 06010 Sintok, Kedah, Malaysia
  • Nur Mariana Zaimah BIN Mohd Zaki School of Quantitative Sciences, College of Arts and Sciences, Universiti Utara Malaysia, 06010 Sintok, Kedah, Malaysia

DOI:

https://doi.org/10.32890/jtom2018.13.1.3

Keywords:

Greedy method, optimal route, shortest route, travelling cost, MATLAB

Abstract

This paper presents a real case study to determine the optimal tourist route at Langkawi Island. The Langkawi Island was selected as the case study because normally, tourist travel to this island will drive the rented car as the primary mode of transport. Thus, the aim of this paper is to develop a mathematical model to find an optimal route for tourist to travel to their interesting places around Langkawi Island. In order to solve the problem, Greedy method was applied in this study and MATLAB version 7.8 has been used to get the solution. The result obtained shows that Nearest Greedy Insertion method gives better result compared to the Nearest Greedy method. The minimum value of the route selection gives effect to the cost of travelling. Therefore, from this study, the best route that connect from one interesting place to others place can be suggested to the tourist as guidance. In addition, tourist can save their time and money to visit all interesting places in this study.

Metrics

Metrics Loading ...

References

Arora, K., Agarwal, S., & Tanwar, R. (2016). Solving TSP using genetic algorithm and nearest neighbor algorithm and their comparison. International Journal of Scientific & Engineering Research, 7(1), 1014-1018.

Bolzoni, P., & Helmer, S. (2014). Efficient itinerary planning with category constraints, Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 203–212.

Bruce, P. (2000). The role of the transport system in destination development, Tourism Management, 21, 53 – 63.

Burkart, A. J., & Medlik, S. (1981). Tourism: Past,Present and Future, 2nd Edition. London: William Heinemann Ltd.

Carson, D., Waller, I., & Scott, N. (2002). Drive Tourism: Up the Wall and Around the Bend. Melbourne: Common Ground Publishing Pty Ltd.

Dziauddin, M. F., 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, Jurnal Teknologi (Sciences & Engineering), 61(1), 35–47.

Gopika, N. A. (2014). Optimal route queries with mousquito swarm algorithm in the road networks, International Journal of Research in Computer Applications and Robotics, 2(3), 119–123.

Hahsler, M., & Hornik, K. (2007). TSP – Infrastructure for the traveling salesperson problem, Journal of Statistical Software, 23(2),1-21.

Laporte, G. (1992). The traveling salesman problem : an overview of exact and approximate algorithms, Europian Journal of Operational Research, 59(2), 231–247.

Matai, R., Singh, S. P., & Mittal, M. L. (2010). Traveling Salesman Problem : An Overview of Applications , Formulations , and Solution Approaches, InTech.

Mohammad, A. K., & Khidhir, G. I. (2016). A study of the efficiency of sequencing within plants, Journal of Pure and Applied Sciences, 28(3), 86–96.

Neto, J. C., Almeida C. A. D., Roveroto, G., & Tavares J. D. H. (2012). Applications of operational research techniques in optimization to visit tourist points of Viña del Mar, Informatica Economicã, 16(2), 5-13.

Sahalot, A., & Shrimali, S. (2014). A comparative study of brute force method, nearest neighbour and greedy algorithms to solve the travelling salesman problem, International Journal of Research in Engineering & Technology, 2(6), 59–72.

Taiwo, O. S., Josiah, O., Taiwo, A., Dkhrullahi, S., & Sade, O. K. (2013). Implementation of heuristics for solving travelling salesman problem using nearest neighbor and nearest insertion approaches. International Journal of Advance Research, 1(3), 139-155

Taplin, J. H. E., & McGinley, C. (2000). A linear program to model daily car touring choices. Annals of Tourism Research, 27(2), 451-467.

Wen, L. Y. (2004). A comparison of two optimal approches for the amcop problem, Journal of Network and Computer Applications, 27, 151-162.

Downloads

Published

27-06-2018

How to Cite

Hashim, Z., Mat Desa, W. L. H., Aziz, H. A., & Mohd Zaki, N. M. Z. B. (2018). GREEDY METHOD FOR SOLVING THE LANGKAWI TOURIST ROUTE: A CASE STUDY. Journal of Technology and Operations Management, 13(1), 21–29. https://doi.org/10.32890/jtom2018.13.1.3

Issue

Vol. 13 No. 1 (2018): Journal of Technology and Operations Management (JTOM)

Section

Articles

License

Disclaimer

The Journal of Technology and Operation Management (JTOM) has taken all reasonable measures to ensure that material contained in this website is the original work of the author(s). However, the Journal gives no warranty and accepts no responsibility for the accuracy or the completeness of the material; no reliance should be made by any user on the material. The user should check with the authors for confirmation. Articles published in the Journal of Technology and Operation Management (JTOM) do not represent the views held by the editors and members of the editorial board. Authors are responsible for all aspects of their articles except the editorial screen design.