The Travel Problem (TSP Problem) finds a cycle that goes through all classes, each class once, and returns to the starting point such that the Total Cost of the process is minimum.