Method for uniformly navigating delivery paths for a plurality of deliverers

Abstract

The invention discloses a method for unified navigation of delivery paths for multiple couriers, belongs to the field of path navigation, and aims to solve the multi-point and multi-target navigationproblem of logistics delivery. According to the method, a delivery path is as short as possible and approximately equivalent; the uniformity index is optimized through a mean rebound strategy and an in-out stack type feasible solution recombination strategy; particularly, a stack-in-out type feasible solution recombination strategy is adopted; the longest sub-path and the shortest sub-path are artificially neutralized and recombined; on the other hand, the combination of the mean value rebound strategy and the in-out stack type feasible solution recombination strategy makes up for the appearance of a long sub-path possibly caused by the mean value rebound strategy, so that the overall search has better performance in path length and uniformity. In addition, the uniformity index is furtheroptimized in the aspects of feasible solution assessment and pheromone updating. By adopting the method, the distribution paths of multiple couriers can be navigated in a unified manner, so that the labor cost is effectively reduced, and the distribution time is shortened.

Description

technical field [0001] The invention relates to the field of route navigation, in particular to a method for uniformly navigating delivery routes of multiple couriers. Background technique [0002] Driven by online shopping, the express service industry has developed rapidly. In the express logistics process, the most urgent problem to be solved is the last mile of express delivery, that is, how to rationally allocate all logistics resources under the regional distribution points. Logistics personnel, so that all packages can reach users as quickly and efficiently as possible. Only by solving the last mile problem reasonably and effectively can we meet the actual needs of making full use of human resources, improving logistics efficiency, and improving user experience. [0003] Solving the logistics distribution problem is actually a practical application of the classic multi-traveling salesman problem, which is specifically reflected in the fact that multiple couriers must...

AI Technical Summary

Problems solved by technology

[0004] However, there is a problem in the existing research on the multi-traveling salesman problem: due to the regional distribution of logistics distribution points, when the optimization goal only focuses on the total length of the path, the delivery path length of a certain courier will be much longer than that of other couriers. This will directly lead to confusion in the deployment of couriers, which will not only waste labor costs, but also reduce logistics efficiency.

Images