For the classic Traveling Salesman Problem $($TSP$)$ a salesman is given a list of cities and only the distances between each pair of cities. The goal is to find the shortest possible route that visits each city exactly once and returns to the original city.

Which one of these describe the objective function the best $($you can choose more than if needed.

Question $3$ options:

Minimize number of visits $($Cities$).$

Maximize "edge" covered.

the smallest value of distance travelled.

Avoid any revisit of cities.

This definition is not for TSP but for Chinese Postman Problem $($CPP$)$

Minimize travel time.