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 ...

The consistent traveling salesman problem aims to identify minimum-cost routes to be followed by a single vehicle so as to provide a set of customers with service that adheres to arrival-time ...