Solving the shortest path problem by saving mileage method

You just need to remember that the straight line between two points is the shortest.

Mileage saving method is the most famous heuristic algorithm to solve the problem of uncertain number of transport vehicles.

1, and the mileage saving optimization process is divided into parallel mode and serial mode. Its core idea is to combine two cycles in the transportation problem into one cycle in turn, and reduce the combined total transportation distance to the maximum every time until the loading limit of one car is reached, and then optimize the next car.

2. The shortest path of mileage saving method is the shortest straight line between two points. Shortest path is a typical shortest path routing algorithm, which is used to calculate the shortest path from one node to all other nodes. The main feature is to expand outward from the starting point until the end.

3. Path optimization problems also include mileage saving method, genetic algorithm and neural network. Among them, the genetic algorithm is relatively simple, because the genetic algorithm can not directly deal with the parameters of the problem space, so the problem to be solved must be expressed as chromosomes or individuals in the genetic space through coding. This conversion operation is called encoding.