Hybrid Local Search Algorithm for Optimization Route of Travelling Salesman Problem

This study explores the Traveling Salesman Problem (TSP) in Medan City, North Sumatra, Indonesia, analyzing 100 geographical locations for the shortest route determination. Four heuristic algorithms-Nearest Neighbor (NN), Repetitive Nearest Neighbor (RNN), Hybrid NN, and Hybrid RNN-are investigated using RStudio software and benchmarked against various problem instances and TSPLIB data. The results reveal that algorithm performance is contingent on problem size and complexity, with hybrid methods showing promise in producing superior solutions. Statistical analysis confirms the significance of the differences between non-hybrid and hybrid methods, emphasizing the potential for hybridization to enhance solution quality. This research advances our understanding of heuristic algorithm performance in TSP problem-solving and underscores the transformative potential of hybridization strategies in optimization.

Automated summary

This study analyzes the Traveling Salesman Problem in Medan City, Indonesia, using four heuristic algorithms and finds that hybrid methods show promise in generating superior solutions.