CD Tesis
Aplikasi Pemograman Gol Untuk Rute Wisata Berkendara Sendiri
This thesis discusses an application of non-preemptive goal programming
based on the model of traveling salesman problem. This study involves seven
cities which can be connected by road network in West Sumatera. In this study,
we consider two cases with the assumption that the tourist started to self-drive
from dierent city. The results show that the goal programming gives a route
with minimum distance, time and traveling cost compared to the traditional
route.
Keywords: Goal programming, non-preemptive, self-drive, traveling salesman
problem
Tidak tersedia versi lain