The traveling salesman problem. How to optimize the route for picking up cargo from checkpoints?

Question

Algorithms

Hello, task description:
There are control points (more than 200-300, then they will only increase). At each of the points there is a load of a certain weight (always approximate).
Every day there are 2-3 cars available.
It is necessary to distribute the vehicles in such a way that, with minimal costs (time), to pick up all the cargo from these points and ship it to the point of export. Moreover, one car picks up cargo from approximately 30-50 points, that is, the route will be built with multiple visits to the shipment point. There are also checkpoints that are served by only one of the three machines.
Before starting to build routes, the distance between the points and the priority of the export are known.
Question:
How to distribute these points between cars in such a way as to speed up the export process?
After these points are distributed, the coordinates will be fed to Yandex.maps and optimal routes will be built (if there are other free solutions for building the optimal route, I will be glad to get acquainted with them).
Initially, I see the task as a traveling salesman problem (there is a cost of a point and a cost of the distance between them). But since I'm not very familiar with solving problems of this nature, I ask you to help.

Answer 1

Chapter 14 of Laforet's book "Data Structures and Java Algorithms" is devoted to this issue - I recommend that you read it.

Answer 2

Theoretical routes on Yandex can completely break into reality. For a complex circuit, GPS trackers on these machines and heuristic data wherever they are are desirable.
The weight of the load is not the only critical parameter, by the way. Dimensions and oversized cargo, which occupies half a car, easily turn a theoretical calculation into a pumpkin.
If there is already an aunt who has figured out this kitchen, it would be better to dance from her. First, make her a user-friendly interface instead of Yoksel, then think about what the computer can tell her. If he can prompt so that the aunt is not needed - great. If not, it will still be useful.

Answer 3

https://math.semester.ru/simplex/simplex-standart.php

Answer 4

Osrm is completely free, Google has a conditional paid one (very cheap), there are still a lot of analogues with different prices. They all basically consider the route purely, that is, you yourself will have to deal with the distribution of cargo. Doing the construction of a route on real roads yourself, as people advise here, is an aerial, because for example, the only free database from where you can get data is osm and it weighs half a gigabyte in my opinion for the whole world, there are true assemblies for regions, but they need sickly ones server resources and a lot of time to deal with their format. For osrm, by the way, preparing data is another matter, you can stupidly take it from my repo in the Russian Federation: https://gitlab.com/grinat/osrm-prepared-russia-data because if you use the osrm server, then it regularly lies.
And if these 200-300 points are displayed on a Yandex map, this is a very bad decision, Yandex with clusters does not export such a number on a weak PC, and if it is displayed cleanly, then it may not output to PC standards, take mapbox, or leaflet. Yandex maps and all their GIS services are complete bottom, and at exorbitant prices.