The article is about solving a A-to-B routing problem, for which you would use something like a Dijkstra algorithm, which is not a heuristic (in its standard se

The article is about solving a A-to-B routing problem, for which you would use something like a Dijkstra algorithm, which is not a heuristic (in its standard settings) and has nothing to do with solving a TSP.