tokens: Problem is closely related to the well - known traveling salesman problem ( TSP ) but with three distinctions : the set of waypoints to be visited is to be determined by the solution ; there is no need to return to the starting waypoint ; and the cost is defined as the total waiting time over each waypoint instead of the total travel distance .