This study presents an application of nonpreemptive goal programming to find the best route to visit tourist sites in West Sumatera. The goal programming model is constructed based on traveling salesman problem. This study involves seven cities which can be connected by road network in West Sumatera. In this study, two cases are considered with the assumption that the tourists start to self-drive from different city. The results show that the goal programming based on traveling salesman problem model gives a route with minimum distance, time, and traveling cost compared to the traditional route.
Published in | International Journal of Management and Fuzzy Systems (Volume 5, Issue 1) |
DOI | 10.11648/j.ijmfs.20190501.12 |
Page(s) | 9-13 |
Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
Copyright |
Copyright © The Author(s), 2019. Published by Science Publishing Group |
Nonpreemptive Goal Programming, Minimum Distance, Self-Drive, Traveling Salesman Problem, West Sumatera
[1] | Charnes, W. Cooper, and R. Ferguson, Optimal estimation of executive compensation by linear programming, Management Science, 1 (1955), 138 ˗ 151. |
[2] | J. P. Ignizio, Goal Programming and Extensions, Lexington Books, Lexington, (1976). |
[3] | G. Gutin and A. P. Punnen, The Traveling Salesman Problem and Its Variations, Kluwer Academic Publishers, New York, (2004). |
[4] | N. Hassan and B. A. Halim, Mathematical modelling approach to the management of recreational tourism activities at Wetland Putrajaya, Sains Malaysiana, 41 (2012), 1155 - 1161. |
[5] | F. Jolai and M. Aghdaghi, A goal programming model for single vehicle routing problem with multiple routes, Journal of Industrial and Systems Engineering, 2 (2008), 154 - 163. |
[6] | G. Lau and B. McKercher, Understanding tourist movement patterns in a destination: A GIS approach, Tourism and Hospitality Research, 7 (2007), 39 - 49. |
[7] | A. Lew and B. McKercher, Modeling Tourist Movements: A Local Destination Analysis, Annals of Tourism Research, 33 (2006), 403-423. |
[8] | M. Olsen, Keeping Track of the Self Drive Market, Common Ground Publishing Pty Ltd, Melbourne, (2002). |
[9] | C. E. Miller, A. W. Tucker, and R. A. Zemlin, Integer programming formulations and traveling salesman problems, Journal of ACM, 7 (1960), 326-329. |
[10] | Ping Yin, Xinwei Jiang, and Yichao Ma, Research on Tourism Information Systems for Self-drive tourists, IEEE International Conference on Service Operations and Logistics, and Informatics, Beijing, (2008), 1915 - 1921. |
[11] | L. Schrage, Optimization Modeling with Lingo, 6th ed., Lindo System Inc., Chicago, (2006). |
[12] | R. L. Seely, H. J. Iglarsh and D. L. Edgell, Goal programming: Planning process of tourism organizations, Annals of Tourism Research, 7 (1980), 353-365. |
[13] | Z. Hashim and W. R. Ismail, Self-drive tourism route in Terengganu: An application of goal programming model, Sains Humanika, 9 (2017), 51-57. |
APA Style
Adhe Afriani, Habibis Saleh, Moh Danil Hendry Gamal. (2019). An Application of Goal Programming: The Best Route to Discover a Wonderful West Sumatera. International Journal of Management and Fuzzy Systems, 5(1), 9-13. https://doi.org/10.11648/j.ijmfs.20190501.12
ACS Style
Adhe Afriani; Habibis Saleh; Moh Danil Hendry Gamal. An Application of Goal Programming: The Best Route to Discover a Wonderful West Sumatera. Int. J. Manag. Fuzzy Syst. 2019, 5(1), 9-13. doi: 10.11648/j.ijmfs.20190501.12
AMA Style
Adhe Afriani, Habibis Saleh, Moh Danil Hendry Gamal. An Application of Goal Programming: The Best Route to Discover a Wonderful West Sumatera. Int J Manag Fuzzy Syst. 2019;5(1):9-13. doi: 10.11648/j.ijmfs.20190501.12
@article{10.11648/j.ijmfs.20190501.12, author = {Adhe Afriani and Habibis Saleh and Moh Danil Hendry Gamal}, title = {An Application of Goal Programming: The Best Route to Discover a Wonderful West Sumatera}, journal = {International Journal of Management and Fuzzy Systems}, volume = {5}, number = {1}, pages = {9-13}, doi = {10.11648/j.ijmfs.20190501.12}, url = {https://doi.org/10.11648/j.ijmfs.20190501.12}, eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ijmfs.20190501.12}, abstract = {This study presents an application of nonpreemptive goal programming to find the best route to visit tourist sites in West Sumatera. The goal programming model is constructed based on traveling salesman problem. This study involves seven cities which can be connected by road network in West Sumatera. In this study, two cases are considered with the assumption that the tourists start to self-drive from different city. The results show that the goal programming based on traveling salesman problem model gives a route with minimum distance, time, and traveling cost compared to the traditional route.}, year = {2019} }
TY - JOUR T1 - An Application of Goal Programming: The Best Route to Discover a Wonderful West Sumatera AU - Adhe Afriani AU - Habibis Saleh AU - Moh Danil Hendry Gamal Y1 - 2019/02/22 PY - 2019 N1 - https://doi.org/10.11648/j.ijmfs.20190501.12 DO - 10.11648/j.ijmfs.20190501.12 T2 - International Journal of Management and Fuzzy Systems JF - International Journal of Management and Fuzzy Systems JO - International Journal of Management and Fuzzy Systems SP - 9 EP - 13 PB - Science Publishing Group SN - 2575-4947 UR - https://doi.org/10.11648/j.ijmfs.20190501.12 AB - This study presents an application of nonpreemptive goal programming to find the best route to visit tourist sites in West Sumatera. The goal programming model is constructed based on traveling salesman problem. This study involves seven cities which can be connected by road network in West Sumatera. In this study, two cases are considered with the assumption that the tourists start to self-drive from different city. The results show that the goal programming based on traveling salesman problem model gives a route with minimum distance, time, and traveling cost compared to the traditional route. VL - 5 IS - 1 ER -