Logistics line generation method and device, equipment and storage medium

Abstract

The invention relates to the technical field of logistics, in particular to a logistics line generation method and device, equipment and a storage medium. The method comprises the steps of determining at least one potential place based on a geographic position and a logistics cargo quantity corresponding to at least one place in a preset geographic area; constructing at least one candidate annular logistics route based on the first geographic position, the first delivery time and the first logistics cargo quantity corresponding to each potential place; and on the basis of the second logistics cargo quantity corresponding to the space-time node in each candidate annular logistics route, an optimal annular logistics route is screened out from the candidate annular logistics routes, and the optimal annular logistics route is used for guiding cargo transportation in the preset geographic area. According to the method and the device, the optimal annular logistics route can be generated in a relatively small preset geographic area, and effective improvement of cargo transportation timeliness is realized.

Description

Technical Field

[0001] The present application relates to the field of logistics technology, and specifically to a logistics route generation method, device, equipment and storage medium. Background Art

[0002] The land transportation networks of major logistics companies today typically employ a multi-tiered "hub-and-spoke" structure. This involves selecting nodes throughout the network as hubs at each level, and assigning subordinate nodes to one or more hubs within each layer of the network. When a batch of express parcels needs to be transported from node A to node B, it typically follows a route structured like "A - Hub 1 - Hub 2... - Hub B." Because the transport needs of a large number of subordinate nodes are aggregated, the transport volume between hubs is generally large, resulting in economies of scale and, consequently, reducing transportation costs. However, this "hub-and-spoke" structure presents significant shortcomings for transporting goods between locations within a smaller geographic area, such as between smaller cities within a given region. Due to the relatively small volume of goods between smaller cities, delivery often requires multiple hub transfers, each of which involves time-consuming steps such as unloading, sorting, and loading, significantly compromising delivery time. From the consumer's perspective, express parcels between cities within 200 kilometers of each other may have to travel a significant distance, taking more than one or two days to reach their recipients. This phenomenon clearly violates consumer expectations for delivery time and significantly reduces the customer experience.

[0003] Logistics companies have traditionally attempted to address this issue by adding direct or stopover routes. However, due to insufficient cargo volume between small cities, adding direct routes results in low vehicle loading rates, resulting in poor cost-effectiveness. On stopover routes, each stop takes a long time, increasing the risk of poor delivery times. Furthermore, adding direct or stopover routes can only address the flow of goods to certain cities and is insufficient to meet the transportation needs of multiple small, closely spaced locations within a single geographic area. Therefore, improving the delivery timeliness of goods within a smaller geographic area remains an urgent challenge. Summary of the Invention

[0004] Based on the above-mentioned defects and shortcomings of the existing technology, the present application proposes a logistics route generation method, device, equipment and storage medium, which can generate an optimal circular logistics route within a smaller preset geographical area, thereby effectively improving the timeliness of cargo transportation.

[0005] According to a first aspect of an embodiment of the present application, a logistics route generation method is provided, comprising: determining at least one potential location based on the geographical location and logistics cargo volume corresponding to at least one location in a preset geographical area; constructing at least one candidate circular logistics route based on the first geographical location, first shipping time and first logistics cargo volume corresponding to each potential location, wherein the candidate circular logistics route comprises at least one space-time node, and the space-time node comprises the node geographical location and the second shipping time corresponding to each of the node geographical locations; based on the second logistics cargo volume corresponding to the space-time node in each of the candidate circular logistics routes, selecting the optimal circular logistics route from each of the candidate circular logistics routes, wherein the optimal circular logistics route is used to guide the transportation of goods within the preset geographical area.

[0006] According to the logistics route generation method provided by the first aspect of the embodiment of the present application, the optimal circular logistics route is selected from each of the candidate circular logistics routes based on the second logistics cargo volume corresponding to the time-space node in each of the candidate circular logistics routes, including: based on the second logistics cargo volume corresponding to the time-space node in each of the candidate circular logistics routes, obtaining the time-sensitive transport cargo volume used by each of the candidate circular logistics routes to complete the cargo transportation; based on the time-sensitive transport cargo volume, selecting at least one first circular logistics route from each of the candidate circular logistics routes; through the mutually exclusive loading events between different first circular logistics routes, selecting the optimal circular logistics route from each of the first circular logistics routes, wherein the mutually exclusive loading event means that the same cargo cannot be loaded on different transport vehicles at the same time.

[0007] According to the logistics route generation method provided by the first aspect of the embodiment of the present application, based on the second logistics cargo volume corresponding to the space-time node in each of the candidate circular logistics routes, the time-sensitive transport cargo volume used by each candidate circular logistics route to complete the cargo transportation is obtained, including: respectively configuring the corresponding second logistics cargo volume for each of the space-time nodes in each of the candidate circular logistics routes; based on the second logistics cargo volume corresponding to the space-time node and the time information of the cargo arriving at the space-time node, calculating the predicted time-sensitive transport cargo volume used by each of the candidate circular logistics routes to complete the cargo transportation; obtaining the actual time-sensitive transport cargo volume used by each of the candidate circular logistics routes to complete the cargo transportation; based on the time-sensitive transport cargo volume, screening out at least one first circular logistics route from each of the candidate circular logistics routes, including: determining the candidate circular logistics route whose predicted time-sensitive transport cargo volume is greater than the actual time-sensitive transport cargo volume as the first circular logistics route.

[0008] According to the logistics route generation method provided in the first aspect of the embodiment of the present application, the optimal circular logistics route is screened out from each of the first circular logistics routes through the mutually exclusive loading events between different first circular logistics routes, including: based on the mutually exclusive loading events between the first circular logistics routes, reconfiguring the corresponding mutually exclusive logistics cargo volume for each of the time and space nodes in each of the first circular logistics routes; based on the mutually exclusive logistics cargo volume, calculating the mutually exclusive time-sensitive transport cargo volume used by each of the first circular logistics routes to complete the cargo transportation; and determining the first circular logistics route with the largest mutually exclusive time-sensitive transport cargo volume as the optimal circular logistics route.

[0009] According to the logistics route generation method provided in the first aspect of the embodiment of the present application, the first geographical location, the first shipping time and the first logistics cargo volume corresponding to each potential location are used to construct at least one candidate circular logistics route, including: configuring the corresponding first shipping time for each potential location, and constructing at least one candidate space-time node; based on the candidate geographical location of each candidate space-time node, determining the candidate node distance between each two candidate space-time nodes, wherein the candidate geographical location of the candidate space-time node is obtained based on the first geographical location of the potential location; based on the candidate node distance and the candidate logistics cargo volume corresponding to each candidate space-time node, determining the next candidate space-time node to be reached after the goods are transported from the previous candidate space-time node, until returning to the candidate geographical location of the origin, to obtain at least one candidate circular logistics route, wherein the candidate logistics cargo volume of the candidate space-time node is obtained based on the first logistics cargo volume of the potential location.

[0010] According to the logistics route generation method provided in the first aspect of the embodiment of the present application, the method determines the next candidate space-time node to which the goods arrive after being transported from the previous candidate space-time node based on the candidate node distance and the first logistics cargo volume corresponding to each candidate space-time node, until the goods return to the candidate geographical location of origin, to obtain at least one candidate circular logistics route, including: taking any one of the candidate space-time nodes as the originating space-time node, and performing the following route construction processing: taking the candidate geographical location of the originating space-time node as the cargo originating location, and taking the first shipping time of the originating space-time node as the cargo originating time; based on the candidate node distance, the first logistics cargo volume corresponding to each candidate space-time node, and the first shipping time corresponding to each candidate space-time node, starting from the originating space-time node, determining the next candidate space-time node to which the goods arrive after being transported from the previous candidate space-time node, until the goods return to the cargo originating location, to construct a candidate circular logistics route; traversing all candidate space-time nodes, and performing the route construction processing on all candidate space-time nodes as the originating space-time nodes to obtain at least one candidate circular logistics route.

[0011] According to the logistics route generation method provided in the first aspect of the embodiment of the present application, the method of determining at least one potential location based on the geographical location and logistics cargo volume corresponding to at least one location in a preset geographical area includes: calculating the average distance between each location and other locations based on the geographical location of at least one location in the preset geographical area; screening out n first locations with the smallest average distance from each location, where n is a positive integer; calculating the logistics cargo volume between each of the n first locations and the other locations; and screening out m potential locations with the largest logistics cargo volume from each of the first locations, where m is less than or equal to n and is a positive integer.

[0012] According to a second aspect of an embodiment of the present application, a logistics route generation device is provided, including: a location acquisition module for determining at least one potential location based on the geographical location and logistics cargo volume corresponding to at least one location in a preset geographical area; a route construction module for constructing at least one candidate circular logistics route based on the first geographical location, the first shipping time and the first logistics cargo volume corresponding to each potential location, wherein the candidate circular logistics route includes at least one space-time node, and the space-time node includes the node geographical location and the second shipping time corresponding to each of the node geographical locations; a route screening module for screening out an optimal circular logistics route from each of the candidate circular logistics routes based on the second logistics cargo volume corresponding to the space-time node in each of the candidate circular logistics routes, wherein the optimal circular logistics route is used to guide the transportation of goods within the preset geographical area.

[0013] According to the third aspect of an embodiment of the present application, an electronic device is provided, comprising: a memory and a processor; the memory is connected to the processor and is used to store programs; the processor is used to implement the logistics route generation method as described in the first aspect by running the program in the memory.

[0014] According to a fourth aspect of an embodiment of the present application, a storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the logistics route generation method as described in the first aspect is implemented.

[0015] In an embodiment of the present application, at least one potential location is determined based on the geographical location and logistics cargo volume corresponding to at least one location in a preset geographical area; at least one candidate circular logistics route is constructed based on the first geographical location, first shipping time and first logistics cargo volume corresponding to each potential location, wherein the candidate circular logistics route includes at least one space-time node, and the space-time node includes the node geographical location and the second shipping time corresponding to each node geographical location; based on the second logistics cargo volume corresponding to the space-time node in each candidate circular logistics route, the optimal circular logistics route is screened out from each candidate circular logistics route, wherein the optimal circular logistics route is used to guide the transportation of goods in the preset geographical area. In the above process, in the preset geographical area, candidate circular logistics routes are constructed by screening out each potential location, and the optimal circular logistics route is determined from each candidate circular logistics route, and the optimal circular logistics route is used to guide the transportation of goods in the preset geographical area, thereby avoiding the low timeliness problem brought by traditional transportation routes and improving the timeliness of cargo transportation in the preset geographical area. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. 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 provided drawings without any creative work.

[0017] Figure 1 A flow chart of a logistics route generation method provided in an embodiment of the present application;

[0018] Figure 2 A schematic diagram of a process for constructing a candidate circular logistics route provided in an embodiment of the present application;

[0019] Figure 3 A block diagram of a logistics route generation device provided in an embodiment of the present application;

[0020] Figure 4 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0021] 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.

[0022] Exemplary Methods

[0023] In one embodiment, if Figure 1 As shown, the logistics route generation method is characterized by comprising:

[0024] Step 101: Determine at least one potential location based on the geographical location and logistics cargo volume corresponding to at least one location in a preset geographical area.

[0025] In this embodiment, the preset geographical area refers to an area where logistics routes need to be improved. In particular, the preset geographical area refers to a smaller geographical area, such as the area containing multiple small cities near a provincial boundary. Alternatively, the preset geographical area may refer to the area containing at least one small city within a preset distance of the target provincial boundary. A small city may refer to a city with a population less than a preset population, or a city with a logistics cargo volume less than a preset logistics cargo volume. The preset geographical area generally includes multiple locations. Potential locations refer to a subset of locations selected from all locations within the preset geographical area based on their respective geographical locations and logistics cargo volumes. Optionally, potential locations may refer to locations where, during the freight transportation process, the corresponding cargo must pass through a hub transfer station a number of times greater than or equal to a preset number after entering the preset geographical area. It is understood that if cargo must pass through multiple hub transfer stations after entering the preset geographical area, it indicates that the freight transportation efficiency of the cargo at that location is low, and there is a need for freight transportation route optimization at that location. Specifically, based on the geographical locations corresponding to each location within the preset geographical area, the distance between any two locations can be calculated. Logistics cargo volume refers to the total cargo volume transported at each location. Geographical locations can be directly obtained through research, while cargo volume can be calculated based on historical logistics data for each location. Furthermore, potential locations can be selected from multiple logistics sites within a pre-set geographic area based on both geographic location and cargo volume. If the pre-set geographic area is a small city, using logistics sites within that small city as potential locations is more consistent with actual freight transport conditions. Within the pre-set geographic area, potential locations are relatively close to each other, but cargo volume between them is relatively low. Traditional logistics routes result in high transportation costs and poor timeliness, making them unable to meet logistics needs.

[0026] Step 102: construct at least one candidate circular logistics route based on the first geographical location, the first shipping time, and the first logistics cargo volume corresponding to each potential location, wherein the candidate circular logistics route includes at least one space-time node, and the space-time node includes the node geographical location and the second shipping time corresponding to each node geographical location.

[0027] In this embodiment, the geographical location of the potential location is defined as the first geographical location, the time of shipment of goods at the potential location is defined as the first shipment time, and the logistics cargo volume at the potential location is defined as the first logistics cargo volume. Based on the first geographical location, first shipment time, and first logistics cargo volume corresponding to each potential location, at least one candidate circular logistics route is constructed, that is, the potential locations within the preset geographical area are connected to form a circular logistics route connected end to end, and the starting time and space node and the ending time and space node in the candidate circular logistics route are the same node geographical location. The goods between the various locations are transported by vehicles, and the transport vehicles start from any node geographical location in the candidate circular logistics route, travel along the candidate circular logistics route, and finally return to the starting node geographical location. By constructing a circular logistics route, the problem of low time efficiency caused by traditional logistics routes can be avoided.

[0028] Step 103: Based on the second logistics cargo volume corresponding to the spatiotemporal nodes in each candidate circular logistics route, an optimal circular logistics route is selected from each candidate circular logistics route, wherein the optimal circular logistics route is used to guide the transportation of cargo within a preset geographical area.

[0029] Optionally, the optimal circular logistics route can ensure that each shipment within a pre-set geographic area passes through a hub transfer station fewer than a pre-set number of times during transportation. This means that, after receiving the optimal circular logistics route's guidance, at least one potential location within the pre-set geographic area no longer needs to pass through a hub transfer station multiple times within a small area, significantly improving cargo transportation efficiency. Furthermore, the optimal circular logistics route can ensure that the average number of times all shipments within the pre-set geographic area pass through a hub transfer station fewer than a pre-set number of times during transportation.

[0030] The logistics route generation method provided in the embodiment of the present application can be applied to a terminal and / or a server, that is, steps S101 to S103 can be executed by the terminal and / or the server. The terminal communicates with the server via a network. The data storage system can store data that the server needs to process. The data storage system can be integrated on the server, or placed on the cloud or other network servers. The terminal can be, but is not limited to, various personal computers, laptops, smart phones, tablet computers, Internet of Things devices, and portable wearable devices. The server can be implemented as an independent server or a server cluster consisting of multiple servers.

[0031] In this embodiment, based on the second logistics cargo volume corresponding to the space-time node in each candidate circular logistics route, the optimal circular logistics route is selected from each candidate circular logistics route, and the optimal circular logistics route is used to guide the transportation of goods in the preset geographical area, thereby avoiding the low timeliness problem caused by the transmission and transportation route, and improving the timeliness of the transportation of goods in the preset geographical area. Moreover, the optimal circular logistics route achieves the optimal timeliness and realizes the optimal effect of cargo transportation.

[0032] In one embodiment, at least one potential location is determined based on the geographical location and logistics cargo volume corresponding to at least one location in a preset geographical area, as follows: based on the geographical location of at least one location in the preset geographical area, the average distance of each location from other locations is calculated; from each location, n first locations with the smallest average distance are selected, where n is a positive integer; the logistics cargo volume between each first location and other locations among the n first locations is calculated; and from each first location, m potential locations with the largest logistics cargo volume are selected, where m is less than or equal to n and is a positive integer.

[0033] For example, there are four locations A, B, C and D. The average distance between location A and location B, location C and location D is 5m, the average distance between location B and location A, location C and location D is 7m, the average distance between location C and location A, location B and location D is 5m, and the average distance between location D and location A, location B and location C is 10m. Assuming n is 2, then from the four locations A, B, C and D, the two first locations with the smallest average distance are selected as location A and location C; further, the logistics cargo volume of location A is 100 tons (t), and the logistics cargo volume of location C is 200t. Assuming m is 1, then from the two first locations, the potential location with the largest logistics cargo volume is selected as location C.

[0034] In this embodiment, the average distance between each potential location and all non-potential locations is first calculated. These average distances are then sorted in ascending order, and n first-tier locations with the shortest average distances are selected. Then, for each of the n first-tier locations, the total logistics volume of that location and the other n-1 locations is calculated based on the volume of cargo between any two of them. The total volumes of cargo corresponding to each first-tier location are then sorted in descending order, and the m potential locations with the largest total volumes are selected, where m <= n. These m potential locations are then constructed into a potential location set V. By using both average distance and cargo volume as the two filters, each potential location is identified. The screening process is logically simple and easily programmable.

[0035] In one embodiment, at least one candidate circular logistics route is constructed based on the first geographical location, the first shipping time and the first logistics cargo volume corresponding to each potential location, as follows: a corresponding first shipping time is configured for each potential location, and at least one candidate space-time node is constructed, wherein the candidate shipping time of the candidate space-time node is obtained based on the first shipping time of the potential location; based on the candidate geographical location of each candidate space-time node, the candidate node distance between every two candidate space-time nodes is determined, wherein the candidate geographical location of the candidate space-time node is obtained based on the first geographical location of the potential location; based on the candidate node distance, the sum of the candidate logistics cargo volume corresponding to each candidate space-time node, the next candidate space-time node to which the goods will arrive after being transported from the previous candidate space-time node is determined, until the goods return to the candidate geographical location of the origin, and at least one candidate circular logistics route is obtained, wherein the candidate logistics cargo volume of the candidate space-time node is obtained based on the first logistics cargo volume of the potential location.

[0036] In this embodiment, the historical freight information of potential locations is queried, and the first shipping time of the corresponding transport vehicle can be configured for each potential location. Then, the first geographical location of each potential location is used as the candidate geographical location corresponding to each candidate space-time node, and the first shipping time of each potential location is used as the candidate shipping time corresponding to each candidate space-time node, thereby completing the construction of the candidate space-time node. The first logistics cargo volume of each potential location is used as the candidate logistics cargo volume corresponding to each candidate space-time node. After determining the candidate shipping time and candidate cargo flow of each candidate space-time node, combined with the candidate node distance between any two candidate space-time nodes, each candidate space-time node is used as the first candidate space-time node, and at least one candidate circular logistics route can be obtained.

[0037] In this embodiment, by associating candidate space-time nodes that can carry out circular cargo transportation, as many candidate circular logistics routes as possible are constructed to expand the range of selectable logistics routes. Among them, based on the candidate shipping time of the candidate space-time node, the candidate logistics cargo volume, and the candidate node distance between any two candidate space-time nodes, when determining the candidate space-time node associated with the next stop of cargo transportation for each candidate space-time node, the processing is carried out as much as possible between two candidate space-time nodes with logistics cargo volume and closer distance, so as to conform to the actual transportation scenario and operating environment and improve cargo efficiency. Among them, the candidate node distance between two candidate space-time nodes is calculated based on the candidate geographical locations corresponding to the two candidate space-time nodes.

[0038] In one embodiment, based on the candidate node distance and the first logistics cargo volume corresponding to each candidate space-time node, the next candidate space-time node that the cargo arrives at after being transported from the previous candidate space-time node is determined, until the cargo returns to the candidate geographical location of origin, to obtain at least one candidate circular logistics route, specifically as follows: any candidate space-time node is used as the originating space-time node, and the following route construction processing is performed: the candidate geographical location of the originating space-time node is used as the cargo originating location, and the candidate shipping time of the originating space-time node is used as the cargo originating time; based on the candidate node distance, the candidate logistics cargo volume corresponding to each candidate space-time node, and the candidate shipping time corresponding to each candidate space-time node, starting from the originating space-time node, the next candidate space-time node that the cargo arrives at after being transported from the previous candidate space-time node is determined, until the cargo returns to the cargo originating location, to construct a candidate circular logistics route; all candidate space-time nodes are traversed, and all candidate space-time nodes are used as the originating space-time nodes for route construction processing to obtain at least one candidate circular logistics route.

[0039] In this embodiment, assuming that starting from an arbitrarily selected first candidate space-time node, at the candidate shipping time corresponding to the first candidate space-time node, the cargo of the candidate cargo flow corresponding to the first candidate space-time node is dispatched, combined with the candidate node distances between the first candidate space-time node and other candidate space-time nodes, the second candidate space-time node that the cargo can smoothly reach after starting transportation from the first candidate space-time node can be determined; after the cargo arrives at the second candidate space-time node from one candidate space-time node, the cargo of the candidate cargo flow corresponding to the second candidate space-time node is dispatched at the candidate shipping time corresponding to the second candidate space-time node, combined with the candidate node distances between the second candidate space-time node and other candidate space-time nodes, the third candidate space-time node that the cargo can smoothly reach after starting transportation from the second candidate space-time node can be determined; and so on, the fourth candidate space-time node, the fifth candidate space-time node... can be determined in sequence until returning to the first candidate geographical location of the starting point, and a candidate circular logistics route is obtained. By traversing all candidate space-time nodes, that is, treating each candidate space-time node as the first candidate space-time node and performing the above processing respectively, and treating all candidate space-time nodes as the starting space-time nodes for route construction processing respectively, at least one candidate circular logistics route can be obtained.

[0040] In this embodiment, when constructing spatiotemporal nodes, not only individual potential locations are considered candidate spatiotemporal nodes, but potential locations with associated cargo transportation can also be linked to form candidate spatiotemporal nodes. This allows for the construction of as many candidate circular logistics routes as possible, expanding the range of selectable logistics routes. If the cargo volume between any two potential locations exceeds a preset cargo volume threshold, they are considered to have a cargo transportation connection. If the cargo volume between multiple potential locations is consistently greater than the cargo volume threshold, they are considered to have a cargo transportation connection.

[0041] Specifically, based on the potential location set V obtained in the above embodiment, such as Figure 2 As shown, we use the breadth-first search method to construct as many candidate circular logistics routes as possible. The process is as follows:

[0042] Step 201: Input the potential location set V and the time point set T, where the potential location set V includes all potential locations and the time point set T includes the shipping time corresponding to each potential location. Traverse each potential location o and the corresponding shipping time t o The departure location and departure time.

[0043] Step 202: In each traversal, first construct the search time and space node node, let node.i = o, node.t = t o ,node.route=[(o,t o )]. Let search queue L = [node], feasible solution set That is, the initialized feasible solution F is empty.

[0044] Step 203 , determine whether the current queue L is empty. If so, output the feasible solution set F, that is, output the spatiotemporal bus route set F, and the process ends; if not, execute step 204 .

[0045] Step 204: Take a node from L and do not put it back. Determine whether the current node returns to node o and whether the length of node.route is greater than 1. If so, it means that a loop has been formed. Add the node to the feasible solution set F and execute step 203; if not, execute step 205.

[0046] Step 205: Obtain the set of next available space-time nodes through the distance information between space-time nodes and the logistics cargo volume. For each space-time node j∈S in S, based on the origin time of space-time node j, the shipping time of space-time node j is calculated as t j , construct a new node j , let node j .i=j,node j .t=tj ,node j .route=node.route+[(j,t j )], and node j Add to the search queue L and execute step 203.

[0047] In the above process, a breadth-first search is used in the potential location set V, and the distance information between potential locations and the logistics cargo volume are referred to to guide the search and pruning, and a potential space-time bus route set F is output. The space-time bus route set F includes all candidate circular logistics routes searched through the above process.

[0048] In one embodiment, based on the second logistics cargo volume corresponding to the time-space node in each candidate circular logistics route, the optimal circular logistics route is selected from each candidate circular logistics route, specifically as follows: based on the second logistics cargo volume corresponding to the time-space node in each candidate circular logistics route, the time-efficient transport cargo volume used by each candidate circular logistics route to complete the cargo transportation is obtained; based on the time-efficient transport cargo volume, at least one first circular logistics route is selected from each candidate circular logistics route; through the mutually exclusive loading events between different first circular logistics routes, the optimal circular logistics route is selected from each first circular logistics route, wherein the mutually exclusive loading event means that the same cargo cannot be loaded on different transport vehicles at the same time.

[0049] In this embodiment, after constructing the space-time bus route set F, the optimal circular logistics route is obtained through two screenings. The first time is to complete the time-efficient transport volume used for the transportation of goods through each candidate circular logistics route, ensuring that the first circular logistics route selected has high time efficiency, that is, more goods can be transported in a shorter time through the first circular logistics route. The time-efficient transport volume refers to the volume of goods transported within a preset unit time (for example, 1 day). The time-efficient transport volume used for the transportation of goods by each candidate circular logistics route can be calculated based on the second logistics volume corresponding to the space-time node in each candidate circular logistics route. The second time is through the mutually exclusive loading events between different first circular logistics routes. The mutually exclusive loading event means that the same goods cannot be loaded on different transport vehicles at the same time, thereby ensuring that the calculation process is more in line with the actual operating conditions, further improving the accuracy of the screening, and ensuring the practicality of the optimal circular logistics route obtained by the screening.

[0050] In one embodiment, based on the second logistics cargo volume corresponding to the spatiotemporal nodes in each candidate circular logistics route, the time-efficient transport cargo volume required to complete cargo transportation along each candidate circular logistics route is obtained, specifically as follows: a corresponding second logistics cargo volume is assigned to each spatiotemporal node in each candidate circular logistics route; based on the second logistics cargo volume corresponding to the spatiotemporal node and the time information of the cargo arriving at the spatiotemporal node, the predicted time-efficient transport cargo volume required to complete cargo transportation along each candidate circular logistics route is calculated; and the actual time-efficient transport cargo volume required to complete cargo transportation along each candidate circular logistics route is obtained. Based on the time-efficient transport cargo volume, at least one first circular logistics route is selected from each candidate circular logistics route, specifically as follows: a candidate circular logistics route whose predicted time-efficient transport cargo volume is greater than the actual time-efficient transport cargo volume is determined as the first circular logistics route.

[0051] In this embodiment, based on the spatiotemporal bus route set F obtained in the above embodiment, the corresponding second logistics cargo volume is entered for each candidate circular logistics route after the spatiotemporal bus route set F. For the transportation of cargo between different spatiotemporal nodes, the following conditions must be met in the actual operation environment: the arrival time of the cargo matches the arrival and departure time of the vehicle used for cargo transportation. Specifically, on a candidate circular logistics route, the departure time of the transport vehicle at spatiotemporal node j is t j , for the goods loaded by the transport vehicle from the time-space node j, the earliest arrival time of the goods shall not be earlier than in, Indicates the longest waiting time. The latest arrival time must not be later than in, Represents the shortest processing time. Among them, the longest waiting time and the shortest processing time can be obtained in advance through actual historical data and specific needs. At the same time, through the arrival time of the transport vehicle at each time-space node, the predicted time efficiency of each batch of goods after being transported by the transport vehicle can be predicted, and this time efficiency includes the predicted time efficiency transport volume. The predicted time efficiency transport volume is compared with the actual time efficiency transport volume used to complete the cargo transportation of each candidate circular logistics route. Only when the predicted time efficiency transport volume is greater than the actual time efficiency transport volume of the candidate circular logistics route, that is, only the cargo with the predicted time efficiency not worse than the actual time efficiency can be loaded onto the transport vehicle. The actual time efficiency transport volume can be obtained by querying the historical actual data of cargo transportation. It should be noted that here each batch of goods can be repeatedly loaded onto different selected circular logistics routes in order to obtain the potential maximum time efficiency improvement volume of each selected circular logistics route, so as to obtain the final optimal circular logistics route.

[0052] In one embodiment, the optimal circular logistics route is selected from each first circular logistics route through mutually exclusive loading events between different first circular logistics routes, specifically as follows: based on the mutually exclusive loading events between the first circular logistics routes, the corresponding mutually exclusive logistics cargo volume is reconfigured for each time and space node in each first circular logistics route; based on the mutually exclusive logistics cargo volume, the mutually exclusive time-efficient transportation cargo volume used by each first circular logistics route to complete the cargo transportation is calculated; the first circular logistics route with the largest mutually exclusive time-efficient transportation cargo volume is determined as the optimal circular logistics route.

[0053] In this embodiment, mutually exclusive loading events on different transport vehicles along the same first circular logistics route are considered, and the cargo volume is reallocated. Mutually exclusive loading events mean that the same cargo cannot be loaded onto different transport vehicles at the same time. Based on the above embodiment, it can be seen that the same potential location set V can output multiple first circular logistics routes, and there is a high probability that duplicate logistics routes will appear in each first circular logistics route. For example, for the first circular logistics route o-j1-j2-j3-j4-j5-j6-o, there may be a logistics route corresponding to multiple departure times, and these routes are output as multiple first circular logistics routes. For example, j1-j2-j3-j4-j5-j6-o-j1 and o-j1-j2-j3-j4-j5-j6-o are output as two different first circular logistics routes. The same batch of cargo may be repeatedly loaded onto multiple first circular logistics routes. Therefore, it is necessary to consider mutually exclusive loading events on different transport vehicles along the same logistics route and reallocate the logistics cargo volume. Based on the above embodiments, it can be seen that the multiple first circular logistics routes corresponding to the same logistics route are arranged in descending order according to the predicted time-effective transport cargo volume with improved time efficiency, and then the cargo on each first circular logistics route is cleared, and the corresponding mutually exclusive logistics cargo volume is reconfigured for each time-space node in each first circular logistics route, wherein the mutually exclusive logistics cargo volume refers to the corresponding logistics cargo volume based on satisfying the mutually exclusive loading events, that is, the same cargo in the mutually exclusive logistics cargo volume corresponding to each time-space node cannot be simultaneously loaded on different transport vehicles traveling in the first circular logistics route.

[0054] Each shipment can only use one primary circular logistics route, and multiple shipments cannot be loaded. Finally, the mutually exclusive time-sensitive transport volume for each primary circular logistics route is recalculated. The primary circular logistics route with the largest mutually exclusive time-sensitive transport volume for the pre-defined geographic area is selected and output as the optimal circular logistics route. Specifically, the mutually exclusive time-sensitive transport volume refers to the time-sensitive transport volume that corresponds to the mutually exclusive loading event.

[0055] In a specific embodiment, the logistics route generation methods provided in the above embodiments can be implemented by pre-training an intelligent model to perform data processing and output an optimal circular logistics route. The model can be based on any intelligent model architecture, such as a neural network model or a reinforcement learning model, and can be obtained through training.

[0056] In this embodiment, the input of the model includes:

[0057] (1) Potential location set V;

[0058] (2) Time point set T;

[0059] (3) The running time d of the transport vehicle from potential location i to potential location j ij (i,j∈V);

[0060] (4) The transport demand volume (logistics volume) w from potential location i to potential location j at time t ijt (i, j∈V, t∈T);

[0061] (5) Transportation demand (i, j, t) (i.e., the amount of cargo arriving at potential location i at time t and destined for potential location j) is required at time e to achieve a time efficiency better than the current situation. ijt (i, j∈V, t∈T) before reaching potential location j;

[0062] (6) The time it takes for a transport vehicle to arrive at a certain logistics volume and then depart again (for loading and unloading)

[0063] (7) The shortest processing time from the arrival of goods to the dispatch of transport vehicles That is, if the transport demand (i, j, t) wants to catch up with the transport vehicle sent from potential location i at time t', it needs to satisfy

[0064] (8) The longest waiting time from the arrival of goods to the dispatch of transport vehicles That is, if the transportation demand (i, j, t) wants to catch up with the car sent from potential location i at time t', it needs to satisfy

[0065] The constraints of the model include:

[0066] (1) There is only one potential location selected as the starting location, see formula (2) below;

[0067] (2) Each potential location i can only send out one flow direction at most, that is, after the transport vehicle arrives at the potential location i, the next stop can only choose one potential location, see the following formula (3);

[0068] (3) The inflow and outflow balance constraint of each potential location, that is, the number of flows arriving at potential location i and the number of flows departing from potential location i are equal, see the following formula (4);

[0069] (4) The transport vehicle will have at most one delivery time at each potential location i, see the following formula (5);

[0070] (5) The transport vehicle is dispatched from potential location j at time t, which is necessary if j is the starting location or there is a potential location i such that the transport vehicle is dispatched from potential location j at time td ij -t1 buff Starting from potential location i, the next stop of potential location i is potential location j, see formula (6) below;

[0071] (6) Determine whether the transport demand (i, j, t) can be loaded onto the transport vehicle. The transport vehicle is required to be dispatched at the potential location i at time t'. and Between, see the following formula (7);

[0072] (8) Determine whether the transport demand (i, j, t) can be loaded onto the vehicle, requiring the transport vehicle to arrive at the potential location j within e ijt Previously, the following formula (8) uses the departure time t' from the last potential location k plus d kj to represent the arrival time of potential location j.

[0073] The goal of the model is to maximize the total number of goods with improved timeliness. Due to the existence of constraint (8), all goods that can be transported on the transport vehicle can achieve a timeliness that is better than the current situation. Therefore, the model objective function can be expressed as formula (1). The objective function and constraints of the model are combined and shown as follows:

[0074]

[0075]

[0076]

[0077]

[0078]

[0079]

[0080]

[0081]

[0082] The decision variables are defined as follows:

[0083] zi ∈{0,1} indicates whether node i is selected as the originating node (i∈V)

[0084] x ij ∈{0,1} indicates whether the next node of node i is j (i∈V,j∈V)

[0085] y it ∈{0,1} indicates whether the vehicle departs from node i at time t (i∈V,t∈T)

[0086] v ijt ∈{0,1} indicates whether the transport demand (i,j,t) is loaded on the vehicle (i,j∈V,t∈T)

[0087] The above model makes decisions based on the selection of the originating location, the interconnectedness between potential locations, the departure time from each potential location, and the availability of vehicles for each transport request. Based on the originating location selection and the interconnectedness between potential locations, the arrival and departure time ranges for each potential location can be calculated. Based on the cargo arrival time, the departure time of the transport vehicle at each potential location, and the inferred time efficiency, the availability of each shipment and the corresponding time efficiency improvement can be calculated. The total number of shipments with time efficiency improvements on the shipments can then be calculated, and this is maximized to determine the model's objective function, which outputs the optimal circular logistics route.

[0088] The logistics route generation method provided by the present application determines at least one potential location based on the geographical location and logistics cargo volume corresponding to at least one location in a preset geographical area; constructs at least one candidate circular logistics route based on the first geographical location, first shipping time and first logistics cargo volume corresponding to each potential location, wherein the candidate circular logistics route includes at least one spatiotemporal node, and the spatiotemporal node includes the node geographical location and the second shipping time corresponding to each node geographical location; based on the second logistics cargo volume corresponding to the spatiotemporal node in each candidate circular logistics route, selects the optimal circular logistics route from each candidate circular logistics route, wherein the optimal circular logistics route is used to guide the transportation of goods within the preset geographical area. In the above process, within the preset geographical area, candidate circular logistics routes are constructed by screening out each potential location, and the optimal circular logistics route is determined from each candidate circular logistics route. The optimal circular logistics route is used to guide the transportation of goods within the preset geographical area, thereby avoiding the low timeliness problem caused by traditional transportation routes and improving the timeliness of cargo transportation within the preset geographical area.

[0089] Furthermore, the circular logistics route structure of the present application breaks the "hub-spoke" structure of the existing logistics network, significantly improving the timeliness of goods delivery while controlling transportation costs. By screening potential locations in a preset geographical area in advance and searching for bus routes within the set of potential locations, the situation where the search space is too large is avoided, the difficulty of model search is effectively reduced, and the solution efficiency is improved. Using breadth-first search, candidate circular logistics routes are output, and by repeating the process of loading, sorting, and reloading, more goods are loaded onto circular logistics routes with better timeliness performance, and finally the optimal circular logistics route with the best timeliness performance is output. This method is universally applicable to all logistics scenarios.

[0090] Exemplary devices

[0091] Accordingly, the embodiment of the present application also provides a logistics route generation device, which is applied to the logistics route generation method provided in any of the above embodiments. Figure 3 As shown, the device may include:

[0092] A location acquisition module 301 is configured to determine at least one potential location based on the geographical location and logistics cargo volume corresponding to at least one location in a preset geographical area;

[0093] A route construction module 302 is configured to construct at least one candidate circular logistics route based on the first geographic location, the first shipping time, and the first logistics cargo volume corresponding to each potential location, wherein the candidate circular logistics route includes at least one spatiotemporal node, each of which includes a geographic location of the node and a second shipping time corresponding to each geographic location of the node;

[0094] The route screening module 303 is used to screen out the optimal circular logistics route from each candidate circular logistics route based on the second logistics cargo volume corresponding to the time and space nodes in each candidate circular logistics route, wherein the optimal circular logistics route is used to guide the transportation of goods within a preset geographical area.

[0095] In one embodiment, the route screening module 303 is used to obtain the time-sensitive transport volume used to complete the cargo transportation of each candidate circular logistics route based on the second logistics cargo volume corresponding to the time-space node in each candidate circular logistics route; based on the time-sensitive transport volume, at least one first circular logistics route is screened out from each candidate circular logistics route; through the mutually exclusive loading events between different first circular logistics routes, the optimal circular logistics route is screened out from each first circular logistics route, wherein the mutually exclusive loading event means that the same cargo cannot be loaded on different transport vehicles at the same time.

[0096] In one embodiment, the route screening module 303 is used to configure a corresponding second logistics cargo volume for each space-time node in each candidate circular logistics route; calculate the predicted time-efficient transport cargo volume used to complete the cargo transportation of each candidate circular logistics route based on the second logistics cargo volume corresponding to the space-time node and the time information of the cargo arriving at the space-time node; obtain the actual time-efficient transport cargo volume used to complete the cargo transportation of each candidate circular logistics route; and determine the candidate circular logistics route whose predicted time-efficient transport cargo volume is greater than the actual time-efficient transport cargo volume as the first circular logistics route.

[0097] In one embodiment, the route screening module 303 is used to reconfigure corresponding mutually exclusive logistics cargo volumes for each time and space node in each first circular logistics route based on mutually exclusive loading events between the first circular logistics routes; based on the mutually exclusive logistics cargo volumes, calculate the mutually exclusive time-efficient transport cargo volumes used by each first circular logistics route to complete cargo transportation; and determine the first circular logistics route with the largest mutually exclusive time-efficient transport cargo volume as the optimal circular logistics route.

[0098] In one embodiment, the route construction module 302 configures a corresponding first shipping time for each potential location, constructs at least one candidate space-time node, wherein the candidate shipping time of the candidate space-time node is obtained based on the first shipping time of the potential location; determines the candidate node distance between every two candidate space-time nodes based on the candidate geographical locations of each candidate space-time node, wherein the candidate geographical locations of the candidate space-time nodes are obtained based on the first geographical locations of the potential location; determines the next candidate space-time node to which the goods will arrive after being transported from the previous candidate space-time node based on the candidate node distance, the candidate logistics cargo volume and the candidate shipping time corresponding to each candidate space-time node, until returning to the candidate geographical location of the origin, and obtains at least one candidate circular logistics route, wherein the candidate logistics cargo volume of the candidate space-time node is obtained based on the first logistics cargo volume of the potential location.

[0099] In one embodiment, the route construction module 302 is used to take any candidate space-time node as the starting space-time node and perform the following route construction processing: take the candidate geographical location of the starting space-time node as the starting point of the goods, and take the candidate shipping time of the starting space-time node as the starting time of the goods; based on the candidate node distance, the candidate logistics cargo volume corresponding to each candidate space-time node and the candidate shipping time corresponding to each candidate space-time node, starting from the starting space-time node, determine the next candidate space-time node that the goods arrive at after being transported from the previous candidate space-time node, until returning to the starting point of the goods, and construct a candidate circular logistics route; traverse all candidate space-time nodes, and perform route construction processing on all candidate space-time nodes as the starting space-time nodes to obtain at least one candidate circular logistics route.

[0100] In one embodiment, the route construction module 302 is used to calculate the average distance between each location and other locations based on the geographical location of at least one location in a preset geographical area; select n first locations with the smallest average distance from each location, where n is a positive integer; calculate the logistics cargo volume between each first location and other locations among the n first locations; and select m potential locations with the largest logistics cargo volume from each first location, where m is less than or equal to n and is a positive integer.

[0101] The logistics route generation device provided in this embodiment is based on the same concept as the logistics route generation method provided in the aforementioned embodiments of this application. It can execute the logistics route generation method provided in any of the aforementioned embodiments of this application and possesses the corresponding functional modules and beneficial effects. For technical details not fully described in this embodiment, please refer to the specific processing content of the logistics route generation method provided in the aforementioned embodiments of this application and will not be repeated here.

[0102] Exemplary electronic devices

[0103] The present application also provides an electronic device, such as Figure 4 As shown, the electronic device includes: a memory 400 and a processor 401.

[0104] The memory 400 is connected to the processor 401 and is used to store programs.

[0105] The processor 401 is used to implement the logistics route generation method in the above embodiment by running the program stored in the memory 400.

[0106] Specifically, the electronic device may further include: a communication interface 402 , an input device 403 , an output device 404 and a bus 405 .

[0107] The processor 401, the memory 400, the communication interface 402, the input device 403 and the output device 404 are connected to each other via a bus.

[0108] Bus 405 may include a pathway for transferring information between various components of the computer system.

[0109] Processor 401 can be a general-purpose processor, such as a general-purpose central processing unit (CPU), a microprocessor, or the like, or an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of the program of the present invention. It can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic device, discrete gate or transistor logic device, or discrete hardware components.

[0110] The processor 401 may include a main processor, and may also include a baseband chip, a modem, etc.

[0111] The memory 400 stores a program for executing the technical solution of the present invention, and may also store an operating system and other key services. Specifically, the program may include program code, which includes computer operating instructions. More specifically, the memory 400 may include read-only memory (ROM), other types of static storage devices that can store static information and instructions, random access memory (RAM), other types of dynamic storage devices that can store information and instructions, disk storage, flash, etc.

[0112] The input device 403 may include a device for receiving data and information input by a user, such as a keyboard, a mouse, a camera, a scanner, a light pen, a voice input device, a touch screen, a pedometer, or a gravity sensor.

[0113] Output device 404 may include devices that allow information to be output to a user, such as a display screen, printer, speakers, etc.

[0114] The communication interface 402 may include any transceiver or similar device for communicating with other devices or communication networks, such as Ethernet, Radio Access Network (RAN), Wireless Local Area Network (WLAN), etc.

[0115] The processor 401 executes the program stored in the memory 400 and calls other devices, which can be used to implement the various steps of the logistics route generation method provided in the above embodiments of the present application.

[0116] Exemplary computer program products and storage media

[0117] In addition to the above-mentioned methods and devices, an embodiment of the present application may also be a computer program product, which includes computer program instructions, which, when executed by a processor, enable the processor to execute the steps in the logistics route generation method described in the embodiment of the present application.

[0118] The computer program product may be written in any combination of one or more programming languages ​​to implement the program code for performing the operations of the embodiments of the present application, including object-oriented programming languages ​​such as Java, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computing device, partially on the user's computing device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server.

[0119] In addition, an embodiment of the present application may also be a storage medium on which a computer program is stored, and the computer program is executed by a processor to execute the steps in the logistics route generation method described in the embodiment of the present application.

[0120] For the sake of simplicity, the aforementioned method embodiments are described as a series of action combinations. However, those skilled in the art should be aware that this application is not limited by the order of the actions described, because according to this application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in this specification are all preferred embodiments, and the actions and modules involved are not necessarily required by this application.

[0121] It should be noted that the various embodiments in this specification are described in a progressive manner, with each embodiment focusing on the differences from other embodiments. Similarities between the various embodiments can be referred to in conjunction with each other. For device embodiments, since they are generally similar to method embodiments, their description is relatively simple, and for relevant details, reference can be made to the description of the method embodiments.

[0122] The steps in the methods of each embodiment of the present application can be adjusted in sequence, merged, and deleted according to actual needs, and the technical features recorded in each embodiment can be replaced or combined.

[0123] The modules and sub-modules in the devices and terminals provided in the various embodiments of the present application can be merged, divided, and deleted according to actual needs.

[0124] In the several embodiments provided in this application, it should be understood that the disclosed terminals, devices, and methods can be implemented in other ways. For example, the terminal embodiments described above are merely illustrative. For example, the division of modules or submodules is merely a logical function division. In actual implementation, there may be other division methods, such as multiple submodules or modules can be combined or integrated into another module, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interface, device or module, which can be electrical, mechanical or other forms.

[0125] The modules or submodules described as separate components may or may not be physically separate, and the components of the modules or submodules may or may not be physical modules or submodules, that is, they may be located in one place or distributed across multiple network modules or submodules. Some or all of the modules or submodules may be selected to achieve the purpose of this embodiment according to actual needs.

[0126] In addition, each functional module or submodule in each embodiment of the present application may be integrated into a processing module, or each module or submodule may exist physically separately, or two or more modules or submodules may be integrated into a single module. The above-mentioned integrated modules or submodules may be implemented in the form of hardware or software functional modules or submodules.

[0127] Professionals may further appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the above description has generally described the components and steps of each example according to their functions. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professionals and technicians may use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0128] The steps of the methods or algorithms described in conjunction with the embodiments disclosed herein may be implemented directly using hardware, software units executed by a processor, or a combination of the two. The software units may be placed in random access memory (RAM), internal memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art.

[0129] Finally, it should be noted that, in this document, relational terms such as first and second, etc., are used only to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. Moreover, the terms "comprises," "comprising," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or device comprising a series of elements includes not only those elements, but also other elements not explicitly listed, or elements inherent to such process, method, article, or device. In the absence of further limitations, an element defined by the phrase "comprising a ..." does not exclude the presence of additional identical elements in the process, method, article, or device comprising the element.

[0130] The above description of the disclosed embodiments will enable those skilled in the art to implement or use the present application. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present application. Therefore, the present application is not limited to the embodiments shown herein, but is to be construed in the widest manner consistent with the principles and novel features disclosed herein.

Claims

1. A logistics route generation method, characterized in that: include: Determine at least one potential location based on the geographical location and logistics cargo volume corresponding to at least one location in the preset geographical area; Constructing at least one candidate circular logistics route based on the first geographical location, the first shipping time, and the first logistics cargo volume corresponding to each potential location, wherein the candidate circular logistics route includes at least one spatiotemporal node, each spatiotemporal node including a geographical location of the node and a second shipping time corresponding to each geographical location of the node; Based on the second logistics cargo volume corresponding to the time and space nodes in each of the candidate circular logistics routes, the optimal circular logistics route is selected from each of the candidate circular logistics routes, wherein the optimal circular logistics route is used to guide the transportation of goods within the preset geographical area.

2. The method for generating a logistics route according to claim 1, characterized in that: The step of selecting an optimal circular logistics route from each candidate circular logistics route based on the second logistics cargo volume corresponding to the spatiotemporal node in each candidate circular logistics route includes: Based on the second logistics cargo volume corresponding to the time-space node in each candidate circular logistics route, obtaining the time-efficient transportation cargo volume used to complete the cargo transportation of each candidate circular logistics route; Based on the time-efficient transport volume, selecting at least one first circular logistics route from each of the candidate circular logistics routes; The optimal circular logistics route is selected from each of the first circular logistics routes through mutually exclusive loading events between different first circular logistics routes, wherein the mutually exclusive loading event means that the same cargo cannot be loaded on different transport vehicles at the same time.

3. The method for generating a logistics route according to claim 2, characterized in that: The obtaining, based on the second logistics cargo volume corresponding to the time-space node in each candidate circular logistics route, the time-efficient transportation cargo volume used to complete the cargo transportation of each candidate circular logistics route includes: respectively configuring the corresponding second logistics cargo volume for each of the spatiotemporal nodes in each of the candidate circular logistics routes; Calculate the predicted time-efficient transport volume required for each candidate circular logistics route to complete the transport of the goods based on the second logistics cargo volume corresponding to the space-time node and the time information of the cargo arriving at the space-time node; Obtaining the actual time-efficient cargo volume used to complete cargo transportation for each candidate circular logistics route; The selecting at least one first circular logistics route from each of the candidate circular logistics routes based on the time-efficient transport volume includes: The candidate circular logistics route for which the predicted time-efficient transport volume is greater than the actual time-efficient transport volume is determined as the first circular logistics route.

4. The method for generating a logistics route according to claim 2, characterized in that: The selecting the optimal circular logistics route from among the first circular logistics routes by performing mutually exclusive loading events between different first circular logistics routes includes: Based on the mutually exclusive loading events between the first circular logistics routes, reconfigure the corresponding mutually exclusive logistics cargo volume for each of the spatiotemporal nodes in each of the first circular logistics routes; Based on the mutually exclusive logistics cargo volume, calculating the mutually exclusive time-efficient transportation cargo volume used by each of the first circular logistics routes to complete the cargo transportation; The first circular logistics route with the largest mutually exclusive time-efficient transport volume is determined as the optimal circular logistics route.

5. The method for generating a logistics route according to claim 1, characterized in that: The step of constructing at least one candidate circular logistics route based on the first geographical location, the first shipping time, and the first logistics cargo volume corresponding to each potential location includes: Configuring the first shipping time corresponding to each of the potential locations, respectively, and constructing at least one candidate spatiotemporal node, wherein the candidate shipping time of the candidate spatiotemporal node is obtained based on the first shipping time of the potential location; determining a candidate node distance between every two candidate spatiotemporal nodes based on the candidate geographic locations of the candidate spatiotemporal nodes, wherein the candidate geographic locations of the candidate spatiotemporal nodes are obtained based on the first geographic location of the potential location; Based on the candidate node distance, the candidate logistics cargo volume corresponding to each candidate space-time node and the candidate shipping time, determine the next candidate space-time node where the goods will arrive after being transported from the previous candidate space-time node, until returning to the candidate geographical location of origin, and obtain at least one candidate circular logistics route, wherein the candidate logistics cargo volume of the candidate space-time node is obtained based on the first logistics cargo volume of the potential location.

6. The method for generating a logistics route according to claim 5, characterized in that: The step of determining the next candidate spatiotemporal node to which the cargo will be delivered after being transported from the previous candidate spatiotemporal node based on the candidate node distances and the first logistics cargo volumes corresponding to the respective candidate spatiotemporal nodes, until the cargo returns to the candidate geographic location of origin, and obtaining at least one candidate circular logistics route includes: Taking any of the candidate spatiotemporal nodes as the starting spatiotemporal node, the following route construction process is performed: taking the candidate geographical location of the starting spatiotemporal node as the cargo starting location, and taking the candidate shipping time of the starting spatiotemporal node as the cargo starting time; based on the candidate node distance, the candidate logistics cargo volume corresponding to each candidate spatiotemporal node, and the candidate shipping time corresponding to each candidate spatiotemporal node, starting from the starting spatiotemporal node, determining the next candidate spatiotemporal node to which the cargo will arrive after being transported from the previous candidate spatiotemporal node, until returning to the cargo starting location, thereby constructing a candidate circular logistics route; All candidate space-time nodes are traversed, and all candidate space-time nodes are used as the starting space-time nodes to perform the route construction process to obtain at least one candidate circular logistics route.

7. The method for generating a logistics route according to claim 1, characterized in that: The determining of at least one potential location based on the geographical location and logistics cargo volume corresponding to at least one location in the preset geographical area includes: Based on the geographical location of at least one location within the preset geographical area, respectively calculating an average distance between each location and other locations; Selecting n first locations with the smallest average distance from each of the locations, where n is a positive integer; Calculating the logistics volume between each of the n first locations and the other locations; From each of the first locations, m potential locations with the largest logistics cargo volume are screened out, where m is less than or equal to n and is a positive integer.

8. A logistics route generation device, characterized in that: include: A location acquisition module, configured to determine at least one potential location based on the geographical location and logistics cargo volume corresponding to at least one location in a preset geographical area; a route construction module, configured to construct at least one candidate circular logistics route based on the first geographical location, the first shipping time, and the first logistics cargo volume corresponding to each potential location, wherein the candidate circular logistics route includes at least one spatiotemporal node, each spatiotemporal node including a geographical location of the node and a second shipping time corresponding to each geographical location of the node; A route screening module is used to screen out an optimal circular logistics route from each of the candidate circular logistics routes based on the second logistics cargo volume corresponding to the time and space nodes in each of the candidate circular logistics routes, wherein the optimal circular logistics route is used to guide the transportation of goods within the preset geographical area.

9. An electronic device, characterized in that: include: memory and processor; The memory is connected to the processor and is used to store programs; The processor is used to implement the logistics route generation method as described in any one of claims 1 to 7 by running the program in the memory.

10. A storage medium, characterized in that: The storage medium stores a computer program, and when the computer program is executed by the processor, the logistics route generation method according to any one of claims 1 to 7 is implemented.

Images