Commercial Vehicle Route Planning Design Based on Partition Coding Genetic Algorithm

The problem of vehicle path planning has been deeply studied in the fields of logistics and transportation for its broad application prospects. The correct planning of commercial vehicle routes will help reduce delivery time and logistics costs. Based on the example of commercial transport vehicles delivering goods, this paper establishes the Manhattan distance matrix between stations and obtains the overall optimization model. The genetic algorithm is the basic method for solving the vehicle routing model, which is used to calculate the integer-coded path sequence. Introduce roulette wheel selection, establish an adaptive algorithm to simplify the calculation process, and get the optimal transportation plan. The partition coding algorithm is used to solve the multiple traveling salesman problem, using the constraint function of the penalty factor to minimize the transportation cost, which has some reference value for the logistics transportation decision of the transportation company to reduce the cost.