Travelling Salesman Problem Assisted WITH TABU SEARCH ALGORITHM
Daftar Isi:
- In this modern era, the TSP problem is often used as an ingredient to solve the problem. Find I he shortest distance from the distance between two cities is needed in these days given the importance of time efficiency and cost of transportation in the modern era. This application aims to find the shortest distance from the past some of the city taken. This application is created by saving the city in the distance and in a matrix and then processed into the tabu search algorithm