One-point to multi-point path programming method and transport distribution system

Abstract

The invention relates to a one-point to multi-point path programming method. The method comprises the following steps: S1) obtaining the position information of a start point and multiple target points, wherein the position information of the start point and the multiple target points are in a path programming area; S2) taking the start point as a center, segmenting the path programming area to several sub-path programming areas; and S3) in the sub-path programming areas, taking the start point as an original point to search a first target point having a nearest distance with the position of the start point, determining the path information from the start point to the first target point, then searching a second target point having the nearest distance with the position of the first targetpoint, determining the path information from the first target point to the second target point, and searching other target points in order according to a nearest distance principle until the path programming of all the target points are completed. The large-scale conveying path area is decomposed to small-scale conveying path areas, a whole conveying system is comprehensively optimized, and the transport power can be better used.

Description

technical field [0001] The invention relates to the field of logistics distribution, in particular to a method for path planning between one point and multiple points and a transportation and distribution system. Background technique [0002] Modern logistics not only simply considers the distribution of goods from producers to consumers, but also considers the procurement of raw materials from suppliers to producers, as well as the transportation, storage and information of producers themselves in the process of product manufacturing. Comprehensively and comprehensively improve economic benefits and efficiency. Therefore, modern logistics is a strategic measure aimed at satisfying the needs of consumers and unifying market conditions such as manufacturing, transportation, and sales. [0003] However, although the existing map navigation such as Gaode Map, Baidu Map, Tencent Map, etc., all provide developers with API interfaces for map navigation, even the Baidu Map API int...

AI Technical Summary

Problems solved by technology

[0003] However, although the existing map navigation such as Gaode Map, Baidu Map, Tencent Map, etc., all provide developers with API interfaces for map navigation, even the Baidu Map API interface with the most open ability can only meet the requirements at best. Route navigation with 5 starting and ending points cannot provide good route planning and navigation support for the distribution of most chain enterprises

[0004] For example, for a city, there are many stores, and these stores need to stock breakfast at a fixed time in the morning, and the supply and distribution of breakfast should be fast and efficient; but due to the large number of stores, they are scattered and uneven, Often results in poor delivery efficiency

Images