PENENTUAN JALUR PENGIRIMAN PESANAN MENGGUNAKAN METODE TRAVELLING SALESMAN PROBLEM (TSP) DENGAN ALGORITMA HEURISTIK DI KPRI SEHAT RS MARGONO SOEKARJO PURWOKERTO

Abstract

In everyday life, there are many problems that can be solved and brought into the form of a diagram consisting of points and lines, for example looking for a salesman route (Traveling salesman problem (TSP)). This problem is classified as having very many possible answers. The Heuristic Algorithm is an algorithm that produces the best solution to problems that are part or intersect with a more complex problem where delivery of orders from producers to consumers is maximized. This algorithm looks for the minimum spanning tree of all vertices. Then, forming a circuit that has been passed more than once, so that it is expected to provide optimal solutions in solving the problem of order delivery. With this method, we can find the fastest distance to deliver orders to consumers. This not only makes it easier to find the best route that can speed up delivery of orders to consumers, but also can keep food good because it reaches consumers faster at Rs Margono Soekarjo Purwokerto.