Cars can have the start point from everywhere in Region A, it is not set up in which point should a car start. That is up to the formula to decide what is the best point where to start. The last points that cars reach in the Czech Republic are areas with postal codes 3 and 4 as it is shown in a map. The best means to find the shortest way between all stops and do not go to the same point again with another car. To avoid redundant stops. There are three types of cars which are available for our company. We do not care about the position of cars within the regions. It means that we can start from everywhere because our capacity is spread within both regions everywhere. The points are marked as numbers (postal codes). The first points where trips continue in Germany are either 0 or 9. The last points where trips should finish are either 4 or 5. Does anyone have an idea how this problem could be solved? Thank you for any suggestions.

The shortest way, efficient loads (unloads), map

Cars can have the start point from everywhere in Region A, it is not set up in which point should a car start. That is up to the formula to decide what is the best point where to start.
The last points that cars reach in the Czech Republic are areas with postal codes 3 and 4 as it is shown in a map.
The best means to find the shortest way between all stops and do not go to the same point again with another car. To avoid redundant stops.
There are three types of cars which are available for our company. We do not care about the position of cars within the regions. It means that we can start from everywhere because our capacity is spread within both regions everywhere.
The points are marked as numbers (postal codes).
The first points where trips continue in Germany are either 0 or 9.
The last points where trips should finish are either 4 or 5.

Does anyone have an idea how this problem could be solved? Thank you for any suggestions.