APLIKASI ALGORITMA SEMUT DAN ALGORITMA CHEAPEST INSERTION HEURISTIC PADA TRAVELLING SALESMAN PROBLEM (TSP)

Abstract

Travelling Salesman Problem (TSP) is travels problem a salesman must visit n vertex with each vertex has visited once only and back (return) to the initial vertex, such that the total travel distance is minimized. TSP can be solved by using the some methods, one of them is the CIH algorithm and ant algorithm. This study aims to find solutions of the TSP using CIH, creating programs to solve those problems and compare the result of CIH algorithm and ant algorithm of TSP solution. The result is travelling route, so that the total travel distance is minimized. These results can be obtained from the program that was created with Delphi 7.0 for solving TSP with CIH algorithm and ant algorithm. This program can be used for different data in TSP problem. Input of this program include a flow matrix, distance matrix, a lot of vertexs, α parameter, β parameter, dan parameter. Output of this program include optimum route, length of optimum route and sketch of optimum route.