An Application of Goal Programming: The Best Route to Discover a Wonderful West Sumatera

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.