PENENTUAN RUTE WISATA OPTIMAL DI PROVINSI SUMATERA BARAT PADA AGEN WISATA MINANGKABAU TOUR MENGGUNAKAN METODE TRAVELLING SALLESMAN PROBLEM

Abstract

The many tourist attractions in West Sumatra have the potential to benefit tourism actors in West Sumatra, especially in the packages or tourist routes owned by the Minangkabau Tour travel agent. However, in fact, not many tourists use the tour packages offered by travel agents due to several things, one of which is the less than optimal time and costs that will be incurred by tourists. Optimization of tourist routes is expected to be one solution so that tourists can return to using the tour packages offered by travel agents.

Optimization is carried out by changing the tourist attraction data into a matrix form, then providing labels for each point. Determining the distance from the starting point to the tourist attraction and the distance from the tourist attraction to other tourist attractions. After that, form a tourist route using the Nearest Neighbor Algorithm.

So there are four optimal tourist routes according to the Nearest Neighbor Algorithm, namely the tourist routes from each tourist group studied, namely S → C → D → A →B →S (group 1) with a distance of 333.7 km. S → I → H → G → F → E → S (group 2) with a distance of 628 km. S → L → J → M → K → S (group 3) with a distance of 455 km. S → O → P → N → T → Q → R → U → S (group 4) with a distance of 450.2 km.