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

Abstract

The present application relates to a logistics transportation path planning method and apparatus, a computer device, and a storage medium. The method comprises: determining first transportation durations from service points to a transit hub and second transportation durations among the service points (102); clustering the service points on the basis of the first transportation durations to obtain a plurality of clusters (104); for each cluster, taking the remaining shift duration of a target path being greater than or equal to a preset duration as a constraint, on the basis of the second transportation durations among the service points in the clusters, sequentially selecting service points from among the service points in the clusters to connect the service points to form a corresponding target path, wherein the target path is a path formed by sequentially passing through the selected service points and then reaching the transit hub from the last selected service point, and the remaining shift duration is the remaining duration in a transportation shift after completing transportation along the target path (106); and determining the target path as a transportation path of a transport vehicle in the transportation shift (108).

Description

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

[0001] Related applications

[0002] This application claims priority to Chinese patent application number 202311872329.2, filed on December 30, 2023, entitled “Logistics Transportation Path Planning Method, Device, Computer Equipment and Storage Medium,” the entire text of which is hereby incorporated by reference. Technical Field

[0003] The present application relates to the fields of computer technology and logistics technology, and in particular to a logistics transportation route planning method, device, computer equipment and storage medium. Background Art

[0004] In the logistics industry, goods, parcels, and express shipments from various distribution centers must be transported to a transit point for centralized transportation. This often requires route planning to improve transportation efficiency. However, traditional logistics route planning methods often simply search for the optimal route while ignoring the actual situation, resulting in high logistics transportation costs. Summary of the Invention

[0005] According to various embodiments of the present application, a logistics transportation path planning method, apparatus, computer equipment, computer-readable storage medium, and computer program product are provided.

[0006] In a first aspect, the present application provides a method for logistics transportation route planning. The method comprises:

[0007] Determining a first transportation time from each network point to the transfer station and a second transportation time between each network point;

[0008] Clustering the network points according to the first transport times to obtain a plurality of clusters;

[0009] For each of the clusters, with the remaining shift duration of the target route being greater than or equal to a preset duration as a constraint, nodes are sequentially selected from each node in the cluster according to the second transport duration between each node in the cluster to form a corresponding target route; the target route is a route that passes through each selected node in sequence and then reaches the transfer station from the last selected node; the remaining shift duration is the duration remaining in the transport route after transport along the target route;

[0010] The target path is determined as a transport path of a transport vehicle in the transport shift.

[0011] According to one embodiment, the method of sequentially selecting nodes from each node in the cluster to connect to form a corresponding target path based on the second transportation time between each node in the cluster, with the remaining duration of the target path being greater than or equal to a preset duration as a constraint, includes:

[0012] With the remaining shift duration of the target route being greater than or equal to a preset duration as a constraint, firstly, an initial node is selected from the cluster;

[0013] Continuing with the constraint that the remaining duration of the target route is greater than or equal to the preset duration, the network point with the shortest transportation time between the network points in the cluster is selected one by one according to the second transportation time between the network points in the cluster;

[0014] Connect the selected points in sequence into the corresponding target path.

[0015] According to one embodiment, the method of sequentially selecting nodes from each node in the cluster to connect to form a corresponding target path based on the second transportation time between each node in the cluster, with the remaining duration of the target path being greater than or equal to a preset duration as a constraint, includes:

[0016] Selecting an initial network point from each network point in the cluster;

[0017] Using the initial network point as the target network point in the first round of iteration;

[0018] In each iteration, the total transport duration of the target route in the current iteration is determined based on the second transport durations between the target nodes in the current iteration and previous iterations, and the first transport durations corresponding to the target nodes in the current iteration. The target route in the current iteration is a path that starts from the initial node, passes through the target nodes in the iterations before the current iteration and the target node in the current iteration, and then reaches the transfer station from the target node in the current iteration.

[0019] Determine the remaining duration of the target route in the current iteration according to the difference between the transport shift duration and the total transport duration;

[0020] With the remaining duration of the target route in the current iteration being greater than or equal to a preset duration as a constraint, the node with the shortest second transit time to the target node in the current iteration is selected from the remaining nodes in the cluster based on the second transit time between the nodes in the cluster as the target node in the next iteration; the remaining nodes are nodes in the cluster excluding the target node in the current iteration and previous iterations;

[0021] Returning the second transport durations between the target nodes in the current iteration and previous iterations, and the first transport durations corresponding to the target nodes in the current iteration, determining a total transport duration for the target path in the current iteration to enter the next iteration, and setting the next iteration as the new current iteration;

[0022] Determining the target path as the transport path of a transport vehicle in the transport shift includes:

[0023] The target path in the last round of iteration is determined as the transport path of a transport vehicle in the transport shift.

[0024] According to one embodiment, after determining the target path as the transport path of a transport vehicle in the transport shift, the method further includes:

[0025] In the case that there are remaining network points outside the target path in the cluster, the remaining network points are used as updated network points in the cluster;

[0026] Returning the constraint that the remaining shift duration of the target route is greater than or equal to the preset duration, sequentially selecting nodes from each node in the cluster according to the second transport duration between each node in the cluster to connect to form a corresponding target route, so as to obtain a new target route;

[0027] The new target path is determined as the transport path of another transport vehicle in the transport shift.

[0028] According to one embodiment, determining the target path as the transport path of a transport vehicle in the transport shift includes:

[0029] When all nodes in the cluster have been selected and the transportation attribute of the last selected node is round trip, determining whether the remaining duration of the target route 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 site to the last node and then return from the last node to the transfer site;

[0030] If the judgment result is yes, the target path is added to the round-trip path corresponding to the last network point to determine the transport path of a transport vehicle in the transport shift; the round-trip path corresponding to the last network point is the path from the transfer station back to the last network point, and then from the last network point back to the transfer station.

[0031] According to one embodiment, when all the nodes in the cluster have been selected and the transportation attribute of the last selected node is round trip, before determining whether the remaining duration of the target route is greater than or equal to the round trip duration, the method further includes:

[0032] The transportation attributes of each of the network points are determined according to the transportation shift duration and the first transportation duration corresponding to each of the network points.

[0033] According to one embodiment, determining the transport attribute of each of the network points based on the transport shift duration and the first transport duration corresponding to each of the network points includes at least one of the following:

[0034] For each of the network points, if the first transportation duration corresponding to the network point is less than or equal to one third of the transportation shift duration, determining the transportation attribute of the network point as round trip;

[0035] For each of the network points, when the first transportation duration corresponding to the network point is greater than one third of the transportation shift duration, the transportation attribute of the network point is determined to be non-round trip.

[0036] According to one embodiment, determining the target path as the transport path of a transport vehicle in the transport shift includes:

[0037] When all the network points in the cluster have been selected, a new network point is selected from the remaining clusters that are closer to the transfer station than the cluster, with the remaining shift duration of the updated target route being greater than or equal to the preset duration as a constraint;

[0038] Determine the path that passes through each selected network point in sequence, then from the last selected network point to the newly added network point, and then from the newly added network point to the transfer station as the updated target path;

[0039] Returning the constraint that the remaining duration of the shift of the updated target route is greater than or equal to the preset duration, selecting new network points from the remaining clusters that are closer to the transfer station than the cluster, so as to iteratively optimize the target route;

[0040] According to the total transportation cost of each target path determined for each cluster in previous optimizations, each target path in an optimization whose total transportation cost meets the preset conditions is determined as the target transportation path corresponding to each transportation vehicle in the transportation shift.

[0041] According to one embodiment, the method includes:

[0042] Starting from the outermost cluster in the outer ring, traverse the clusters in the inner ring layer by layer;

[0043] For each of the traversed clusters, executing the constraint that the remaining duration of the target route is greater than or equal to the preset duration, and selecting nodes from each of the nodes in the cluster according to the second transportation duration between each node in the cluster to connect to form a corresponding target route;

[0044] When all the network points in the cluster have been selected, the remaining shift duration of the updated target route is greater than or equal to the preset duration, and new network points are selected from the remaining clusters that are closer to the transfer station than the cluster;

[0045] The updated target path is determined as a path that passes through each selected network point in sequence, then from the last selected network point to the newly added network point, and then from the newly added network point to the transfer station;

[0046] The target path is iteratively optimized by selecting new network points from the remaining clusters that are closer to the transfer station than the cluster, with the remaining shift duration of the updated target path being greater than or equal to the preset duration as a constraint.

[0047] According to one embodiment, the newly added network point selected is a network point in a first cluster closest to the cluster among the remaining clusters that are closer to the transfer site than the cluster.

[0048] According to one embodiment, the newly added network point is a network point in the remaining clusters that are closer to the transfer site than the cluster, in the first cluster closest to the cluster, and having the shortest second transportation time between the network point and the last network point.

[0049] According to one embodiment, the method further comprises:

[0050] Using an optimization algorithm, replacing the nodes in the transport route of each transport vehicle in the determined transport shift to obtain a new transport route;

[0051] comparing the total transportation costs of the determined transportation route and the new transportation route;

[0052] The target transport path of each transport vehicle in the transport shift is determined according to the comparison result.

[0053] According to one embodiment, the method further comprises at least one of the following:

[0054] When the timeliness attribute of the transport flight is high timeliness, determining the preset duration as the minimum remaining duration corresponding to the transport flight;

[0055] When the timeliness attribute of the transport flight is general timeliness, determining the preset time length to be zero;

[0056] The high timeliness means that the transport shift requires the transport vehicle to arrive at the transfer yard in advance before the end of the shift; the general timeliness means that the transport shift does not require the transport vehicle to arrive at the transfer yard in advance before the end of the shift.

[0057] According to one embodiment, the method further comprises:

[0058] For each of the plurality of clusters, executing the steps of sequentially selecting nodes from each of the clusters to connect to form a corresponding target path based on the second transport time between each node in the cluster, with the remaining duration of the target path being greater than or equal to a preset duration as a constraint, to obtain a plurality of target paths;

[0059] The plurality of target paths are respectively determined as transport paths corresponding to respective transport vehicles in the transport shift; and each transport vehicle travels on one target path respectively.

[0060] In a second aspect, the present application also provides a logistics transportation route planning device. The device includes:

[0061] A transport time determination module, configured to determine a first transport time from each outlet to the transfer station and a second transport time between the outlets;

[0062] a clustering module, configured to cluster the network points according to the first transport durations to obtain a plurality of clusters;

[0063] A path planning module is used to, for each of the clusters, take the remaining shift duration of the target path as a constraint that is greater than or equal to a preset duration, and select nodes from each node in the cluster in sequence according to the second transportation duration between each node in the cluster to form a corresponding target path; the target path is a path that passes through each selected node in sequence and then reaches the transfer site from the last selected node; the remaining shift duration is the duration remaining in the transport shift after transportation along the target path; and the target path is determined as the transport path of a transport vehicle in the transport shift.

[0064] In a third aspect, the present application further provides a computer device. The computer device includes a memory and a processor, wherein the memory stores a computer program, and when the computer program is executed by the processor, the processor executes the steps of the logistics transportation route planning method described in each embodiment of the present application.

[0065] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, causes the processor to execute the steps of the logistics transportation route planning method described in each embodiment of the present application.

[0066] In a fifth aspect, the present application further provides a computer program product, which includes a computer program that, when executed by a processor, causes the processor to execute the steps of the logistics transportation route planning method described in each embodiment of the present application.

[0067] The details of one or more embodiments of the present application are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the present application will become apparent from the description, drawings, and claims. BRIEF DESCRIPTION OF THE DRAWINGS

[0068] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the conventional technology, the following briefly introduces the drawings required for use in the embodiments or the conventional technology descriptions. Obviously, the drawings described below are merely embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on the disclosed drawings without any creative work.

[0069] FIG1 is a flow chart of a method for logistics transportation route planning according to an embodiment;

[0070] FIG2 is a structural block diagram of a logistics transportation path planning device according to an embodiment;

[0071] FIG3 is a structural block diagram of a logistics transportation path planning device in another embodiment;

[0072] FIG4 is a diagram showing the internal structure of a computer device according to one embodiment;

[0073] FIG5 is a diagram showing the internal structure of a computer device in another embodiment. DETAILED DESCRIPTION

[0074] The following will be combined with the drawings in the embodiments of this application to clearly and completely describe the technical solutions in the embodiments of this application. Obviously, the embodiments described are only part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0075] In some embodiments, as shown in FIG1 , a logistics transportation route planning method is provided. This embodiment illustrates the method by applying it to a computer device, which may be a terminal or a server. The terminal may be, but is not limited to, various personal computers, laptops, smartphones, tablets, IoT devices, and portable wearable devices. IoT devices may include smart speakers, smart TVs, smart air conditioners, and smart car devices. Portable wearable devices may include smart watches, smart bracelets, and head-mounted devices. The server may be implemented as a standalone server or a server cluster consisting of multiple servers.

[0076] In this embodiment, the method includes the following steps:

[0077] Step 102: Determine a first transportation time from each network point to the transfer station and a second transportation time between each network point.

[0078] A distribution point is a location in logistics where goods are delivered and received. A transit point is a location where goods are collected, distributed, and transferred. Goods can include at least one of express mail and parcels. The first transit time refers to the time required for a transport vehicle to travel from a distribution point to the transit point. Each distribution point has its own corresponding first transit time. The second transit time refers to the time required for a transport vehicle to travel from one distribution point to another. Any two distribution points have a corresponding second transit time.

[0079] In some embodiments, the computer device can determine a first transportation time from each node to the transfer station and a second transportation time between nodes based on historical route information and the locations of each node and transfer station. The historical route information may include information such as the transportation time of past transportation routes and the locations of the starting and ending locations.

[0080] In some embodiments, when the historical route information contains the transportation time corresponding to the transportation path from the network point to the transfer yard, the computer device can directly determine the transportation time as the first transportation time from the network point to the transfer yard. When the historical route information does not contain the transportation time corresponding to the transportation path from the network point to the transfer yard, the computer device can make a prediction based on the location of the network point and the transfer yard to obtain the first transportation time from the network point to the transfer yard. Similarly, when the historical route information contains the transportation time corresponding to the transportation path between the first network point and the second network point, the computer device can directly determine the transportation time as the second transportation time between the first network point and the second network point. When the historical route information does not contain the transportation time corresponding to the transportation path between the first network point and the second network point, the computer device can make a prediction based on the location of the first network point and the second network point to obtain the second transportation time between the first network point and the second network point.

[0081] Step 104 : clustering the network points according to the first transport durations to obtain a plurality of clusters.

[0082] In some embodiments, the computer device may cluster the network points using methods such as a k-means algorithm, a KNN algorithm (k-nearest neighbor algorithm), or a decision tree.

[0083] In some embodiments, the computer device may cluster each network point based on the first transportation time from each network point to the transfer station, thereby obtaining a plurality of clusters. It is understood that since the clustering is based on the transportation time from the network point to the transfer station, the plurality of clusters are approximately "ring-shaped" clustering results centered on the transfer station, with each cluster corresponding to an approximate "ring."

[0084] Step 106: For each cluster, with the constraint that the remaining duration of the target route is greater than or equal to the preset duration, nodes are selected from each node in the cluster in sequence according to the second transportation duration between each node in the cluster to form a corresponding target route; the target route is a route that passes through each selected node in sequence and then reaches the transfer station from the last selected node; the remaining duration of the route is the duration remaining in the transport route after transport along the target route.

[0085] For example: assuming that for a certain cluster, first select point A from the cluster, assuming that the remaining shift time of the target path from point A to the transfer yard is greater than or equal to the preset time, then continue to select point B from the cluster, assuming that the remaining shift time of the target path from point A to point B to the transfer yard is still greater than or equal to the preset time, then continue to select point C from the cluster, assuming that the remaining shift time of the target path from point A to point B to point C to the transfer yard is still greater than or equal to the preset time, then continue to select point D from the cluster, assuming that the remaining shift time of the target path from point A to point B to point C to the transfer yard is less than the preset time, then the constraint condition is not met, the selection is ended, and the target path from point A to point B to point C to the transfer yard is obtained, and then step 108 is executed to determine the target path from point A to point B to point C to the transfer yard as the transportation path of a transport vehicle in the transportation shift.

[0086] In some embodiments, the computer device can use the remaining shift duration of the target path as a constraint that is greater than or equal to a preset duration, first select an initial point from the cluster, and then, based on the second transportation duration between each point in the cluster, successively select the point with the shortest transportation duration between the previously selected point, and connect the selected points into the corresponding target path.

[0087] In some embodiments, in the process of selecting outlets in sequence, the computer device can determine the current total transportation time based on the second transportation time between the selected outlets and the first transportation time from the last selected outlet to the transfer station, and determine the current remaining time of the shift based on the difference between the transportation shift time and the current total transportation time. With the current remaining time of the shift being greater than or equal to the preset time as a constraint, outlets are selected in sequence from the outlets in the cluster according to the second transportation time between the outlets in the cluster to form a corresponding target path.

[0088] For example, if a transport shift runs from 8:00 to 10:00, the transport shift duration is 2 hours. If the current total transport duration is 1.5 hours, the remaining duration of the current shift is 0.5 hours (i.e., 2 hours - 1.5 hours). If the preset duration is 0.2 hours, the remaining duration of the current shift is greater than the preset duration, and the network point can continue to be selected from the cluster.

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

[0090] It is understood that step 106 is performed for each cluster to obtain multiple target paths, and the computer device can determine the multiple target paths as transportation paths corresponding to each transportation vehicle in the transportation shift. That is, each transportation vehicle travels on a target path.

[0091] In some embodiments, the computer device may obtain the transport shift duration of each transport shift, and execute steps 106 to 108 for each transport shift to obtain the transport path of each transport vehicle in each transport shift.

[0092] The above-mentioned logistics transportation path planning method determines the first transportation time from each network point to the transfer yard and the second transportation time between each network point. According to each first transportation time, each network point is clustered to obtain multiple clusters. For each cluster, the remaining time of the target path is greater than or equal to the preset time. According to the second transportation time between each network point in the cluster, the network points are selected from each network point in the cluster in turn to form the corresponding target path. Finally, the target path is determined as the transportation path of a transport vehicle in the transport shift, which enables a transport vehicle to pass through as many 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 transportation of goods of all network points and reducing the cost of logistics transportation.

[0093] In some embodiments, with the remaining shift duration of the target path being greater than or equal to a preset duration as a constraint, points are sequentially selected from each point in the cluster according to the second transport duration between each point in the cluster to form a corresponding target path, including: selecting an initial point from each point in the cluster, and using the initial point as the target point in the first round of iteration; in each round of iteration, determining the total transport duration of the target path in the current round of iteration according to the second transport duration between each target point in the current round of iteration and previous rounds of iteration, and the first transport duration corresponding to the target point in the current round of iteration; the target path in the current round of iteration is a path starting from the initial point, sequentially passing through the target points in each round of iteration before the current round of iteration and the target point in the current round of iteration, and then reaching the transfer station from the target point in the current round of iteration; determining the remaining shift duration of the target path in the current round of iteration according to the difference between the transport shift duration and the total transport duration. Remaining time; taking the remaining duration of the target path in the current iteration as a constraint that is greater than or equal to the preset duration, according to the second transportation duration between each network point in the cluster cluster, select the network point with the shortest second transportation duration between the target network point in the current iteration from the remaining network points in the cluster cluster as the target network point in the next iteration; the remaining network points refer to the network points in the cluster cluster except the target network points in the current iteration and previous iterations; return the second transportation duration between each target network point in the current iteration and previous iterations, and the first transportation duration corresponding to the target network point in the current iteration, determine the total transportation duration of the target path in the current iteration to enter the next iteration, and use the next iteration as the new current iteration; determine the target path as the transportation path of a transport vehicle in the transportation shift, including: determining the target path in the last iteration as the transportation path of a transport vehicle in the transportation shift.

[0094] In some embodiments, the computer device may select any one of the nodes in the cluster as the initial node.

[0095] In some embodiments, the computer device may add up the second transport time between each target node in the current iteration and previous iterations, and the first transport time corresponding to the target node in the current iteration to obtain the total transport time of the target path in the current iteration.

[0096] In some embodiments, selecting the network point with the shortest second transportation time to the target network point in the current iteration from the remaining network points in the cluster as the target network point in the next iteration includes: sorting the remaining network points according to the second transportation time between them and the target network point in the current iteration, and selecting the network point with the shortest second transportation time to the target network point in the current iteration as the target network point in the next iteration based on the sorting result.

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

[0098] In the above embodiment, in each round of iteration, the network point with the shortest second transportation time between it and the target network point in the previous round of iteration is selected from the cluster as the target network point in the current round of iteration, and the remaining shift time of the target path in the current round of iteration is constrained to be greater than or equal to the preset time. This enables a transport vehicle to pass through as many adjacent networks in the cluster as possible and transport the goods of these networks to the transfer site, thereby reducing the total number of transport vehicles used to complete the transportation of goods to all networks and reducing the cost of logistics transportation.

[0099] In some embodiments, after the target path is determined to be the transport path of a transport vehicle in the transport shift, the method further includes: when there are remaining nodes outside the target path in the cluster cluster, the remaining nodes are used as the nodes in the updated cluster cluster, and the remaining duration of the target path shift is constrained to be greater than or equal to the preset duration. According to the second transport duration between the nodes in the cluster cluster, nodes are selected from the nodes in the cluster cluster in turn to form a corresponding target path to obtain a new target path; and the new target path is determined as the transport path of another transport vehicle in the transport shift.

[0100] In some embodiments, after obtaining a new target path, if there are still remaining points in the cluster, the execution continues to return to the constraint that the remaining duration of the target path shift is greater than or equal to the preset duration, and points are selected from each point in the cluster in turn according to the second transportation duration between each point in the cluster to form a corresponding target path to obtain a new target path, until there are no remaining points in the cluster, and each obtained target path is determined as the transportation path corresponding to each transport vehicle in the transportation shift.

[0101] It can be understood that, assuming that a certain cluster contains outlets A, outlets B, outlets C, outlets D and outlets E, outlets A, outlets B and outlets C are selected in sequence from the certain cluster with the constraint that the remaining shift time of the target path is greater than or equal to the preset time, and after obtaining the target path of outlets A-outlet B-outlet C-transfer station, there are remaining outlets in the cluster outside the target path, namely outlets D and outlets E. The computer device can continue to select outlets from outlets D and outlets E in sequence to form a new target path with the constraint that the remaining shift time of the target path is greater than or equal to the preset time, until there are no remaining outlets in the cluster.

[0102] In the above embodiment, when there are remaining nodes outside the target path in the cluster, the remaining shift duration of the target path is still constrained to be greater than or equal to the preset duration, and nodes are selected from the remaining nodes in sequence to form a new target path. This allows a transport vehicle to pass through as many adjacent nodes in the cluster as possible and transport the goods of these nodes to the transfer yard, thereby reducing the total number of transport vehicles used to complete the transportation of goods to all nodes and reducing the cost of logistics transportation.

[0103] In some embodiments, the target path is determined as the transport path of a transport vehicle in a transport shift, including: when all the nodes in the cluster have been selected and the transport attribute of the last selected node is round trip, whether the remaining shift time of the target path is greater than or equal to the sum of the round trip time and the preset time; the round trip time is the transport time required for the transport vehicle to return from the transfer yard to the last node and then return to the transfer yard from the last node; if the judgment result is yes, the target path plus the round trip path corresponding to the last node is determined as the transport path of a transport vehicle in the transport shift; the round trip path corresponding to the last node is the path from the transfer yard back to the last node and then from the last node back to the transfer yard.

[0104] The transportation attribute indicates whether the first transportation time from the outlet to the transfer station supports round trip travel within the transportation schedule. Transportation attributes can include round trip and non-round trip. A round trip transportation attribute indicates that the first transportation time from the outlet to the transfer station supports round trip travel within the transportation schedule. A non-round trip transportation attribute indicates that the first transportation time from the outlet to the transfer station does not support round trip travel within the transportation schedule.

[0105] In some embodiments, the round trip time may be twice the first transportation time from the last node to the transfer station.

[0106] In some embodiments, when the preset duration is zero, all nodes in the cluster have been selected, and the transportation attribute of the last selected node is round-trip, a determination is made as to whether the remaining duration of the target route is greater than or equal to the round-trip duration. If so, the target route plus the round-trip route corresponding to the last node is determined as the transportation route for a transport vehicle in the transport shift.

[0107] For example, suppose a cluster contains nodes A, B, C, D, and E. If node A-node B-node C-transfer depot is selected as a target route, node A-node B-node C-transfer depot is determined as the transport route for a transport vehicle. Next, node D-node E-transfer depot is selected as a target route. Since all nodes in the cluster have been selected after node E is selected, and node E's transport attribute is round-trip, the computer device can determine whether the remaining duration of the target route node D-node E-transfer depot is greater than or equal to the sum of the round-trip duration and the preset duration. If the determination is yes, the route node D-node E-transfer depot-node E-transfer depot is determined as the transport route for a transport vehicle in the transport shift. The round-trip duration is the time required to return from the transfer depot to node E and then return from node E to the transfer depot.

[0108] In the above embodiment, when all the outlets in the cluster have been selected and the transportation attribute of the last outlet selected is round trip, it is determined whether the remaining time of the target path is greater than or equal to the sum of the round trip time and the preset time. If the judgment result is yes, the target path plus the round trip path corresponding to the last outlet is determined as the transportation path of a transport vehicle in the transport shift, so that the transport vehicles that have arrived at the transfer yard to complete the transportation in the transport shift can return to the outlet with the round trip transportation attribute to transport the goods. Since the outlet with the round trip transportation attribute is close to the transfer yard, it is only necessary to arrange the vehicles that have completed the transportation in the transport shift to return to the outlet for transportation, without the need to arrange additional transport vehicles. Therefore, the total number of transport vehicles used to complete the transportation of goods to all outlets can be reduced, thereby reducing the cost of logistics transportation.

[0109] In some embodiments, when all outlets in the cluster have been selected and the transportation attribute of the last selected outlet is round-trip, before determining whether the remaining shift time of the target path is greater than or equal to the round-trip time, the method also includes: determining the transportation attribute of each outlet based on the transportation shift time and the first transportation time corresponding to each outlet.

[0110] In some embodiments, the computer device may compare the first transportation time from the network point to the transfer station with one-third of the transportation time of the shift for each network point, and determine the transportation attribute of the network point based on the comparison result.

[0111] In the above embodiment, the transportation attribute of each network point is determined based on the transportation shift duration and the first transportation duration corresponding to each network point, so that the transportation attribute of the network point can be accurately determined.

[0112] The transportation attributes of each outlet are determined based on the transportation schedule and the first transportation duration corresponding to each outlet, including at least one of the following: for each outlet, when the first transportation duration corresponding to the outlet is less than or equal to one-third of the transportation schedule, the transportation attribute of the outlet is determined to be round trip; for each outlet, when the first transportation duration corresponding to the outlet is greater than one-third of the transportation schedule, the transportation attribute of the outlet is determined to be non-round trip.

[0113] In some embodiments, when the preset duration is not zero, and the first transportation duration corresponding to the outlet is less than or equal to one-third of the difference between the transportation shift duration and the preset duration, the transportation attribute of the outlet is determined to be round trip; when the first transportation duration corresponding to the outlet is greater than one-third of the difference between the transportation shift duration and the preset duration, the transportation attribute of the outlet is determined to be non-round trip.

[0114] In the above embodiment, for each outlet, when the first transportation time corresponding to the outlet is less than or equal to one-third of the transportation shift time, the transportation attribute of the outlet is determined to be round trip; when the first transportation time corresponding to the outlet is greater than one-third of the transportation shift time, the transportation attribute of the outlet is determined to be non-round trip, which can accurately determine the transportation attributes of each outlet.

[0115] In some embodiments, the target path is determined as the transport path of a transport vehicle in a transport shift, including: when all the network points in the cluster cluster have been selected, with the remaining shift duration of the updated target path being greater than or equal to the preset duration as a constraint, a new network point is selected from the remaining cluster clusters that are closer to the transfer yard than the cluster cluster; a path that passes through the selected network points in sequence, then from the last selected network point to the new network point, and then from the new network point to the transfer yard is determined as the updated target path; returning to the remaining shift duration of the updated target path being greater than or equal to the preset duration as a constraint, a new network point is selected from the remaining cluster clusters that are closer to the transfer yard than the cluster cluster to iteratively optimize the target path; based on the total transportation cost of each target path determined for each cluster cluster in previous optimizations, each target path in an optimization whose total transportation cost meets the preset conditions is determined as the target transportation path corresponding to each transport vehicle in the transport shift.

[0116] It can be understood that the remaining clusters that are closer to the transfer site than the cluster are clusters in the inner ring that are closer to the cluster.

[0117] In some embodiments, the computer device may start from the outermost cluster in each cluster, and traverse the inner clusters layer by layer. For each traversed cluster, the computer device may execute a constraint that the remaining shift time of the target path is greater than or equal to the preset time. According to the second transportation time between each network point in the cluster, network points are selected from each network point in the cluster to form a corresponding target path. When all network points in the cluster have been selected, the computer device may continue to select new network points from the remaining clusters that are closer to the transfer yard than the cluster, with the constraint that the remaining shift time of the updated target path is greater than or equal to the preset time. The computer device may determine the path that 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 yard as the updated target path. The computer device may return to the constraint that the remaining shift time of the updated target path is greater than or equal to the preset time, and select new network points from the remaining clusters that are closer to the transfer yard than the cluster to iteratively optimize the target path.

[0118] In some embodiments, the newly added network point selected may be a network point in the first cluster that is closest to the cluster among the remaining clusters that are closer to the transfer site. In some embodiments, the newly added network point selected may be a network point in the first cluster that is closest to the cluster among the remaining clusters that are closer to the transfer site and that has the shortest second transport time with the last network point.

[0119] In some embodiments, multiple new network points can be sequentially selected based on the constraint that the remaining duration of the updated target route is greater than or equal to a preset duration. The multiple new network points selected can all be network points in the first cluster that is closest to the cluster among the remaining clusters that are closer to the transfer site than the cluster. The multiple new network points selected can also partially be network points in the first cluster that is closest to the cluster among the remaining clusters that are closer to the transfer site than the cluster, and partially be network points in the cluster that is closer to the transfer site than the first cluster.

[0120] In some embodiments, the total transportation cost may be the total number of transportation vehicles required to be used in a transportation shift or the total distance required to be traveled in a transportation shift.

[0121] In some embodiments, the computer device may determine each target path in an optimization with the lowest total transportation cost among all previous optimizations as the target transportation path corresponding to each transportation vehicle in the transportation shift.

[0122] For example, cluster 1, cluster 2, and cluster 3 are clusters from the outermost ring to the innermost ring, respectively. Cluster 1 contains points A, B, and C, cluster 2 contains points D and E, and cluster 3 contains points F, G, and H. Assume that points A, B, and C are selected from cluster 1 in sequence to form the target path Point A-Point B-Point C-transfer site, points D and E are selected from cluster 2 in sequence to form the target path Point D-Point E-transfer site, and points F, G, and H are selected from cluster 3 in sequence to form the target path Point F-Point G-Point H-transfer site. The three target paths of "Point A-Point B-Point C-transfer site", "Point D-Point E-transfer site", and "Point F-Point G-Point H-transfer site" are respectively determined as the transportation paths corresponding to each transport vehicle in the transport shift as the initial solutions. During the optimization process, after selecting points A, B, and C from cluster 1 to form the target path, since all the points 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 points can be selected from cluster 2. Assuming that point D is selected from cluster 2, the target path is connected as point A-point B-point C-point D-transfer station, and then points are selected from cluster 2 in sequence. Obviously, point E will be selected. Then, since all the points in cluster 2 have been selected, If the remaining duration of the shift corresponding to the target route is greater than or equal to the preset duration, additional nodes can be selected from cluster 3. For example, if node F is selected from cluster 3, the target path is node E-node F-transfer station. Nodes are then sequentially selected from cluster 3 to form the target path node G-node H-transfer station, resulting in the optimized target paths "node A-node B-node C-node D-transfer station," "node E-node F-transfer station," and "node G-node H-transfer station," which serve as the optimized solution. Optimization can then continue. For example, after sequentially selecting nodes A, B, and C from cluster 1 to form the target path, two additional nodes can be sequentially selected from cluster 2. The computer can compare the total transportation costs corresponding to the initial solution and the previously optimized solutions, and determine the target paths from the solution with the lowest total transportation cost as the transportation paths corresponding to each transport vehicle in the transport shift.

[0123] In the above embodiment, when all the outlets in the cluster have been selected, with the constraint that the remaining shift time of the updated target route is greater than or equal to the preset time, new outlets are selected from the remaining clusters that are closer to the transfer yard than the cluster, so that a transport vehicle can pass through as many nearby outlets as possible and transport the goods of these outlets to the transfer yard, thereby reducing the total transportation cost of logistics transportation.

[0124] In some embodiments, the method further includes: using an optimization algorithm to replace the nodes in the transport path of each transport vehicle in the determined transport shift to obtain a new transport path; comparing the total transport cost of the determined transport path and the new transport path, and determining the target transport path of each transport vehicle in the transport shift based on the comparison result.

[0125] In some embodiments, the optimization algorithm may be an ant colony algorithm, a genetic algorithm, a maximum neighbor algorithm, or the like.

[0126] In some embodiments, the replacement mesh point may be one or more.

[0127] In some embodiments, the computer device may determine, based on the comparison result, the transport route with the lowest total transport cost as the target transport route for each transport vehicle in the transport shift.

[0128] In the above embodiment, the optimization algorithm is used as the mutation factor of the initial solution, so that a more optimal transportation route can be determined, the effect of route planning is improved, and the cost of logistics transportation is reduced to a greater extent.

[0129] In some embodiments, the method further includes at least one of the following: when the timeliness attribute of the transport shift is high timeliness, determining the preset duration as the minimum remaining duration corresponding to the transport shift; when the timeliness attribute of the transport shift is general timeliness, determining the preset duration as zero.

[0130] High time efficiency refers to a transport shift requiring vehicles to arrive at the transfer depot before the shift ends. Minimum remaining time for a transport shift refers to the minimum amount of time a transport shift requires vehicles to arrive at the transfer depot before the shift ends, i.e., the minimum time required to arrive at the transfer depot before the shift ends. Normal time efficiency refers to a transport shift not requiring vehicles to arrive at the transfer depot before the shift ends, meaning that vehicles can arrive at the transfer depot on time.

[0131] In some embodiments, when the time efficiency attribute of the transport shift is high, for each cluster, the remaining time of the target path is constrained to be greater than or equal to the minimum remaining time corresponding to the transport shift, and according to the second transport time between each node in the cluster, nodes are selected in turn from each node in the cluster to form the corresponding target path.

[0132] In some embodiments, when the time efficiency attribute of the transport shift is general time efficiency, for each cluster, with the constraint that the remaining time of the target route is greater than or equal to zero, points are selected in turn from each point in the cluster according to the second transport time between each point in the cluster to form a corresponding target route.

[0133] In the above embodiment, the remaining duration of the target route in the transport shifts with different time requirements is constrained to different degrees, so that the route planning can be performed flexibly to meet the requirements of different transport shifts.

[0134] It should be understood that, although the steps in the flowcharts of the above embodiments are shown in sequence as indicated by the arrows, these steps are not necessarily performed in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and these steps can be performed in other orders. Moreover, at least a portion of the steps in the flowcharts of the above embodiments may include multiple steps or multiple stages, and these steps or stages are not necessarily performed at the same time, but can be performed at different times. The execution order of these steps or stages is not necessarily to be performed in sequence, but can be performed in turn or alternately with other steps or at least a portion of steps or stages in other steps.

[0135] Based on the same inventive concept, embodiments of the present application also provide a logistics transport route planning device for implementing the logistics transport route planning method described above. The solution to the problem provided by this device is similar to the solution described in the method described above. Therefore, the specific limitations of one or more logistics transport route planning device embodiments provided below can be found in the above-mentioned limitations of the logistics transport route planning method and will not be repeated here.

[0136] In some embodiments, as shown in FIG2 , a logistics transportation path planning device 200 is provided, comprising: a transportation duration determination module 202 , a clustering module 204 , and a path planning module 206 , wherein:

[0137] The transport duration determining module 202 is used to determine a first transport duration from each network point to the transfer station and a second transport duration between each network point;

[0138] A clustering module 204 is configured to cluster the network points according to the first transport durations to obtain a plurality of clusters;

[0139] The path planning module 206 is used to select nodes from each node in the cluster in sequence to form a corresponding target path based on the second transportation time between each node in the cluster, with the constraint that the remaining shift time of the target path is greater than or equal to the preset duration. The target path is a path that passes through each selected node in sequence and then reaches the transfer station from the last selected node. The remaining shift time is the remaining time in the transport shift after transporting along the target path. The target path is determined as the transport path of a transport vehicle in the transport shift.

[0140] In some embodiments, the path planning module 206 is further configured to select an initial point from each point in the cluster, and use the initial point as the target point in the first round of iteration; in each round of iteration, the total transport time of the target path in the current round of iteration is determined based on the second transport time between each target point in the current round of iteration and the previous rounds of iteration, and the first transport time corresponding to the target point in the current round of iteration; the target path in the current round of iteration is a path starting from the initial point, passing through the target points in the previous rounds of iteration and the target point in the current round of iteration, and then reaching the transfer station from the target point in the current round of iteration; the remaining shift time of the target path in the current round of iteration is determined based on the difference between the transport shift time and the total transport time; the target path in the current round of iteration is calculated based on the difference between the transport shift time and the total transport time. The remaining duration of the shift is greater than or equal to the preset duration as a constraint. According to the second transportation time between each network point in the cluster, the network point with the shortest second transportation time between the target network point in the current iteration is selected from the remaining network points in the cluster as the target network point in the next iteration; the remaining network points refer to the network points in the cluster except the target network points in the current iteration and previous iterations; the second transportation time between each target network point in the current iteration and previous iterations, and the first transportation time corresponding to the target network point in the current iteration are returned to determine the total transportation time of the target path in the current iteration to enter the next iteration, and the next iteration is used as the new current iteration; the target path in the last iteration is determined as the transportation path of a transport vehicle in the transport shift.

[0141] In some embodiments, the path planning module 206 is also used to, when there are remaining nodes outside the target path in the cluster cluster, use the remaining nodes as the nodes in the updated cluster cluster, return the constraint that the remaining duration of the target path shift is greater than or equal to the preset duration, and select nodes from the nodes in the cluster cluster in turn according to the second transportation duration between the nodes in the cluster cluster to connect into the corresponding target path to obtain a new target path; and determine the new target path as the transportation path of another transport vehicle in the transportation shift.

[0142] In some embodiments, the path planning module 206 is also used to determine whether the remaining duration of the target path is greater than or equal to the sum of the round-trip time and the preset time when all the nodes in the cluster have been selected and the transportation attribute of the last selected node is round-trip; the round-trip time is the transportation time required for the transport vehicle to return from the transfer yard to the last node and then return to the transfer yard from the last node; if the judgment result is yes, the target path plus the round-trip path corresponding to the last node is determined as the transportation path of a transport vehicle in the transport shift; the round-trip path corresponding to the last node is the path from the transfer yard back to the last node and then from the last node back to the transfer yard.

[0143] In some embodiments, the route planning module 206 is further configured to determine the transportation attributes of each network point based on the transportation shift duration and the first transportation duration corresponding to each network point.

[0144] In some embodiments, the path planning module 206 is also used to perform at least one of the following: for each outlet, when the first transportation time corresponding to the outlet is less than or equal to one-third of the transportation shift time, determine the transportation attribute of the outlet as round trip; for each outlet, when the first transportation time corresponding to the outlet is greater than one-third of the transportation shift time, determine the transportation attribute of the outlet as non-round trip.

[0145] In some embodiments, as shown in FIG3 , the logistics transportation path planning device 200 further includes:

[0146] The path optimization module 208 is used to select new nodes from the remaining clusters that are closer to the transfer yard than the cluster, with the constraint that the remaining duration of the updated target path is greater than or equal to the preset duration, when all nodes in the cluster have been selected; determine the path that passes through the selected nodes in sequence, then from the last selected node to the new node, and then from the new node to the transfer yard as the updated target path; return to iteratively optimize the target path by selecting new nodes from the remaining clusters that are closer to the transfer yard than the cluster, with the constraint that the remaining duration of the updated target path is greater than or equal to the preset duration; and determine, based on the total transportation cost of each target path determined for each cluster in previous optimizations, each target path in an optimization whose total transportation cost meets the preset conditions as the target transportation path corresponding to each transportation vehicle in the transportation shift.

[0147] In some embodiments, the path optimization module 208 is also used to use an optimization algorithm to replace the nodes in the transportation path of each transport vehicle in the determined transportation shift to obtain a new transportation path; compare the total transportation cost of the determined transportation path and the new transportation path, and determine the target transportation path of each transport vehicle in the transportation shift based on the comparison result.

[0148] In some embodiments, the path planning module 206 is also used to perform at least one of the following: when the timeliness attribute of the transport shift is high timeliness, determine the preset duration as the minimum remaining duration corresponding to the transport shift; when the timeliness attribute of the transport shift is general timeliness, determine the preset duration as zero.

[0149] The above-mentioned logistics transportation path planning device determines the first transportation time from each network point to the transfer yard and the second transportation time between each network point, and clusters each network point according to each first transportation time to obtain multiple clusters. For each cluster cluster, the remaining time of the target path shift is greater than or equal to the preset time. According to the second transportation time between each network point in the cluster cluster, network points are selected from each network point in the cluster cluster in turn to form a corresponding target path, and finally the target path is determined as the transportation path of a transport vehicle in the transport shift, which enables a transport vehicle to pass through as many network points in the cluster 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 transportation of goods of all network points and reducing the cost of logistics transportation.

[0150] Each module in the aforementioned logistics and transportation route planning device can be implemented in whole or in part through software, hardware, or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in the computer device in the form of software, so that the processor can call and execute the corresponding operations of each module.

[0151] In some embodiments, a computer device is provided, which may be a server, and its internal structure diagram may be as shown in FIG4 . The computer device includes a processor, a memory, and a network interface connected via a system bus. 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, 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 the computer device is used to store data. The network interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, a method for logistics transportation path planning is implemented.

[0152] In other embodiments, a computer device is provided, which may be a terminal, and its internal structure diagram may be as shown in Figure 5. The computer device includes a processor, memory, a communication interface, a display screen, and an input device connected via a system bus. 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 a computer program. The internal memory provides an environment for the operation of the operating system and computer program in the non-volatile storage medium. The communication interface of the computer device is used to communicate with an external terminal via wired or wireless communication, and the wireless communication may be achieved via Wi-Fi, a mobile cellular network, NFC (near-field communication), or other technologies. When the computer program is executed by the processor, a method for logistics transportation route planning is implemented. The display screen of the computer device may be a liquid crystal display or an electronic ink display screen. The input device of the computer device may be a touch layer covering the display screen, or may be buttons, a trackball, or a touchpad provided on the computer device housing, or may be an external keyboard, touchpad, or mouse.

[0153] Those skilled in the art will understand that the structure shown in Figure 4 or Figure 5 is merely a block diagram of a partial structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0154] In one embodiment, a computer device is provided, including a memory and a processor. The memory stores a computer program, and the processor implements the steps in the above method embodiments when executing the computer program.

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

[0156] In one embodiment, a computer program product is provided, including a computer program, which implements the steps in the above method embodiments when executed by a processor.

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

[0158] Those skilled in the art will appreciate that all or part of the processes in the above-mentioned embodiment methods can be implemented by instructing the relevant hardware through a computer program, and 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-mentioned methods. Among them, any reference to memory, database or other media used in the embodiments provided in this application may include at least one of non-volatile and volatile memory. Non-volatile memory may include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory may 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). The database involved in the various embodiments provided herein may include at least one of a relational database and a non-relational database. Non-relational databases may include, but are not limited to, distributed databases based on blockchains. The processor involved in the various embodiments provided herein may be, but are not limited to, a general-purpose processor, a central processing unit, a graphics processing unit, a digital signal processor, a programmable logic unit, a data processing logic unit based on quantum computing, and the like.

[0159] The technical features of the above-mentioned embodiments can be combined arbitrarily. In order to make the description concise, not all possible combinations of the technical features in the above-mentioned embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0160] The above-described embodiments merely represent several implementation methods of the present application. While the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the patent application. It should be noted that a person of ordinary skill in the art may make various modifications and improvements without departing from the spirit of the present application, and these modifications and improvements fall within the scope of protection of the present application. Therefore, the scope of protection of the present patent application shall be determined by the appended claims.

Claims

1. A method for planning a logistics transportation route, characterized in that, The method includes: Determining a first transportation duration from each network point to the transfer yard and a 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, according to the second transportation durations between the network points in the clustering cluster, successively select network points from the network points in the clustering cluster to form a corresponding target path; the target path is a path that successively 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, characterized in that, 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, according to the second transportation durations between the network points in the clustering cluster, successively select network points from the network points in the clustering cluster to form a corresponding target path includes: With the constraint that the remaining duration of the shift of the target path is greater than or equal to a preset duration, first select an initial network point from the clustering cluster; Continue with the constraint that the remaining duration of the shift of the target path is greater than or equal to a preset duration, and successively select the network point with the shortest transportation duration from the previously selected network point according to the second transportation durations between the network points in the clustering cluster; Connect the successively selected network points to form a corresponding target path.

3. 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, according to the second transportation durations between the network points in the clustering cluster, successively select network points from the network points in the clustering cluster to form a corresponding target path includes: Select an initial network point from the network points in the clustering cluster; Taking 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, successively 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 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, according to the second transportation durations between the network points in the clustering cluster, select the network point with the shortest second transportation duration from the remaining network points in the clustering cluster to 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; Return the total transportation duration of the target path in the current iteration based on the second transportation durations between each pair of target network points in the current iteration and previous iterations, as well as the first transportation duration corresponding to the target network point in the current iteration, to enter the next iteration, and use the next iteration as the new current iteration; The step of determining the target path as the transportation path of a transportation vehicle in the transportation schedule includes: Determine the target path in the last iteration as the transportation path of a transportation vehicle in the transportation schedule.

4. The method according to claim 1, wherein After determining the target path as the transportation path of a transportation vehicle in the transportation schedule, the method further includes: In the case where 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. Return the step of, with the constraint that the remaining duration of the target path's schedule is greater than or equal to a preset duration, sequentially select network points from the network points in the cluster according to the second transportation durations 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 transportation vehicle in the transportation schedule.

5. The method according to claim 1, characterized in that, The step of determining the target path as the transportation path of a transportation vehicle in the transportation schedule includes: When 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 target path's schedule 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 back from the last network point to the transfer yard; When the judgment result is yes, determine the result of adding the round-trip path corresponding to the last network point to the target path as the transportation path of a transportation vehicle in the transportation schedule; 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.

6. The method according to claim 5, wherein Before determining whether the remaining duration of the target path's schedule is greater than or equal to the round-trip duration when all the network points in the cluster have been selected and the transportation attribute of the last selected network point is round-trip, the method further includes: Determine the transportation attribute of each network point according to the transportation schedule duration and the first transportation duration corresponding to each network point.

7. The method according to claim 6, wherein The step of determining the transportation attribute of each network point according to the transportation schedule duration and the first transportation duration corresponding to each network point includes at least one of the following: For each network point, when the first transportation duration corresponding to the network point is less than or equal to one-third of the transportation schedule duration, determine the transportation attribute of the network point as round-trip; For each network point, when the first transportation duration corresponding to the network point is greater than one-third of the transportation schedule duration, determine the transportation attribute of the network point as non-round-trip.

8. The method according to any one of claims 1 to 7, characterized in that Determining the target path as the transportation path of a transportation vehicle in the transportation shift includes: When all the network points in the clustering cluster have been selected, taking the remaining shift duration of the updated target path being greater than or equal to the preset duration as a constraint, select additional 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 each selected network point, 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 that are closer to the transfer yard than the clustering cluster with the constraint that the remaining shift duration of the updated target path is greater than or equal to the preset duration, so as to iteratively optimize the target path; According to the total transportation costs of the target paths determined for each clustering cluster in previous optimizations, determine the target transportation paths corresponding to each transportation vehicle in the transportation shift for the target paths that meet the preset conditions in one optimization.

9. The method according to claim 8, characterized in that, Including: Start from the clustering cluster in the outermost outer ring and traverse layer by layer in sequence to the clustering clusters in the inner ring; For each traversed clustering cluster respectively, execute with the constraint that the remaining shift duration of the target path is greater than or equal to the preset duration, and sequentially select network points from the network points in the clustering cluster to connect into the corresponding target path according to the second transportation duration between the network points in the clustering cluster; When all the network points in the clustering cluster have been selected, with the constraint that the remaining shift duration of the updated target path is greater than or equal to the preset duration, continue to select additional 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 each selected network point, 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 that are closer to the transfer yard than the clustering cluster with the constraint that the remaining shift duration of the updated target path is greater than or equal to the preset duration, so as to iteratively optimize the target path.

10. The method according to claim 8, characterized in that Wherein, The selected additional network points are the network points in the first clustering cluster that is the closest to the clustering cluster among the remaining clustering clusters that are closer to the transfer yard than the clustering cluster.

11. The method according to claim 10, wherein Wherein, The selected additional network points are the network points in the first clustering cluster that is the closest to the clustering cluster among the remaining clustering clusters that are closer to the transfer yard than the clustering cluster and have the shortest second transportation duration with the last network point.

12. The method according to any one of claims 1 to 7, characterized in that, The method further includes: Using an optimization algorithm to replace the network points in the determined transportation paths of each transportation vehicle in the transportation shift to obtain new transportation paths; Compare the total transportation costs of the determined transportation paths and the new transportation paths; Determine the target transportation paths of each transportation vehicle in the transportation shift according to the comparison result.

13. The method according to any one of claims 1 to 7, characterized in that, The method further includes at least one of the following: When the timeliness attribute of the transportation shift is high timeliness, determine the preset duration as the minimum remaining duration corresponding to the transportation shift; When the timeliness attribute of the transportation shift is general timeliness, determine the preset duration as zero; Among them, the high timeliness indicates that the transportation schedule requires the transport vehicle to arrive at the transfer yard in advance before the end time of the schedule; the general timeliness indicates that the transportation schedule does not require the transport vehicle to arrive at the transfer yard in advance before the end time of the schedule.

14. The method according to any one of claims 1 to 7, characterized in that The method further includes: For multiple clustering clusters, respectively perform the step of connecting the selected points into the corresponding target path in sequence from each point in the clustering cluster according to the second transportation duration between each point in the clustering cluster, with the constraint that the remaining duration of the schedule of the target path is greater than or equal to the preset duration, to obtain multiple target paths; Determine the multiple target paths as the transportation paths respectively corresponding to each transport vehicle in the transportation schedule; each transport vehicle corresponds to one target path respectively.

15. 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 point to the transfer yard and the second transportation duration between each of the points; A clustering module, configured to cluster each of the points according to each of the first transportation durations to obtain multiple clustering clusters; A path planning module, configured to, for each of the clustering clusters, with the constraint that the remaining duration of the schedule of the target path is greater than or equal to the preset duration, connect the selected points into the corresponding target path in sequence from each point in the clustering cluster according to the second transportation duration between each point in the clustering cluster; the target path is the path that sequentially passes through each selected point and then reaches the transfer yard from the last selected 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 transport vehicle in the transportation schedule.

16. 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 14.

17. 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 14.

Images