Route data processing method and device, electronic equipment and computer readable medium

Abstract

Embodiments of the present disclosure disclose a routing data processing method and device, electronic equipment and computer readable medium. A specific embodiment of the processing method comprises: in response to receiving the actual operation information of the target waybill sent by the production terminal, determining the logistics node sequence corresponding to the actual operation information according to the historical actual operation information of the target waybill that has been received; determining the version identifier of the actual operation information based on the logistics node sequence and the logistics link of the actual operation information within the logistics node; and based on the version identifier, updating the target logistics link in the routing plan of the target waybill according to the actual operation information. This embodiment is related to supply chain technology, and by adding an updated version, the pessimistic lock of the waybill dimension can be modified to the optimistic lock of the link dimension. While ensuring the order of actual operation processing, the concurrent processing capability of the system can be improved, thereby improving the data processing efficiency.

Description

Technical Field

[0001] Embodiments of this disclosure relate to the field of supply chain technology, and more particularly to routing data processing methods, apparatus, electronic devices, and computer-readable media. Background Technology

[0002] In supply chain logistics production systems, routing systems typically define a digital model of the production structure of the real physical network. Based on this digital network structure and actual operational information from other production systems, they can calculate and update the distribution plan for each shipment. This is generally defined as a routing plan. As an optimization problem guiding production, the plan often considers as much static data as possible. However, the real world is constantly changing, and the plan is only a theoretical value. Furthermore, the more real-time the input information, the more accurate the plan will be. In actual production, the routing system adjusts subsequent plans promptly based on operational information. This operational information flow generally originates from multiple production terminal systems, such as transportation systems, sorting systems, etc.

[0003] The information disclosed in this background section is only intended to enhance the understanding of the background of the inventive concept, and therefore may contain information that does not constitute prior art known to those skilled in the art. Summary of the Invention

[0004] The summary portion of this disclosure is intended to provide a brief overview of the concepts, which will be described in detail in the detailed description portion. This summary portion is not intended to identify key or essential features of the claimed technical solutions, nor is it intended to limit the scope of the claimed technical solutions.

[0005] Some embodiments of this disclosure provide routing data processing methods, routing data processing apparatuses, electronic devices, computer-readable media, and computer program products to solve one or more of the technical problems mentioned in the background section above.

[0006] In a first aspect, some embodiments of this disclosure provide a routing data processing method, including: in response to receiving operational information of a target waybill sent by a production terminal, determining the order of logistics nodes corresponding to the operational information based on the historical operational information of the target waybill, wherein the operational information includes node information of the logistics node to which the operational information belongs; determining a version identifier of the operational information based on the order of logistics nodes and the logistics links of the operational information within the logistics node to which it belongs, wherein each logistics node contains at least one associated logistics link, and the order of each logistics link within the logistics node is fixed; and updating the target logistics link in the routing plan of the target waybill based on the version identifier and the operational information, wherein the target logistics link includes the logistics link where the operational information is located, and / or the logistics link located after that logistics link.

[0007] In some embodiments, the version identifier of the practical information is determined based on the order of logistics nodes and the logistics links of the practical information within the logistics node. This includes: determining the product of the order value of the logistics node and a preset parameter, and determining the version identifier of the practical information by summing the order value of the logistics link where the practical information is located within the logistics node and the product value, wherein the preset parameter is greater than the maximum number of logistics links.

[0008] In some embodiments, determining the order of logistics nodes corresponding to the received target waybill based on historical operational information includes: in response to determining the logistics node to which the operational information belongs, located between the logistics nodes to which each of the received historical operational information belongs, determining the order value of the logistics node to which the operational information belongs based on the order values ​​of two adjacent logistics nodes; wherein, the preset parameter is a positive integer, and its value ensures that the version identifier of the first logistics link of the subsequent logistics node is greater than the version identifier of the last logistics link of the adjacent preceding logistics node.

[0009] In some embodiments, based on the version identifier and according to the operational information, the target logistics link in the routing plan of the target waybill is updated with data, including: for the logistics link in the routing plan of the target waybill where the operational information is located, updating the operational data in the logistics link according to the operational information, wherein the operational data includes the latest updated version identifier; and for the subsequent logistics link in the routing plan of the target waybill, determining whether to update the planned data in the subsequent logistics link based on the comparison result between the latest updated version identifier of the subsequent logistics link and the version identifier of the operational information.

[0010] In some embodiments, determining whether to update the planning data in the subsequent logistics process based on a comparison between the latest updated version identifier of the subsequent logistics process and the version identifier of the operational information includes: adjusting the planning data of the subsequent logistics process according to the operational information in response to determining that the latest updated version identifier of the subsequent logistics process is less than the version identifier of the operational information, and updating the latest updated version identifier of the subsequent logistics process.

[0011] In some embodiments, the method further includes: in response to concurrently receiving at least two operational information pieces of the target waybill, selecting target operational information from the at least two operational information pieces according to a version identifier, wherein the target operational information is the operational information with the largest version identifier; updating the target logistics link in the routing plan of the target waybill according to the target operational information; and updating the corresponding logistics link in the routing plan according to other operational information pieces other than the target operational information from the at least two operational information pieces, wherein the corresponding logistics link is the logistics link where the other operational information pieces are located, and the logistics link located between the logistics link and the target logistics link.

[0012] In some embodiments, the planning data in the routing plan includes the planned time for each logistics link. The planned time is determined based on the base time of the logistics node to which the logistics link belongs and the incremental time of the logistics link, wherein the incremental time of the first logistics link in the logistics node is a preset value.

[0013] In some embodiments, before determining the order of logistics nodes corresponding to the operation information based on the historical operation information of the received target waybill, the method further includes: determining whether the operation indicated by the operation information is an abnormal operation; and determining the order of logistics nodes corresponding to the operation information in response to determining that it is not an abnormal operation.

[0014] In some embodiments, determining whether the operation indicated by the operation information is an abnormal operation includes: determining that the operation indicated by the operation information is an abnormal operation in response to determining that the operation time of the operation indicated by the operation information is outside the operation time period of the logistics node to which the operation information belongs, wherein the operation data in the routing plan includes the operation time of each logistics link; or, determining that the operation indicated by the operation information is an abnormal operation in response to determining that the operation time of the operation indicated by the operation information is later than the operation time of the next logistics link adjacent to the logistics link where the operation information is located.

[0015] Secondly, some embodiments of this disclosure provide a routing data processing apparatus, including: a node sequence determination unit, configured to, in response to receiving operational information of a target waybill sent by a production terminal, determine the logistics node sequence corresponding to the operational information based on the received historical operational information of the target waybill, wherein the operational information includes node information of the logistics node to which the operational information belongs; a version determination unit, configured to determine a version identifier of the operational information based on the logistics node sequence and the logistics links of the operational information within the logistics node to which it belongs, wherein each logistics node contains at least one associated logistics link, and the order of each logistics link within the logistics node is fixed; and a plan update unit, configured to, based on the version identifier, update the target logistics link in the routing plan of the target waybill according to the operational information, wherein the target logistics link includes the logistics link where the operational information is located, and / or the logistics link located after that logistics link.

[0016] In some embodiments, the version determination unit is further configured to determine the product of the sequence value of the logistics node to which the operation information belongs and a preset parameter, and to determine the version identifier of the operation information by summing the sequence value of the logistics link where the operation information is located within the logistics node and the product value, wherein the preset parameter is greater than the maximum number of logistics links.

[0017] In some embodiments, the node sequence determination unit is further configured to, in response to determining the logistics node to which the operational information belongs, be located between the logistics nodes to which each of the received historical operational information belongs, and determine the sequence value of the logistics node to which the operational information belongs based on the sequence values ​​of two adjacent logistics nodes; wherein, the preset parameter is a positive integer, and its value ensures that the version identifier of the first logistics link of the subsequent logistics node is greater than the version identifier of the last logistics link of the adjacent preceding logistics node.

[0018] In some embodiments, the plan update unit includes: a current stage update subunit, configured to update the operational data in the logistics stage where the operational information is located in the routing plan of the target waybill based on the operational information, wherein the operational data includes the latest updated version identifier; and a subsequent stage update subunit, configured to determine whether to update the plan data in the subsequent logistics stage located after the current logistics stage in the routing plan of the target waybill, based on a comparison between the latest updated version identifier of the subsequent logistics stage and the version identifier of the operational information.

[0019] In some embodiments, the subsequent update subunit is further configured to, in response to determining that the latest update version identifier of the subsequent logistics link is less than the version identifier of the operational information, adjust the planning data of the subsequent logistics link according to the operational information, and update the latest update version identifier of the subsequent logistics link.

[0020] In some embodiments, the routing data processing apparatus further includes a concurrent processing unit configured to, in response to concurrently receiving at least two operational information pieces of a target waybill, select target operational information from the at least two operational information pieces based on a version identifier, wherein the target operational information is the operational information with the largest version identifier; update the target logistics link in the routing plan of the target waybill based on the target operational information; and update the corresponding logistics link in the routing plan based on other operational information pieces other than the target operational information from the at least two operational information pieces, wherein the corresponding logistics link is the logistics link where the other operational information pieces are located, and the logistics link located between the logistics link and the target logistics link.

[0021] In some embodiments, the planning data in the routing plan includes the planned time for each logistics link. The planned time is determined based on the base time of the logistics node to which the logistics link belongs and the incremental time of the logistics link, wherein the incremental time of the first logistics link in the logistics node is a preset value.

[0022] In some embodiments, the routing data processing apparatus further includes an abnormal operation determination unit, configured to determine whether the operation indicated by the operation information is an abnormal operation; and in response to determining that it is not an abnormal operation, to determine the logistics node sequence corresponding to the operation information.

[0023] In some embodiments, the abnormal operation determination unit is further configured to determine that the operation indicated by the operation information is an abnormal operation in response to determining that the operation time of the operation indicated by the operation information is outside the operation time period of the logistics node to which the operation information belongs, wherein the operation data in the routing plan includes the operation time of each logistics link; or, in response to determining that the operation time of the operation indicated by the operation information is later than the operation time of the next logistics link adjacent to the logistics link to which the operation information is located, the operation indicated by the operation information is determined to be an abnormal operation.

[0024] Thirdly, some embodiments of this disclosure provide an electronic device, including: one or more processors; and a storage device having one or more programs stored thereon, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the routing data processing method described in any of the implementations of the first aspect above.

[0025] Fourthly, some embodiments of this disclosure provide a computer-readable medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the routing data processing method described in any of the implementations of the first aspect above.

[0026] Fifthly, some embodiments of this disclosure provide a computer program product, including a computer program that, when executed by a processor, implements the routing data processing method described in any of the implementations of the first aspect above.

[0027] The above embodiments of this disclosure have the following beneficial effects: the routing data processing methods of some embodiments of this disclosure can increase the amount of data processed concurrently by the system and reduce the overall data processing time of the system. Specifically, since there is a strict sequential order in the processing logic between production operations, the routing system also needs to ensure that the final order of operation processing conforms to this sequential order when processing operation information. To this end, related technologies use a global distributed exclusive lock, combined with all historical operation messages participating in the processing order of each real-time operation, thereby ensuring the sequential processing of operation messages so that data under the same business primary key (waybill) can be processed as expected. This will consume a lot of system resources and affect system performance. Moreover, the locking of message processing in related technologies is at the waybill level, which will reduce the amount of data processed concurrently, thereby affecting the time efficiency of system data processing.

[0028] Based on this, the routing data processing method in some embodiments of this disclosure can modify the locking (pessimistic locking) at the waybill level to optimistic locking at the logistics link level by adding version identifiers for practical information. This allows for data updates to the routing plan by comparing updated versions across logistics links. This not only ensures the final sequentiality of practical processing but also increases the amount of data that the system can process concurrently by reducing the locking dimension, thereby improving data processing efficiency. Attached Figure Description

[0029] The above and other features, advantages, and aspects of the embodiments of this disclosure will become more apparent from the accompanying drawings and the following detailed description. Throughout the drawings, the same or similar reference numerals denote the same or similar elements. It should be understood that the drawings are schematic, and elements are not necessarily drawn to scale.

[0030] Figure 1 This is a flowchart of some embodiments of the routing data processing method disclosed herein;

[0031] Figure 2 These are schematic diagrams of some embodiments of a supply chain logistics system;

[0032] Figure 3A These are schematic diagrams illustrating some embodiments of generating version identifiers;

[0033] Figure 3B These are schematic diagrams of some embodiments of practical information conflict handling;

[0034] Figure 3CThese are schematic diagrams of some embodiments of out-of-order arrival of practical information.

[0035] Figure 3D This is a diagram illustrating the planned time for each logistics link in the routing plan;

[0036] Figure 3E These are schematic diagrams of some embodiments of abnormal operations;

[0037] Figure 3F It is a flowchart of routing plans and practical processing in related technologies;

[0038] Figure 3G This is a flowchart of a routing plan using the routing data processing method disclosed herein;

[0039] Figure 4 These are flowcharts of some other embodiments of the routing data processing method disclosed herein;

[0040] Figure 5 This is a schematic diagram of the structure of some embodiments of the routing data processing apparatus disclosed herein;

[0041] Figure 6 This is a schematic diagram of the structure of an electronic device suitable for implementing some embodiments of the present disclosure. Detailed Implementation

[0042] Embodiments of this disclosure will now be described in more detail with reference to the accompanying drawings. While some embodiments of this disclosure are shown in the drawings, it should be understood that this disclosure can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided to provide a more thorough and complete understanding of this disclosure. It should be understood that the accompanying drawings and embodiments of this disclosure are for illustrative purposes only and are not intended to limit the scope of protection of this disclosure.

[0043] It should also be noted that, for ease of description, only the parts relevant to the invention are shown in the accompanying drawings. Unless otherwise specified, the embodiments and features described in this disclosure can be combined with each other.

[0044] It should be noted that the concepts of "first" and "second" mentioned in this disclosure are used only to distinguish different devices, modules or units, and are not used to limit the order of functions performed by these devices, modules or units or their interdependencies.

[0045] It should be noted that the terms "a" and "a plurality of" used in this disclosure are illustrative rather than restrictive, and those skilled in the art should understand that, unless otherwise expressly indicated in the context, they should be understood as "one or more".

[0046] This disclosure will now be described in detail with reference to the accompanying drawings and embodiments.

[0047] Figure 1 A flow 100 of some embodiments of a routing data processing method according to the present disclosure is shown. The processing method includes the following steps:

[0048] Step 101: In response to receiving the operational information of the target waybill sent by the production terminal, determine the sequence of logistics nodes corresponding to the operational information based on the historical operational information of the target waybill that has been received.

[0049] In some embodiments, the execution body of the routing data processing method (e.g. Figure 2 The routing system shown can communicate with other electronic devices via wired or wireless connections. Figure 2 As shown, a supply chain logistics system typically includes multiple point-of-care (POC) production systems and routing systems. POC production systems can include pickup, sorting, transportation, warehousing, and delivery systems, among others. When actual operations occur in these POC production systems, they are usually sent to the routing system as messages (such as operational information). The routing system can then use this information to calculate and update the distribution (transportation and delivery) plan for each waybill, i.e., the routing plan.

[0050] from Figure 2 As can be seen, a routing plan typically includes at least one of the following: logistics nodes, logistics links, routes, operation times, etc. Among these, logistics nodes are usually the same abstract description of different network structures, such as... Figure 2 The diagram may include warehouse A, sorting centers B and C, sales department D, etc. The geographical locations between logistics nodes are generally far apart. Routes are typically used to connect two logistics nodes. A logistics node usually contains at least one logistics link. A logistics link generally refers to business-related actions within or between network points, typically involving changes in the physical location of waybills and the handover of responsibility, such as... Figure 2 The links 11 to 113 shown in the diagram.

[0051] It should be noted that the four types of information—space, time, behavior, and correlation—in the plan itself can meet the goal of guiding production. However, in addition to guiding production, the routing plan also needs to assess whether the actual production behavior on the front line is compliant and efficient. Therefore, corresponding practical information is required based on the plan. Here, the routing plan can be shown in the table below:

[0052]

[0053] In addition, in a routing plan, the four elements often have the following relationship:

[0054]

[0055]

[0056] In some embodiments, upon receiving operational information for a target waybill from a production terminal, the executing entity can determine the sequence of logistics nodes corresponding to the operational information based on the historical operational information of the received target waybills. The target waybill here can be any waybill in the supply chain logistics system. Operational information typically describes the actual production operations in the logistics process, such as the operation content and time. This operational information usually includes node information of the logistics node to which the operation belongs. It is understood that different waybills often have different routing plans. The corresponding routing plans can be distinguished through the waybill.

[0057] In some embodiments, ideally, the operational information of each logistics node arrives sequentially in chronological order. For example... Figure 3A As shown, if the operational information of logistics node 1 (operational information of logistics link 1 or 2) arrives first, since the executing entity has not received any historical operational information for this waybill before, the executing entity can determine that the order value of logistics node 1 corresponding to this operational information is 1. Next, if operational information of logistics node 2 is received, such as operational information from any of logistics links 3-5, since logistics node 2 is after logistics node 1 in the routing plan, the executing entity can then determine that the order value of logistics node 2 is 2.

[0058] Step 102: Based on the order of logistics nodes and the logistics links of the practical information within the respective logistics nodes, determine the version identifier of the practical information.

[0059] In some embodiments, the executing entity can determine the version identifier of the operational information based on the logistics node sequence obtained in step 101 and the order of the operational information within the logistics links of the respective logistics node. Here, the specific algorithm for the version identifier is not limited. For example, the version identifier can be the concatenation of two sequences, such as the order value of the logistics node — (or the order value of the logistics link, etc.)

[0060] As an example, the version identifier (i.e., version number) can be equal to the logistics node sequence * θ + the logistics link sequence within the logistics node. In other words, the executing entity can first determine the product of the sequence value of its logistics node and the preset parameter θ. Next, it can calculate the sum of the sequence value of the logistics link containing the operational information within its logistics node and the product value. This sum can then be used as the version identifier of the operational information.

[0061] like Figure 3AAs shown in the figure, the actual operation indicated by the actual operation information 2 occurs in the logistics link 2. The logistics link 2 belongs to the logistics node 1, and the sequence value of the links within this logistics node is 2. If the preset parameter θ takes the value of 100, the version identifier of the actual operation information 2 can be determined as 1 * 100 + 2 = 102 at this time. By analogy, the version identifier of the actual operation information 3 can be obtained as 201.

[0062] It should be noted that in the generation of the version identifier, the value of the preset parameter θ should first ensure that the influence of the logistics link is less than the influence of the logistics node sequence. That is, the preset parameter should be greater than the maximum number of logistics links. Usually, the number of logistics links is greater than or equal to the number of logistics nodes.

[0063] Step 103, based on the version identifier, update the data of the target logistics link in the routing plan of the target shipping order according to the actual operation information.

[0064] In some embodiments, the execution entity can update the data of the target logistics link in the routing plan of the target shipping order based on the version identifier of the actual operation information and according to the actual operation information. Among them, the target logistics link can include the logistics link where the actual operation information is located, and / or the logistics links after this logistics link. According to Rule 7, the target logistics link can be the logistics link where the actual operation information is located. Or, the target logistics link can be the logistics link where the actual operation information is located and the subsequent logistics links after this logistics link.

[0065] Specifically, for the logistics link where the actual operation information is located in the routing plan of the target shipping order, the execution entity can update the actual operation data in this logistics link according to the actual operation information. For example, update the actual operation network point, actual operation link, actual operation time, actual operation route, etc. of this logistics link. In addition, in order to implement the update according to the version, the routing plan (actual operation data) can also include the latest updated version identifier. And for the subsequent logistics links after this logistics link in the routing plan of the target shipping order, the execution entity can determine whether to update the planned data in the subsequent logistics links according to the comparison result between the latest updated version identifier of the subsequent logistics link and the version identifier of the actual operation information.

[0066] As an example, if it is determined that the latest updated version identifier of the subsequent logistics link is less than the version identifier of the actual operation information, the execution entity can adjust the planned data of the subsequent logistics link according to the actual operation information and update the latest updated version identifier of the subsequent logistics link. For example, the planned time, planned network point, etc. of the subsequent logistics link can be re-determined according to the actual operation time, actual operation node (network point), etc. of this actual operation information.

[0067] As described above, the routing data processing method in some embodiments of this disclosure can modify the locking (pessimistic locking) at the waybill level to an optimistic locking at the logistics link level by adding version identifiers for practical information. This allows for data updates to the routing plan by comparing updated versions across logistics links. This not only ensures the final order of practical processing but also increases the amount of data that the system can process concurrently by reducing the locking dimension, thereby improving data processing efficiency.

[0068] It is understandable that the process of a routing system processing operational data streams typically involves consuming data from multiple input sources in parallel. During this process, because the processing logic between operations has a strict sequential order, the system must also ensure that the operation processing follows this order. This is easily guaranteed in the system that produces operational information (i.e., the production terminal), but often cannot be guaranteed at the receiving end of the operational information (i.e., the routing system). This is because asynchronous systems have various possible causes of message delays. The method in this embodiment, by setting a version identifier, can guarantee the final sequentiality of operational processing.

[0069] It's important to note that a significant factor impacting time performance in these technical solutions is low concurrency. The locking mechanism for message (i.e., operational information) processing in these technologies is at the order dimension. Reducing the locking dimension can improve concurrency. Based on the above abstraction, there are node dimensions under the order dimension, and process dimensions under the node dimension. That is, the dimensions from high to low are: order -> node -> process. According to rules 4 and 5 above, message uniqueness can be guaranteed at the process dimension. Therefore, if message uniqueness is guaranteed beforehand, can it be optimized to eliminate locking? The conclusion is no.

[0070] like Figure 3B As shown, during the concurrent processing of Practical Information 2 and Practical Information 3, there are common subsequent nodes, as shown in stages 4 to 8. According to rule 7, both will update the planning information of the subsequent nodes. A conflict would occur if locking were not implemented. However, Practical Information 2 and Practical Information 3 also follow rule 8. In this case, this embodiment adds the concept of an updated version, i.e., a version identifier. This allows the locking at the waybill dimension (pessimistic locking) to be modified to optimistic locking at the logistics stage dimension. At this point, the execution of the routing plan update must satisfy the condition that the version number is greater than the current version number.

[0071] Pessimistic locking typically refers to a conservative approach to data modification by external factors (including other transactions within the same system and transactions from external systems). Therefore, pessimistic locking keeps the data locked throughout the entire data processing process. Optimistic locking, on the other hand, is generally very optimistic when operating on data, assuming that other threads will not modify the data simultaneously, and therefore does not lock it. However, during updates, it checks whether other threads have updated the data in the meantime. In scenarios with a low probability of concurrent access conflicts, optimistic locking is usually much more efficient than pessimistic locking.

[0072] Specifically, if the executing entity concurrently receives at least two operational information pieces for the target waybill, it can first select the target operational information from the at least two pieces of operational information based on its version identifier. The target operational information is generally the one with the largest version identifier. Next, the target logistics link in the routing plan of the target waybill can be updated based on the target operational information. Additionally, the corresponding logistics links in the routing plan can be updated based on other operational information pieces from the at least two pieces of operational information, excluding the target operational information. These corresponding logistics links are generally the logistics links where other operational information is located, as well as the logistics links located between these logistics links and the target logistics link.

[0073] by Figure 3B Taking the scenario shown as an example, when processing operational information 2 and 3 in parallel, after updating subsequent logistics links based on operational information 2, conflicting logistics links will be updated again based on operational information 3 to update to the latest status of the waybill. In other words, conflicting logistics links can be directly updated based on operational information 3. This not only wastes system resources but also affects the system's processing time. In this situation, using the method of this embodiment, the executing entity can select operational information 3 with a larger version number as the target operational information, thereby updating data for logistics links 3 to 8. Based on operational information 2, only logistics link 2 can be updated. That is, by setting a version identifier, the problem of conflicting links in parallel processing can be resolved, ensuring the sequentiality of operational processing results. It can also improve the high concurrency of operational information processing, reduce unnecessary processing steps, help shorten processing time, and improve processing efficiency.

[0074] In routing plans, the actual sequential processing guarantee is a final ordering guarantee, not a real-time ordering guarantee. Related technical solutions, to ensure message ordering, include... Figure 3FAs shown, processing each action message requires querying and sorting all current action messages. Furthermore, in each action processing, previously processed out-of-order actions are re-consumed. The time and space consumption of these two operations is obvious and will not be elaborated upon here. This operation is a result of the constraints imposed by rules 3, 6, and 7. In high-concurrency design, this embodiment uses rule 8 in conjunction with version identifier design, thereby ensuring the maximum feasible concurrent computation of the routing plan. This design also applies to the processing of out-of-order messages (i.e., out-of-order action information).

[0075] Therefore, the design of version identifiers transforms into ensuring the correct sequence of nodes and the correct sequence of processes within each node. The correct sequence of processes can be directly guaranteed by rule 4. The guarantee of node sequence can be established through fixed logic formed by specific process types and routes. For example, the node carried by a special operation that triggers the routing plan (such as order creation) can be designated as the first node. Subsequent nodes can be determined based on the route information carried in the operation information. The route information typically represents upstream and downstream logistics nodes. For example, when an operation occurs at a logistics node handover point, such as... Figure 3C In logistics links 2 and 3, the operational information can include either downstream or upstream node information. Thus, the node sequence can be determined based on the upstream node sequence in the route information.

[0076] Even when operational information arrives out of order and upstream nodes are nonexistent, the method in this embodiment can still guarantee the sequential order of nodes. Specifically, in response to determining the logistics node to which the operational information belongs, which is located among the logistics nodes to which all previously received operational information belongs, the sequential value of the logistics node to which the operational information belongs can be determined based on the sequential values ​​of two adjacent logistics nodes. The aforementioned preset parameter is typically a positive integer, and its value ensures that the version identifier of the first logistics link of the subsequent logistics node is greater than the version identifier of the last logistics link of the adjacent preceding logistics node.

[0077] As an example, such as Figure 3C As shown, operational information 3, 4, and 5 (all operational steps of logistics node 2) arrive later than operational information 6. At this time, the logistics node containing operational information 6 cannot find its corresponding upstream node based on the route information. For this type of scenario, this embodiment can make a special design for the order of logistics nodes. For special operational types, the routing plan calculation begins and the first node is confirmed as node 1, at which time the order of node 1 is 1. Operation 3 arrives in the routing system earlier than all operations of node 2, at which time the order of node 3 is 2. Operation 2 arrives in the routing system and finds the nodes with the order of 1 and 2. That is, node 2 is located between node 1 and node 3. At this time, the order value of node 2 can be calculated as 1 + (2-1) * 1 / 2 = 1.5.

[0078] Therefore, when the total number of nodes is N, the extreme special case of the problem is: Node 1 -> Node N -> Node N-1 -> Node N-2 ... -> Node 2. That is, the practical information of all nodes except the first node arrives in reverse order. In this case, the list of differences in the order values ​​of each node is: (1 / 2) 1 (1 / 2) 2 (1 / 2) 3 ···(1 / 2) n .

[0079] To ensure that the influence of node order is greater than the influence of process steps, the preset parameter values ​​must guarantee that, under any process step order, the version of the first process step of a subsequent node is greater than the version of the last process step of a preceding node. Consider the critical value judgment under the above extreme case: the version number B2 of the first process step of node 2 > the version number B1 of the last process step of node 1. Where B1 = 1 * θ + Max(number of processes); B2 = (1 + (1 / 2)... n )*θ+0.

[0080] In routing systems, the maximum number of links (Max) and the maximum number of nodes (n) are usually integers less than 10 (set according to specific circumstances). Therefore, θ has a minimum actual value that satisfies the order constraint. For example, B2 = (1 + (1 / 2)... 10 B1 = 1 * θ + 0 = 1.0009765625 * θ; B1 = 1 * θ + 10 = θ + 10. Based on the given conditions, we can establish the inequality: 1.0009765625 * θ > θ + 10. From this, we can calculate that θ > 10240. Therefore, the smallest positive integer θ that satisfies the condition is 10241. Note that this is the smallest integer that satisfies the condition; any integer greater than 10241 also satisfies the condition.

[0081] It should be noted that the node order value obtained from the above calculation formula can be understood as the cardinality of the order value, but it is not the final order value. It still needs to be integerized later using a product of common factors. The core of this invention is to solve the out-of-order problem through this calculation method, without requiring a full sort. An intuitive way to understand this is that it involves queuing; not all nodes need to be present (received) before queuing, but only later-arriving nodes need to be able to cut in line to their appropriate positions. Figure 3F As can be seen, in related technologies, each practical message processing operation requires obtaining all messages and performing full message sorting. Furthermore, handling out-of-order messages introduces pointless routing plan calculations and updates, meaning retries are performed during the processing of forward-order messages. And from... Figure 3GAs can be seen, the method of this disclosure can eliminate high time and space complexity operations such as sorting of practical information and retrying of out-of-order practical information, which can reduce unnecessary resource consumption and improve the processing efficiency of the system.

[0082] In some application scenarios, to reduce the conflict rate of concurrent updates, this embodiment can also make special designs for the planning time. The planning time for each logistics link in the routing plan can be determined based on the base time of the logistics node to which the logistics link belongs, and the incremental time of that logistics link. That is, as... Figure 3D As shown, the planned time for a logistics process consists of two parts: the base time of the current node and the offset time of the current step within the node. The offset time of the first logistics step within a logistics node can be set to a preset value, typically zero. This allows the planned time field to be transformed from a direct mapping to a calculated mapping (planned time = base + offset) when displayed in the view.

[0083] It is understandable that various situations can occur during actual production, leading to discrepancies between actual operations and the planned route (static routing). Therefore, the arrival of practical operation messages can change subsequent route operations at any time. The entire plan is recalculated, which we define as dynamic routing. When multiple practical operations arrive, their subsequent sequences inevitably overlap, and conflicts occur when all need to be updated. The effect of optimistic locking is generally more pronounced the smaller the conflict. Therefore, this invention, by designing the planned time and utilizing the baseline time of nodes, can elevate time from the stage dimension to the node dimension. This reduces the number of potentially conflicting practical operation messages, transforming stage conflicts into node conflicts, thereby lowering the conflict rate.

[0084] Continue to refer to Figure 4 The diagram illustrates a flow 400 of another embodiment of the routing data processing method according to this disclosure. This processing method may include the following steps:

[0085] Step 401: In response to receiving the operational information of the target waybill sent by the production terminal, determine whether the operational information indicates an abnormal operational operation.

[0086] In some embodiments, when the execution body of the routing data processing method receives the operational information of the target waybill sent by the production terminal, it can first determine whether the operational information indicates an abnormal operational practice. Abnormal operational practices are typically illegal or erroneous practices. For example, in actual production processes, there may be scenarios where frontline employees complete supplementary operational practices. Such practices are not considered legal practices, do not meet Rule 7, and should be identified and marked as erroneous practices, and the plans for subsequent stages should not be updated.

[0087] Here, the executing entity can determine whether an operation is abnormal using at least one of the following methods. For example, operation data in a routing plan typically includes the operation time for each logistics link. In this case, if the operation time indicated by the operation information is determined to be outside the operation time period of the logistics node to which the operation information belongs, then the operation indicated by the operation information can be determined to be an abnormal operation. For example... Figure 3E As shown, the operation information for node 1 is not within the valid operation period [base1, base2) of logistics node 1, i.e., it is in an illegal operation period. In this case, the operation indicated by the operation information of node 1 is an abnormal operation. For example, if a package has already arrived at logistics node 2, but a worker at logistics node 1 reissues an operation for logistics node 1, then when the system receives this operation information, it will identify the operation of node 1 as an abnormal operation.

[0088] In some alternative implementations, if the operation time indicated by the operation information is later than the operation time of the next logistics link adjacent to the operation information, then the operation indicated by the operation information can also be determined to be an abnormal operation. For example, if the operation time is within the valid operation period but later than the operation time of the first subsequent link, it does not meet the requirements of rule 2 or rule 5 above. In this case, it can also be said that the operation is an abnormal operation.

[0089] In some embodiments, if the executing entity determines that the practice indicated by the practice information is not an abnormal practice, the following steps can continue to be executed. It should be noted that if the abnormal practice arrives later than the subsequent practice, the subsequent plan cannot be updated due to version number rules. This meets the application scenario requirements and demonstrates that the method of this disclosure embodiment is compatible with special practices. If the abnormal practice arrives earlier than the subsequent practice, although it may cause temporary erroneous plan data, it can be updated to correct data after the subsequent practice arrives, thus still ensuring the final correctness of the data. Therefore, it can be inferred that this solution is compatible with such abnormal practices.

[0090] Step 402: In response to determining that it is not an abnormal operation, determine the sequence of logistics nodes corresponding to the operation information based on the historical operation information of the received target waybill.

[0091] Step 403: Based on the order of logistics nodes and the logistics links of the practical information within the respective logistics nodes, determine the version identifier of the practical information.

[0092] Step 404: Based on the version identifier and the actual operation information, update the data of the target logistics link in the routing plan of the target waybill.

[0093] In some embodiments, a detailed description of the above steps can be found in [reference needed]. Figure 1 The relevant descriptions in the embodiments will not be repeated here.

[0094] The routing data processing method of this disclosure further enriches and improves the judgment process for abnormal operations. This helps to reduce unnecessary or erroneous routing plan update processing, thereby reducing resource consumption and waste, and also improving the system's data processing efficiency.

[0095] Further reference Figure 5 As a response to the above Figures 1 to 4 The present disclosure provides some embodiments of a routing data processing apparatus to implement the processing method shown. These processing apparatus embodiments are similar to... Figures 1 to 4 The illustrated processing method embodiments correspond to these. This routing data processing device can be specifically applied to various electronic devices.

[0096] like Figure 5 As shown, the routing data processing apparatus 500 in some embodiments may include: a node sequence determination unit 501, configured to determine the logistics node sequence corresponding to the operational information based on the received historical operational information of the target waybill in response to receiving operational information of the target waybill sent by the production terminal, wherein the operational information includes node information of the logistics node to which the operation belongs; a version determination unit 502, configured to determine a version identifier of the operational information based on the logistics node sequence and the logistics links of the operational information within the logistics node to which it belongs, wherein each logistics node contains at least one associated logistics link, and the order of each logistics link within the logistics node is fixed; and a plan update unit 503, configured to update the target logistics link in the routing plan of the target waybill based on the version identifier and the operational information, wherein the target logistics link includes the logistics link where the operational information is located and / or the logistics link located after that logistics link.

[0097] In some embodiments, the version determination unit 502 may be further configured to determine the product of the sequence value of the logistics node to which the operation information belongs and a preset parameter, and to determine the version identifier of the operation information by summing the sequence value of the logistics link where the operation information is located within the logistics node and the product value, wherein the preset parameter is greater than the maximum number of logistics links.

[0098] In some embodiments, the node sequence determination unit 501 may be further configured to, in response to determining the logistics node to which the operational information belongs, be located between the logistics nodes to which each of the received historical operational information belongs, and determine the sequence value of the logistics node to which the operational information belongs based on the sequence values ​​of two adjacent logistics nodes; wherein, the preset parameter is a positive integer, and its value ensures that the version identifier of the first logistics link of the subsequent logistics node is greater than the version identifier of the last logistics link of the adjacent preceding logistics node.

[0099] In some embodiments, the plan update unit 503 may include: a current stage update subunit (not shown in the figure), configured to update the operational data in the logistics stage where the operational information is located in the routing plan of the target waybill based on the operational information, wherein the operational data includes the latest updated version identifier; and a subsequent stage update subunit (not shown in the figure), configured to determine whether to update the plan data in the subsequent logistics stage located after the current logistics stage in the routing plan of the target waybill based on the comparison result between the latest updated version identifier of the subsequent logistics stage and the version identifier of the operational information.

[0100] In some embodiments, the subsequent update subunit may be further configured to, in response to determining that the latest update version identifier of the subsequent logistics link is less than the version identifier of the operational information, adjust the planning data of the subsequent logistics link according to the operational information, and update the latest update version identifier of the subsequent logistics link.

[0101] In some embodiments, the routing data processing apparatus 500 may further include a concurrent processing unit (not shown in the figure), configured to, in response to concurrently receiving at least two operational information pieces of a target waybill, select target operational information from the at least two operational information pieces according to a version identifier, wherein the target operational information is the operational information with the largest version identifier; and update the target logistics link in the routing plan of the target waybill according to the target operational information; and update the corresponding logistics link in the routing plan according to other operational information pieces other than the target operational information from the at least two operational information pieces, wherein the corresponding logistics link is the logistics link where the other operational information pieces are located, and the logistics link located between the logistics link and the target logistics link.

[0102] In some embodiments, the planning data in the routing plan includes the planned time for each logistics link. The planned time is determined based on the base time of the logistics node to which the logistics link belongs and the incremental time of the logistics link, wherein the incremental time of the first logistics link in the logistics node is a preset value.

[0103] In some embodiments, the routing data processing device 500 may further include an abnormal operation determination unit (not shown in the figure), configured to determine whether the operation indicated by the operation information is an abnormal operation; and in response to determining that it is not an abnormal operation, to determine the logistics node sequence corresponding to the operation information.

[0104] In some embodiments, the abnormal operation determination unit may be further configured to determine that the operation indicated by the operation information is an abnormal operation in response to determining that the operation time of the operation indicated by the operation information is outside the operation time period of the logistics node to which the operation information belongs, wherein the operation data in the routing plan includes the operation time of each logistics link; or, in response to determining that the operation time of the operation indicated by the operation information is later than the operation time of the next logistics link adjacent to the logistics link to which the operation information is located, the operation indicated by the operation information is determined to be an abnormal operation.

[0105] It is understandable that the units described in the routing data processing device 500 are related to the reference. Figures 1 to 4 The steps in the described method correspond to each other. Therefore, the operations, features, and beneficial effects described above for the method also apply to the processing device 500 and the units contained therein, and will not be repeated here.

[0106] The following is for reference. Figure 6 It shows a schematic diagram of the structure of an electronic device 600 suitable for implementing some embodiments of the present disclosure. Figure 6 The electronic device shown is merely an example and should not be construed as limiting the functionality and scope of the embodiments of this disclosure.

[0107] like Figure 6 As shown, the electronic device 600 may include a processing unit 601 (e.g., a central processing unit, a graphics processor, etc.) that can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 602 or a program loaded from a storage device 608 into a random access memory (RAM) 603. The RAM 603 also stores various programs and data required for the operation of the terminal device 600. The processing unit 601, ROM 602, and RAM 603 are interconnected via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0108] Typically, the following devices can be connected to I / O interface 605: input devices 606 including, for example, touchscreens, touchpads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, etc.; output devices 607 including, for example, speakers, vibrators, etc.; storage devices 608 including, for example, disks, hard disks, etc.; and communication devices 609. Communication device 609 allows electronic device 600 to communicate wirelessly or wiredly with other devices to exchange data. Although Figure 6 An electronic device 600 with various devices is shown; however, it should be understood that it is not required to implement or possess all of the devices shown. More or fewer devices may be implemented or possessed alternatively. Figure 6 Each box shown can represent a device or multiple devices as needed.

[0109] In particular, according to some embodiments of this disclosure, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, some embodiments of this disclosure include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication device 609, or installed from a storage device 608, or installed from a ROM 602. When the computer program is executed by the processing device 601, it performs the functions defined above in the methods of some embodiments of this disclosure.

[0110] It should be noted that, in some embodiments of this disclosure, the computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium, or any combination thereof. A computer-readable storage medium may be, for example,—but not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In some embodiments of this disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In some embodiments of this disclosure, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium can be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted using any suitable medium, including but not limited to: wires, optical fibers, RF (radio frequency), etc., or any suitable combination thereof.

[0111] In some implementations, clients and servers can communicate using any currently known or future-developed network protocol such as HTTP (Hypertext Transfer Protocol) and can interconnect with digital data communication (e.g., communication networks) of any form or medium. Examples of communication networks include local area networks (“LANs”), wide area networks (“WANs”), the Internet (e.g., the Internet of Things), and end-to-end networks (e.g., ad hoc end-to-end networks), as well as any currently known or future-developed networks.

[0112] The aforementioned computer-readable medium may be included in the aforementioned electronic device; or it may exist independently and not assembled into the electronic device. The aforementioned computer-readable medium carries one or more programs that, when executed by the electronic device, cause the electronic device to: in response to receiving operational information of a target waybill sent by a production terminal, determine the sequence of logistics nodes corresponding to the operational information based on the received historical operational information of the target waybill, wherein the operational information includes node information of the logistics node to which the operational information belongs; determine a version identifier of the operational information based on the logistics node sequence and the logistics links within the logistics node to which the operational information belongs, wherein each logistics node contains at least one associated logistics link, and the order of each logistics link within the logistics node is fixed; and update the target logistics link in the routing plan of the target waybill based on the version identifier and the operational information, wherein the target logistics link includes the logistics link where the operational information is located and / or the logistics link following that logistics link.

[0113] Furthermore, computer program code for performing operations of some embodiments of this disclosure can be written in one or more programming languages ​​or a combination thereof. Programming languages ​​include object-oriented programming languages—such as Java, Smalltalk, and C++—and conventional procedural programming languages—such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0114] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this disclosure. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0115] The units described in some embodiments of this disclosure can be implemented in software or hardware. The described units can also be housed in a processor; for example, a processor may be described as including a node sequence determination unit, a version determination unit, and a plan update unit. The names of these units do not necessarily limit the specific unit; for example, the node sequence determination unit may also be described as "a unit that determines the sequence of logistics nodes corresponding to operational information."

[0116] The functions described above in this document can be performed, at least in part, by one or more hardware logic components. For example, exemplary types of hardware logic components that can be used, without limitation, include: Field Programmable Gate Arrays (FPGAs), Application-Specific Integrated Circuits (ASICs), Application Standard Products (ASSPs), System-on-Chip (SoCs), Complex Programmable Logic Devices (CPLDs), and so on.

[0117] Some embodiments of this disclosure also provide a computer program product, including a computer program that, when executed by a processor, implements any of the routing data processing methods described above.

[0118] The above description is merely a selection of preferred embodiments of this disclosure and an explanation of the technical principles employed. Those skilled in the art should understand that the scope of the invention involved in the embodiments of this disclosure is not limited to technical solutions formed by specific combinations of the above-described technical features, but should also cover other technical solutions formed by arbitrary combinations of the above-described technical features or their equivalents without departing from the above-described inventive concept. For example, technical solutions formed by substituting the above-described features with (but not limited to) technical features with similar functions disclosed in the embodiments of this disclosure.

Claims

1. A method for routing data processing, comprising: in response to receiving real operation information of a target waybill sent by a production terminal, determining a sequence of logistics nodes corresponding to the real operation information according to historical real operation information of the target waybill, wherein the real operation information comprises node information of a logistics node to which the real operation belongs; based on the sequence of logistics nodes and a sequence of logistics links within the logistics node to which the real operation information belongs, determining a version identifier of the real operation information, wherein each logistics node comprises at least one associated logistics link, and the sequence of logistics links within the logistics node is fixed, and the version identifier is a splicing result of the two sequences; based on the version identifier, updating target logistics links in a routing plan of the target waybill according to the real operation information, wherein the target logistics links comprise the logistics link in which the real operation information is located and / or logistics links after the logistics link.

2. The routing data processing method of claim 1, wherein, The determination of the version identifier of the real operation information based on the sequence of logistics nodes and the logistics links within the logistics node to which the real operation information belongs comprises: determining a product value of the sequence value of the logistics node and a preset parameter, and determining a sum value of the sequence value of the logistics link in which the real operation information is located within the logistics node and the product value as the version identifier of the real operation information, wherein the preset parameter is greater than the maximum number of logistics links.

3. The routing data processing method of claim 2, wherein, The determination of the sequence of logistics nodes corresponding to the real operation information according to the historical real operation information of the target waybill comprises: in response to determining that the logistics node to which the real operation information belongs is located between the logistics nodes to which the historical real operation information has been received, determining the sequence value of the logistics node to which the real operation information belongs according to the sequence values of the two adjacent logistics nodes. The preset parameter is a positive integer, and the value of the preset parameter ensures that the version identifier of the first logistics link of the subsequent logistics node is greater than the version identifier of the last logistics link of the adjacent previous logistics node.

4. The routing data processing method of claim 1, wherein, The updating of the target logistics links in the routing plan of the target waybill according to the real operation information based on the version identifier comprises: for the logistics link in which the real operation information is located in the routing plan of the target waybill, updating real operation data in the logistics link according to the real operation information, wherein the real operation data comprises a latest updated version identifier; and for subsequent logistics links after the logistics link in the routing plan of the target waybill, determining whether to update plan data in the subsequent logistics links according to a comparison result of the latest updated version identifier of the subsequent logistics links and the version identifier of the real operation information.

5. The routing data processing method of claim 4, wherein, The determination of whether to update the plan data in the subsequent logistics links according to the comparison result of the latest updated version identifier of the subsequent logistics links and the version identifier of the real operation information comprises: in response to determining the latest updated version identifier of the subsequent logistics link, which is less than the version identifier of the actual operation information, adjusting the plan data of the subsequent logistics link according to the actual operation information, and updating the latest updated version identifier of the subsequent logistics link.

6. The routing data processing method of claim 1, wherein, The method further comprises: in response to concurrently receiving at least two actual operation information of the target waybill, selecting target actual operation information from the at least two actual operation information according to version identifiers, wherein the target actual operation information is the actual operation information with the largest version identifier; and updating data of a target logistics link in a routing plan of the target waybill according to the target actual operation information; updating data of corresponding logistics links in the routing plan according to actual operation information other than the target actual operation information in the at least two actual operation information, wherein the corresponding logistics links are logistics links in which the other actual operation information is located and logistics links located between the logistics links and the target logistics link.

7. The routing data processing method of claim 1, wherein, The plan data in the routing plan comprises plan times of the logistics links, which are determined according to reference times of logistics nodes to which the logistics links belong and increment times of the logistics links, wherein the increment time of a first logistics link in a logistics node is a preset value.

8. The routing data processing method according to one of claims 1-7, wherein, Before the determining the logistics node sequence corresponding to the actual operation information according to the historical actual operation information of the target waybill that has been received, the method further comprises: determining whether the actual operation indicated by the actual operation information is an abnormal actual operation; in response to determining that the actual operation is not an abnormal operation, determining the logistics node sequence corresponding to the actual operation information.

9. The routing data processing method of claim 8, wherein, The determining whether the actual operation indicated by the actual operation information is an abnormal actual operation comprises: in response to determining that an actual operation time of the actual operation indicated by the actual operation information is outside an actual operation time period of a logistics node to which the actual operation information belongs, determining that the actual operation indicated by the actual operation information is an abnormal actual operation, wherein actual operation data in the routing plan comprises actual operation times of the logistics links; or in response to determining that the actual operation time of the actual operation indicated by the actual operation information is later than an actual operation time of a subsequent logistics link adjacent to the logistics link in which the actual operation information is located, determining that the actual operation indicated by the actual operation information is an abnormal actual operation.

10. A routing data processing apparatus, comprising: a node sequence determination unit configured to, in response to receiving actual operation information of a target waybill sent by a production terminal, determine a logistics node sequence corresponding to the actual operation information according to historical actual operation information of the target waybill that has been received, wherein the actual operation information comprises node information of a logistics node to which an actual operation belongs; a version determination unit configured to determine a version identifier of the actual operation information based on the logistics node sequence and a sequence of a logistics link in the logistics node to which the actual operation information belongs, wherein each logistics node comprises at least one associated logistics link, and the sequence of each logistics link in the logistics node is fixed, and the version identifier is a splicing result of the two sequences; A plan updating unit is configured to update, according to the actual operation information, a target logistics link in a route plan of the target waybill based on the version identifier, wherein the target logistics link includes a logistics link where the actual operation information is located and / or a logistics link after the logistics link. 11.An electronic device, comprising: one or more processors; a memory device having stored thereon one or more programs, when the one or more programs are executed by the one or more processors, the one or more processors implement the route data processing method according to any one of claims 1-9.

12. A computer readable medium having stored thereon a computer program, wherein, The computer program is executed by the processor to implement the route data processing method according to any one of claims 1-9. 13.A computer program product comprising a computer program which, when executed by a processor, implements the route data processing method according to any one of claims 1-9.

Images