Line Traveler (TSP), Snow Blower

Question

In a typical TSP algorithm, we have several points and we want to travel in the optimal travel order. Points that are households, customers, etc., Mostly a point on the map.

Instead of dots, I have lines for optimization. A snow blower is a good example where you can travel across several streets. And the biggest difference is that for each trip, the point you end up is different from your starting point. My attempt was to consider the starting point as the only node in each journey. But, apparently, whenever your route / line is quite long, you find yourself at a distant point from the very beginning. And the solution is nowhere near optimal.

I looked at some companies that provide route optimization. Their solution is to break the lines into close points; and consider each line as nodes close to each other. I think this will not work when you have to drive on both sides of the street or when you are approaching another street.

I wonder if there is a simulation trick or any other way to solve this problem?

Answer 1

In fact, you presented four completely different problems in your question, consisting of two main tasks with two subtasks each.

Task 1: One-Way Street Walk

, , . .

1:

, . , TSP . , , .

Challenge 1B:

Challenge 1A, , , , , . , TSP.

2:

, , , , , . .

2A:

/ . , , . , . , , . , , . , TSP . , .

2B: jaywalking

. , , , . , . , , jaywalking . , , , jaywalking. , TSP , . TSP . . TSP .

Answer 2

, TSP - . - , . TSP - , .

, . , , , .