Suppose the seller needed to return home on the weekend. and suppose that the time spent in each city was not constant. Does anyone know of any specific work undertaken to solve this problem?
I mean that each city will have a cost attached to it, which indicates how long it should remain in this city (only 1 hour and up to four days), each city, of course, takes place, so the distance from each point and to each point can be calculated. the seller will make several trips to visit all cities. each trip lasts 5 days (starts on Monday and ends on Friday). Thus, the goal is to plan trips so that he can visit all cities once (with the exception of the hometown, which he will return at the end of each week) as soon as possible.
source
share