English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

This study presents a goal programming approach to determine the best self-drive tourism route in Terengganu. The goal programming was formulated based on the model of Traveling Salesman Problem (TSP). This study involved seven cities in Terengganu which can be connected by road network. The data of the tourist attractions for each city was used in this study. The model of self-drive tourism route was constructed so as to connect all these seven cities by minimizing the travel distance, minimizing accommodation costs and maximizing the total number of tourist attractions. To achieve the objectives of this study, we develop the goal programming model that considers three model structures with each of them consists three goal constraints which are subjected to four hard constraints. This model has been solved using LINGO12.0 software. The results obtained from each model structures will be compared in order to get the most optimum route for self-drive tourism. The result showed that the first model structure was suitable to be used because this model structure gave the optimum result compared to other model structures. It produced the minimum total traveling cost of RM967.70 compared to the model structure two of RM977.10 and model structure three of RM1233.10.

Self-Drive Tourism Route in Terengganu: An Application of Goal Programming Model