Investigation of Simulated Annealing and Ant Colony Optimization to Solve Delivery Routing Problem in Surabaya, Indonesia

This research emphasizes the importance of efficient goods delivery services because it is essential in maintaining the sustainable supply chain's continuity and applying optimization techniques, specifically the Traveling Salesman Problem (TSP), in determining optimal transportation routes. It compares the effectiveness of the Simulated Annealing (SA) and Ant Colony Optimization (ACO) in finding the shortest routes to minimize operational costs. This study compares the performance of the SA and ACO algorithms. It shows that both provide improved routes compared to the existing routes, with the SA achieving shorter distances, 17.4% smaller than the existing route.