On the Implementation of a Transverse Wave-Based Routing Technique for a TSP Circular Instance

This study introduces the Transverse Waves Algorithm (TWA), a novel heuristic approach devised to address the Travelling Salesperson Problem (TSP) within a unique instance. Inspired by natural phenomena where energy disperses in waves from a central point and interacts with its environment, TWA is designed for areas structured in concentric circles and segmented into equal parts. The algorithm mimics wave behaviors, when disrupted by obstacles and reflected by surfaces, to optimize routing. It systematically calculates routes initiating from a central hub, extending along each circle's circumference, visiting each location once, and progressing through strategically chosen adjacent points to minimize the total traveled distance. Experimental results indicate that TWA significantly enhances route optimization, outperforming traditional methods in specific instances. The findings underscore TWA's potential contributions to the field of logistics and operational research.