IMPLEMENTASI TRAVELLING SALESMAN PROBLEM (TSP) DENGAN ALGORITMA GENETIKA DAN SIMULATED ANNEALING PADA PENDISTRIBUSIAN PUPUK PT. AUSTINDO NUSANTARA JAYA Tbk
Daftar Isi:
- Traveling Salesman Problem (TSP) is one of the problems of optimization of circuit Hamiltonian, which will look for the shortest route that must pass a salesman to a number of cities exactly once and return to town early. Genetic Algorithm (GA) and Simulated Annealing (SA) are the methods that can be used in the search of TSP. In the distribution of fertilizers, PT. Sahabat Mewah Makmur (SMM) from Tanjung Pandan to the warehouse in Jangkang, Balok, Ladang Jaya, Sari Bunga, and Aik Ruak. Completion of TSP with GA and SA aims to obtain the shortest route. The results show by GA, for 120 routes, there are 8 routes with a distance of 175 km, while the route include the Port of Tanjung Pandan - Jangkang - Balok - Aik Ruak - Sari Bunga - Ladang Jaya - Port of Tanjung Pandan; Tanjung Pandan - Jangkang - Balok - Aik Ruak - Ladang Jaya - Sari Bunga - Tanjung Pandan; Tanjung Pandan - Jangkang - Ladang Jaya - Sari Bunga - Aik Ruak - Balok - Port of Tanjung Pandan; Tanjung Pandan - Jangkang - Sari Bunga - Ladang Jaya - Aik Ruak - Balok - Port of Tanjung Pandan; Tanjung Pandan - Balok - Aik Ruak - Ladang Jaya - Sari Bunga - Jangkang - Port of Tanjung Pandan; Tanjung Pandan - Balok – Aik Ruak - Sari Bunga - Ladang Jaya - Jangkang - Port of Tanjung Pandan; Tanjung Pandan - Ladang Jaya - Sari Bunga - Aik Ruak - Balok - Jangkang - Port of Tanjung Pandan; Tanjung Pandan - Sari Bunga - Ladang Jaya - Aik Ruak - Balok - Jangkang - Port of Tanjung Pandan; By implementing SA, the optimal route is from the Port of Tanjung Pandan - Jangkang - Balok - Aik Ruak - Sari Bunga - Ladang Jaya - Port of Tanjung Pandan with the distance of 175 km. Based on the results TSP of fertilizer case can be implemented at the GA and SA.