[1] It's actually easier to analyze the version of the problem which asks you to find any solution of length less than some constant L.
You seem to be confused over the difference between "solution", in the sense of the answer to a well-defined mathematical problem, and "solution", in the sense of "what do I say to my boss?"
https://en.wikipedia.org/wiki/Travelling_salesman_problem#He...
I'm not confused. For the ACO, Genetic algorithms,... approaches you still need to show that the tour that was found has the lowest possible length... which you cannot without iterating all tours (or doing a branch and bound, which is the same but you prune bad partial tours early).
Obviously, people typically work with well known problems where the best tour is already known. They then typically determine the quality of their 'solution' as the relative difference to the best tour in some metric.
This is a strange thing to say, given the definition provided in the link you cite:
> The travelling salesman problem (also called the travelling salesperson problem or TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?"
An optimal solution S has len(S) = min {len(P) | P in Perm(cities)}