Logistics transportation path planning method and device, computer equipment and storage medium

Abstract

The invention relates to a logistics transportation path planning method and device, computer equipment and a storage medium. The method comprises the following steps: determining a first transportation time length from each network point to a transit site and a second transportation time length between the network points; according to each first transportation duration, clustering each network point to obtain a plurality of clusters; aiming at each clustering cluster, taking the condition that the shift residual duration of the target path is greater than or equal to the preset duration as a constraint, and sequentially selecting network points from all the network points in the clustering cluster according to the second transportation duration between all the network points in the clustering cluster so as to connect the network points into the corresponding target path; the target path is a path which sequentially passes through all the selected network points and then reaches the transfer field from the last selected network point; the shift remaining time length is the remaining time length in the transportation shift after the transportation of the target path; and determining the target path as the transportation path of one transportation vehicle in the transportation shift. By adopting the method, the logistics transportation cost can be reduced.

Description

Technical Field

[0001] The present application relates to the fields of computer technology and logistics technology, and particularly to a logistics transportation route planning method, apparatus, computer device, and storage medium. Background Art

[0002] In the logistics industry, goods, packages, express deliveries, etc. that need to be sent from each network point need to be transported to a transfer yard for centralized transportation. In practice, it is often necessary to plan the route for this transportation process to improve transportation efficiency. However, in traditional logistics transportation route planning methods, the optimal route is often simply searched, while ignoring the actual situation, resulting in relatively high logistics transportation costs. Summary of the Invention

[0003] Based on this, in view of the above technical problems, it is necessary to provide a logistics transportation route planning method, apparatus, computer device, computer-readable storage medium, and computer program product that can reduce logistics transportation costs.

[0004] In a first aspect, the present application provides a logistics transportation route planning method. The method includes:

[0005] Determine the first transportation duration from each network point to the transfer yard and the second transportation duration between each pair of the network points;

[0006] Cluster each of the network points according to each of the first transportation durations to obtain a plurality of clustering clusters;

[0007] For each of the clustering clusters, with the constraint that the remaining duration of the shift of the target route is greater than or equal to a preset duration, sequentially select network points from the network points in the clustering cluster according to the second transportation duration between the network points in the clustering cluster to connect into a corresponding target route; the target route is a route that sequentially passes through the selected network points and then reaches the transfer yard from the last selected network point; the remaining duration of the shift is the remaining duration in the transportation shift after the transportation through the target route;

[0008] Determine the target route as the transportation route of a transport vehicle in the transportation shift.

[0009] In a second aspect, the present application further provides a logistics transportation route planning apparatus. The apparatus includes:

[0010] A transportation duration determination module, configured to determine the first transportation duration from each network point to the transfer yard and the second transportation duration between each pair of the network points;

[0011] A clustering module, configured to cluster each of the network points according to each of the first transportation durations to obtain a plurality of clustering clusters;

[0012] A path planning module, for each of the clustering clusters, with the remaining duration of the shift of the target path being greater than or equal to a preset duration as a constraint, sequentially selects network points from the network points in the clustering cluster according to the second transportation duration between the network points in the clustering cluster to connect into the corresponding target path; the target path is a path that sequentially passes through the selected network points and then reaches the transfer yard from the last selected network point; the remaining duration of the shift is the remaining duration in the transportation shift after the transportation through the target path; and determines the target path as the transportation path of a transportation vehicle in the transportation shift.

[0013] In a third aspect, the present application also provides a computer device. The computer device includes a memory and a processor, and a computer program is stored in the memory. When the computer program is executed by the processor, the processor executes the steps in the logistics transportation path planning method according to the embodiments of the present application.

[0014] In a fourth aspect, the present application also provides a computer-readable storage medium. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the processor executes the steps in the logistics transportation path planning method according to the embodiments of the present application.

[0015] In a fifth aspect, the present application also provides a computer program product. The computer program product includes a computer program, and when the computer program is executed by a processor, the processor executes the steps in the logistics transportation path planning method according to the embodiments of the present application.

[0016] For the above-mentioned logistics transportation path planning method, device, computer device, storage medium and computer program product, the first transportation duration from each network point to the transfer yard and the second transportation duration between each network point are determined, and each network point is clustered according to each first transportation duration to obtain multiple clustering clusters. For each clustering cluster, with the remaining duration of the shift of the target path being greater than or equal to a preset duration as a constraint, network points are sequentially selected from the network points in the clustering cluster according to the second transportation duration between the network points in the clustering cluster to connect into the corresponding target path, and finally the target path is determined as the transportation path of a transportation vehicle in the transportation shift, which can enable a transportation vehicle to pass through as many network points in the clustering cluster as possible to transport the goods of these network points to the transfer yard, thereby reducing the total number of transportation vehicles used to complete the goods transportation of all network points and lowering the cost of logistics transportation. Description of the Drawings

[0017] Figure 1 It is a flowchart of the logistics transportation path planning method in an embodiment;

[0018] Figure 2It is a structural block diagram of a logistics transportation route planning device in an embodiment;

[0019] Figure 3 It is a structural block diagram of a logistics transportation route planning device in another embodiment;

[0020] Figure 4 It is an internal structure diagram of a computer device in an embodiment;

[0021] Figure 5 It is an internal structure diagram of a computer device in another embodiment. Detailed implementation manners

[0022] In order to make the objectives, technical solutions and advantages of the present application clearer, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0023] In some embodiments, as Figure 1 shown, a logistics transportation route planning method is provided. In this embodiment, an example is given where this method is applied to a computer device. The computer device can be a terminal or a server. The terminal can be, but is not limited to, various personal computers, laptop computers, smart phones, tablet computers, Internet of Things devices, and portable wearable devices. The Internet of Things devices can be smart speakers, smart TVs, smart air conditioners, smart in-vehicle devices, etc. The portable wearable devices can be smart watches, smart bracelets, head-mounted devices, etc. The server can be implemented by an independent server or a server cluster composed of multiple servers. In this embodiment, the method includes the following steps:

[0024] Step 102, determine the first transportation duration from each network point to the transfer yard and the second transportation duration between each network point.

[0025] Among them, the network point is a place where goods are delivered and received in logistics. The transfer yard is a place where goods are gathered and transferred in logistics. The goods can include at least one of express items and packages, etc. The first transportation duration refers to the duration required for the transport vehicle to transport from the network point to the transfer yard. Each network point has its own corresponding first transportation duration. The second transportation duration refers to the duration required for the transport vehicle to transport from one network point to another network point. There is a corresponding second transportation duration between any two network points.

[0026] In some embodiments, the computer device can determine the first transportation duration from each network point to the transfer yard and the second transportation duration between each network point according to the historical route information and the locations of each network point and the transfer yard. Among them, the historical route information can include information such as the transportation duration of the past traveled transportation route, and the locations of the starting point and the ending point.

[0027] In some embodiments, if the historical route information contains the transportation duration corresponding to the transportation route from a network point to a transfer yard, the computer device can directly determine the transportation duration as the first transportation duration from the network point to the transfer yard. If the historical route information does not contain the transportation duration corresponding to the transportation route from the network point to the transfer yard, the computer device can predict the first transportation duration from the network point to the transfer yard according to the positions of the network point and the transfer yard. Similarly, if the historical route information contains the transportation duration corresponding to the transportation route between a first network point and a second network point, the computer device can directly determine the transportation duration as the second transportation duration between the first network point and the second network point. If the historical route information does not contain the transportation duration corresponding to the transportation route between the first network point and the second network point, the computer device can predict the second transportation duration between the first network point and the second network point according to the positions of the first network point and the second network point.

[0028] Step 104: Cluster each network point according to each first transportation duration to obtain multiple clustering clusters.

[0029] In some embodiments, the computer device can use methods such as the k-means algorithm, the KNN algorithm (k-nearest neighbor algorithm), or a decision tree to cluster each network point.

[0030] In some embodiments, the computer device can cluster each network point according to the first transportation duration from each network point to the transfer yard to obtain multiple clustering clusters. It can be understood that since the clustering is based on the transportation duration from the network point to the transfer yard, the multiple clustering clusters are approximate "ring-shaped" clustering results centered on the transfer yard, and each clustering cluster corresponds to an approximate "ring".

[0031] Step 106: For each clustering cluster, with the constraint that the remaining duration of the shift of the target path is greater than or equal to a preset duration, select network points from the network points in the clustering cluster in sequence according to the second transportation duration between the network points in the clustering cluster to connect into the corresponding target path; the target path is the path that sequentially passes through the selected network points and then reaches the transfer yard from the last selected network point; the remaining duration of the shift is the remaining duration in the transportation shift after the transportation through the target path.

[0032] For example: Assume that for a certain cluster, first select network point A from the cluster. Assume that the remaining duration of the shift of the target path from network point A to the transfer station is greater than or equal to the preset duration. Then continue to select network point B from the cluster. Assume that the remaining duration of the shift of the target path from network point A to network point B to the transfer station is still greater than or equal to the preset duration. Then continue to select network point C from the cluster. Assume that the remaining duration of the shift of the target path from network point A to network point B to network point C to the transfer station is still greater than or equal to the preset duration. Then continue to select network point D from the cluster. Assume that the remaining duration of the shift of the target path from network point A to network point B to network point C to network point D to the transfer station is less than the preset duration. Then it does not meet the constraint condition, end the selection, obtain the target path from network point A to network point B to network point C to the transfer station, and then execute step 108 to determine the target path from network point A to network point B to network point C to the transfer station as the transportation path of a transport vehicle in the transport shift.

[0033] In some embodiments, the computer device can use the remaining duration of the shift of the target path being greater than or equal to the preset duration as a constraint. First, select an initial network point from the cluster, and then, according to the second transportation duration between each network point in the cluster, successively select the network point with the shortest transportation duration from the previously selected network point, and connect the selected network points to form the corresponding target path.

[0034] In some embodiments, during the process of successively selecting network points, the computer device can determine the current total transportation duration according to the second transportation duration between the selected network points and the first transportation duration from the last selected network point to the transfer station, determine the current remaining duration of the shift according to the difference between the transport shift duration and the current total transportation duration, and use the current remaining duration of the shift being greater than or equal to the preset duration as a constraint to successively select network points from each network point in the cluster according to the second transportation duration between each network point in the cluster to form the corresponding target path.

[0035] For example: Assume that a certain transport shift is from 8 o'clock to 10 o'clock, then the transport shift duration is 2 hours. Assume that the current total transportation duration is 1.5 hours, then the current remaining duration of the shift is 0.5 hours (i.e., 2 hours - 1.5 hours). Assume that the preset duration is 0.2 hours, then the current remaining duration of the shift is greater than the preset duration, and network points can continue to be selected from the cluster.

[0036] Step 108: Determine the target path as the transportation path of a transport vehicle in the transport shift.

[0037] It can be understood that for each cluster, step 106 is executed to obtain multiple target paths. The computer device can respectively determine the multiple target paths as the transportation paths corresponding to each transport vehicle in the transport shift. That is, each transport vehicle travels a target path respectively.

[0038] In some embodiments, the computer device may obtain the transportation shift duration of each transportation shift, and perform steps 106 to 108 for each transportation shift respectively, so as to obtain the transportation routes of each transportation vehicle in each transportation shift.

[0039] For the above logistics transportation route planning method, the first transportation duration from each network point to the transfer yard and the second transportation duration between each network point are determined. According to each first transportation duration, the network points are clustered to obtain multiple clustering clusters. For each clustering cluster, with the constraint that the remaining duration of the shift of the target route is greater than or equal to the preset duration, network points are sequentially selected from the network points in the clustering cluster according to the second transportation duration between the network points in the clustering cluster to form the corresponding target route. Finally, the target route is determined as the transportation route of a transportation vehicle in the transportation shift, which can enable a transportation vehicle to pass through as many network points in the clustering cluster as possible to transport the goods of these network points to the transfer yard, thereby reducing the total number of transportation vehicles used to complete the goods transportation of all network points and lowering the cost of logistics transportation.

[0040] In some embodiments, with the constraint that the remaining duration of the shift of the target path is greater than or equal to a preset duration, the network points in the clustering cluster are sequentially selected according to the second transportation duration between the network points in the clustering cluster to form the corresponding target path, including: selecting an initial network point from the network points in the clustering cluster and taking the initial network point as the target network point in the first round of iteration; in each round of iteration, determining the total transportation duration of the target path in the current round of iteration according to the second transportation duration between the target network points in the current round of iteration and the previous rounds of iteration, and the first transportation duration corresponding to the target network point in the current round of iteration; the target path in the current round of iteration is a path that starts from the initial network point, sequentially passes through the target network points in the previous rounds of iteration before the current round of iteration and the target network point in the current round of iteration, and then reaches the transfer yard from the target network point in the current round of iteration; determining the remaining duration of the shift of the target path in the current round of iteration according to the difference between the transportation shift duration and the total transportation duration; with the constraint that the remaining duration of the shift of the target path in the current round of iteration is greater than or equal to the preset duration, selecting, according to the second transportation duration between the network points in the clustering cluster, the network point with the shortest second transportation duration from the remaining network points in the clustering cluster as the target network point in the next round of iteration; the remaining network points refer to the network points in the clustering cluster except the target network points in the current round of iteration and the previous rounds of iteration; returning to determine the total transportation duration of the target path in the current round of iteration according to the second transportation duration between the target network points in the current round of iteration and the previous rounds of iteration, and the first transportation duration corresponding to the target network point in the current round of iteration to enter the next round of iteration, and taking the next round of iteration as the new current round of iteration; determining the target path as the transportation path of a transport vehicle in the transportation shift, including: determining the target path in the last round of iteration as the transportation path of a transport vehicle in the transportation shift.

[0041] In some embodiments, the computer device may arbitrarily select a network point from the network points in the clustering cluster as the initial network point.

[0042] In some embodiments, the computer device may add the second transportation duration between the target network points in the current round of iteration and the previous rounds of iteration, and the first transportation duration corresponding to the target network point in the current round of iteration to obtain the total transportation duration of the target path in the current round of iteration.

[0043] In some embodiments, selecting the network point with the shortest second transportation duration from the remaining network points in the clustering cluster as the target network point in the next round of iteration includes: sorting the remaining network points according to the second transportation duration between them and the target network point in the current round of iteration, and selecting the network point with the shortest second transportation duration from the sorting result as the target network point in the next round of iteration.

[0044] For example, assume that for a certain cluster, first select network point A (the initial network point) from the cluster. Assume that the remaining duration of the shift of the target path from network point A to the transfer yard is 1 hour, which is greater than the preset duration of 0.2 hours. Then continue to select network point B with the shortest transportation duration between network point B and network point A from the cluster. Assume that the remaining duration of the shift of the target path from network point A - network point B - to the transfer yard is 0.6 hours, which is greater than the preset duration of 0.2 hours. Then continue to select network point C with the shortest transportation duration between network point C and network point B from the cluster. Assume that the remaining duration of the shift of the target path from network point A - network point B - network point C - to the transfer yard is 0.3 hours, which is greater than the preset duration of 0.2 hours. Then continue to select network point D with the shortest transportation duration between network point D and network point C from the cluster. Assume that the remaining duration of the shift of the target path from network point A - network point B - network point C - network point D - to the transfer yard is 0.1 hours, which is less than the preset duration of 0.2 hours. Then it does not meet the constraint condition, and the selection ends. The target path from network point A - network point B - network point C - to the transfer yard is obtained, and then the target path from network point A - network point B - network point C - to the transfer yard is determined as the transportation path of a transport vehicle in the transportation shift.

[0045] In the above embodiments, in each round of iteration, the network point with the shortest second transportation duration between the network point selected in the previous round of iteration and the target network point is selected from the cluster as the target network point in the current round of iteration, and with the constraint that the remaining duration of the shift of the target path in the current round of iteration is greater than or equal to the preset duration, it can enable a transport vehicle to pass through as many adjacent network points in the cluster as possible to transport the goods of these network points to the transfer yard, thereby reducing the total number of transport vehicles used to complete the goods transportation of all network points and lowering the cost of logistics transportation.

[0046] In some embodiments, after determining the target path as the transportation path of a transport vehicle in the transportation shift, the method further includes: if there are remaining network points outside the target path in the cluster, then use the remaining network points as the network points in the updated cluster, and return to use the remaining duration of the shift of the target path being greater than or equal to the preset duration as the constraint, and successively select network points from the network points in the cluster according to the second transportation duration between the network points in the cluster to connect into the corresponding target path to obtain a new target path; determine the new target path as the transportation path of another transport vehicle in the transportation shift.

[0047] In some embodiments, after obtaining a new target path, if there are still remaining network points in the clustering cluster, continue to return and execute the operation of selecting network points from the network points in the clustering cluster in sequence according to the second transportation duration between the network points in the clustering cluster to form the corresponding target path with the constraint that the remaining duration of the shift of the target path is greater than or equal to the preset duration, until there are no remaining network points in the clustering cluster, and determine each obtained target path as the transportation path corresponding to each transportation vehicle in the transportation shift respectively.

[0048] It can be understood that, assuming that a certain clustering cluster contains network points A, B, C, D, and E, after obtaining the target path of network point A-network point B-network point C-transfer yard by sequentially selecting network points A, B, and C from a certain clustering cluster with the constraint that the remaining duration of the shift of the target path is greater than or equal to the preset duration, there are remaining network points outside this target path in this clustering cluster, that is, network points D and E. Then, the computer device can continue to sequentially select network points from network points D and E to form a new target path with the constraint that the remaining duration of the shift of the target path is greater than or equal to the preset duration, until there are no remaining network points in the clustering cluster.

[0049] In the above embodiments, if there are remaining network points outside the target path in the clustering cluster, continue to sequentially select network points from the remaining network points to form a new target path with the constraint that the remaining duration of the shift of the target path is greater than or equal to the preset duration, which can enable a transportation vehicle to pass through as many adjacent network points in the clustering cluster as possible to transport the goods of these network points to the transfer yard, thereby reducing the total number of transportation vehicles used to complete the goods transportation of all network points and lowering the cost of logistics transportation.

[0050] In some embodiments, determining the target path as the transportation path of a transportation vehicle in the transportation shift includes: if all the network points in the clustering cluster have been selected and the transportation attribute of the last selected network point is round-trip, determine whether the remaining duration of the shift of the target path is greater than or equal to the sum of the round-trip duration and the preset duration; the round-trip duration is the transportation duration required for the transportation vehicle to return from the transfer yard to the last network point and then return from the last network point to the transfer yard; if so, determine the target path plus the round-trip path corresponding to the last network point as the transportation path of a transportation vehicle in the transportation shift; the round-trip path corresponding to the last network point is the path from the transfer yard to the last network point and then back from the last network point to the transfer yard.

[0051] Among them, the transportation attribute is used to characterize whether the first transportation duration from the network point to the transfer yard supports round-trip within the transportation shift. The transportation attribute can include round-trip and non-round-trip. The transportation attribute being round-trip indicates that the first transportation duration from the network point to the transfer yard supports round-trip within the transportation shift. The transportation attribute being non-round-trip indicates that the first transportation duration from the network point to the transfer yard does not support round-trip within the transportation shift.

[0052] In some embodiments, the round-trip duration can be twice the first transportation duration from the last network point to the transfer yard.

[0053] In some embodiments, when the preset duration is zero, if all the network points in the clustering cluster have been selected and the transportation attribute of the last selected network point is round-trip, it is determined whether the remaining duration of the shift of the target path is greater than or equal to the round-trip duration. If so, the target path plus the round-trip path corresponding to the last network point is determined as the transportation path of a transport vehicle in the transport shift.

[0054] For example: Suppose a clustering cluster includes network points A, B, C, D, and E. Suppose the selected network points A - B - C - transfer yard is a target path, then A - B - C - transfer yard is determined as the transportation path of a transport vehicle. Then, the selected network points D - E - transfer yard is a target path. Since all the network points in the clustering cluster have been selected after selecting network point E, and assuming the transportation attribute of network point E is round-trip, the computer device can determine whether the remaining duration of the shift of the target path D - E - transfer yard is greater than or equal to the sum of the round-trip duration and the preset duration. If so, the path D - E - transfer yard - E - transfer yard is determined as the transportation path of a transport vehicle in the transport shift. The round-trip duration is the transportation duration required to return from the transfer yard to network point E and then back from network point E to the transfer yard.

[0055] In the above embodiments, when all the network points in the clustering cluster have been selected and the transportation attribute of the last selected network point is round-trip, it is determined whether the remaining duration of the shift of the target path is greater than or equal to the sum of the round-trip duration and the preset duration. If so, the target path plus the round-trip path corresponding to the last network point is determined as the transportation path of a transport vehicle in the transport shift, so that the transport vehicle that has arrived at the transfer yard and completed the transportation within the transport shift can return to the network point with the round-trip transportation attribute to transport goods. Since the network point with the round-trip transportation attribute is relatively close to the transfer yard, only the vehicles that have completed the transportation within the transport shift need to be arranged to return to this network point for transportation, without the need to arrange additional transport vehicles. Therefore, the total number of transport vehicles used to complete the goods transportation of all network points can be reduced, and the logistics transportation cost is lowered.

[0056] In some embodiments, before determining whether the remaining duration of the shift of the target path is greater than or equal to the round-trip duration when all the network points in the clustering cluster have been selected and the transportation attribute of the last selected network point is round-trip, the method further includes: determining the transportation attribute of each network point according to the transport shift duration and the first transportation duration corresponding to each network point.

[0057] In some embodiments, the computer device can compare the first transportation duration from each network point to the transfer yard with one-third of the shift transportation duration for each network point respectively, and determine the transportation attribute of the network point according to the comparison result.

[0058] In the above embodiments, by determining the transportation attributes of each network point based on the shift transportation duration and the first transportation duration corresponding to each network point respectively, the transportation attributes of the network points can be accurately determined.

[0059] Determining the transportation attributes of each network point based on the shift transportation duration and the first transportation duration corresponding to each network point respectively includes at least one of the following: for each network point respectively, if the first transportation duration corresponding to the network point is less than or equal to one-third of the shift transportation duration, then determine the transportation attribute of the network point as round-trip; for each network point respectively, if the first transportation duration corresponding to the network point is greater than one-third of the shift transportation duration, then determine the transportation attribute of the network point as non-round-trip.

[0060] In some embodiments, when the preset duration is not zero, if the first transportation duration corresponding to the network point is less than or equal to one-third of the difference between the shift transportation duration and the preset duration, then determine the transportation attribute of the network point as round-trip; if the first transportation duration corresponding to the network point is greater than one-third of the difference between the shift transportation duration and the preset duration, then determine the transportation attribute of the network point as non-round-trip.

[0061] In the above embodiments, for each network point respectively, if the first transportation duration corresponding to the network point is less than or equal to one-third of the shift transportation duration, then determine the transportation attribute of the network point as round-trip; if the first transportation duration corresponding to the network point is greater than one-third of the shift transportation duration, then determine the transportation attribute of the network point as non-round-trip, which can accurately determine the transportation attributes of each network point.

[0062] In some embodiments, determining the target path as the transportation path of a transportation vehicle in a transportation shift includes: if all the network points in the clustering cluster have been selected, then taking the remaining shift duration of the updated target path being greater than or equal to the preset duration as a constraint, select new network points from the remaining clustering clusters that are closer to the transfer yard than the clustering cluster; determine the path that sequentially passes through the selected network points, then from the last selected network point to the new network points, and then from the new network points to the transfer yard as the updated target path; return to select new network points from the remaining clustering clusters that are closer to the transfer yard than the clustering cluster to iteratively optimize the target path with the constraint that the remaining shift duration of the updated target path is greater than or equal to the preset duration; according to the total transportation costs of the target paths determined for each clustering cluster in each optimization, determine the target transportation paths corresponding to each transportation vehicle in the transportation shift for the target paths in one optimization whose total transportation costs meet the preset conditions.

[0063] It can be understood that the remaining cluster clusters closer to the transfer station than the cluster cluster refer to the cluster clusters in the inner ring closer to the transfer station than this cluster cluster.

[0064] In some embodiments, the computer device can start from the cluster cluster in the outermost outer ring of each cluster cluster, traverse layer by layer in sequence to the cluster clusters in the inner ring, and for each traversed cluster cluster, execute the constraint that the remaining duration of the shift of the target path is greater than or equal to the preset duration. According to the second transportation duration between each network point in the cluster cluster, network points are sequentially selected from each network point in the cluster cluster to form the corresponding target path. If all the network points in the cluster cluster have been selected, then with the constraint that the remaining duration of the shift of the updated target path is greater than or equal to the preset duration, continue to select new network points from the remaining cluster clusters closer to the transfer station than the cluster cluster, and determine the path that sequentially passes through each selected network point, then from the last selected network point to the new network point, and then from the new network point to the transfer station as the updated target path, and return to select new network points from the remaining cluster clusters closer to the transfer station than the cluster cluster to iteratively optimize the target path with the constraint that the remaining duration of the shift of the updated target path is greater than or equal to the preset duration.

[0065] In some embodiments, the selected new network point can be a network point in the first cluster cluster closest to this cluster cluster among the remaining cluster clusters closer to the transfer station than the cluster cluster. In some embodiments, the selected new network point can be a network point in the first cluster cluster closest to this cluster cluster among the remaining cluster clusters closer to the transfer station than the cluster cluster and with the shortest second transportation duration between it and the last network point.

[0066] In some embodiments, multiple new network points can be sequentially selected with the constraint that the remaining duration of the shift of the updated target path is greater than or equal to the preset duration. The multiple selected new network points can all be network points in the first cluster cluster closest to this cluster cluster among the remaining cluster clusters closer to the transfer station than the cluster cluster. The multiple selected new network points can also be partially network points in the first cluster cluster closest to this cluster cluster among the remaining cluster clusters closer to the transfer station than the cluster cluster, and the other part are network points in the cluster clusters closer to the transfer station than the first cluster cluster.

[0067] In some embodiments, the total transportation cost can be the total number of transportation vehicles required in the transportation shift or the total distance required to travel in the transportation shift.

[0068] In some embodiments, the computer device can determine each target transportation path corresponding to each transportation vehicle in the transportation shift as the target paths in the optimization with the lowest total transportation cost in each previous optimization.

[0069] For example: Cluster 1, Cluster 2, and Cluster 3 are clusters from the outermost ring to the innermost ring. Cluster 1 contains outlets A, B, and C. Cluster 2 contains outlets B and C. Cluster 3 contains outlets F, G, and H. Assume that outlets A, B, and C are sequentially selected from Cluster 1 to form the target path Outlet A - Outlet B - Outlet C - Transfer Yard. Outlets D and E are sequentially selected from Cluster 2 to form the target path Outlet D - Outlet E - Transfer Yard. Outlets F, G, and H are sequentially selected from Cluster 3 to form the target path Outlet F - Outlet G - Outlet H - Transfer Yard. The three target paths, namely "Outlet A - Outlet B - Outlet C - Transfer Yard", "Outlet D - Outlet E - Transfer Yard", and "Outlet F - Outlet G - Outlet H - Transfer Yard", are respectively determined as the transportation paths corresponding to each transport vehicle in the transport schedule, serving as the initial solution. During the optimization process, after sequentially selecting outlets A, B, and C from Cluster 1 to form the target path, since all the outlets in Cluster 1 have been selected, when the remaining duration of the shift corresponding to the target path is greater than or equal to the preset duration, new outlets can be continuously selected from Cluster 2. Assume that Outlet D is selected from Cluster 2, then the target path Outlet A - Outlet B - Outlet C - Outlet D - Transfer Yard is formed. Then, when sequentially selecting outlets from Cluster 2, it is obvious that Outlet E will be selected. Then, since all the outlets in Cluster 2 have been selected, when the remaining duration of the shift corresponding to the target path is greater than or equal to the preset duration, new outlets can be continuously selected from Cluster 3. Assume that Outlet F is selected from Cluster 3, then the target path Outlet E - Outlet F - Transfer Yard is formed. Then, when sequentially selecting outlets from Cluster 3 to form the target path Outlet G - Outlet H - Transfer Yard, the optimized target paths "Outlet A - Outlet B - Outlet C - Outlet D - Transfer Yard", "Outlet E - Outlet F - Transfer Yard", and "Outlet G - Outlet H - Transfer Yard" are obtained, serving as the optimized solution. Then, further optimization can be continued. For example, after sequentially selecting outlets A, B, and C from Cluster 1 to form the target path, two new outlets are sequentially selected from Cluster 2. The computer device can compare the total transportation costs corresponding to the initial solution and the solutions after each optimization, and determine the target paths in the solution with the lowest total transportation cost as the transportation paths corresponding to each transport vehicle in the transport schedule.

[0070] In the above embodiment, if all the outlets in the cluster have been selected, new outlets are selected from the remaining clusters closer to the transfer yard than the cluster, with the constraint that the remaining duration of the shift of the updated target path is greater than or equal to the preset duration. Thus, it can be ensured that a transport vehicle can pass through as many nearby outlets as possible to transport the goods of these outlets to the transfer yard, reducing the total transportation cost of the logistics transportation.

[0071] In some embodiments, the method further includes: using an optimization algorithm to replace the network points in the transportation routes of each transportation vehicle in the determined transportation schedule to obtain new transportation routes; comparing the total transportation costs of the determined transportation routes and the new transportation routes, and determining the target transportation routes of each transportation vehicle in the transportation schedule according to the comparison result.

[0072] In some embodiments, the optimization algorithm can be an ant colony algorithm, a genetic algorithm, a nearest neighbor algorithm, etc.

[0073] In some embodiments, the replaced network points can be one or more.

[0074] In some embodiments, the computer device can determine the transportation route with the lowest total transportation cost as the target transportation route of each transportation vehicle in the transportation schedule according to the comparison result.

[0075] In the above embodiments, using the optimization algorithm as the mutation factor of the initial solution can determine a more optimal transportation route, improve the effect of route planning, and reduce the cost of logistics transportation to a greater extent.

[0076] In some embodiments, the method further includes at least one of the following: if the timeliness attribute of the transportation schedule is high timeliness, determining a preset duration as the minimum remaining duration corresponding to the transportation schedule; if the timeliness attribute of the transportation schedule is general timeliness, determining the preset duration as zero.

[0077] Among them, high timeliness means that the transportation schedule requires the transportation vehicle to arrive at the transfer yard in advance before the end time of the schedule. The minimum remaining duration corresponding to the transportation schedule refers to the minimum advance duration for the transportation vehicle to arrive at the transfer yard in advance before the end time of the schedule, that is, how early to arrive at the transfer yard at least. General timeliness means that the transportation schedule does not require the transportation vehicle to arrive at the transfer yard in advance before the end time of the schedule, that is, it can arrive at the transfer yard on time.

[0078] In some embodiments, if the timeliness attribute of the transportation schedule is high timeliness, for each clustering cluster, with the constraint that the remaining duration of the target route is greater than or equal to the minimum remaining duration corresponding to the transportation schedule, the network points are sequentially selected from the network points in the clustering cluster according to the second transportation duration between the network points in the clustering cluster to form the corresponding target route.

[0079] In some embodiments, if the timeliness attribute of the transportation schedule is general timeliness, for each clustering cluster, with the constraint that the remaining duration of the target route is greater than or equal to zero, the network points are sequentially selected from the network points in the clustering cluster according to the second transportation duration between the network points in the clustering cluster to form the corresponding target route.

[0080] In the above embodiments, different degrees of constraints are imposed on the remaining duration of the shifts of the target paths in transportation shifts with different aging requirements, so that path planning can be flexibly performed to meet the requirements of different transportation shifts.

[0081] It should be understood that although the steps in the flowcharts involved in the above embodiments are sequentially shown according to the indications of the arrows, these steps do not necessarily need to be executed in the order indicated by the arrows. Unless there is a clear description in this article, the execution of these steps has no strict order limit, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above embodiments may include multiple steps or multiple stages. These steps or stages do not necessarily need to be executed at the same moment, but can be executed at different moments. The execution order of these steps or stages does not necessarily need to be sequential, but can be executed alternately or alternately with at least a part of other steps or steps or stages in other steps.

[0082] Based on the same inventive concept, an embodiment of the present application also provides a logistics transportation path planning device for implementing the logistics transportation path planning method involved above. The solution provided by this device to solve the problem is similar to the solution recorded in the above method. Therefore, the specific limitations in one or more embodiments of the logistics transportation path planning device provided below can refer to the limitations on the logistics transportation path planning method in the above text, and will not be repeated here.

[0083] In some embodiments, as Figure 2 shown, a logistics transportation path planning device 200 is provided, including: a transportation duration determination module 202, a clustering module 204, and a path planning module 206, where:

[0084] The transportation duration determination module 202 is used to determine the first transportation duration from each network point to the transfer yard and the second transportation duration between each network point;

[0085] The clustering module 204 is used to cluster each network point according to each first transportation duration to obtain multiple clustering clusters;

[0086] The path planning module 206 is used for each clustering cluster, with the constraint that the remaining duration of the shift of the target path is greater than or equal to a preset duration, and sequentially selects network points from the network points in the clustering cluster according to the second transportation duration between the network points in the clustering cluster to connect into the corresponding target path; the target path is the path that sequentially passes through the selected network points and then reaches the transfer yard from the last selected network point; the remaining duration of the shift is the remaining duration in the transportation shift after the transportation through the target path; and the target path is determined as the transportation path of a transportation vehicle in the transportation shift.

[0087] In some embodiments, the path planning module 206 is further configured to select an initial network point from each network point in the cluster and use the initial network point as the target network point in the first round of iteration; in each round of iteration, determine the total transportation duration of the target path in the current round of iteration according to the second transportation durations between the target network points in the current round of iteration and the previous rounds of iteration, and the first transportation duration corresponding to the target network point in the current round of iteration; the target path in the current round of iteration is a path that starts from the initial network point, sequentially passes through the target network points in the previous rounds of iteration before the current round of iteration and the target network point in the current round of iteration, and then reaches the transfer yard from the target network point in the current round of iteration; determine the remaining duration of the shift of the target path in the current round of iteration according to the difference between the shift duration and the total transportation duration; with the constraint that the remaining duration of the shift of the target path in the current round of iteration is greater than or equal to the preset duration, select, according to the second transportation durations between the network points in the cluster, the network point with the shortest second transportation duration between it and the target network point in the current round of iteration from the remaining network points in the cluster as the target network point in the next round of iteration; the remaining network points refer to the network points in the cluster except the target network points in the current round of iteration and the previous rounds of iteration; return to determine the total transportation duration of the target path in the current round of iteration according to the second transportation durations between the target network points in the current round of iteration and the previous rounds of iteration, and the first transportation duration corresponding to the target network point in the current round of iteration to enter the next round of iteration, and use the next round of iteration as the new current round of iteration; determine the target path in the last round of iteration as the transportation path of a transport vehicle in the transportation shift.

[0088] In some embodiments, the path planning module 206 is further configured to, if there are remaining network points outside the target path in the cluster, use the remaining network points as the network points in the updated cluster, and return to sequentially select network points from the network points in the cluster according to the second transportation durations between the network points in the cluster with the constraint that the remaining duration of the shift of the target path is greater than or equal to the preset duration to connect into the corresponding target path to obtain a new target path; determine the new target path as the transportation path of another transport vehicle in the transportation shift.

[0089] In some embodiments, the path planning module 206 is further configured to, if all the network points in the cluster have been selected and the transportation attribute of the last selected network point is round-trip, determine whether the remaining duration of the shift of the target path is greater than or equal to the sum of the round-trip duration and the preset duration; the round-trip duration is the transportation duration required for the transport vehicle to return from the transfer yard to the last network point and then return from the last network point to the transfer yard; if so, determine the target path plus the round-trip path corresponding to the last network point as the transportation path of a transport vehicle in the transportation shift; the round-trip path corresponding to the last network point is the path that returns from the transfer yard to the last network point and then returns from the last network point to the transfer yard.

[0090] In some embodiments, the path planning module 206 is further configured to determine the transportation attributes of each network point according to the transportation shift duration and the first transportation duration corresponding to each network point.

[0091] In some embodiments, the path planning module 206 is further configured to perform at least one of the following: for each network point, if the first transportation duration corresponding to the network point is less than or equal to one-third of the transportation shift duration, determine that the transportation attribute of the network point is round-trip; for each network point, if the first transportation duration corresponding to the network point is greater than one-third of the transportation shift duration, determine that the transportation attribute of the network point is non-round-trip.

[0092] In some embodiments, as Figure 3 shown, the logistics transportation path planning device 200 further includes:

[0093] A path optimization module 208, configured to, if all the network points in the clustering cluster have been selected, select new network points from the remaining clustering clusters closer to the transfer station than the clustering cluster with the constraint that the remaining duration of the shift of the updated target path is greater than or equal to a preset duration; determine the path that sequentially passes through each selected network point, then from the last selected network point to the new network point, and then from the new network point to the transfer station as the updated target path; return to select new network points from the remaining clustering clusters closer to the transfer station than the clustering cluster to iteratively optimize the target path with the constraint that the remaining duration of the shift of the updated target path is greater than or equal to a preset duration; and determine the target transportation paths corresponding to each transportation vehicle in the transportation shift according to the total transportation costs of each target path determined for each clustering cluster in previous optimizations, where the target paths in one optimization that meet the preset conditions are the target transportation paths corresponding to each transportation vehicle in the transportation shift.

[0094] In some embodiments, the path optimization module 208 is further configured to use an optimization algorithm to replace the network points in the transportation paths of each transportation vehicle in the determined transportation shift to obtain new transportation paths; compare the total transportation costs of the determined transportation paths and the new transportation paths, and determine the target transportation paths of each transportation vehicle in the transportation shift according to the comparison result.

[0095] In some embodiments, the path planning module 206 is further configured to perform at least one of the following: if the timeliness attribute of the transportation shift is high timeliness, determine that the preset duration is the minimum remaining duration corresponding to the transportation shift; if the timeliness attribute of the transportation shift is general timeliness, determine that the preset duration is zero.

[0096] The above-mentioned logistics transportation route planning device determines the first transportation duration from each network point to the transfer yard and the second transportation duration between each pair of network points. Based on each first transportation duration, it clusters each network point to obtain multiple clustering clusters. For each clustering cluster, with the constraint that the remaining duration of the target route is greater than or equal to the preset duration, it sequentially selects network points from the network points in the clustering cluster according to the second transportation duration between the network points in the clustering cluster to connect into the corresponding target route. Finally, it determines the target route as the transportation route of a transportation vehicle in the transportation shift, which can enable a transportation vehicle to pass through as many network points in the clustering cluster as possible to transport the goods of these network points to the transfer yard, thereby reducing the total number of transportation vehicles used to complete the goods transportation of all network points and lowering the cost of logistics transportation.

[0097] Each module in the above-mentioned logistics transportation route planning device can be implemented in whole or in part by software, hardware, and their combination. The above-mentioned modules can be embedded in the processor of the computer device in hardware form or be independent of it, or can be stored in the memory of the computer device in software form, so as to facilitate the processor to call and execute the operations corresponding to each of the above-mentioned modules.

[0098] In some embodiments, a computer device is provided. This computer device can be a server, and its internal structure diagram can be as Figure 4 shown. This computer device includes a processor, a memory, and a network interface connected through a system bus. Among them, the processor of this computer device is used to provide computing and control capabilities. The memory of this computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of this computer device is used to store data. The network interface of this computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, it realizes a logistics transportation route planning method.

[0099] In other embodiments, a computer device is provided. This computer device can be a terminal, and its internal structure diagram can be as Figure 5As shown in the figure. The computer device includes a processor, a memory, a communication interface, a display screen, and an input device connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage medium. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be achieved through WIFI, a mobile cellular network, NFC (Near Field Communication), or other technologies. When the computer program is executed by the processor, it implements a method for planning a logistics transportation route. The display screen of the computer device can be a liquid crystal display screen or an electronic ink display screen. The input device of the computer device can be a touch layer covered on the display screen, or a button, a trackball, or a touchpad provided on the computer device housing, or an external keyboard, touchpad, or mouse, etc.

[0100] Those skilled in the art can understand that Figure 4 or Figure 5 the structure shown in the figure is only a block diagram of some structures related to the solution of this application, and does not constitute a limitation on the computer device to which the solution of this application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine some components, or have different component arrangements.

[0101] In one embodiment, a computer device is provided, including a memory and a processor. A computer program is stored in the memory. When the processor executes the computer program, the steps in the above method embodiments are implemented.

[0102] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by the processor, the steps in the above method embodiments are implemented.

[0103] In one embodiment, a computer program product is provided, including a computer program. When the computer program is executed by the processor, the steps in the above method embodiments are implemented.

[0104] It should be noted that the data involved in this application (including but not limited to data for analysis, stored data, displayed data, etc.) are all data authorized by users or fully authorized by all parties.

[0105] Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be completed by instructing relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above methods. Among them, any reference to a memory, database, or other medium used in the embodiments provided in the present application can include at least one of non-volatile and volatile memories. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM), etc. The databases involved in the embodiments provided in the present application can include at least one of relational databases and non-relational databases. Non-relational databases can include distributed databases based on blockchain, etc., without limitation. The processors involved in the embodiments provided in the present application can be general-purpose processors, central processors, graphics processors, digital signal processors, programmable logic devices, data processing logics based on quantum computing, etc., without limitation.

[0106] The technical features of the above embodiments can be combined arbitrarily. For the sake of brevity of description, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, it should be considered as the scope described in this specification.

[0107] The above-described embodiments merely represent several implementation manners of the present application. The description thereof is relatively specific and detailed, but it should not be construed as a limitation on the patent scope of the present application. It should be noted that for those of ordinary skill in the art, without departing from the concept of the present application, several modifications and improvements can still be made, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the appended claims.

Claims

1. A method for planning a logistics transportation route, characterized in that, The method includes: Determining the first transportation duration from each network point to the transfer yard and the second transportation duration between each pair of the network points; Clustering each of the network points according to the first transportation durations to obtain a plurality of clustering clusters; For each of the clustering clusters, with the constraint that the remaining duration of the shift of the target path is greater than or equal to a preset duration, selecting network points from the network points in the clustering cluster in sequence according to the second transportation durations between the network points in the clustering cluster to connect into the corresponding target path; the target path is a path that sequentially passes through the selected network points and then reaches the transfer yard from the last selected network point; the remaining duration of the shift is the remaining duration in the transportation shift after the transportation through the target path; Determining the target path as the transportation path of a transportation vehicle in the transportation shift.

2. The method according to claim 1, wherein The step of, with the constraint that the remaining duration of the shift of the target path is greater than or equal to a preset duration, selecting network points from the network points in the clustering cluster in sequence according to the second transportation durations between the network points in the clustering cluster to connect into the corresponding target path includes: Selecting an initial network point from the network points in the clustering cluster and taking the initial network point as the target network point in the first round of iteration; In each round of iteration, determining the total transportation duration of the target path in the current round of iteration according to the second transportation durations between the target network points in the current round of iteration and the previous rounds of iteration and the first transportation duration corresponding to the target network point in the current round of iteration; the target path in the current round of iteration is a path that starts from the initial network point, sequentially passes through the target network points in the previous rounds of iteration before the current round of iteration and the target network point in the current round of iteration, and then reaches the transfer yard from the target network point in the current round of iteration; Determining the remaining duration of the shift of the target path in the current round of iteration according to the difference between the transportation shift duration and the total transportation duration; With the constraint that the remaining duration of the shift of the target path in the current round of iteration is greater than or equal to a preset duration, selecting, according to the second transportation durations between the network points in the clustering cluster, the network point with the shortest second transportation duration between the remaining network points in the clustering cluster and the target network point in the current round of iteration as the target network point in the next round of iteration; the remaining network points refer to the network points in the clustering cluster except the target network points in the current round of iteration and the previous rounds of iteration; Returning to determine the total transportation duration of the target path in the current round of iteration according to the second transportation durations between the target network points in the current round of iteration and the previous rounds of iteration and the first transportation duration corresponding to the target network point in the current round of iteration to enter the next round of iteration, and taking the next round of iteration as the new current round of iteration; The step of determining the target path as the transportation path of a transportation vehicle in the transportation shift includes: Determining the target path in the last round of iteration as the transportation path of a transportation vehicle in the transportation shift.

3. The method according to claim 1, wherein After the step of determining the target path as the transportation path of a transportation vehicle in the transportation shift, the method further includes: If there are remaining network points outside the target path in the clustering cluster, then use the remaining network points as the network points in the updated clustering cluster, and return to select network points from the network points in the clustering cluster in sequence according to the second transportation duration between the network points in the clustering cluster with the constraint that the remaining duration of the shift of the target path is greater than or equal to the preset duration to form the corresponding target path, so as to obtain a new target path; Determine the new target path as the transportation path of another transportation vehicle in the transportation shift.

4. The method according to claim 1, wherein The determining the target path as the transportation path of a transportation vehicle in the transportation shift includes: If all the network points in the clustering cluster have been selected and the transportation attribute of the last selected network point is round-trip, then determine whether the remaining duration of the shift of the target path is greater than or equal to the sum of the round-trip duration and the preset duration; the round-trip duration is the transportation duration required for the transportation vehicle to return from the transfer yard to the last network point and then return from the last network point to the transfer yard; If so, determine the target path plus the round-trip path corresponding to the last network point as the transportation path of a transportation vehicle in the transportation shift; the round-trip path corresponding to the last network point is the path from the transfer yard to the last network point and then back from the last network point to the transfer yard.

5. The method according to claim 4, characterized in that, Before the step of if all the network points in the clustering cluster have been selected and the transportation attribute of the last selected network point is round-trip, then determine whether the remaining duration of the shift of the target path is greater than or equal to the round-trip duration, the method further includes: Determine the transportation attribute of each network point according to the transportation shift duration and the first transportation duration corresponding to each network point.

6. The method according to claim 5, characterized in that, The determining the transportation attribute of each network point according to the transportation shift duration and the first transportation duration corresponding to each network point includes at least one of the following: For each network point respectively, if the first transportation duration corresponding to the network point is less than or equal to one-third of the transportation shift duration, then determine the transportation attribute of the network point as round-trip; For each network point respectively, if the first transportation duration corresponding to the network point is greater than one-third of the transportation shift duration, then determine the transportation attribute of the network point as non-round-trip.

7. The method according to any one of claims 1 to 6, characterized in that The determining the target path as the transportation path of a transportation vehicle in the transportation shift includes: If all the network points in the clustering cluster have been selected, then select additional network points from the remaining clustering clusters closer to the transfer yard than the clustering cluster with the constraint that the remaining duration of the updated target path is greater than or equal to the preset duration; Determine the path that sequentially passes through the selected network points, then from the last selected network point to the additional network point, and then from the additional network point to the transfer yard as the updated target path; Return to select additional network points from the remaining clustering clusters closer to the transfer yard than the clustering cluster to iteratively optimize the target path with the constraint that the remaining duration of the updated target path is greater than or equal to the preset duration; According to the total transportation costs of each target path determined for each of the clustering clusters in previous optimizations, determine the target transportation paths corresponding to each transportation vehicle in the transportation schedule from the target paths in one optimization where the total transportation costs meet the preset conditions.

8. The method according to any one of claims 1 to 6, characterized in that, The method further includes: Using an optimization algorithm, replace the network points in the transportation paths of each transportation vehicle in the determined transportation schedule to obtain new transportation paths; Compare the total transportation costs of the determined transportation paths and the new transportation paths, and determine the target transportation paths of each transportation vehicle in the transportation schedule according to the comparison results.

9. The method according to any one of claims 1 to 6, characterized in that, The method further includes at least one of the following: If the timeliness attribute of the transportation schedule is high timeliness, determine the preset duration as the minimum remaining duration corresponding to the transportation schedule; If the timeliness attribute of the transportation schedule is general timeliness, determine the preset duration as zero.

10. A logistics transportation route planning device, characterized in that, The device includes: A transportation duration determination module, configured to determine the first transportation duration from each network point to the transfer yard and the second transportation duration between each of the network points; A clustering module, configured to cluster each of the network points according to each of the first transportation durations to obtain a plurality of clustering clusters; A path planning module, for each of the clustering clusters, with the constraint that the remaining duration of the target path is greater than or equal to the preset duration, sequentially select network points from the network points in the clustering cluster according to the second transportation duration between the network points in the clustering cluster to connect into the corresponding target path; the target path is the path that sequentially passes through the selected network points and then reaches the transfer yard from the last selected network point; the remaining duration of the schedule is the remaining duration in the transportation schedule after the transportation through the target path; determine the target path as the transportation path of a transportation vehicle in the transportation schedule.

11. A computer device, comprising a memory and a processor, the memory storing a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 9.

12. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the steps of the method according to any one of claims 1 to 9.

Images