The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...