Application of Traveling Salesman Problem (TSP) Model for Solution Acceleration of Package Distribution Services with Dijkstra's Algorithm
Package distribution services are the main business in supporting today's massive online business. Traveling Salesman Problem (TSP) can be used to calculate the distance of the closest route of the courier to the intended customer. TSP can be stated as a problem in finding the minimum distance of a customer's address to a number of n addresses where the addresses are only visited once by the courier. The TSP model is supported using the dijikstra's algorithm to produce a computerized system that can optimize the performance of packet distribution by couriers to consumers to increase profits in time and economy.