CN111932182A

CN111932182A - Distribution path planning method and related device

Info

Publication number: CN111932182A
Application number: CN202010878397.XA
Authority: CN
Inventors: 杨清广; 杨耿; 李日璐; 李伟; 张紫君
Original assignee: Guangdong Youteyun Technology Co ltd
Current assignee: Guangdong Youteyun Technology Co ltd
Priority date: 2020-08-27
Filing date: 2020-08-27
Publication date: 2020-11-13

Abstract

The embodiment of the application discloses a distribution path planning method and a related device, which are used for improving the distribution efficiency of orders. The method in the embodiment of the application comprises the following steps: determining a main order in the list of the orders to be processed and a main order planning path set corresponding to the main order, judging whether an on-road order of the main order exists in the list of the orders to be processed, wherein the on-road order is an order which has a planning path falling into a planning path in the main order planning path set except the main order in the list of the orders to be processed, if the on-road order does not exist, the main order is regarded as a delivery order, and a lowest-cost planning path in the main order planning path set is selected as a delivery path of the delivery order; and if the on-road order exists, taking the main order and the on-road order as delivery orders, determining an on-road order planning path set of the on-road order existing in the main order planning path set, and selecting a lowest-cost planning path in the on-road order planning path set as a delivery path of the delivery orders.

Description

Distribution path planning method and related device

Technical Field

The embodiment of the application relates to the field of data processing, in particular to a distribution path planning method and a related device.

Background

With the gradual development of the internet society, various shopping platforms capable of carrying out online shopping appear on the internet, such as Jingdong, Taobao, Mei Tuo, hungry and the like. Due to the convenience of online shopping and the timeliness of goods distribution by a logistics system, people are gradually accustomed to the convenience brought by shopping through a shopping platform.

People can generate an order when shopping online through a shopping platform, and the shopping platform can send order information of the order to a corresponding merchant so that the merchant can prepare goods; the shopping platform also sends the order information to the rider who provides the delivery service, so that the rider goes to the place where the merchant is located to take the goods and deliver the goods to the designated place according to the order information. However, the orders of the current rider for the shopping platform can only be singly and individually received, and after the rider receives an order to be delivered, the rider often needs to self-screen and consider the on-road orders based on the order, so that more orders can be delivered in one delivery process.

In practical application, under the influence of factors such as the familiarity of a rider to a distribution area, network quality and the like, the rider often cannot well select a proper in-route order, so that a distribution path among a plurality of orders is possibly not in-route, the order is possibly overtime under the condition that the plurality of orders are not in-route, the order distribution efficiency is low, and the user experience is poor.

Disclosure of Invention

The embodiment of the application provides a distribution path planning method and a related device, which are used for improving the distribution efficiency of orders.

A first aspect of the present application provides a delivery path planning method, including:

determining a main order in an order list to be processed and a main order planning path set corresponding to the main order;

judging whether an on-road order of the main order exists in the to-be-processed order list, wherein the on-road order is an order of which a planning path, except the main order, in the to-be-processed order list falls into a planning path in the main order planning path set;

if the off-road order does not exist in the main order, the main order is regarded as a delivery order, and a lowest-cost planning path with the lowest delivery time cost in the main order planning path set is selected as a delivery path of the delivery order;

if the main order has the on-road order, taking the main order and the on-road order as delivery orders, determining that an on-road order planning path set of the on-road order exists in the main order planning path set, and selecting a lowest-cost planning path with the lowest delivery time cost in the on-road order planning path set as a delivery path of the delivery orders.

Optionally, before determining a main order in the to-be-processed order list and a main order planning path set corresponding to the main order, the method further includes:

receiving a plurality of orders in a preset time period to form a list of orders to be processed, wherein the order information of the orders comprises an order starting position and an order ending position;

performing path planning on the order starting position and the order ending position of the order to obtain a planned path corresponding to each order in the list of the orders to be processed;

calculating the distribution time corresponding to the planned path;

and screening out an order planning path set which meets the preset distribution timeliness of the orders when the orders are distributed from the planning paths.

Optionally, before receiving several orders within a preset time period, the method further includes:

determining a distribution service range of a distribution station on a map;

determining the positions of all nodes within the service range, the nodes comprising: merchants, shelves, distribution stations, and road intersections;

dividing the road in the distribution range by taking the nodes as dividing points to form a plurality of sub-paths;

and calculating the distribution time required by each sub-path.

Optionally, the calculating, according to the length of the path, a delivery time required for each of the sub-paths includes:

calculating the historical distribution time of each sub-path in the history, and averaging the historical distribution time to obtain distribution time;

or the like, or, alternatively,

counting the path length of each sub-path;

receiving a preset distribution speed;

and dividing the path length by the distribution speed, and calculating the distribution time of each sub-path.

Optionally, the determining a master order in the to-be-processed order list includes:

determining the order receiving distance from the order starting position of each order in the to-be-processed order list to the delivery station;

sequencing all the orders in the to-be-processed order list according to the order receiving distance;

and selecting the order ranked at the top in the list of the orders to be processed as a main order.

Optionally, the sorting all the orders in the to-be-processed order list according to the order taking distance includes:

and sequencing all the orders in the to-be-processed order list according to the order distance from small to large.

Optionally, the delivery speed is different types of delivery speeds, and the calculating the delivery time required for each of the sub paths includes:

calculating different types of historical distribution time of each sub-path in the history, and averaging the different types of historical distribution time to obtain different types of distribution time;

or the like, or, alternatively,

and dividing the path length by the different types of the distribution speeds, and calculating the distribution time of each sub-path corresponding to the different types of the distribution speeds.

Optionally, the performing path planning for the order starting position and the order ending position of the order to obtain a planned path corresponding to each order in the to-be-processed order list includes:

and traversing all connectable sub-paths within the service range by taking the order starting position of each order as a starting point and the order ending position as an ending point to form a plurality of planned paths of the orders.

Optionally, the calculating the delivery time corresponding to the planned path includes:

and counting the sum of the delivery time of all the sub-paths of each planned path to obtain the delivery time corresponding to each planned path of each order.

Optionally, the determining of the lowest-cost planned path with the lowest delivery time cost includes:

acquiring the distribution time corresponding to the planned path;

counting the number of orders corresponding to the planned path;

dividing the delivery time by the number of the orders, and calculating to obtain the delivery cost of the planned path;

and selecting the planning path with the lowest delivery cost to determine the planning path with the lowest delivery cost.

Optionally, the order further comprises: order required delivery time and an acceptable delivery time error preset according to the order required delivery time; after determining the delivery path for the delivery order, the method further comprises:

determining the time for delivery of the delivery route as the time for delivery of the delivery order;

and calculating the acceptable departure time of the prepared order according to the order required arrival time, the delivery time and the acceptable arrival time error.

Optionally, after calculating the acceptable departure time of the prepared order, the method further includes:

sending delivery information to a target delivery terminal to guide the target delivery terminal to deliver the delivery order from the order starting position to the order ending position according to the delivery path, wherein the delivery information comprises the delivery order, the delivery path, the order required arrival time and the acceptable departure time.

Optionally, after sending the delivery information to the target delivery terminal, the method further includes:

removing the delivery order from the list of pending orders;

judging the order quantity of the to-be-processed order list;

if the order number in the to-be-processed order list is zero, stopping processing the to-be-processed order list;

and if the order quantity in the to-be-processed order list is larger than zero, triggering the step of sequencing all the orders in the to-be-processed order list according to the order receiving distance.

Optionally, before sending the delivery information to the target delivery terminal, the method further includes:

receiving a registration request of the distribution terminal in the preset time period to form a distribution terminal list;

recording the registration request receiving time of each registration request in the distribution terminal list;

sorting the distribution terminal list according to the receiving time of each registration request;

and selecting the delivery terminal arranged at the forefront in the delivery terminal list as a target delivery terminal.

Optionally, the sorting the distribution terminal list according to each registration request receiving time includes:

and sequencing all the distribution terminals in the distribution terminal list from morning to evening according to the sequence of the receiving time of the registration request.

removing the target delivery terminal from the delivery terminal list;

judging the number of the distribution terminals in the distribution terminal list;

if the number of the distribution terminals in the distribution terminal list is zero, stopping processing the to-be-processed order list;

and if the number of the distribution terminals in the distribution terminal list is greater than zero, triggering the step of sequencing the distribution terminal list according to the receiving time of each registration request.

Optionally, the determining whether the in-route order of the main order exists in the to-be-processed order list includes:

determining all nodes on each planning path of the main order planning path set to obtain a main order node set;

traversing all nodes of each planning path of the order planning path set of the non-master order in the to-be-processed order list to obtain a non-master order node set;

and all the non-main order node sets fall into the main order node sets, the acceptable departure time of the non-main orders and the acceptable departure time of the main orders have coincident corresponding non-main orders and are regarded as the on-road orders of the main orders.

Optionally, after the non-primary order corresponding to the planned path of the order planned path set in which all the non-primary order node sets fall into the primary order node set is regarded as the on-road order of the primary order, the method further includes: recording the number of the on-road orders of the main orders;

and when the quantity of the on-road orders reaches a preset quantity, triggering a step of determining the delivery time of the delivery path as the delivery time of the delivery orders.

Optionally, the selecting a lowest-cost planned path with the lowest delivery time cost in the off-road order planned path set as the delivery path of the delivery order includes:

determining the number of the lowest cost planned paths;

when the number of the lowest-cost planning paths is 1, determining that the lowest-cost planning paths are taken as distribution paths of the distribution orders;

and when the number of the lowest-cost planning paths is greater than 1, determining a lowest-cost planning path set formed by the lowest-cost planning paths in the off-road order planning path set, and selecting the lowest-cost planning path with the smallest number of working points in the lowest-cost planning path set as a distribution path of the distribution order, wherein the working points are the order starting point position and the order end point position on the planning path.

Optionally, the selecting, as the delivery path of the delivery order, the minimum working point planned path with the minimum number of working points in the minimum cost planned path set includes:

determining the number of the minimum working point planned paths;

when the number of the minimum working point planned paths is 1, determining that the minimum working point planned paths are taken as the distribution paths of the distribution orders;

and when the number of the minimum working point planned paths is more than 1, determining a minimum working point planned path set consisting of the minimum working point planned paths in the minimum cost planned path set, and selecting one minimum working point planned path in the minimum working point planned path set as the distribution path of the distribution order.

A second aspect of the present application provides a delivery path planning system, including:

the system comprises a determining unit, a processing unit and a processing unit, wherein the determining unit is used for determining a main order in an order list to be processed and a main order planning path set corresponding to the main order;

a determining unit, configured to determine whether an on-road order of the main order exists in the to-be-processed order list, where the on-road order is an order in which a planned path, excluding the main order, in the to-be-processed order list falls within a planned path in the main order planned path set;

a selecting unit, configured to, if the main order does not have the on-road order, regard the main order as a delivery order, and select a lowest-cost planning path with the lowest delivery time cost in the main order planning path set as a delivery path of the delivery order;

and if the main order has the on-road order, the selection unit is further configured to regard the main order and the on-road order as delivery orders, determine an on-road order planning path set in which the on-road order exists in the main order planning path set, and select a lowest-cost planning path in the on-road order planning path set, which has the lowest delivery time cost, as a delivery path of the delivery orders.

Optionally, the system further comprises:

the receiving unit is used for receiving a plurality of orders in a preset time period to form a list of orders to be processed, wherein the order information of the orders comprises an order starting position and an order ending position;

a path planning unit, configured to perform path planning for an order starting position and an order ending position of the order, so as to obtain a planned path corresponding to each order in the to-be-processed order list;

the calculation unit is used for calculating the distribution time corresponding to the planned path;

and the screening unit is used for screening out an order planning path set which meets the preset distribution timeliness of the order when in distribution from planning paths.

Optionally, the system further comprises:

the determining unit is also used for determining the distribution service range of the distribution station on the map;

a determining unit, further configured to determine locations of all nodes within the service range, where the nodes include: merchants, shelves, distribution stations, and road intersections;

the dividing unit is used for dividing the road in the distribution range by taking the nodes as dividing points to form a plurality of sub-paths;

and the calculating unit is also used for calculating the distribution time required by each sub-path.

Optionally, when the calculation unit calculates the delivery time required for each of the sub-paths according to the length of the path, the calculation unit is specifically configured to:

or the like, or, alternatively,

counting the path length of each sub-path;

receiving a preset distribution speed;

Optionally, when determining the main order in the to-be-processed order list, the determining unit is specifically configured to:

Optionally, when sorting all the orders in the to-be-processed order list according to the order taking distance, the determining unit is specifically configured to:

Optionally, the distribution speeds are different types of distribution speeds, and the calculation unit is specifically configured to, when calculating the distribution time required for each of the sub-paths:

or the like, or, alternatively,

Optionally, when performing path planning for the order starting position and the order ending position of the order to obtain a planned path corresponding to each order in the to-be-processed order list, the path planning unit is specifically configured to:

Optionally, when the calculation unit calculates the delivery time corresponding to the planned path, the calculation unit is specifically configured to:

Optionally, the system further comprises:

the obtaining unit is used for obtaining the distribution time corresponding to the planned path;

the statistical unit is used for counting the number of orders corresponding to the planned path;

the calculation unit is further used for dividing the delivery time by the number of the orders to calculate and obtain the delivery cost of the planned path;

and the selection unit is further used for selecting the planned path with the lowest delivery cost and determining the planned path with the lowest delivery cost as the planned path with the lowest delivery cost.

Optionally, the order further comprises: order required delivery time and an acceptable delivery time error Δ t preset for the order required delivery time, the system further comprising:

a determining unit configured to determine a time for delivery of the delivery route as a time for delivery of the delivery order;

and the calculating unit is further used for calculating and obtaining the acceptable departure time of the prepared order according to the order required delivery time, the delivery time and the acceptable delivery time error.

Optionally, the system further comprises:

a sending unit, configured to send distribution information to a target distribution terminal, so as to guide the target distribution terminal to distribute the distribution order from the order starting point location to the order ending point location according to the distribution path, where the distribution information includes the distribution order, the distribution path, the order required arrival time, and the acceptable departure time.

Optionally, the system further comprises:

a removing unit, configured to remove the delivery order from the to-be-processed order list;

the judging unit is used for judging the order quantity of the to-be-processed order list;

a stopping unit, configured to stop processing the to-be-processed order list if the order quantity in the to-be-processed order list is zero;

and the triggering unit is used for triggering the step of sequencing all the orders in the to-be-processed order list according to the order receiving distance if the order quantity in the to-be-processed order list is greater than zero.

Optionally, the system further comprises:

the receiving unit is also used for receiving a registration request of the distribution terminal in the preset time period to form a distribution terminal list;

a recording unit configured to record registration request reception time of each of the registration requests in the distribution terminal list;

a sorting unit configured to sort the distribution terminal list according to each registration request reception time;

and the selecting unit is also used for selecting the delivery terminal arranged at the forefront in the delivery terminal list as the target delivery terminal.

Optionally, when the sorting unit sorts the distribution terminal list according to each registration request receiving time, the sorting unit is specifically configured to:

Optionally, the method further comprises:

a removing unit, configured to remove the target delivery terminal from the delivery terminal list;

the judging unit is also used for judging the number of the distribution terminals of the distribution terminal list;

the stopping unit is further used for stopping the processing of the to-be-processed order list if the number of the distribution terminals in the distribution terminal list is zero;

and the triggering unit is further used for triggering the step of sequencing the distribution terminal list according to the receiving time of each registration request if the number of the distribution terminals in the distribution terminal list is greater than zero.

Optionally, when the determining unit determines whether the off-road order of the main order exists in the to-be-processed order list, the determining unit is specifically configured to:

Optionally, the system further comprises:

the recording unit is also used for recording the quantity of the on-road orders of the main orders;

and the triggering unit is also used for triggering the step of sending the distribution information to the target distribution terminal when the quantity of the on-road orders reaches the preset quantity.

Optionally, when the selecting unit selects a lowest-cost planned path with the lowest delivery time cost in the off-road order planned path set as the delivery path of the delivery order, the selecting unit is specifically configured to:

determining the number of the lowest cost planned paths;

Optionally, when the selecting unit selects the minimum planned path of the working points with the minimum number of working points in the minimum cost planned path set as the delivery path of the delivery order, the selecting unit is specifically configured to:

determining the number of the minimum working point planned paths;

A third aspect of the present application provides a distribution route planning apparatus, including:

the system comprises a processor, a memory, a bus and input and output equipment;

the processor is connected with the memory and the input and output equipment;

the bus is respectively connected with the processor, the memory and the input and output equipment;

the processor performs the method of any of the preceding first aspects.

A fourth aspect of the present application provides a computer storage medium having stored therein instructions that, when executed on a computer, cause the computer to perform the method of any of the preceding first aspects.

A fifth aspect of the present application provides a computer program product which, when executed on a computer, causes the computer to perform the method of any one of the preceding first aspects.

According to the technical scheme, the embodiment of the application has the following advantages:

the technical scheme of the application can help a rider to automatically receive orders through the distribution terminal, and the rider can automatically receive the on-road orders after receiving the main orders, the on-road orders are orders which are truly overlapped with the distribution path of the main orders, so that the problems that in the prior art, the rider is influenced by factors such as familiarity of the rider to a distribution area and network quality are solved, the rider often cannot well select proper on-road orders, the distribution path between a plurality of orders is not on the on-road probably occurs, the orders are possibly overtime under the condition that the orders are not on the on-road probably occur, and therefore user experience is poor and distribution efficiency is low are solved.

Drawings

Fig. 1 is a schematic diagram illustrating a flow of a delivery path planning method according to an embodiment of the present application;

fig. 2 is a schematic view illustrating another flow chart of the delivery path planning method according to the present application;

FIG. 3 is a schematic diagram of an embodiment of a method for planning a distribution route according to the present application with respect to determining a service range;

fig. 4 is a schematic diagram of an embodiment of determining a delivery time in the delivery path planning method according to the present application;

FIG. 5 is a schematic diagram of an embodiment of determining an order planning path set in the delivery path planning method according to the present application;

fig. 6 is a schematic view illustrating another flow chart of the delivery path planning method according to the present application;

fig. 7 is a schematic diagram of an exemplary structure of the distribution route planning system according to the present application;

fig. 8 is a schematic diagram of another structural embodiment of the distribution route planning system of the present application;

fig. 9 is a schematic view of an embodiment of the distribution route planning apparatus according to the present application.

Detailed Description

It should be noted that the delivery path planning method of the present application is applicable to a scenario of planning a delivery path of a reserved order, for example, a scenario in which the order is required to deliver related goods within a certain time period in the future. That is to say, the technical solution of the present application is suitable for a scenario in which a non-real-time order is subjected to distribution path planning, and is an application scenario for a to-be-processed order list with a fixed order quantity within a preset time, so as to determine an on-road order in the to-be-processed order list with the fixed order quantity, and select a corresponding distribution path for the determined distribution order.

Referring to fig. 1, an embodiment of a distribution route planning method according to the present application includes:

101. and determining a main order in the list of the orders to be processed and a main order planning path set corresponding to the main order.

The pending order list in the embodiment of the present application refers to: the user purchases an order formed at a certain merchant through the Internet, and the order is still in a waiting delivery state, and a collection of a plurality of the orders is formed. Each order in the list of the orders to be processed has its own corresponding order planning path set, and the order planning path set reflects all alternative planning paths of the order that meet the delivery conditions, where the planning path is a path obtained by planning from an order starting position specified by the order to an order ending position. In the embodiment of the application, one of the orders needs to be determined as a main order in the to-be-processed order list, and when a certain order is determined as the main order, the order planning path set of the corresponding order is the main order planning path set. In this embodiment, there are many methods for determining the main order in the pending order list, such as random selection, selection according to the order generation time, or selection according to the distance from the order distribution starting point to the distribution terminal, and the like, and the method is not particularly limited herein.

102. Judging whether an on-road order of the main order exists in the to-be-processed order list, and executing the step 104 if the on-road order of the main order exists in the to-be-processed order list; if there is no on-route order of the main order in the pending order list, step 103 is executed.

After the main order is determined from the pending order list in step 101, this step further determines whether an on-road order of the main order exists from the pending order list. The in-route order means: orders with the planning paths falling into the planning paths in the main order planning path set exist in the order list to be processed except the main order. That is, in this step, all planned paths in the main order planned path set of the main order are compared and determined with all planned paths in each order planned path set of the non-main order, so as to determine whether the planned paths in the order planned path set of the non-main order have planned paths that fall into the main order planned path set of the main order. It is understood that when the planned path of the order planned path set in the non-master order has a planned path that falls within the master order planned path set of the master order, it means that the planned path of the non-master order is consistent with the planned path of the master order, and the non-master order can be delivered together as an on-road order of the master order, that is, the non-master order is an on-road order of the master order.

103. And taking the main order as a delivery order, and selecting the lowest-cost planning path with the lowest delivery time cost in the main order planning path set as a delivery path of the delivery order.

After determining that no on-road order exists in the main order in step 102, the main order may be regarded as a delivery order alone, where the delivery order is an order to be delivered as a delivery task, and a lowest-cost planning path with the lowest delivery time cost is selected from a plurality of planning paths in the main order planning path set as a delivery path of the delivery order. The lowest cost route with the lowest delivery time cost is as follows: the time spent on the order plan path divided by the number of orders delivered results in the order plan path with the least delivery time.

104. And taking the main order and the on-road order as delivery orders, determining an on-road order planning path set with the on-road order in the main order planning path set, and selecting a lowest-cost planning path with the lowest delivery time cost in the on-road order planning path set as a delivery path of the delivery orders.

After determining that the main order has the on-road order in step 102, the main order and the on-road order combination may be considered as a delivery order together, because the planned paths in the main order planned path set do not all fit the on-road order, it is necessary to determine that the on-road order planned path set exists in the main order planned path set, and select the lowest cost path with the lowest delivery time cost as the delivery path in the on-road order planned path set. The minimum cost path is determined in step 103. Therefore, the lowest cost path in the step not only enables the on-road order and the main order to achieve real on-road in the distribution process, but also has higher distribution efficiency.

The technical scheme of the embodiment of the application can automatically determine a main order from the list of the orders to be processed, judge whether a non-main order in the list of the orders to be processed can be taken as an on-road order of the main order, and select a lowest-cost planning path from a main order planning path set of the main order as a distribution path of the main order which becomes a distribution order when the main order is determined not to have the on-road order; when the main order is determined to have the on-road order, the main order and the on-road order are taken as the delivery order together, an on-road order planning path set containing a planning path of the on-road order is determined from the main order planning path set of the main order, and then the lowest-cost planning path is selected from the on-road order planning path set to serve as the delivery path of the delivery order. Therefore, the technical scheme of the application can automatically receive the on-road order for the main order after the main order is received, the on-road order is the order which is truly related to the way of the main order, and further solves the problems that in the prior art, due to the fact that factors such as the familiarity of a rider on a distribution area and the network quality are influenced, the rider often cannot well select a proper on-road order, the distribution route between a plurality of orders is possibly not on the way, the orders are possibly overtime under the condition that the orders are not on the way, the user experience is poor, and the distribution efficiency is low.

Referring to fig. 2, before determining the main order of the to-be-processed order list, the delivery path planning method of the present application needs to perform some data preprocessing in advance, and the embodiment is as follows:

201. the distribution service range of the distribution station is determined on the map.

The technical scheme of the distribution path planning in this embodiment is performed based on a map, and firstly, a specific position of a distribution station on the map needs to be determined, the distribution station is a place where distribution personnel such as a rider gather or gather, and the distribution station can provide some basic services for the distribution personnel, such as electric vehicle charging, mobile phone charging, network connection service, seat rest, and even unified management for work equipment of the distribution personnel. Due to the special role of the distribution station, the distribution service range can be a coverage area formed on a map by taking a certain distance as a radius and taking the distribution station as a center. To a certain extent, it can be considered that all distribution personnel need to start from distribution stations as starting points when starting distribution work, each distribution station has its corresponding distribution service range, and the distribution range may also be dynamically changed due to factors such as weather conditions and traffic conditions.

For example, referring to the map shown in fig. 3, in the embodiment, the position of the distribution station a needs to be determined on the map, and in practical applications, the position of the distribution station a may be determined on the map by using methods such as satellite positioning technology and artificial marks. In view of reducing the distance between the distribution personnel and the merchant locations from the distribution station, the distribution station is generally selected to try to select locations that are relatively close to the affiliated merchants, such as the central locations of the affiliated merchants. As shown in fig. 3, assuming that the distribution station a is located in a street shown in the map, after determining the specific location of the distribution station a on the map, we can make a circle (or other shape) with the specific location of the distribution station a as the center and with the preset distance as the radius, and the range a covered by the circle on the map can be regarded as the service range of the distribution station a. The service area a of the distribution station a may be: a range formed by a set of the farthest distances that can be reached to each road with the distribution station a as the center at a general distribution speed within a predetermined time (for example, 30 minutes), and the specific determination of the distribution range is not limited herein. As can be seen from fig. 3, since the locations such as the merchant E and the delivery destination Z on the map are not within the delivery range a, the technical solution of the present application cannot provide delivery service for these locations outside the service range a. In the map loading process, the positions in the non-service range can be omitted, so that the data processing process is accelerated, and energy is saved.

202. Determining the positions of all nodes within the service range, wherein the nodes comprise: merchants, shelves, distribution stations, and road intersections.

After the service area is determined in step 201, all locations of the business partners, all shelf locations that may be delivered, all road intersections, and the specific location of the delivery station are determined on the map within the service area. The merchant position may be regarded as a delivery starting position, the shelf position may be regarded as a delivery end position, the delivery end position is also regarded as a delivery destination, the shelf is only one of the delivery end positions, and the delivery end position may also be a gate of a certain cell, an entrance of a certain parking lot, and the like within the service range. These locations determined in this step may each be considered nodes within service.

As shown in fig. 3, specific positions of a merchant B, a merchant C, a merchant D, a delivery destination X, a delivery destination Y, a delivery station a, a road intersection of a street, a road lane, a road intersection of a street, a street intersection, a road intersection of a street, a street intersection, and the like are determined in a delivery range a on a map.

203. And dividing the road in the distribution range by taking the nodes as dividing points to form a plurality of sub-paths.

After the nodes on the map are determined in step 202, all roads in the service range need to be determined, and since in actual situations, the positions of each merchant, the distribution station, the shelf, and the like necessarily arrive at the roads, the nodes in step 202 necessarily fall in the roads in the service range, and are divided by taking the nodes as dividing points, and the roads are divided into a plurality of sub-paths.

As shown in fig. 3, assuming that the upper part of the map is north, the lower part is south, the left side is west, and the right side is east, the node of the merchant B divides the road between the first road and the second road into a west street and an east street, wherein the west street or the east street is a sub-path.

204. The delivery time required for each sub-path is calculated.

After each sub-path of the road is determined in step 203, the delivery time required for each sub-path may be calculated by various methods. For example, the historical delivery time of each sub-path in the history is counted in advance in a big data counting mode, and then the average value of the historical delivery time is obtained, so that the delivery time of each sub-path is obtained; or, the distribution time of each sub-path is obtained by counting the path length of each sub-path, then presetting a distribution speed, and dividing the path length of the sub-path by the distribution speed. In practical applications, various methods can be used to calculate the delivery time required for each sub-path, and the calculation process of the delivery time of the sub-path is not limited.

It is worth noting that the historical delivery time of each sub-path in the history under different types can be counted in a big data counting mode, and then the average value of the historical delivery time of different types is obtained, so that the delivery time of each sub-path under different types is obtained; or, the different types of delivery time of each sub-path are obtained by counting the path length of each sub-path, then presetting different types of delivery speed, and dividing the path length of the sub-path by the different types of delivery speed, wherein the different types refer to different vehicles, such as walking, bicycles, electric vehicles and the like.

For example, referring to fig. 4, fig. 4 is a schematic diagram of an embodiment of a delivery route planning method for determining delivery time. Information such as a specific position of each sub-route in the map, a name of each sub-route, node positions at both ends of the sub-route, a distance of the sub-route, a route address of the sub-route (also referred to as a sub-route ID), and a delivery time required to pass through the sub-route under different types of transportation means can be clearly known from fig. 4. To illustrate one row of the chain table in fig. 4, when the first node has a code number of 00200001 representing a merchant B on the map, and when the second node has a road junction of two roads and one street, the first node represents a sub-path with a road ID of 7100215, the sub-path has a name of street west, the road length of street west is about 400 meters, it takes about 2 minutes to ride a bicycle, and it takes about 6 minutes to walk. The linked list in fig. 4 is formed to facilitate the automatic calculation of the distribution time of each planned path in the subsequent steps, and also facilitate the management and modification of map data by the manager. And so on for other data in the linked list, and so on, are not described too much here. It is understood that the calculation and management of the delivery time may be in other manners, and is not further limited herein.

205. Receiving a plurality of orders in a preset time period to form a list of orders to be processed, wherein the order information of the orders comprises an order starting position, an order ending position, order required delivery time and an acceptable delivery time error preset according to the order required delivery time.

In the step, a plurality of orders in a preset time period are received, and a list of orders to be processed is formed. The preset time period refers to a future time period, for example, the current time is 8 months in 2020, 1 am, 9: 00, from the current time to 12 am on 8/1/2020, receive 9 am on 8/2/2020: the order to be delivered is needed between 8/month 2/noon 12 o' clock in 2020; for another example, the current time is 2020, 8, 1 am 9: 00, from the current time to 10 am on 8/month 1/2020, receive 11 am on 8/month 1/2020: orders to be delivered between 00 and 2020, 8/1/noon, 12: 00; for another example, the current time is 2020, 8, 1 am 9: 00, receive 2020, 8 months, 2 days am 9 from the current time: 00 followed by the order that needs to be delivered. That is to say, no new order is added after the pending order list in the embodiment of the present application is formed, and the new order is added to the pending order list in the next time period. The received order information of each order in this embodiment at least includes an order starting position, an order ending position, an order required delivery time, and an acceptable delivery time error preset for the order required delivery time. The order starting point position generally corresponds to the position of a merchant in the service range on the map; the so-called order end position generally corresponds to a delivery destination within a service range on a map; the order required delivery time is a desired order delivery time selected by the user, and the to-be-processed order list in the embodiment of the present application is generated by dividing according to the time period of the order required delivery time, for example, when the rule is that the current time is 8/1/9 am in 2020: 00, receive 2020, 8 months, 2 days am 9 from the current time: when an order needs to be delivered after 00, then 8/1/9 am in 2020: 8/month 2/am 9/00 to 2020: the number of the orders needing to be delivered between 00 is determined, and then a list of the orders to be processed is generated; it should be noted that the order delivery time is a determined time, and is influenced by various objective reasons (such as traffic jam, asynchronous clock, etc.), and it is impossible for the distributor to actually deliver the order to the order destination at the right point.

206. And planning paths for the order starting position and the order ending position of the order to obtain a planned path corresponding to each order in the list of the orders to be processed.

After the order starting position and the order ending position of the order are obtained in step 205, the order starting position of each order in the list of the orders to be processed may be used as a starting point, and the order ending position is an ending point, and all connectable sub-paths are traversed within the service range on the map, so as to obtain a planned path corresponding to each order and connecting the order starting position and the order ending position, where each planned path is formed by connecting a plurality of sub-paths end to end, and one end of each planned path corresponds to the order starting position of the corresponding order and the other end corresponds to the order ending position of the corresponding order. Namely, each order in the list of orders to be processed corresponds to a plurality of planning paths.

207. And calculating the distribution time corresponding to the planned path.

Step 206 shows that each planned path of each order in the to-be-processed order list is formed by connecting a plurality of sub-paths end to end, and the delivery time of each planned path can be obtained by accumulating the delivery time of the sub-paths formed by each planned path. It can be understood that, since each sub-path has delivery time under different types of transportation means, delivery time of each planned path under different types of transportation means can be calculated. It will be appreciated that, similarly, the delivery times for each planned route mixed with different types of vehicles can also be calculated.

208. And screening an order planning path set which meets the preset distribution timeliness of the orders when used for distribution from the planning paths.

And (4) screening the plurality of planning paths corresponding to each order in the to-be-processed order list obtained in the step 207, and screening the planning paths meeting the preset distribution timeliness to form an order planning path set. It can be understood that, in order to reasonably distribute the time of the delivery personnel and improve the delivery efficiency of the orders, a preset delivery time limit is set for each order, and only a planned path with delivery time less than the preset delivery time limit of the orders is recommendable.

For example, referring to fig. 5, the order starting point position of an order is merchant B, the order ending point position is delivery destination Y, and the preset delivery time period of the order is 30 minutes, as can be seen from the figure, in the three planned routes of the order: route one requires 20 minutes, route two requires 40 minutes, and route three requires 26 minutes; the delivery time spent on the route two exceeds the preset delivery time limit, and the route two cannot be selected into the order planning path set; and the first route and the second route meet the preset delivery timeliness, the route planning of the first route and the second route is screened out and selected into an order planning route set, and all planning routes in the order planning route set are planning routes of the order meeting the preset delivery timeliness.

Through the above data preprocessing process, the distribution path planning method according to the embodiment of the present application may enter a processing process of a to-be-processed order list, referring to fig. 6, and another embodiment of the distribution path planning method according to the present application includes:

601. and determining a main order of the to-be-processed order list and a main order planning path set corresponding to the main order.

The execution of this step is similar to the execution of step 101 in fig. 1, and the repeated parts are not described herein again.

For determining the main order in the to-be-processed order list, the present embodiment may first determine an order receiving distance from an order starting point position of each order in the to-be-processed order list to the distribution station, where the order receiving distance is a distance between the order starting point position and a path formed by a combination of shortest sub-paths between two nodes of the distribution station. And sorting all orders in the order list to be processed according to the order receiving distance, and selecting the order sorted at the top in the order list to be processed as a main order. The ordering of all orders in the to-be-processed order list according to the order receiving distance may be: sequencing all orders in the to-be-processed order list according to the order distance from small to large, and further selecting the order closest to the distribution station as a main order; or sequencing all orders in the to-be-processed order list according to the order distance from large to small, and further selecting the order farthest from the delivery station as the main order. It is understood that there are many methods for determining the main order in the pending order list, and the main order may be selected randomly, in the order of generation time of the order, and the like, and is not limited herein.

602. Judging whether an on-road order of the main order exists in the to-be-processed order list, if so, executing step 604; if there is no on-route order of the main order in the pending order list, go to step 603.

The execution of this step is similar to the execution of step 102 in fig. 1, and the repeated parts are not described herein again.

It is to be noted that, in this embodiment, the specific process of determining whether the in-route order of the main order exists in the to-be-processed order list may be: all nodes on each planning path of the main order planning path set are determined firstly, a main order node set on each planning path of the main order planning path set is obtained, all nodes of each planning path of the order planning path set of non-main orders in the to-be-processed order list are traversed, and a non-main order node set on each planning path of the order planning path set of the non-main orders is obtained. All the node sets with non-main orders fall into the main order node set to be taken as the on-road orders of the main orders; furthermore, a non-main order with coincident and corresponding acceptable departure time and the acceptable departure time of the main order can be considered as a direct order of the main order; furthermore, the node sequence of the non-main order node set may be considered as the same as the node sequence of the main order node set, and the node sequence is regarded as the on-road order of the main order, so as to avoid that the direction of the planned path of the on-road order is opposite to the direction of the planned path of the main order, that is, only the direction of the planned path in which the order starting point position of the main order points to the order end point position is the same as the direction of the planned path in which the order starting point position of the non-main order points to the order end point position.

Wherein, the acceptable departure time of the order is calculated as described in the embodiment of step 606.

603. And taking the main order as a delivery order, and selecting the lowest-cost planning path with the lowest delivery time cost in the main order planning path set as a delivery path of the delivery order.

The execution of this step is similar to the execution of step 103 in fig. 1, and the repeated parts are not described herein again.

The process of determining the minimum cost planning path may be: the method comprises the steps of firstly obtaining the distribution time corresponding to a planned path, counting the number of orders corresponding to the planned path, dividing the distribution time by the number of the orders to further obtain the distribution cost of the planned path, wherein the planned path with the lowest distribution cost is determined as the lowest-cost planned path. It can be seen that the lowest cost planned path reflects the average delivery elapsed time per order for each order for the planned path, i.e., the greater the number of orders per delivery order in the planned path, the less the average delivery elapsed time per order.

Such as: one delivery order is out of order, the delivery time of the corresponding delivery path is 20 minutes, and the delivery cost of the delivery order on the delivery path is 20 minutes/order; when the delivery cost of the delivery order on the corresponding delivery path is 30 minutes when there are 1 on-road orders, the delivery cost of the delivery order on the delivery path is 30/2-15 minutes/order. Therefore, the distribution path with the shortest distribution time can be successfully found regardless of whether the distribution order is in-route or not through the determination of the lowest-cost planning path.

604. And taking the main order and the on-road order as delivery orders, determining an on-road order planning path set with the on-road order in the main order planning path set, and selecting a lowest-cost planning path with the lowest delivery time cost in the on-road order planning set as a delivery path of the delivery orders.

The execution of this step is similar to the execution of step 104 in fig. 1, and the repeated parts are not described herein again.

It should be noted that, considering that the delivery personnel need to complete all delivery orders within the preset time-efficient plus the acceptable delivery time error for each delivery order, it is not suitable to allocate too many in-route orders to the delivery personnel, so as to avoid the delivery personnel from overtime delivery orders due to too many in-route orders. The embodiment of the present application may further set a forward order quantity limiting mechanism, such as: by recording the number of the on-road orders of the main order, when the number of the on-road orders reaches the preset number, the addition of the on-road orders to the main order is stopped, and step 605 is triggered and executed.

605. The delivery time of the delivery route is determined as the delivery time of the delivery order.

The delivery time corresponding to the delivery route determined in step 604 or step 603 is determined as the delivery time of the delivery order.

606. And calculating the acceptable departure time of the delivery order according to the order required arrival time, the delivery time and the acceptable arrival time error.

The orders in the delivery orders have the order required delivery time, when the delivery route corresponding to the delivery orders has the delivery time corresponding to the delivery route, the acceptable delivery time error is preset by the system, and the acceptable delivery time error is subtracted from the difference obtained by subtracting the delivery time from the required delivery time to obtain an end value of the acceptable departure time; and then the difference obtained by subtracting the delivery time from the required delivery time is added with the acceptable delivery time error to obtain another end value of the acceptable departure time, and the time period formed between the two end values of the acceptable departure time is the acceptable departure time.

For example, if a delivery order is an off-road order, the order of the delivery order requires 12:00 delivery time of 2020, 8, 1, 20 minutes delivery time, and the acceptable delivery time error is 10 minutes, then the end value of one acceptable departure time of the delivery order is 12:00-00:20-00:10 is 11:30, the end value of the other acceptable departure time of the delivery order is 12:00-00:20+00:10 is 11:50, and the acceptable departure time of the delivery order is 11:30 to 11: 50.

For another example, there are two in-route orders for delivery orders, the main order of which requires delivery time of 12:00 at 8 months and 1 day of 2020, delivery time of 20 minutes, and acceptable delivery time error of 10 minutes; the required delivery time for the on-road order 1 is 12:10 at 8 month and 1 day of 2020, and the required delivery time for the on-road order 2 is 11:50 at 8 month and 1 day of 2020. According to the algorithm, the acceptable departure time of the main order is 11: 30-11: 50, the acceptable departure time of the on-road order 1 is 11: 40-12: 00, and the acceptable departure time of the on-road order 2 is 11: 20-11: 40, and the acceptable departure time of the delivery order is the acceptable departure time of the combined main order, the on-road order 1 and the on-road order 2 is 11: 30-11: 40, namely, the acceptable departure time of the non-main order and the acceptable departure time of the main order are overlapped.

607. And receiving a registration request of the distribution terminal in a preset time period to form a distribution terminal list.

According to the technical scheme of the embodiment of the application, the registration request of the distribution terminal in the preset time period can be received in advance, and then the distribution terminal list is formed. The preset time period here corresponds to the preset time period in step 205, that is, the registration request sent by the distribution personnel who can provide the distribution service in the time period through the distribution terminal is received, and the distribution terminal is generally an intelligent terminal, such as a mobile phone, a tablet computer, and the like. The registration request may contain some basic information of the delivery person: type of vehicle (walking, bicycle, electric car, etc.), name, body temperature, contact, etc.

608. The registration request reception time of each registration request in the distribution terminal list is recorded.

The technical solution of the embodiment of the present application may further record the registration request receiving time of the distribution terminal that makes the registration request in step 607, so as to know a waiting time length when each distribution terminal waits to allocate the distribution order after the registration request, where the waiting time length is equal to a time when the distribution information is sent to the target terminal in step 611 minus the registration request receiving time of the target terminal.

609. The distribution terminal list is sorted according to each registration request reception time.

All the distribution terminals in the distribution terminal list are sorted from the morning to the evening according to the sequence of the registration request receiving time recorded in step 608, and the sorting of the distribution terminal list is updated. Of course, in practical applications, all the delivery terminals in the delivery terminal list may be sorted from late to early according to the sequence of the registration request receiving times recorded in step 608.

610. The delivery terminal arranged at the forefront in the delivery terminal list is selected as a target delivery terminal.

For fairness, it is considered that the distribution terminal with the earlier registration request time should be allocated with the distribution order preferentially, the longer the waiting time of waiting for the distribution order is. When all the distribution terminals in the distribution terminal list are sorted from the morning to the evening in step 609 according to the sequence of the registration request receiving time recorded in step 608, and then the sorting of the distribution terminal list is updated, the distribution terminal arranged at the forefront in the distribution terminal list is the one with the longest time waiting for distribution of the distribution order, and at this time, the distribution terminal arranged at the forefront in the distribution terminal list may be selected as the target distribution terminal.

611. And sending the distribution information to the target distribution terminal to guide the target distribution terminal to distribute the distribution orders from the order starting position to the order terminal position according to the distribution path, wherein the distribution information comprises the distribution orders, the distribution path, the order required arrival time and the acceptable departure time.

After step 606, the embodiment of the present application determines a delivery order, a delivery path corresponding to the delivery order, an order required arrival time of the delivery order, and an acceptable departure time of the delivery order; after step 610, the target delivery terminal of the delivery order is determined in the embodiment of the present application; in this case, the delivery information including the delivery order, the delivery path, the order arrival time and the acceptable departure time may be transmitted to the target terminal, so that the target delivery terminal is guided to deliver the delivery order from the order start position to the order end position according to the delivery path, that is, to obtain the corresponding goods from the merchant position within the service range on the map, and then to deliver the goods to the delivery destination along the delivery path. The starting time can be accepted, so that the distribution personnel can directly see the goods needing to be taken from the corresponding merchant position in the time period through the target distribution terminal, the flow of calculating and arranging the delivery time according to the order requirement is not needed, the time of the distribution personnel is saved, and the distribution efficiency is higher.

612. The delivery order is removed from the pending order list.

After the delivery order is sent to the target delivery terminal in step 611, the delivery order may be removed from the pending order list to indicate that the delivery order has been subjected to delivery processing.

613. Judging the order quantity in the list of the orders to be processed, and if the order quantity is zero, executing step 614; if the order quantity is greater than zero, the execution step triggers the execution step 601.

After the delivery order is removed from the to-be-processed order list in step 612, it is necessary to determine whether there is an unprocessed order in the to-be-processed order list at this time, in the embodiment of the present application, by determining the number of orders in the to-be-processed order list, if the number of orders in the to-be-processed order list is zero, it is verified that the to-be-processed order list is processed; if the number of orders in the to-be-processed order list is greater than zero, it is verified that there are unprocessed orders in the to-be-processed order list, and further processing is required, and step 601 is triggered to be executed to determine the main order again for the orders in the to-be-processed order list.

614. The processing of the list of orders to be processed is stopped.

When the order number in the pending order list is determined to be zero in step 613, it is verified that the pending order list is processed, and the processing of the pending order list is stopped. When the number of the delivery terminals in the delivery terminal list is determined to be zero in step 616, it is proved that there is no optional delivery person in the delivery terminal list for distributing the delivery order, and at this time, the processing of the to-be-processed order list should also be stopped.

615. And removing the target delivery terminal from the delivery terminal list.

After the delivery order is sent to the target delivery terminal in step 611, the target delivery terminal may be removed from the delivery terminal list to indicate that the target delivery terminal has been allocated the delivery order, that is, the target terminal has already allocated the delivery order to the delivery personnel, and the ordering of the registration request of the current delivery terminal in the delivery terminal list has failed.

616. Judging the number of the distribution terminals in the distribution terminal list, and if the number of the distribution terminals is zero, triggering step 614; if the number of distribution terminals is greater than zero, step 609 is triggered.

After the target distribution terminal is removed from the distribution terminal list in step 615, it is determined whether there are any distribution terminals of the unallocated distribution orders in the distribution terminal list at this time, in the embodiment of the present application, the number of the distribution terminals in the distribution terminal list is determined, and if the number of the distribution terminals in the distribution terminal list is zero, it is proved that there are no alternative distribution terminals in the distribution terminal list, that is, no distributor waits to distribute the distribution orders, and distribution service cannot be provided; if the number of the delivery terminals in the delivery terminal list is greater than zero, it is proved that alternative delivery terminals exist in the delivery terminal list, that is, delivery personnel wait for the delivery of delivery orders and can continue to provide delivery services.

It should be noted that, when the lowest-cost planned route selected in step 603 or step 604 is not unique as the planned route of the delivery order, the embodiment of the present application further provides the following schemes, including:

determining the number of the lowest-cost planned paths, and when the number of the lowest-cost planned paths is 1, determining that the lowest-cost planned paths are taken as delivery paths of delivery orders; and when the number of the lowest-cost planning paths is greater than 1, determining a lowest-cost planning path set consisting of the lowest-cost planning paths in the off-road order planning path set, and selecting the minimum working point planning path with the minimum number of working points in the lowest-cost planning path set as a distribution path for distributing orders, wherein the working points refer to order starting positions and order end positions of the planning paths.

Further, if the minimum working point planned path is not unique, a further selected technical solution provided by the embodiment of the present application includes:

determining the number of the minimum working point planned paths, and determining the minimum working point planned paths as distribution paths of distribution orders when the number of the minimum working point planned paths is 1; and when the number of the minimum working point planned paths is more than 1, determining a minimum working point planned path set consisting of the minimum working point planned paths in the minimum cost planned path set, and selecting one minimum working point planned path in the minimum working point planned path set as a distribution path of the distribution order, namely, randomly selecting one minimum working point planned path from the minimum working point planned path set as the distribution path of the distribution order.

It can be seen from the foregoing embodiments that, in the embodiments of the present application, a distribution service range is determined on a map in advance, all passable roads, and positions of merchants, shelves, intersections, distribution stations, etc. located on the roads are determined in the service range, then all passable planned paths between the locations of the merchants and the shelves in the service range are calculated through a certain algorithm, and further the passable planned paths are screened, so that the planned paths meeting requirements are selected as distribution paths of orders, thereby solving the problem that in the prior art, due to factors such as the familiarity of a rider to a distribution area and network quality, the rider often cannot well select a proper in-route order, which may result in that distribution paths between a plurality of orders are not in-route, and an order may be overtime if a plurality of orders are not in-route, therefore, the user experience is poor, and the distribution efficiency is low.

The above description is made on the delivery path planning method according to the embodiment of the present application, and the following description is made on the delivery path planning system according to the embodiment of the present application, with reference to fig. 7, where the method includes:

a determining unit 701, configured to determine a main order in an order list to be processed and a main order planning path set corresponding to the main order;

a determining unit 702, configured to determine whether an on-road order of the main order exists in the to-be-processed order list, where the on-road order is an order in which a planned path, excluding the main order, in the to-be-processed order list falls within a planned path in the main order planned path set;

a selecting unit 703, configured to, if the main order does not have the on-road order, regard the main order as a delivery order, and select a lowest-cost planning path with the lowest delivery time cost in the main order planning path set as a delivery path of the delivery order;

the selecting unit 703 is further configured to, if the main order has the on-road order, regard the main order and the on-road order as a delivery order, determine an on-road order planning path set in which the on-road order exists in the main order planning path set, and select a lowest-cost planning path in the on-road order planning path set, which has the lowest delivery time cost, as a delivery path of the delivery order.

In this embodiment, the operation performed by the distribution path planning system is similar to the operation performed in the embodiment of fig. 1, and is not described again here.

It can be seen from the foregoing embodiments that, in the embodiments of the present application, a distribution service range is determined on a map in advance, all passable roads and all node positions located on the roads are determined in the service range, the nodes include a merchant position, a shelf position, a road intersection position, a distribution station position, and the like, and further the nodes may be used to divide the roads into a plurality of sub-paths, and perform a data representation on the sub-paths and the nodes, and further calculate all possible passing planned paths between the merchant position and the shelf position in the service range by using a certain algorithm, and further screen the possible passing planned paths, so as to select the planned paths meeting requirements as the distribution paths of the order. Therefore, the technical scheme of the application solves the problems that in the prior art, due to the influence of factors such as the familiarity of a rider to a distribution area and the network quality, the rider often cannot well select a proper in-route order, so that a distribution path among a plurality of orders is possibly not in-route, and the orders are possibly overtime under the condition that the orders are not in-route, so that the user experience is poor and the distribution efficiency is low.

Referring to fig. 8, another embodiment of the distribution route planning system of the present application includes:

a determining unit 801, configured to determine a main order in an order list to be processed and a main order planning path set corresponding to the main order;

a determining unit 802, configured to determine whether an on-road order of the main order exists in the to-be-processed order list, where the on-road order is an order in which a planned path, excluding the main order, in the to-be-processed order list falls within a planned path in the main order planned path set;

a selecting unit 803, configured to, if the main order does not have the on-road order, regard the main order as a delivery order, and select a lowest-cost planning path with the lowest delivery time cost in the main order planning path set as a delivery path of the delivery order;

the selecting unit 803 is further configured to, if the main order has the on-road order, regard the main order and the on-road order as a delivery order, determine an on-road order planning path set in which the on-road order exists in the main order planning path set, and select a lowest-cost planning path in the on-road order planning path set, which has the lowest delivery time cost, as a delivery path of the delivery order.

Optionally, the system further comprises:

the receiving unit 804 is used for receiving a plurality of orders in a preset time period to form a to-be-processed order list, wherein the order information of the orders comprises an order starting position and an order ending position;

a path planning unit 805, configured to perform path planning for an order starting position and an order ending position of the order, so as to obtain a planned path corresponding to each order in the to-be-processed order list;

a calculating unit 806, configured to calculate a delivery time corresponding to the planned path;

a screening unit 807, configured to screen out, from the planned paths, an order planned path set that satisfies the preset delivery timeliness of the order when delivered.

Optionally, the system further comprises:

a determination unit 801 further configured to determine a distribution service range of a distribution station on a map;

a determining unit 801, configured to determine positions of all nodes within the service range, where the nodes include: merchants, shelves, distribution stations, and road intersections;

the dividing unit 808 is used for dividing the road in the distribution range by taking the node as a dividing point to form a plurality of sub-paths;

the calculating unit 806 is further configured to calculate a distribution time required for each of the sub paths.

Optionally, when the calculating unit 806 calculates the delivery time required by each of the sub-paths according to the length, the calculating unit is specifically configured to:

or the like, or, alternatively,

counting the path length of each sub-path;

receiving a preset distribution speed;

Optionally, when determining the main order in the to-be-processed order list, the determining unit 801 is specifically configured to:

Optionally, when sorting all the orders in the to-be-processed order list according to the order receiving distance, the determining unit 801 is specifically configured to:

Optionally, the distribution speeds are different types of distribution speeds, and the calculating unit 806 is specifically configured to, when calculating the distribution time required for each of the sub-paths:

or the like, or, alternatively,

Optionally, the path planning unit 805 is specifically configured to, when performing path planning for the order starting position and the order ending position of the order to obtain a planned path corresponding to each order in the to-be-processed order list:

Optionally, when the calculating unit 806 calculates the delivery time corresponding to the planned path, it is specifically configured to:

Optionally, the system further comprises:

an obtaining unit 809, configured to obtain delivery time corresponding to the planned path;

a statistic unit 810, configured to count the number of orders corresponding to the planned path;

the calculating unit 806 is further configured to divide the delivery time by the number of the orders, and calculate a delivery cost of the planned path;

the selecting unit 803 is further configured to select the planned path with the lowest delivery cost and determine the planned path with the lowest delivery cost as the planned path with the lowest delivery cost.

a determining unit 801 configured to determine a time of delivery of the delivery route as a time of delivery of the delivery order;

the calculating unit 806 is further configured to calculate an acceptable departure time of the prepared order according to the order required delivery time, the delivery time, and the acceptable delivery time error.

Optionally, the system further comprises:

a sending unit 811, configured to send distribution information to a target distribution terminal, so as to guide the target distribution terminal to distribute the distribution order from the order starting position to the order ending position according to the distribution path, where the distribution information includes the distribution order, the distribution path, the order required arrival time, and the acceptable departure time.

Optionally, the system further comprises:

a removing unit 812, configured to remove the delivery order from the to-be-processed order list;

a determining unit 802, configured to determine the order quantity of the to-be-processed order list;

a stopping unit 813, configured to stop processing on the to-be-processed order list if the order quantity in the to-be-processed order list is zero;

a triggering unit 814, configured to trigger a step of sorting all the orders in the to-be-processed order list according to the order taking distance if the order quantity in the to-be-processed order list is greater than zero.

Optionally, the system further comprises:

the receiving unit 804 is further configured to receive a registration request of the distribution terminal in the preset time period, and form a distribution terminal list;

a recording unit 815 configured to record a registration request reception time of each of the registration requests in the distribution terminal list;

a sorting unit 816, configured to sort the distribution terminal list according to each registration request receiving time;

the selecting unit 803 is further configured to select the delivery terminal arranged at the top in the delivery terminal list as the target delivery terminal.

Optionally, when the sorting unit 816 sorts the distribution terminal list according to each registration request receiving time, specifically configured to:

Optionally, the method further comprises:

a removing unit 813, configured to remove the target delivery terminal from the delivery terminal list;

the determining unit 802 is further configured to determine the number of the distribution terminals in the distribution terminal list;

a stopping unit 813, configured to stop processing on the to-be-processed order list if the number of the distribution terminals in the distribution terminal list is zero;

the triggering unit 814 is further configured to trigger the step of sorting the distribution terminal list according to each registration request receiving time if the number of the distribution terminals in the distribution terminal list is greater than zero.

Optionally, when the determining unit 802 determines whether the in-route order of the main order exists in the to-be-processed order list, it is specifically configured to:

Optionally, the system further comprises:

a recording unit 815, further configured to record the number of the on-road orders of the main order;

the triggering unit 814 is further configured to trigger a step of sending the delivery information to the target delivery terminal when the number of the on-road orders reaches a preset number.

Optionally, when the selecting unit 803 selects the lowest-cost planned path with the lowest delivery time cost in the off-road order planned path set as the delivery path of the delivery order, the selecting unit is specifically configured to:

determining the number of the lowest cost planned paths;

Optionally, when the selecting unit 803 selects the minimum planned path of the working points in the minimum cost planned path set, where the minimum planned path of the working points is the minimum, as the delivery path of the delivery order, the selecting unit is specifically configured to:

determining the number of the minimum working point planned paths;

In this embodiment, the operation performed by the distribution path planning system is similar to the operation performed in the embodiments of fig. 2 to 6, and is not repeated herein.

An embodiment of the distribution route planning apparatus is described below, with reference to fig. 9, which includes:

the distribution route planning apparatus 900 may include one or more Central Processing Units (CPUs) 901 and a memory 905, where one or more applications or data are stored in the memory 905. Memory 905 may be volatile storage or persistent storage, among others. The program stored in the memory 905 may include one or more modules, each of which may include a series of instruction operations for a delivery path planning apparatus. Further, the central processor 901 may be configured to communicate with the memory 905, and execute a series of instruction operations in the memory 905 on the delivery path planning apparatus 900. The distribution route-based planning device 900 may also include one or more power supplies 902, one or more wired or wireless network interfaces 903, one or more input-output interfaces 904, and/or one or more operating systems, such as Windows Server, MacOSX, Unix, Linux, FreeBSD, etc. The central processor 901 may perform the operations in the embodiments shown in fig. 1 or fig. 2 to fig. 6, which are not described herein again.

It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and various media capable of storing program codes.

Claims

1. A distribution path planning method is characterized by comprising the following steps:

2. The delivery path planning method according to claim 1, wherein before determining the main order in the to-be-processed order list and the main order planning path set corresponding to the main order, the method further comprises:

calculating the distribution time corresponding to the planned path;

3. The delivery path planning method of claim 2, wherein prior to receiving a number of orders within a preset time period, the method further comprises:

determining a distribution service range of a distribution station on a map;

and calculating the distribution time required by each sub-path.

4. The delivery path planning method according to claim 3, wherein the calculating the delivery time required for each of the sub paths includes:

or the like, or, alternatively,

counting the path length of each sub-path;

receiving a preset distribution speed;

5. The delivery path planning method of claim 3 wherein said determining a master order in said list of pending orders comprises:

6. The delivery path planning method of claim 5 wherein said ordering all of the orders in the list of orders to be processed according to the pick-up distance comprises:

7. The delivery path planning method according to claim 4, wherein the delivery speeds are different types of delivery speeds, and the calculating the delivery time required for each of the sub paths includes:

or the like, or, alternatively,

8. The distribution path planning method according to claim 3, wherein the performing path planning for the order starting position and the order ending position of the order to obtain the planned path corresponding to each order in the to-be-processed order list comprises:

9. The method for planning a delivery path according to claim 8, wherein the calculating the delivery time corresponding to the planned path includes:

10. The delivery path planning method according to claim 9, wherein the determining of the lowest-cost planned path with the lowest delivery time cost includes:

acquiring the distribution time corresponding to the planned path;

counting the number of orders corresponding to the planned path;

11. The delivery path planning method of claim 9 wherein the order further comprises: the order delivery time requirement and an acceptable delivery time error Delta t preset according to the order delivery time requirement are obtained; after determining the delivery path for the delivery order, the method further comprises:

and calculating to obtain the acceptable departure time of the order according to the order required arrival time, the distribution time and the acceptable arrival time error delta t.

12. The delivery path planning method of claim 11, wherein after calculating an acceptable departure time for the fill order, the method further comprises:

13. The delivery path planning method according to claim 12, wherein after sending the delivery information to the target delivery terminal, the method further comprises:

removing the delivery order from the list of pending orders;

judging the order quantity of the to-be-processed order list;

14. The delivery path planning method according to claim 12, wherein before sending the delivery information to the target delivery terminal, the method further comprises:

15. The delivery path planning method according to claim 14, wherein the sorting the delivery terminal list according to each of the registration request reception times includes:

16. The delivery path planning method according to claim 14, wherein after sending the delivery information to the target delivery terminal, the method further comprises:

removing the target delivery terminal from the delivery terminal list;

17. The delivery path planning method of claim 14 wherein said determining whether an in-route order for the primary order exists in the pending order list comprises:

18. The delivery path planning method according to claim 17, wherein after considering as the on-road order of the primary order the non-primary order corresponding to the planned path of the order planning path set in which all of the non-primary order node sets fall into the primary order node set, the method further comprises:

recording the number of the on-road orders of the main orders;

19. The delivery path planning method according to claim 1, wherein the selecting a lowest-cost planned path with the lowest delivery time cost in the off-road order planned path set as the delivery path of the delivery order comprises:

determining the number of the lowest cost planned paths;

20. The delivery path planning method according to claim 19, wherein the selecting the least-cost planned path of the lowest planned path set having the least number of work points as the delivery path of the delivery order comprises:

determining the number of the minimum working point planned paths;

21. A delivery path planning system, comprising:

22. A delivery route planning apparatus, comprising:

the processor is connected with the memory and the input and output equipment;

the processor performs the method of any one of claims 1 to 20.

23. A computer storage medium having stored therein instructions that, when executed on a computer, cause the computer to perform the method of any one of claims 1 to 20.

24. A computer program product, which, when executed on a computer, causes the computer to perform the method of any one of claims 1 to 20.