Cold transport link routing planning method and device, computer equipment and readable storage medium

Abstract

The embodiment of the invention provides a cold transport link routing planning method and device, computer equipment and a readable storage medium. The method comprises the following steps: acquiring an initial position of goods and a real-time position of transport capacity; according to the initial position and the real-time position, determining a real-time distribution route between the cargo and the transport capacity; in response to the real-time allocation route, determining an updated transport capacity position of the transport capacity, and determining a new allocation route between the cargo and the transport capacity based on the updated transport capacity position; and in response to the updated distribution route, updating the transport capacity position of the transport capacity until the transport capacity position of the transport capacity is matched with the starting position of the cargo. Through the real-time scheduling process, a reasonable scheduling relationship between the cold transport chain goods and the transport capacity to be allocated can be always controlled, and abnormal scheduling problems such as collision and blockage are avoided, so that scheduling resources are fully utilized, and the scheduling efficiency is effectively improved.

Description

Technical Field

[0001] The embodiments of the present application relate to the technical field of route planning, and in particular to a cold chain route planning method, apparatus, computer equipment, and readable storage medium. Background Art

[0002] At present, with the continuous development of smart logistics, smart warehousing, as an important part of it, has also been paid attention to by many logistics companies. Among them, one of the standards for the construction of smart warehousing is whether it can be automated, that is, whether AGV (Automated Guided Vehicle) can be used to achieve reasonable, scientific, efficient and autonomous operation of goods in the warehouse to fully liberate manpower. Therefore, how to reasonably and effectively dispatch AGV in the warehouse is crucial.

[0003] However, the current route planning for AGVs is mostly an idealized application of single routes or non-intersecting parallel routes. The performance in actual complex business scenarios is still not ideal, especially for route planning scenarios such as cold chain that have extremely high timeliness requirements. The existing route planning strategies still have technical problems such as low scheduling efficiency and low resource utilization. Summary of the invention

[0004] The embodiments of the present application provide a cold chain routing planning method, apparatus, computer equipment and readable storage medium, aiming to solve the technical problems of low scheduling efficiency and low resource utilization in the existing cold chain routing planning methods.

[0005] On the one hand, an embodiment of the present application provides a cold chain routing planning method, including:

[0006] Obtain the starting location of the cold chain goods to be delivered in the target cold chain warehouse, as well as the real-time location of the transportation capacity to be allocated;

[0007] Determine a real-time allocation route between the cold chain goods and the transport capacity to be allocated according to the starting position and the real-time position;

[0008] In response to the real-time allocation route, determine an updated capacity position of the to-be-allocated capacity, and, based on the updated capacity position, determine an updated allocation route between the cold chain cargo and the to-be-allocated capacity;

[0009] The transport capacity position of the transport capacity to be allocated is updated in response to the updated allocation route until the transport capacity position of the transport capacity to be allocated matches the starting position of the cold chain goods.

[0010] As a feasible embodiment of the present application, determining the real-time allocation route between the cold chain goods and the to-be-allocated transport capacity according to the starting position and the real-time position includes:

[0011] Determine the initial transport capacity corresponding to each of the cold chain goods based on the relationship between the path distance and the Manhattan distance between the starting position and the real-time position; the path distance is obtained based on a heuristic path search algorithm;

[0012] Based on the initial allocation relationship between the cold chain goods and the initial transportation capacity, a first distance matrix is ​​generated;

[0013] According to the first distance matrix and the second distance matrix corresponding to the path distance, the initial transportation capacity corresponding to the cold chain goods is updated to obtain the target allocated transportation capacity;

[0014] Based on the target allocation capacity corresponding to the cold chain goods, a real-time allocation route between the cold chain goods and the to-be-allocated capacity is determined.

[0015] As a feasible embodiment of the present application, determining the initial transport capacity corresponding to each of the cold chain goods based on the relationship between the path distance and the Manhattan distance between the starting position and the real-time position includes:

[0016] For each cold chain cargo, the to-be-allocated transport capacity whose path distance between the real-time position and the starting position of the cold chain cargo is equal to the Manhattan distance is determined as the initial transport capacity corresponding to the cold chain cargo.

[0017] As a feasible embodiment of the present application, determining the initial transport capacity corresponding to each of the cold chain goods based on the relationship between the path distance and the Manhattan distance between the starting position and the real-time position includes:

[0018] Obtaining the delivery location of the cold chain goods;

[0019] Determine the distribution order corresponding to each of the cold chain goods according to the relationship between the path distances between the starting position and the delivery position;

[0020] Based on the relationship between the path distance and the Manhattan distance between the starting position and the real-time position, and the allocation order, the initial transportation capacity corresponding to each of the cold chain goods is determined in turn.

[0021] As a feasible embodiment of the present application, the determining of the updated allocation route between the cold chain goods and the to-be-allocated transportation capacity based on the updated transportation capacity position includes:

[0022] Determining a node cost corresponding to each routing node based on the routing nodes included in the real-time allocation route;

[0023] Based on the updated transport capacity position, the starting position and the node cost corresponding to each of the routing nodes, the updated allocation route between the cold chain goods and the transport capacity to be allocated is determined; wherein the path distance between the cold chain goods and the transport capacity to be allocated is associated with the node cost corresponding to the routing node.

[0024] As a feasible embodiment of the present application, after the step of determining the updated allocation route between the cold chain goods and the to-be-allocated capacity based on the updated capacity position, the starting position and the node cost corresponding to each of the routing nodes, the method further includes:

[0025] Determine, according to the updated allocation route, whether there is any capacity to be adjusted in the capacity to be allocated that meets a preset condition; the preset condition includes at least one of a preset conflict condition and a preset replacement condition;

[0026] If the transport capacity to be allocated has transport capacity to be adjusted that meets the preset conditions, the allocation route of the transport capacity to be adjusted is adjusted based on the adjustment strategy corresponding to the preset conditions.

[0027] As a feasible embodiment of the present application, after the step of updating the capacity position of the to-be-allocated capacity in response to the updated allocation route until the capacity position of the to-be-allocated capacity matches the starting position of the cold chain goods, the method further includes:

[0028] Determine a real-time transportation route corresponding to the cold chain goods according to the starting location and the delivery location corresponding to the cold chain goods;

[0029] Determining a transportation node cost corresponding to each routing node based on the routing nodes included in the real-time transportation route;

[0030] In response to the real-time transportation route, determine the updated transportation capacity position of the transportation capacity to be allocated, and, based on the updated transportation capacity position and the transportation node cost, determine the updated transportation route between the cold chain goods and the transportation capacity to be allocated;

[0031] The transport capacity position of the transport capacity to be allocated is updated in response to the updated transport route until the transport capacity position of the transport capacity to be allocated matches the arrival position of the cold chain goods.

[0032] On the other hand, the embodiment of the present application also provides a cold chain routing planning device, comprising:

[0033] The acquisition module is used to obtain the starting position of the cold chain goods to be delivered in the target cold chain warehouse, as well as the real-time position of the transportation capacity to be allocated;

[0034] A determination module, used to determine a real-time allocation route between the cold chain goods and the transport capacity to be allocated according to the starting position and the real-time position;

[0035] An updating module, configured to determine an updated transport capacity position of the transport capacity to be allocated in response to the real-time allocation route, and determine an updated allocation route between the cold chain goods and the transport capacity to be allocated based on the updated transport capacity position;

[0036] The termination module is used to update the capacity position of the to-be-allocated capacity in response to the updated allocation route until the capacity position of the to-be-allocated capacity matches the starting position of the cold chain goods.

[0037] On the other hand, an embodiment of the present application further provides a computer device, comprising a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the above-mentioned cold chain routing planning method.

[0038] On the other hand, an embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, and the computer program is executed by a processor to implement the above-mentioned cold chain routing planning method.

[0039] The cold chain routing planning method provided by the present application, after obtaining the starting position of the cold chain goods to be delivered and the real-time position of the transportation capacity to be allocated, will first determine the real-time allocation route based on the starting position and the real-time position, and then update the allocation route in real time based on the updated transportation capacity position during the scheduling process until the transportation capacity position of the transportation capacity to be allocated matches the starting position of the cold chain goods to complete the loading of the cold chain goods. Through the above-mentioned real-time scheduling process, it is possible to always control the reasonable scheduling relationship between the cold chain goods and the transportation capacity to be allocated, avoid abnormal scheduling problems such as collisions and blockages, thereby making full use of scheduling resources and effectively improving scheduling efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.

[0041] Figure 1A schematic diagram of the steps of a cold chain routing planning method provided in an embodiment of the present application;

[0042] Figure 2 A schematic diagram of a process flow for determining real-time allocation of routes between cargo and transport capacity provided in an embodiment of the present application;

[0043] Figure 3 A schematic diagram of a process flow for allocating initial transport capacity for cold chain goods based on an allocation order provided in an embodiment of the present application;

[0044] Figure 4 A schematic diagram of a flow chart of steps for updating a distribution route provided in an embodiment of the present application;

[0045] Figure 5 A schematic diagram of another step flow for updating the allocated route provided in an embodiment of the present application;

[0046] Figure 6 A schematic diagram of the steps of a route planning method for transporting cold chain goods provided in an embodiment of the present application;

[0047] Figure 7 A schematic diagram of the structure of a cold chain routing planning device provided in an embodiment of the present application;

[0048] Figure 8 A schematic diagram of the structure of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0049] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of the present invention.

[0050] In the embodiments of the present application, the word "exemplary" is used to mean "used as an example, illustration or description". Any embodiment described as "exemplary" in the embodiments of the present application is not necessarily to be construed as being more preferred or advantageous than other embodiments. The following description is given to enable any technician in the field to implement and use the present invention. In the following description, details are listed for the purpose of explanation. It should be understood that a person of ordinary skill in the art can recognize that the present invention can be implemented without using these specific details. In other examples, well-known structures and processes will not be elaborated in detail to avoid unnecessary details that make the description of the present invention obscure. Therefore, the present invention is not intended to be limited to the embodiments shown, but is consistent with the widest range of principles and features disclosed in the embodiments of the present application.

[0051] To facilitate understanding of the cold chain routing planning method provided in the embodiment of the present application, the application scenario of the method is first described. In the field of smart warehousing, in order to realize fully automatic and intelligent warehousing, the prior art uses AGV to realize the reasonable, scientific, efficient and autonomous operation of goods in the warehouse. Among them, how to reasonably use AGV resources to transport the goods to be distributed from the starting point to the destination is the key to scheduling.

[0052] At present, the scheduling of AGVs, that is, route planning, is usually based on the idealized application of single routes or non-intersecting parallel routes. However, in complex actual application scenarios, especially in route planning scenarios such as cold chain that have extremely high timeliness requirements, the above idealized route planning strategies have problems such as low scheduling efficiency and low resource utilization.

[0053] It is precisely to solve the above-mentioned problems that the present application provides a cold chain routing planning method, device, computer equipment and readable storage medium, which can update the scheduling relationship between cold chain goods and AGVs in real time during the scheduling process to avoid abnormal scheduling problems such as collisions and blockages, thereby effectively improving the scheduling efficiency. Specifically, the cold chain routing planning method is usually installed in the cold chain routing planning device in the form of a computer program, and the cold chain routing planning device is set in the computer equipment in the form of a processor. The cold chain routing planning device in the computer equipment executes the steps of the cold chain routing planning method provided in the embodiment of the present application by running the computer program corresponding to the cold chain routing planning method.

[0054] like Figure 1 As shown, Figure 1 A schematic flow chart of a cold chain routing planning method provided in an embodiment of the present application, specifically, comprising steps S110 to S140:

[0055] S110, obtaining the starting position of the cold chain goods to be delivered in the target cold chain warehouse and the real-time position of the transportation capacity to be allocated.

[0056] In the embodiment of the present application, the target cold chain warehouse refers to the intelligent warehousing based on AGV to realize cargo scheduling mentioned in the aforementioned application scenario, wherein the cold chain cargo is the cargo that needs to be scheduled, and the transportation capacity to be allocated is the transportation capacity equipment that provides scheduling services, for example, the more common one is AGV. Specifically, in the complete scheduling process, it is usually necessary to first allocate appropriate transportation capacity for the cold chain cargo, and then dispatch the transportation capacity to the corresponding cold chain cargo to complete the loading of the cold chain cargo, and transport the cold chain cargo from the starting position to the arrival position to complete the unloading of the cold chain cargo. Therefore, the cold chain route planning device usually needs to first obtain the starting position of the cold chain cargo, and the real-time position of the transportation capacity to be allocated to realize the planning of the cold chain route.

[0057] Specifically, the starting position of each cold chain cargo can usually be described by a coordinate vector, and the starting positions of the cold chain cargo are arranged in parallel to form a coordinate matrix for subsequent calculations, wherein each row in the coordinate matrix corresponds to the coordinate of a cold chain cargo. Similarly, the real-time position of each to-be-allocated transport capacity can also be described by a coordinate vector, and the real-time positions of the to-be-allocated transport capacity are arranged in parallel to form a coordinate matrix.

[0058] S120: Determine a real-time allocation route between the cold chain goods and the transport capacity to be allocated according to the starting position and the real-time position.

[0059] In the embodiment of the present application, based on the aforementioned starting position and real-time position, the real-time allocation route between the cold chain goods and the transportation capacity to be allocated can be realized based on conventional route planning methods, such as the more common Dijkstra algorithm, A* (A-Star) algorithm, probabilistic roadmap method (PRM) algorithm, ant colony algorithm or neural network algorithm, etc. Of course, based on the consumption of computing resources and the performance of the method, as a feasible embodiment of the present application, a technical solution for implementing route planning based on the A* algorithm is provided. In addition, since the application scenario provided by this proposal involves the allocation of multiple cold chain goods and transportation capacity to be allocated, in the process of route planning, it is also necessary to first implement the allocation of cold chain goods and transportation capacity to be allocated more reasonably based on the allocation constraints, so as to facilitate the subsequent calculation of real-time routes. For specific implementation schemes, please refer to the subsequent Figure 2 and its explanatory contents.

[0060] S130, in response to the real-time allocation route, determining an updated capacity position of the to-be-allocated capacity, and, based on the updated capacity position, determining an updated allocation route between the cold chain goods and the to-be-allocated capacity.

[0061] In an embodiment of the present application, after the real-time allocation route between the cold chain goods and the transportation capacity to be allocated is determined as mentioned above, in response to the real-time allocation route, the cold chain route planning device will dispatch each transportation capacity according to its corresponding real-time allocation route, and then determine the real-time updated capacity position of the transportation capacity to be allocated, and repeat the above process again, replacing the real-time position with the updated capacity position, and re-updating the allocation route between the cold chain goods and the transportation capacity to be allocated to obtain the updated allocation route.

[0062] In the process of updating the allocation route, since there is a previously provided allocation route between the cold chain goods and the transportation capacity to be allocated, the passing cost of each node in the route can be determined based on the allocation route, wherein the passing cost can describe the congestion of this node to a certain extent. Specifically, the more allocation routes that pass through the node, the higher the congestion of the node, and the greater the passing cost of the node. On this basis, the additional node cost as a cost constraint condition can make the updated allocation route avoid passing through nodes with higher passing costs as much as possible, thereby reducing the congestion of each node, avoiding congestion in the scheduling process, and improving scheduling efficiency. Specifically, the steps for updating the allocation route can be referred to in the subsequent Figure 4 and its explanatory contents.

[0063] S140: updating the transport capacity position of the transport capacity to be allocated in response to the updated allocation route until the transport capacity position of the transport capacity to be allocated matches the starting position of the cold chain goods.

[0064] In the embodiment of the present application, after the allocation route is re-updated based on the real-time allocation route, the cold transport chain routing planning device will further dispatch each transport capacity to operate according to the updated allocation route. In this process, when the transport capacity position is updated, the cold transport chain routing planning device will perform a new round of allocation route updates and dispatch each transport capacity according to the latest updated allocation route until the transport capacity position of the to-be-allocated transport capacity matches the starting position of the cold transport chain goods, that is, the transport capacity arrives at the starting position of the cold transport chain goods and can complete the loading of the cold transport chain goods. Only then will the cold transport chain routing planning device stop the route planning for the transport capacity position and the cold transport chain goods. Through the above-mentioned process of planning the allocation route, it is possible to control the cold transport chain goods and the to-be-allocated transport capacity to ensure a reasonable scheduling relationship, avoid abnormal scheduling problems such as collisions and congestion, thereby making full use of scheduling resources and effectively improving scheduling efficiency.

[0065] After the cold chain cargo is loaded, in order to further realize the complete dispatching process of the cold chain cargo, the route of transporting the cold chain cargo from its starting location to the destination will be further planned. The specific implementation plan can be found in the subsequent Figure 6 and its explanatory contents.

[0066] The cold chain routing planning method provided by the present application, after obtaining the starting position of the cold chain goods to be delivered and the real-time position of the transportation capacity to be allocated, will first determine the real-time allocation route based on the starting position and the real-time position, and then update the allocation route in real time based on the updated transportation capacity position during the scheduling process until the transportation capacity position of the transportation capacity to be allocated matches the starting position of the cold chain goods to complete the loading of the cold chain goods. Through the above-mentioned real-time scheduling process, it is possible to always control the reasonable scheduling relationship between the cold chain goods and the transportation capacity to be allocated, avoid abnormal scheduling problems such as collisions and blockages, thereby making full use of scheduling resources and effectively improving scheduling efficiency.

[0067] like Figure 2 As shown, Figure 2 A schematic flow chart of a step of determining a real-time allocation route between cargo and transport capacity provided in an embodiment of the present application, specifically, comprising steps S210 to S240:

[0068] S210, determining the initial transportation capacity corresponding to each of the cold chain goods based on the relationship between the path distance and the Manhattan distance between the starting position and the real-time position.

[0069] In the embodiment of the present application, in order to more reasonably realize the allocation between cold chain goods and transportation capacity, for each cold chain goods, based on the relationship between the path distance and the Manhattan distance between the starting position and the real-time position of each transportation capacity, it can be determined that there are no obstacles in the shortest path to the cold chain goods, that is, the transportation capacity that does not need to take a detour is used as the initial transportation capacity corresponding to the corresponding cold chain goods. Specifically, the path distance between the starting position and the real-time position is usually obtained based on a heuristic path search algorithm, for example, the A* algorithm provided above, which describes the shortest distance from the starting position to the real-time position after avoiding obstacles. The Manhattan distance is usually obtained by the sum of the difference between the horizontal coordinate and the vertical coordinate between two points in the coordinate system, which describes the shortest distance between two points in a grid map. Therefore, based on the relationship between the path distance and the Manhattan distance between the real-time positions, it can be determined whether there is an obstacle between the starting position and the real-time position.

[0070] Specifically, if the path distance between the real-time position of a certain transport capacity and the starting position of a certain cargo is equal to the Manhattan distance, it indicates that the shortest distance from the starting position to the real-time position after avoiding obstacles is equal to the shortest distance between two points in the grid map, that is, there are no obstacles that need to be avoided between the starting position and the real-time position. At this time, it can be considered that the transport capacity can reach this cargo directly, and the transport capacity can be marked as the initial transport capacity corresponding to the cold chain cargo. That is, as a feasible embodiment of the present application, for each cold chain cargo, the to-be-allocated transport capacity whose path distance between the real-time position and the starting position of the cold chain cargo is equal to the Manhattan distance is determined as the initial transport capacity corresponding to the cold chain cargo.

[0071] Furthermore, considering that in the actual route allocation process, each transport capacity is allowed to be allocated to at most one cold chain cargo, therefore, in the process of determining the initial transport capacity corresponding to each cold chain cargo, the allocation priority corresponding to each cold chain cargo can also be determined, that is, the allocation order. When a transport capacity is set to a cold chain cargo with a higher priority, the transport capacity will no longer be used as the initial transport capacity for other cold chain cargoes with a lower priority. For specific implementation solutions, please refer to the subsequent Figure 3 and its explanatory contents.

[0072] In addition, when the transportation capacity is insufficient, that is, the transportation capacity is lower than the cold chain goods, the cold chain goods to be allocated first can be determined based on this priority, so as to ensure that the transportation capacity matches the number of cold chain goods. Therefore, to simplify the description, the following explanation will be based on the example that the transportation capacity can meet the number of cold chain goods that currently need to be delivered, that is, the number of cold chain goods is not higher than the transportation capacity.

[0073] S220: Generate a first distance matrix based on the initial allocation relationship between the cold chain goods and the initial transportation capacity.

[0074] In the embodiment of the present application, considering that under normal circumstances, there may be multiple initial transport capacities corresponding to cold chain goods, of course, the same transport capacity may also be used as the initial transport capacity for multiple cold chain goods. Therefore, the initial allocation relationship between cold chain goods and transport capacity can be described by a matrix, wherein, when the aforementioned relationship is satisfied between the i-th cold chain goods and the j-th transport capacity, that is, the j-th transport capacity can be used as the initial transport capacity for the i-th cold chain goods, the element value of the i-th row and j-th column in the matrix is ​​the path distance between the i-th cold chain goods and the j-th transport capacity, that is, the Manhattan distance. On the contrary, when the aforementioned relationship is not satisfied between the i-th cold chain goods and the j-th transport capacity, that is, there is an obstacle between the i-th cold chain goods and the j-th transport capacity, resulting in the j-th transport capacity being used as the initial transport capacity for the i-th cold chain goods, the element value of the i-th row and j-th column in the matrix is ​​set to 0. By further optimizing the matrix describing the feasible allocation relationship, the most appropriate one-to-one allocation relationship can be determined.

[0075] S230: Update the initial transportation capacity corresponding to the cold chain goods according to the first distance matrix and the second distance matrix corresponding to the path distance to obtain the target allocated transportation capacity.

[0076] In the embodiment of the present application, in addition to the first distance matrix describing the feasible allocation relationship, in the process of allocating transportation capacity and cold chain goods, the final allocation route will be further balanced based on the equilibrium constraint condition, that is, the final allocation route is stabilized within a reasonable range to avoid the occurrence of too long or too short allocation routes, which will affect the scheduling efficiency of transportation capacity. Specifically, the aforementioned equilibrium constraint condition can be implemented based on the Hungarian algorithm, and its specific implementation process is as follows:

[0077] 1) Determine a second distance matrix corresponding to the path distance, where each element value in the second distance matrix corresponds to the shortest distance between a cold chain cargo and a transport capacity determined by the A* algorithm;

[0078] 2) Subtract the minimum value in each row of the second distance matrix, and then subtract the minimum value in each column from the minimum value in this column;

[0079] 3) Count the distribution of the value 0 in each row and column of the matrix, and use the minimum number of row or column markers to cover all the value 0 in the matrix;

[0080] 4) If the number of rows and columns used to cover all the values ​​0 is the same as the number of cold chain goods, then end the step. At this time, the distribution of the value 0 in the matrix corresponds to the final allocation result; if the number of rows and columns used to cover all the values ​​0 is less than the number of cold chain goods, then continue to execute the subsequent steps;

[0081] 5) Determine the minimum value covered by the rows and columns that are not marked, then subtract this minimum value from each row that is not covered, and add this minimum value to each column that is not covered;

[0082] 6) Jump to step 3) until the end.

[0083] By optimizing the second distance matrix in the above manner, it is possible to achieve a balance for all allocation routes and avoid allocation routes that are too long or too short. On this basis, combined with the optimized second distance matrix, if it also conforms to the feasible allocation relationship described by the first distance matrix, then the target allocation capacity corresponding to each cold chain cargo can be determined based on the optimized second distance matrix. At this time, there are no obstacles between the cold chain cargo and its corresponding target allocation capacity, and it also ensures that the route lengths of each cold chain cargo and its corresponding target allocation capacity are relatively balanced, and there will be no problem of being too long or too short.

[0084] S240, determining a real-time allocation route between the cold chain goods and the to-be-allocated transportation capacity based on the target allocation transportation capacity corresponding to the cold chain goods.

[0085] In an embodiment of the present application, after the target allocated capacity is allocated to each cold chain cargo, the real-time allocation route between the cold chain cargo and the capacity to be allocated can be determined based on the route planned by the A* algorithm provided above. The real-time allocation route specifically describes the allocation relationship between the cold chain cargo and the capacity, as well as the route planning of each capacity.

[0086] like Figure 3 As shown, Figure 3 A schematic flow chart of steps for allocating initial transport capacity for cold chain goods based on the allocation order provided in an embodiment of the present application, specifically, including steps S310 to S330:

[0087] S310, obtaining the delivery location of the cold chain goods.

[0088] In the embodiment of the present application, a method is provided to determine the distribution order corresponding to the cold chain goods based on the transportation route length of the cold chain goods. Specifically, in order to calculate the transportation route length of the cold chain goods, the cold chain routing planning device will further obtain the delivery location of the cold chain goods, that is, the target location to which the cold chain goods need to be delivered. Usually, the target location of the cold chain goods also exists in the form of a coordinate vector.

[0089] S320: Determine the distribution order corresponding to each of the cold chain goods according to the relationship between the path distances between the starting position and the delivery position.

[0090] In the embodiment of the present application, after determining the starting position and the destination position of each cold chain cargo, the path distance of each cold chain cargo from the starting position to the destination position can be determined based on the A* algorithm. Furthermore, based on the size relationship of the path distance, the corresponding allocation order of the cold chain cargo can be determined, that is, the priority of the cold chain cargo. The greater the path distance, the higher the priority of the cold chain cargo. By giving priority to allocating transportation capacity to this cold chain cargo, the efficiency of scheduling can be effectively improved.

[0091] S330, based on the relationship between the path distance and the Manhattan distance between the starting position and the real-time position, and the allocation order, determine the initial transportation capacity corresponding to each of the cold chain goods in turn.

[0092] Different from the implementation scheme of the aforementioned step S210, the scheme for allocating initial transport capacity provided in the embodiment of the present application also takes into account the allocation order. That is, when a certain transport capacity has been allocated as the allocated transport capacity for a cold chain cargo with a higher priority, the transport capacity will no longer be used as the allocated transport capacity for the remaining other cold chain cargoes. The initial allocation relationship between the cold chain cargoes and the transport capacity obtained by the above scheme takes into account the absence of obstacles between the cold chain cargoes and the allocated transport capacity, while also avoiding the possibility of conflicts caused by subsequently assigning the same transport capacity to multiple cold chain cargoes, thereby improving the scheduling effect.

[0093] like Figure 4 As shown, Figure 4 A schematic flow chart of a step of updating a distribution route provided in an embodiment of the present application, specifically, includes steps S410 to S420:

[0094] S410: Determine a node cost corresponding to each routing node based on the routing nodes included in the real-time allocation route.

[0095] In the embodiment of the present application, after the initial allocation route is provided, in the process of further updating the allocation route, in addition to re-planning the allocation route based on the updated capacity position, it is also necessary to additionally optimize the congestion that may exist in the real-time allocation route.

[0096] Specifically, in actual application scenarios, the warehousing scene is usually simplified to the form of an undirected graph model. There are several nodes in the undirected graph, corresponding to several points in the warehousing scene. For example, a common node can be the intersection of the transportation channel in the warehousing scene. At this time, each real-time allocation route can be regarded as composed of several nodes. On this basis, based on the routing nodes contained in the real-time allocation route, the node cost corresponding to each routing node can be further determined. Specifically, the node cost describes the possibility of congestion at the node, which is usually proportional to the number of routes containing this node. That is, the more routes there are, the higher the possibility of congestion at the node, and the higher the node cost, so as to facilitate the subsequent optimization of the routes of nodes with higher costs during the update process to avoid congestion anomalies.

[0097] S420, based on the updated transport capacity position, the starting position and the node cost corresponding to each of the routing nodes, determine the updated allocation route between the cold chain goods and the transport capacity to be allocated.

[0098] In the embodiment of the present application, after the node cost corresponding to the routing node is determined as mentioned above, specifically, the node cost can be introduced into the A* algorithm to affect the calculation of the path distance between the two positions, that is, the path distance between the updated capacity position and the starting position will fully consider the node cost of the routing node, that is, the route is weighted based on the node cost of the routing node, so as to select the optimal path by comprehensively considering the node cost and the actual path length, and calculate the path distance. After obtaining the path distance, combined with the aforementioned step S210 and Figure 3 After providing the relevant instructions, the updated distribution route between the cold chain goods and the transportation capacity to be allocated can be re-determined. Compared with the original distribution route provided, the updated distribution route fully considers the cost of passing through the node, thereby avoiding congestion abnormalities at a certain node, thereby improving the scheduling efficiency as a whole.

[0099] Of course, after the aforementioned update of the allocation route, in actual application scenarios, there may still be conflicts in capacity that need to be dispatched, or there may be the possibility of handing over goods. Therefore, after allocating routes for cold chain goods and capacity, the capacity will also be monitored to determine whether there is any capacity to be adjusted that needs to be dispatched and optimized based on the capacity location and route. For specific implementation plans, please refer to the subsequent Figure 5 and its explanatory contents.

[0100] like Figure 5 As shown, Figure 5 Another step flow diagram of updating the allocated route provided in the embodiment of the present application, specifically, includes steps S510 to S520:

[0101] S510: Determine whether there is any capacity to be adjusted that meets the preset conditions in the capacity to be allocated according to the updated allocation route. If yes, execute step S520; if not, execute other steps.

[0102] In the embodiment of the present application, in order to solve the conflicts and handovers that may exist in the scheduling process of transportation capacity in actual application scenarios, the cold chain routing planning device will further determine whether there is a certain transportation capacity that meets the preset conditions based on the updated allocation route, where the preset conditions here usually refer to the conditions set based on the route conflict or route handover situation. If they are met, it is considered that there is a conflict or handover in the to-be-allocated transportation capacity, and further adjustments need to be made to these transportation capacities.

[0103] S520: Adjust the allocation route of the to-be-adjusted transport capacity based on an adjustment strategy corresponding to the preset condition.

[0104] After determining that there is a conflict in the capacity to be allocated and that a handover is required, the above abnormal situation can be effectively resolved by adjusting the allocation route of the capacity to be adjusted according to the corresponding preset adjustment strategy, thereby improving the scheduling effect.

[0105] Specifically, the conditions mentioned above that are set based on route conflicts or route handover situations can generally be divided into the following types: one-way conflict, two-way conflict, and split-trip succession judgment conditions. Among them, one-way conflict refers to the position of a certain transport capacity at the next moment is the current position of another transport capacity, while the position of the other transport capacity at the next moment is in other directions. At this time, the corresponding adjustment strategy is to first control the transport capacity whose position at the next moment is the current position of the other transport capacity to be stationary, and then control the movement of the transport capacity after the other transport capacity moves. For two-way conflict, it refers to the position of a certain transport capacity at the next moment, which conflicts with the position of another transport capacity at the next moment, such as arriving at the same location, or arriving at the other party's current location. At this time, the corresponding adjustment strategy determines the priority of the transport capacity based on the status of the transport capacity, such as the loading status, the picking status, and the idle status, and based on the priority of the transport capacity, gives priority to re-planning the route or avoiding the low-priority capacity. If both transport capacities cannot plan a new route or avoid, the two transport capacities are controlled to wait at the original position until one of the transport capacities can plan a new route or avoid. The condition for split-trip replacement means that there is some idle capacity in the planned route for transportation by the freight capacity, and the idle capacity cannot be avoided. The costs of other routes planned by the freight capacity based on transportation demand are higher than the sum of the cost of the current planned route and a preset cost threshold that describes the replacement price of goods. At this time, it is considered that the idle capacity and the freight capacity are in the condition of satisfying the split-trip replacement conditions. At this time, the freight capacity and the idle capacity will be controlled to alternate goods, so that the goods on the freight capacity can be transported through the idle capacity in the future.

[0106] like Figure 6 As shown, Figure 6 A schematic flow chart of the steps of a route planning method for transporting cold chain goods provided in an embodiment of the present application, specifically, including steps S610 to S640:

[0107] S610: Determine a real-time transportation route corresponding to the cold chain cargo according to the starting position and the delivery position corresponding to the cold chain cargo.

[0108] In the embodiment of the present application, in order to realize the transportation of cold chain goods, the cold chain goods need to be transported from the starting position to the destination position. Therefore, the idea of ​​the A* algorithm provided above can be adopted to determine the real-time transportation route corresponding to each cold chain goods based on the starting position and the destination position. However, unlike step S120, since there is already a binding relationship between the transportation capacity and the goods at this time, there is no need to consider the distribution relationship between the transportation capacity and the goods in the process of determining the real-time transportation route.

[0109] S620: Determine a transportation node cost corresponding to each routing node based on the routing nodes included in the real-time transportation route.

[0110] In the embodiment of the present application, similar to the solution provided above, in the process of transporting cold chain goods by transportation capacity, it is necessary to adjust the transportation route in real time. Therefore, it is necessary to determine the transportation node cost corresponding to each routing node based on the routing nodes contained in the real-time transportation route. Specifically, for the description of the transportation node cost, please refer to the above-mentioned related description of the node cost, which will not be repeated in the embodiment of the present application.

[0111] S630, in response to the real-time transportation route, determining the updated transportation capacity position of the transportation capacity to be allocated, and, based on the updated transportation capacity position and the transportation node cost, determining the updated transportation route between the cold chain goods and the transportation capacity to be allocated.

[0112] In the embodiment of the present application, based on the real-time transportation route, the cold chain routing planning device will dispatch the transport capacity to travel according to the real-time transportation route, thereby determining the updated transport capacity position, and again using the updated transport capacity position and the transportation node cost to reversely optimize the transportation route. The specific optimization ideas can refer to the aforementioned Figure 4 , the embodiments of the present application will not be described in detail here.

[0113] S640: Update the transport capacity position of the transport capacity to be allocated in response to the updated transport route until the transport capacity position of the transport capacity to be allocated matches the arrival position of the cold chain goods.

[0114] By updating the transport route through the aforementioned iterations and scheduling the transport capacity based on the real-time transport route, it is possible to control the use of transport capacity to transport the goods from the starting location to the destination location. That is, when the transport capacity position reaches the destination location, the algorithm can be terminated and the subsequent unloading can be completed.

[0115] It should be noted that in the above-mentioned route planning process, it is necessary to plan in real time based on the A* algorithm. In the existing A* process of storing candidate path nodes and filtering candidate path nodes, the values ​​are stored in two lists, which means that each storage and filtering requires traversing all nodes in the list. In the real-time planning scenario provided by this application, the computing power requirements of the device are relatively high. Therefore, in order to reduce the computing power requirements, this application also proposes a new list data structure, which replaces the list data structure in the existing A* algorithm with the data structure of the small root heap built into Python. In this way, each time you read, you only need to read the data at the head of the team without traversing each node in the list, thereby reducing the time complexity of the A* algorithm from O(n) to O(n). 2 ) is reduced to O(1), thereby improving the efficiency of the A* algorithm and making it more suitable for the application scenario of real-time routing planning based on the A* algorithm provided in this application.

[0116] In order to better implement the cold chain routing planning method provided in the embodiment of the present application, based on the cold chain routing planning method, the embodiment of the present application also provides a cold chain routing planning device. As shown in FIG. 7, Figure 7 A schematic diagram of the structure of a cold chain routing planning device provided in an embodiment of the present application. Specifically, the cold chain routing planning device includes:

[0117] The acquisition module 710 is used to acquire the starting position of the cold chain goods to be delivered in the target cold chain warehouse, and the real-time position of the transportation capacity to be allocated;

[0118] A determination module 720, configured to determine a real-time allocation route between the cold chain goods and the transport capacity to be allocated according to the starting position and the real-time position;

[0119] An updating module 730 is used to determine an updated transport capacity position of the transport capacity to be allocated in response to the real-time allocation route, and to determine an updated allocation route between the cold chain goods and the transport capacity to be allocated based on the updated transport capacity position;

[0120] The termination module 740 is used to update the capacity position of the to-be-allocated capacity in response to the updated allocation route until the capacity position of the to-be-allocated capacity matches the starting position of the cold chain goods.

[0121] As a feasible embodiment of the present application, the determination module 720 is also used to determine the initial transportation capacity corresponding to each of the cold chain goods based on the relationship between the path distance and the Manhattan distance between the starting position and the real-time position; the path distance is obtained based on a heuristic path search algorithm; based on the initial allocation relationship between the cold chain goods and the initial transportation capacity, a first distance matrix is ​​generated; according to the first distance matrix and the second distance matrix corresponding to the path distance, the initial transportation capacity corresponding to the cold chain goods is updated to obtain the target allocated transportation capacity; based on the target allocated transportation capacity corresponding to the cold chain goods, the real-time allocation route between the cold chain goods and the transportation capacity to be allocated is determined.

[0122] As a feasible embodiment of the present application, the determination module 720 is also used to determine, for each cold chain cargo, the to-be-allocated capacity whose path distance between the real-time position and the starting position of the cold chain cargo is equal to the Manhattan distance as the initial capacity corresponding to the cold chain cargo.

[0123] As a feasible embodiment of the present application, the determination module 720 is also used to obtain the arrival location of the cold chain goods; determine the allocation order corresponding to each of the cold chain goods according to the size relationship of the path distance between the starting position and the arrival location; based on the size relationship of the path distance and Manhattan distance between the starting position and the real-time position, and the allocation order, determine the initial transportation capacity corresponding to each of the cold chain goods in turn.

[0124] As a feasible embodiment of the present application, the update module 730 is also used to determine the node cost corresponding to each routing node based on the routing nodes contained in the real-time allocation route; based on the updated capacity position, the starting position and the node cost corresponding to each routing node, determine the updated allocation route between the cold chain goods and the capacity to be allocated; wherein the path distance between the cold chain goods and the capacity to be allocated is associated with the node cost corresponding to the routing node.

[0125] As a feasible embodiment of the present application, the update module 730 is also used to determine whether there is any capacity to be adjusted that meets preset conditions in the capacity to be allocated according to the updated allocation route; the preset conditions include at least one of preset conflict conditions and preset succession conditions; if there is any capacity to be adjusted that meets the preset conditions in the capacity to be allocated, the allocation route of the capacity to be adjusted is adjusted based on the adjustment strategy corresponding to the preset conditions.

[0126] As a feasible embodiment of the present application, the termination module 740 is also used to determine the real-time transportation route corresponding to the cold chain goods based on the starting position and the arrival position corresponding to the cold chain goods; determine the transportation node cost corresponding to each routing node based on the routing nodes contained in the real-time transportation route; determine the updated capacity position of the capacity to be allocated in response to the real-time transportation route, and determine the updated transportation route between the cold chain goods and the capacity to be allocated based on the updated capacity position and the transportation node cost; update the capacity position of the capacity to be allocated in response to the updated transportation route until the capacity position of the capacity to be allocated matches the arrival position of the cold chain goods.

[0127] For the specific limitations of the cold chain routing planning device, please refer to the limitations of the cold chain routing planning method above, which will not be repeated here. The various modules in the above-mentioned cold chain routing planning device can be implemented in whole or in part through software, hardware and their combination. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules. Specifically, Figure 8 As shown, Figure 8 A schematic diagram of the structure of a computer device provided in an embodiment of the present application.

[0128] Specifically, the computer device may include one or more processing core processors 801, one or more storage media memories 802, a power supply 803, an input unit 804 and other components. Those skilled in the art will understand that Figure 8 The computer device structure shown in the figure does not constitute a limitation on the computer device, and may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently. Among them:

[0129] The processor 801 is the control center of the computer device. It uses various interfaces and lines to connect various parts of the entire computer device. By running or executing software programs and / or modules stored in the memory 802, and calling data stored in the memory 802, it executes various functions of the computer device and processes data, thereby monitoring the computer device as a whole. Optionally, the processor 801 may include one or more processing cores; preferably, the processor 801 may integrate a cold chain routing planner and a modem processor, wherein the cold chain routing planner mainly processes the operating system, user interface, and application programs, and the modem processor mainly processes wireless communications. It is understandable that the above-mentioned modem processor may not be integrated into the processor 801.

[0130] The memory 802 can be used to store software programs and modules. The processor 801 executes various functional applications and data processing by running the software programs and modules stored in the memory 802. The memory 802 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the data storage area may store data created according to the use of the computer device, etc. In addition, the memory 802 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other volatile solid-state storage devices. Accordingly, the memory 802 may also include a memory controller to provide the processor 801 with access to the memory 802.

[0131] The computer device also includes a power supply 803 for supplying power to each component. Preferably, the power supply 803 can be logically connected to the processor 801 through a power management system, so that the power management system can manage charging, discharging, power consumption and other functions. The power supply 803 can also include one or more DC or AC power supplies, recharging systems, power failure detection circuits, power converters or inverters, power status indicators and other arbitrary components.

[0132] The computer device may further include an input unit 804, which may be used to receive input digital or character information and generate keyboard, mouse, joystick, optical or trackball signal input related to user settings and function control.

[0133] Although not shown, the computer device may further include a display unit, etc., which will not be described in detail herein. Specifically in this embodiment, the processor 801 in the computer device will load the executable files corresponding to the processes of one or more application programs into the memory 802 according to the following instructions, and the processor 801 will run the application programs stored in the memory 802, thereby executing the following steps:

[0134] Obtain the starting location of the cold chain goods to be delivered in the target cold chain warehouse, as well as the real-time location of the transportation capacity to be allocated;

[0135] Determine a real-time allocation route between the cold chain goods and the transport capacity to be allocated according to the starting position and the real-time position;

[0136] In response to the real-time allocation route, determine an updated capacity position of the to-be-allocated capacity, and, based on the updated capacity position, determine an updated allocation route between the cold chain cargo and the to-be-allocated capacity;

[0137] The transport capacity position of the transport capacity to be allocated is updated in response to the updated allocation route until the transport capacity position of the transport capacity to be allocated matches the starting position of the cold chain goods.

[0138] To this end, an embodiment of the present application provides a computer-readable storage medium, which may include: a read-only memory (ROM), a random access memory (RAM), a disk or an optical disk, etc. A computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the following steps are implemented:

[0139] Obtain the starting location of the cold chain goods to be delivered in the target cold chain warehouse, as well as the real-time location of the transportation capacity to be allocated;

[0140] Determine a real-time allocation route between the cold chain goods and the transport capacity to be allocated according to the starting position and the real-time position;

[0141] In response to the real-time allocation route, determine an updated capacity position of the to-be-allocated capacity, and, based on the updated capacity position, determine an updated allocation route between the cold chain cargo and the to-be-allocated capacity;

[0142] The transport capacity position of the transport capacity to be allocated is updated in response to the updated allocation route until the transport capacity position of the transport capacity to be allocated matches the starting position of the cold chain goods.

[0143] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, please refer to the detailed description of other embodiments above, and will not be repeated here.

[0144] In specific implementation, the above units or structures can be implemented as independent entities, or can be arbitrarily combined to be implemented as the same or several entities. The specific implementation of the above units or structures can refer to the previous method embodiments, which will not be repeated here.

[0145] The specific implementation of the above operations can be found in the previous embodiments, which will not be described in detail here.

[0146] The above is a detailed introduction to a cold chain routing planning method provided in an embodiment of the present application. Specific examples are used herein to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea. At the same time, for those skilled in the art, according to the idea of ​​the present invention, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.

Claims

1. A cold chain routing planning method, characterized in that: include: Obtain the starting location of the cold chain goods to be delivered in the target cold chain warehouse, as well as the real-time location of the transportation capacity to be allocated; Determine a real-time allocation route between the cold chain goods and the transport capacity to be allocated according to the starting position and the real-time position; In response to the real-time allocation route, determine an updated capacity position of the to-be-allocated capacity, and, based on the updated capacity position, determine an updated allocation route between the cold chain cargo and the to-be-allocated capacity; The transport capacity position of the transport capacity to be allocated is updated in response to the updated allocation route until the transport capacity position of the transport capacity to be allocated matches the starting position of the cold chain goods.

2. The cold chain routing planning method according to claim 1, characterized in that: The determining of the real-time allocation route between the cold chain goods and the to-be-allocated transport capacity according to the starting position and the real-time position includes: Determine the initial transport capacity corresponding to each of the cold chain goods based on the relationship between the path distance and the Manhattan distance between the starting position and the real-time position; the path distance is obtained based on a heuristic path search algorithm; Based on the initial allocation relationship between the cold chain goods and the initial transportation capacity, a first distance matrix is ​​generated; According to the first distance matrix and the second distance matrix corresponding to the path distance, the initial transportation capacity corresponding to the cold chain goods is updated to obtain the target allocated transportation capacity; Based on the target allocation capacity corresponding to the cold chain goods, a real-time allocation route between the cold chain goods and the to-be-allocated capacity is determined.

3. The cold chain routing planning method according to claim 2, characterized in that: The determining of the initial transport capacity corresponding to each of the cold chain goods based on the relationship between the path distance and the Manhattan distance between the starting position and the real-time position includes: For each cold chain cargo, the to-be-allocated transport capacity whose path distance between the real-time position and the starting position of the cold chain cargo is equal to the Manhattan distance is determined as the initial transport capacity corresponding to the cold chain cargo.

4. The cold chain routing planning method according to claim 2, characterized in that: The determining of the initial transport capacity corresponding to each of the cold chain goods based on the relationship between the path distance and the Manhattan distance between the starting position and the real-time position includes: Obtaining the delivery location of the cold chain goods; Determine the distribution order corresponding to each of the cold chain goods according to the relationship between the path distances between the starting position and the delivery position; Based on the relationship between the path distance and the Manhattan distance between the starting position and the real-time position, and the allocation order, the initial transportation capacity corresponding to each of the cold chain goods is determined in turn.

5. The cold chain routing planning method according to claim 1, characterized in that: The step of determining an updated allocation route between the cold chain goods and the to-be-allocated transportation capacity based on the updated transportation capacity position includes: Determining a node cost corresponding to each routing node based on the routing nodes included in the real-time allocation route; Based on the updated transport capacity position, the starting position and the node cost corresponding to each of the routing nodes, the updated allocation route between the cold chain goods and the transport capacity to be allocated is determined; wherein the path distance between the cold chain goods and the transport capacity to be allocated is associated with the node cost corresponding to the routing node.

6. The cold chain routing planning method according to claim 5, characterized in that: After the step of determining an updated allocation route between the cold chain goods and the to-be-allocated transport capacity based on the updated transport capacity position, the starting position and the node cost corresponding to each of the routing nodes, the method further includes: Determine, according to the updated allocation route, whether there is any capacity to be adjusted in the capacity to be allocated that meets a preset condition; the preset condition includes at least one of a preset conflict condition and a preset replacement condition; If the transport capacity to be allocated has transport capacity to be adjusted that meets the preset conditions, the allocation route of the transport capacity to be adjusted is adjusted based on the adjustment strategy corresponding to the preset conditions.

7. The cold chain routing planning method according to any one of claims 1 to 6, characterized in that: After the step of updating the transport capacity position of the transport capacity to be allocated in response to the updated allocation route until the transport capacity position of the transport capacity to be allocated matches the starting position of the cold chain goods, the method further comprises: Determine a real-time transportation route corresponding to the cold chain goods according to the starting location and the delivery location corresponding to the cold chain goods; Determining a transportation node cost corresponding to each routing node based on the routing nodes included in the real-time transportation route; In response to the real-time transportation route, determine the updated transportation capacity position of the transportation capacity to be allocated, and, based on the updated transportation capacity position and the transportation node cost, determine the updated transportation route between the cold chain goods and the transportation capacity to be allocated; The transport capacity position of the transport capacity to be allocated is updated in response to the updated transport route until the transport capacity position of the transport capacity to be allocated matches the arrival position of the cold chain goods.

8. A cold chain routing planning device, characterized in that: include The acquisition module is used to obtain the starting position of the cold chain goods to be delivered in the target cold chain warehouse, as well as the real-time position of the transportation capacity to be allocated; A determination module, used to determine a real-time allocation route between the cold chain goods and the transport capacity to be allocated according to the starting position and the real-time position; An updating module, configured to determine an updated transport capacity position of the transport capacity to be allocated in response to the real-time allocation route, and determine an updated allocation route between the cold chain goods and the transport capacity to be allocated based on the updated transport capacity position; The termination module is used to update the capacity position of the to-be-allocated capacity in response to the updated allocation route until the capacity position of the to-be-allocated capacity matches the starting position of the cold chain goods.

9. A computer device, characterized in that: The computer device includes a processor, a memory, and a computer program stored in the memory and executable on the processor, and the processor executes the computer program to implement the cold chain routing planning method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and the computer program is executed by a processor to implement the cold chain routing planning method according to any one of claims 1 to 7.

Images