Is there an algorithm for near optimal partition of the Travelling salesman problem, creating routes that need the same time to complete?

Question

I have a problem to solve. I need to visit 7962 places with a vehicle. The vehicle travels with 10km/h and each time I visit one place I stay there for 1 minute. I want to divid