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

Abstract

The embodiment of the invention discloses a routing data processing method and device, electronic equipment and a computer readable medium. A specific embodiment of the processing method comprises the following steps: in response to the received practical operation information of a target waybill sent by a production terminal, determining a logistics node sequence corresponding to the practical operation information according to the received historical practical operation information of the target waybill; determining a version identifier of the practical operation information based on the logistics node sequence and a logistics link of the practical operation information in the logistics node to which the practical operation information belongs; and performing data updating on a target logistics link in a routing plan of the target waybill based on the version identifier according to the practical operation information. The implementation mode is related to a supply chain technology, and a pessimistic lock in a waybill dimension can be modified into an optimistic lock in a link dimension by adding an updated version. The concurrent processing capability of the system can be improved while the sequencing of the practical operation processing is ensured, so that the data processing efficiency is improved.

Description

Technical Field

[0001] Embodiments of the present disclosure relate to the field of supply chain technology, and in particular to a routing data processing method, device, electronic device, and computer-readable medium. Background Art

[0002] In the supply chain logistics production system, the routing system usually defines a digital model of the production structure of the real physical network, and based on the digital network structure and the actual operation information of other production systems, it can calculate and update the distribution plan of each waybill. It is generally defined as a routing plan. As a result of the optimization problem guiding production, the plan often considers as much static data as possible. However, the real world is changing rapidly, and the plan is only a theoretical value. And the more real-time the input information is, the more accurate the plan result will be. In the actual production process, the routing system will adjust the subsequent plan in a timely manner according to the actual operation information. The actual operation information flow generally comes from multiple production terminal systems, such as transportation systems, sorting systems, etc.

[0003] The above information disclosed in this Background section is only for enhancement of understanding of the background of the inventive concept and therefore it may contain information that does not form the prior art that is already known in this country to a person of ordinary skill in the art. Summary of the invention

[0004] The content of this disclosure is used to introduce concepts in a brief form, which will be described in detail in the detailed implementation section below. The content of this disclosure is not intended to identify the key features or essential features of the technical solution claimed for protection, nor is it intended to limit the scope of the technical solution claimed for protection.

[0005] Some embodiments of the present disclosure propose a routing data processing method, a routing data processing device, an electronic device, a computer-readable medium, and a computer program product to solve one or more of the technical problems mentioned in the above background technology section.

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

[0007] In some embodiments, based on the order of logistics nodes and the logistics links of the actual operation information within the logistics node to which the actual operation information belongs, the version identifier of the actual operation information is determined, including: determining the product value of the sequence value of the logistics node to which it belongs and the preset parameter, and determining the sum of the sequence value of the logistics link where the actual operation information is located in the logistics node to which it belongs and the product value as the version identifier of the actual operation information, wherein the preset parameter is greater than the maximum number of logistics links.

[0008] In some embodiments, the order of logistics nodes corresponding to the actual operation information is determined based on the historical actual operation information of the received target waybill, including: in response to determining that the logistics node to which the actual operation information belongs is located between the logistics nodes to which the received historical actual operation information belongs, the order value of the logistics node to which the actual operation information belongs is determined 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 previous logistics node.

[0009] In some embodiments, based on the version identification and according to the actual operation information, data of the target logistics link in the routing plan of the target waybill is updated, including: for the logistics link where the actual operation information is located in the routing plan of the target waybill, the actual operation data in the logistics link is updated according to the actual operation information, wherein the actual operation data includes the latest updated version identification; and for the subsequent logistics link located after the logistics link in the routing plan of the target waybill, based on the comparison result of the latest updated version identification of the subsequent logistics link and the version identification of the actual operation information, it is determined whether to update the plan data in the subsequent logistics link.

[0010] In some embodiments, whether to update the planned data in the subsequent logistics link is determined based on the comparison result of the latest updated version identifier of the subsequent logistics link with the version identifier of the actual operation information, including: in response to determining that the latest updated version identifier of the subsequent logistics link is less than the version identifier of the actual operation information, adjusting the planned data of the subsequent logistics link according to the actual operation information, and updating the latest updated version identifier of the subsequent logistics link.

[0011] In some embodiments, the method also includes: in response to at least two actual operation information of the target waybill received concurrently, selecting the target actual operation information from the at least two actual operation information according to the version identifier, wherein the target actual operation information is the actual operation information with the largest version identifier; and updating the data of the target logistics link in the routing plan of the target waybill according to the target actual operation information; updating the data of the corresponding logistics link in the routing plan according to other actual operation information except the target actual operation information in the at least two actual operation information, wherein the corresponding logistics link is the logistics link where the other actual operation information is located, and the logistics link between the logistics link and the target logistics link.

[0012] In some embodiments, the planning data in the routing plan includes the planning time of each logistics link. The planning 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 also includes: determining whether the operation indicated by the operation information is an abnormal operation; in response to determining that it is not an abnormal operation, determining the order of logistics nodes corresponding to the operation information.

[0014] In some embodiments, determining whether the operation indicated by the operation information is an abnormal operation includes: 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, determining that the operation indicated by the operation information is an abnormal operation, 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 a subsequent logistics link adjacent to the logistics link where the operation information is located, determining that the operation indicated by the operation information is an abnormal operation.

[0015] In a second aspect, some embodiments of the present disclosure provide a routing data processing device, including: a node sequence determination unit, configured to respond to the actual operation information of the target waybill sent by the production terminal, and determine the logistics node sequence corresponding to the actual operation information according to the historical actual operation information of the received target waybill, wherein the actual operation information includes the node information of the logistics node to which the actual operation belongs; a version determination unit, configured to determine the version identification of the actual operation information based on the logistics node sequence and the logistics link of the actual operation information in 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 in the logistics node is fixed; a plan update unit, configured to update the data of the target logistics link in the routing plan of the target waybill based on the version identification and the actual operation information, wherein the target logistics link includes the logistics link where the actual operation information is located, and / or the logistics link located after the logistics link.

[0016] In some embodiments, the version determination unit is further configured to determine the product value of the sequence value of the logistics node to which it belongs and the preset parameter, and to determine the sum of the sequence value of the logistics link where the actual operation information is located in the logistics node to which it belongs and the product value as the version identifier of the actual operation information, 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 respond to determining that the logistics node to which the actual operation information belongs is located between the logistics nodes to which the received historical practical operation information belongs, and determine the sequence value of the logistics node to which the actual operation information belongs based on the sequence values ​​of the 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 previous logistics node.

[0018] In some embodiments, the plan update unit includes: a current link update sub-unit, which is configured to update the practical operation data in the logistics link where the practical operation information is located in the routing plan of the target waybill according to the practical operation information, wherein the practical operation data includes the latest updated version identifier; a subsequent link update sub-unit, which is configured to determine whether to update the plan data in the subsequent logistics link according to the comparison result of the latest updated version identifier of the subsequent logistics link and the version identifier of the practical operation information for the subsequent logistics link located after the logistics link in the routing plan of the target waybill.

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

[0020] In some embodiments, the routing data processing device also includes a concurrent processing unit, which is configured to respond to at least two actual operation information of the target waybill received concurrently, select target actual operation information from the at least two actual operation information according to a version identifier, wherein the target actual operation information is the actual operation information with the largest version identifier; and update the data of the target logistics link in the routing plan of the target waybill according to the target actual operation information; update the data of the corresponding logistics link in the routing plan according to other actual operation information except the target actual operation information in the at least two actual operation information, wherein the corresponding logistics link is the logistics link where the other actual operation information is located, and the logistics link between the logistics link and the target logistics link.

[0021] In some embodiments, the planning data in the routing plan includes the planning time of each logistics link. The planning 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 device also includes an abnormal operation determination unit, which is configured to determine whether the operation indicated by the operation information is an abnormal operation; in response to determining that it is not an abnormal operation, 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 actual operation information is an abnormal operation in response to the actual operation time of the actual operation indicated by the actual operation information being outside the actual operation time period of the logistics node to which the actual operation information belongs, wherein the actual operation data in the routing plan includes the actual operation time of each logistics link; or, in response to determining that the actual operation time indicated by the actual operation information is later than the actual operation time of a subsequent logistics link adjacent to the logistics link where the actual operation information is located, determine that the operation indicated by the actual operation information is an abnormal operation.

[0024] In a third aspect, some embodiments of the present disclosure provide an electronic device, comprising: one or more processors; a storage device on which one or more programs are stored, and 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 implementation method in the above-mentioned first aspect.

[0025] In a fourth aspect, some embodiments of the present disclosure provide a computer-readable medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the routing data processing method described in any implementation manner in the above-mentioned first aspect is implemented.

[0026] In a fifth aspect, some embodiments of the present disclosure provide a computer program product, including a computer program, which, when executed by a processor, implements the routing data processing method described in any implementation manner in the above-mentioned first aspect.

[0027] The above-mentioned various embodiments of the present disclosure have the following beneficial effects: the routing data processing method of some embodiments of the present 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 sequence of processing logic between production operations, the routing system also needs to ensure that the final order of the actual operation processing is also in accordance with the sequence when processing the actual operation information. To this end, the relevant technology will use a global distributed exclusive lock, and combine all historical actual operation messages to participate in the processing and sorting of each real-time actual operation, so as to ensure the sequential processing of the actual operation messages, so that the data under the same business primary key (waybill) can be processed as expected. This will take up a lot of system resources and affect system performance. Moreover, the locking of message processing in the relevant technology is the waybill dimension, which will reduce the amount of data processed concurrently, thereby affecting the time efficiency of the system in processing data.

[0028] Based on this, the routing data processing method in some embodiments of the present disclosure can modify the locking (pessimistic lock) of the waybill dimension to the optimistic lock of the logistics link dimension by adding the version identifier of the actual operation information. In this way, by comparing the updated versions between the logistics links, the data of the routing plan can be updated. Not only can the final sequentiality of the actual operation processing be guaranteed, but by reducing the locking dimension, the amount of data processed concurrently by the system can also be increased, thereby helping to improve the data processing efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0030] Figure 1 are flow charts of some embodiments of the routing data processing method disclosed herein;

[0031] Figure 2 are schematic diagrams of some embodiments of supply chain logistics systems;

[0032] Figure 3A is a schematic diagram of some embodiments of generating version identification;

[0033] Figure 3B is a schematic diagram of some embodiments of practical information processing conflicts;

[0034] Figure 3CThis is a schematic diagram of some embodiments of the out-of-order arrival of practical information

[0035] Figure 3D It is a schematic diagram of the planned time of each logistics link in the routing plan;

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

[0037] Figure 3F It is a flow chart of routing planning and practical processing in the related art;

[0038] Figure 3G is a flow chart of a route plan using the route data processing method disclosed herein;

[0039] Figure 4 are flow charts of other embodiments of the routing data processing method disclosed herein;

[0040] Figure 5 is a schematic diagram of the structure of some embodiments of the routing data processing device disclosed in the present invention;

[0041] Figure 6 It is a schematic diagram of the structure of an electronic device suitable for implementing some embodiments of the present disclosure. DETAILED DESCRIPTION

[0042] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments set forth herein. On the contrary, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0043] It should also be noted that, for ease of description, only the parts related to the invention are shown in the drawings. In the absence of conflict, the embodiments and features in the embodiments of the present disclosure can be combined with each other.

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

[0045] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0046] The present disclosure will be described in detail below with reference to the accompanying drawings and in conjunction with embodiments.

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

[0048] Step 101, in response to receiving the actual operation information of the target waybill sent by the production terminal, determine the logistics node sequence corresponding to the actual operation information according to the historical actual operation information of the received target waybill.

[0049] In some embodiments, the execution body of the routing data processing method (eg Figure 2 The routing system shown in FIG. 1 can communicate with other electronic devices through a wired connection or a wireless connection. Figure 2 As shown in the figure, the supply chain logistics system usually includes multiple network production systems and routing systems. The network production system can be a collection system, a sorting system, a transportation system, a warehousing system, and a delivery system. When actual operations occur in these network production systems, they are usually sent to the routing system in the form of messages (such as actual operation information, referred to as actual operation information). In this way, the routing system can calculate and update the distribution (transportation and delivery) plan of each waybill based on this information, that is, the routing plan.

[0050] from Figure 2 As can be seen from the figure, a routing plan usually includes at least one of the following: logistics nodes, logistics links, routes, operation time, etc. Among them, logistics nodes are usually the same abstract description of different network structures, such as Figure 2 The example shown may include warehouse A, sorting centers B and C, sales department D, etc. The geographical locations between logistics nodes are generally far apart. Lines are generally used to connect two logistics nodes in series. A logistics node usually contains at least one logistics link. Logistics links generally refer to behaviors with business semantics within or between outlets, usually including physical location changes and responsibility transfers of waybills, such as Figure 2 The links 11 to 113 shown in FIG.

[0051] It should be noted that the four types of information in the plan itself, space, time, behavior, and association, can meet the goal of guiding production. However, in addition to guiding production, the routing plan also needs to be responsible for assessing whether the actual production behavior of 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 following table:

[0052]

[0053] In addition, in the routing plan, the four elements often have the following regular association relationships, namely:

[0054]

[0055]

[0056] In some embodiments, when the execution entity receives the actual operation information of the target waybill sent by the production terminal, it can determine the order of logistics nodes corresponding to the actual operation information based on the historical actual operation information of the target waybill that has been received. The target waybill here can be any waybill in the supply chain logistics system. The actual operation information is usually used to describe the information of the actual production operation in the logistics link, such as operation content, operation time, etc. Among them, the actual operation information can usually include the node information of the logistics node to which the actual operation belongs. It can be understood that the routing plans of different waybills are often different. The corresponding routing plans can be distinguished by the waybill.

[0057] In some embodiments, ideally, the actual operation information of each logistics node arrives in sequence. Figure 3A As shown, if the actual operation information of logistics node 1 (the actual operation information of logistics link 1 or 2) arrives first, since the execution subject has not received any historical actual operation information of the waybill before, the execution subject can determine that the order value of logistics node 1 corresponding to the actual operation information is 1. Then, if the actual operation information of logistics node 2 is received, such as the actual operation information of any link in logistics links 3-5. Since logistics node 2 is after logistics node 1 in the routing plan, the execution subject can determine that the order value of logistics node 2 is 2 at this time.

[0058] Step 102, based on the order of the logistics nodes and the logistics links of the practical operation information within the logistics nodes to which it belongs, determine the version identifier of the practical operation information.

[0059] In some embodiments, the execution subject can determine the version identification of the actual operation information based on the order of the logistics nodes obtained in step 101 and the order of the logistics links of the actual operation information in the logistics node to which it belongs. Here, the specific algorithm of the version identification is not limited. For example, the version identification can be the concatenation result of two sequences, such as the order value of the logistics node - (or connectors such as &) the order value of the logistics link.

[0060] As an example, the version identifier (i.e., version number) may be equal to the logistics node sequence * θ + the logistics link sequence within the logistics node. In other words, the execution subject may first determine the product value of the sequence value of the logistics node to which it belongs and the preset parameter θ. Then, the sequence value of the logistics link where the actual operation information is located in the logistics node to which it belongs and the sum of the product value may be calculated. The sum value may then be determined as the version identifier of the actual operation information.

[0061] like Figure 3AAs shown, 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 link in the logistics node is 2. If the preset parameter θ is 100, then the version identification of the actual operation information 2 can be determined to be 1*100+2=102. By analogy, the version identification of the actual operation information 3 can be obtained to be 201.

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

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

[0064] In some embodiments, the execution subject may update the data of the target logistics link in the routing plan of the target waybill based on the version identification of the actual operation information and the actual operation information. The target logistics link may include the logistics link where the actual operation information is located, and / or the logistics link after the logistics link. According to Rule 7, the target logistics link may be the logistics link where the actual operation information is located. Alternatively, the target logistics link may be the logistics link where the actual operation information is located, and the subsequent logistics link after the logistics link.

[0065] Specifically, for the logistics link where the actual operation information is located in the routing plan of the target waybill, the execution entity can update the actual operation data in the logistics link according to the actual operation information. For example, update the actual operation outlets, actual operation links, actual operation time, actual operation routes, etc. of the 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 identification. And for the subsequent logistics link located after the logistics link in the routing plan of the target waybill, the execution entity can determine whether to update the plan data in the subsequent logistics link based on the comparison result of the latest updated version identification of the subsequent logistics link and the version identification 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 outlets, etc. of the subsequent logistics link can be re-determined according to the actual operation time, actual operation nodes (outlets), etc. of the actual operation information.

[0067] From the above description, it can be seen that the routing data processing method in some embodiments of the present disclosure can modify the locking (pessimistic lock) of the waybill dimension to the optimistic lock of the logistics link dimension by adding the version identifier of the actual operation information. In this way, by comparing the updated versions between the logistics links, the data of the routing plan can be updated. Not only can the final sequentiality of the actual operation processing be guaranteed, but by reducing the locking dimension, the amount of data processed concurrently by the system can also be increased, thereby helping to improve the data processing efficiency.

[0068] It is understandable that the process of the routing system processing the actual operation data stream is usually to consume data from multiple input sources in parallel. In this process, since there is a strict sequence of processing logic between the actual operations, the system also needs to ensure that the actual operation processing is in order. This is very easy to ensure in the system that produces the actual operation information (i.e., the production terminal), but it is often not guaranteed at the receiving end of the actual operation information (i.e., the routing system). Because there are various possible reasons for message delays in asynchronous systems. The method of the embodiment of the present disclosure can ensure the final sequentiality of the actual operation processing by setting a version identifier.

[0069] It should be noted that an important reason that affects time performance in related technical solutions is low concurrency. In related technologies, the locking of message (i.e., practical information) processing is in the waybill dimension. By reducing the dimension of locking, the concurrency can be improved. According to the above abstraction, there is a node dimension under the waybill dimension, and there is a link dimension under the node dimension. That is, the dimensions from high to low are: waybill->node->link. According to the above rules 4 and 5, the uniqueness of messages can be guaranteed in the link dimension. Therefore, if the message is guaranteed to be unique in advance, can it be optimized to not be locked? The conclusion is no.

[0070] like Figure 3B As shown, in the concurrent processing of practical operation information 2 and practical operation information 3, because there are common subsequent nodes, such as links 4 to 8 shown in the figure. According to rule 7, both will update the plan information of the subsequent nodes. If not locked, a conflict will occur. However, practical operation information 2 and practical operation information 3 follow rule 8. In this case, the embodiment of the present disclosure adds the concept of an updated version, that is, adds a version identifier. The lock (pessimistic lock) of the waybill dimension can be modified to an optimistic lock of the logistics link dimension. At this time, the execution of the routing plan update must meet the condition that the version number is greater than the current version number.

[0071] Among them, pessimistic locking usually refers to a conservative attitude towards data being modified by the outside world (including other current transactions in the system, and transaction processing from external systems). Therefore, during the entire data processing process, pessimistic locking will lock the data. Optimistic locking is usually very optimistic when operating data, and believes that other threads will not modify the data at the same time, so it will not be locked. However, when updating, it will determine whether other threads have updated the data during this period. In scenarios where the probability of concurrent access conflicts is low, optimistic locking is usually much more efficient than pessimistic locking.

[0072] Specifically, if the execution subject concurrently receives at least two practical operation information of the target waybill, the target practical operation information can be first selected from the at least two practical operation information according to the version identifier. Among them, the target practical operation information is generally the practical operation information with the largest version identifier. Then, according to the target practical operation information, the data of the target logistics link in the routing plan of the target waybill can be updated. In addition, according to other practical operation information in the at least two practical operation information except the target practical operation information, the data of the corresponding logistics link in the routing plan can be updated. Among them, the corresponding logistics link is generally the logistics link where other practical operation information is located, and the logistics link between the logistics link and the target logistics link.

[0073] by Figure 3B Take the scenario shown in as an example, when the practical information 2 and 3 are processed in parallel, after the subsequent logistics links are updated according to the practical information 2, the conflicting logistics links will be updated again according to the practical information 3 to update to the latest status of the waybill. In other words, the conflicting logistics links can be directly updated according to the practical information 3. This will not only waste system resources, but also affect the processing time of the system. In this case, through the method of the embodiment of the present disclosure, the execution subject can select the practical information 3 with a large version number as the target practical information, so as to update the data of logistics link 3 to logistics link 8. According to the practical information 2, only the data of logistics link 2 can be updated. In other words, by setting the version identifier, it is possible to solve the problem of link conflicts in parallel processing and ensure the sequentiality of the practical processing results. It can also improve the high concurrency of practical information processing, reduce unnecessary processing processes, help shorten processing time, and improve processing efficiency.

[0074] In the routing plan, the actual sequential processing guarantee is the final sequential guarantee, and the real-time sequential guarantee cannot be guaranteed. In order to ensure the sequential processing of messages, the relevant technical solutions, such as Figure 3FAs shown, the processing of each practical operation message requires querying all current practical operation messages and sorting them. And in each practical operation processing, the out-of-order practical operations that have been processed historically will be consumed again. The time and space consumption of these two operations are obvious and will not be elaborated here. The reason for this operation is the result of the joint constraints of rules 3, 6 and 7. In the high concurrency design, this embodiment combines the use of rule 8 with the version identification design, so that the design ensures the maximum feasible concurrent calculation of the routing plan. And this design is also suitable for the processing of out-of-order messages (i.e., out-of-order practical operation information).

[0075] It can be seen from this that the design of the version identifier is transformed into how to ensure the correct order of nodes and the correct order of links within the node. The correct order of links can be directly guaranteed by rule 4. The guarantee of node order can be guaranteed by special link types and lines to form fixed logic. For example, the node carried by the special operation that triggers the routing plan (such as order creation) can be determined as the first node. The subsequent nodes can be determined based on the line information carried in the operation information. Among them, the line information usually represents the upstream logistics node and the downstream logistics node. For example, when the operation occurs in the logistics link processed at the handover position of the logistics node, such as Figure 3C In the logistics link 2 and logistics link 3, the operation information can carry the downstream node information or the upstream node information. In this way, the node sequence can be determined according to the upstream node sequence in the route information.

[0076] In the case where the actual operation information arrives out of order and the upstream node does not exist, the method of this embodiment can still ensure the order of the nodes. Specifically, in response to determining that the logistics node to which the actual operation information belongs is located between the logistics nodes to which the received historical actual operation information belongs, the order value of the logistics node to which the actual operation information belongs can be determined based on the order values ​​of the two adjacent logistics nodes. Among them, the above-mentioned preset parameters are usually positive integers, and their values ​​can ensure 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.

[0077] As an example, Figure 3C As shown, the practical operation information 3, 4, and 5 (the practical operation of all logistics links of logistics node 2) arrives later than the practical operation information 6. At this time, the logistics node where the practical operation information 6 is located cannot find the corresponding upstream node according to the route information. For such scenarios, this embodiment can make special designs for the order of logistics nodes. Special practical operation types start the routing plan calculation and confirm that the first node is node 1. At this time, the order of node 1 is 1. The practical operation of node 3 arrives at the routing system earlier than all the practical operations of node 2. At this time, the order of node 3 is 2. The practical operation of node 2 arrives at the routing system and finds nodes with the order of 1 and 2. That is, node 2 is 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] From this analysis, 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 actual operation information of all nodes except the first node arrives in reverse. At this time, the difference list of 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 links, the value of the preset parameter must ensure that under any link order, the first link version of the subsequent node is greater than the last link version of the previous node. Consider the critical value judgment under the above limit: the version number B2 of the first link of node 2> the version number B1 of the last link of node 1. Among them, B1=1*θ+Max(number of links); B2=(1+(1 / 2) n )*θ+0.

[0080] In the routing system, the maximum (Max) number of links and the maximum number of nodes (n) are usually integers less than 10 (set according to the specific situation), so there is a practical minimum value of θ that satisfies the order constraint. Taking this as an example, B2=(1+(1 / 2) 10 )*θ+0=1.0009765625*θ;B1=1*θ+10=θ+10. According to the given conditions, we can set the inequality: 1.0009765625*θ>θ+10. From this, we can calculate that θ>10240. So the smallest positive integer θ that meets the conditions is 10241. Note that this is the smallest integer that meets the conditions, and any integer greater than 10241 also meets the conditions.

[0081] It should be noted that the node sequence value obtained by the above calculation formula can be understood as the cardinality of the sequence value, but it is not the final sequence value. It needs to be integerized later by multiplying the common factors. The core of the present invention is to solve the disorder problem through this calculation method without the need for full sorting. An intuitive way to understand it is to queue up. It is not necessary for all nodes to arrive at the scene (receive) before queuing up. It only requires the nodes coming later to cut in line to their appropriate positions. From Figure 3F It can be seen from the above that in the related technology, each actual message processing operation requires obtaining all messages and sorting all messages. In addition, the processing of out-of-order messages will introduce worthless routing plan calculations and updates, that is, retries will be performed during the processing of in-order messages. Figure 3GIt can be seen that the method of the embodiment of the present disclosure can avoid high time and space complexity operations such as sorting of practical operation information and retry processing of out-of-order practical operation information, which can reduce unnecessary resource usage and improve the processing efficiency of the system.

[0082] In some application scenarios, in order to reduce the conflict rate of concurrent updates, this embodiment can also make special designs for the planning time. The planning time of 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 the logistics link. Figure 3D As shown in the figure, the planned time of the logistics link can be composed of two parts: the base time of the current node; and the incremental time of the current link in the node. Among them, the incremental time of the first logistics link in the logistics node can be set to a preset value, generally zero. In this way, when the view is displayed, the planned time field can be transformed from direct mapping to calculated mapping (planned time = base + offset).

[0083] It is understandable that various situations may occur in the actual production process, resulting in the actual operation being inconsistent with the planned route (static routing). Therefore, the arrival of the actual operation message may change the subsequent line actual operation at any time. The entire plan is recalculated, which we define as dynamic routing. After multiple actual operations arrive, their post-orders must have intersections, and when they all need to be updated, conflicts occur. The effect of optimistic locking is generally that the smaller the conflict, the more obvious it is. Therefore, the present invention can upgrade the time from the link dimension to the node dimension by designing the planning time and utilizing the reference time of the node. In this way, the amount of actual operation information that may conflict can be reduced, that is, the link conflict is converted into the node conflict, thereby reducing the conflict rate.

[0084] Continue to refer Figure 4 , which shows a process 400 of another embodiment of the routing data processing method according to the present disclosure. The processing method may include the following steps:

[0085] Step 401, in response to receiving the actual operation information of the target waybill sent by the production terminal, determining whether the actual operation indicated by the actual operation information is an abnormal actual operation.

[0086] In some embodiments, the execution subject of the routing data processing method, upon receiving the operation information of the target waybill sent by the production terminal, can first determine whether the operation indicated by the operation information is an abnormal operation. Among them, abnormal operations are usually illegal or erroneous operations. For example, in the actual production process, there is a scenario where front-line employees make up for the operation. This kind of operation does not belong to legal operations, and such operations do not meet Rule 7. They should be identified and marked as erroneous operations, and the plans for the subsequent links will not be updated.

[0087] Here, the execution subject can determine whether the operation is an abnormal operation by at least one of the following methods. As an example, the operation data in the routing plan usually includes the operation time of each logistics link. In this case, if it is determined that the operation time indicated by the operation information is outside the operation time period of the logistics node to which the operation information belongs, then it can be determined that the operation indicated by the operation information is an abnormal operation. Figure 3E As shown, the operation information of node 1 is not within the valid operation period [base1, base2) of logistics node 1, that is, it is in the illegal operation period. At this time, the operation indicated by the operation information of node 1 is an abnormal operation. For example, a parcel of a waybill has arrived at logistics node 2, and the worker of logistics node 1 reissues an operation of logistics node 1. Then when the system receives the operation information, it will identify the operation of node 1 as an abnormal operation.

[0088] In some optional implementations, if the operation time of the operation indicated by the operation information is determined to be later than the operation time of the next logistics link adjacent to the logistics link where the operation information is located, 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 link in the subsequent sequence, it does not meet the above rule 2 or rule 5. In this case, it can also be said that the operation is an abnormal operation.

[0089] In some embodiments, if the execution subject determines that the practical operation indicated by the practical operation information is not an abnormal practical operation, the following steps can be continued. It should be noted that if the abnormal practical operation arrives later than the practical operation of the subsequent link, the subsequent plan cannot be updated due to the version number rule restrictions. It can meet the needs of application scenarios, and it also shows that the method of the embodiment of the present disclosure can be compatible with special practical operations. If the abnormal practical operation arrives earlier than the practical operation of the subsequent link, although it will cause temporary erroneous plan data. However, after the subsequent practical operation link arrives, it can be updated to the correct data, which can also meet the final correctness of the data. It can be inferred that this solution is compatible with such abnormal practical operations.

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

[0091] Step 403, based on the order of the logistics nodes and the logistics links of the practical operation information within the logistics nodes to which it belongs, determine the version identifier of the practical operation information.

[0092] Step 404, based on the version identifier and according to the practical operation information, update the data of the target logistics link in the routing plan of the target waybill.

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

[0094] The routing data processing method of the disclosed embodiment further enriches and improves the judgment process for abnormal operations. This helps reduce unnecessary or erroneous routing plan update processing, thereby reducing resource occupation and waste, and also helps improve the processing efficiency of system data.

[0095] Further references Figure 5 , as a response to the above Figures 1 to 4 In order to realize the processing method shown in the figure, the present disclosure provides some embodiments of a routing data processing device. These processing device embodiments are similar to Figures 1 to 4 The routing data processing device can be specifically applied to various electronic devices.

[0096] like Figure 5 As shown, the routing data processing device 500 of some embodiments may include: a node sequence determination unit 501, configured to respond to the actual operation information of the target waybill sent by the production terminal, and determine the logistics node sequence corresponding to the actual operation information according to the historical actual operation information of the received target waybill, wherein the actual operation information includes the node information of the logistics node to which the actual operation belongs; a version determination unit 502, configured to determine the version identification of the actual operation information based on the logistics node sequence and the logistics link of the actual operation information in 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 in the logistics node is fixed; a plan update unit 503, configured to update the data of the target logistics link in the routing plan of the target waybill based on the version identification and the actual operation information, wherein the target logistics link includes the logistics link where the actual operation information is located, and / or the logistics link located after the logistics link.

[0097] In some embodiments, the version determination unit 502 can be further configured to determine the product value of the sequence value of the logistics node to which it belongs and the preset parameter, and to determine the sum of the sequence value of the logistics link where the actual operation information is located in the logistics node to which it belongs and the product value as the version identifier of the actual operation information, wherein the preset parameter is greater than the maximum number of logistics links.

[0098] In some embodiments, the node sequence determination unit 501 can be further configured to respond to determining that the logistics node to which the actual operation information belongs is located between the logistics nodes to which the received historical practical operation information belongs, and determine the sequence value of the logistics node to which the actual operation information belongs based on the sequence values ​​of the 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 previous logistics node.

[0099] In some embodiments, the plan update unit 503 may include: a current link update sub-unit (not shown in the figure), which is configured to update the practical operation data in the logistics link where the practical operation information is located in the routing plan of the target waybill according to the practical operation information, wherein the practical operation data includes the latest updated version identifier; a subsequent link update sub-unit (not shown in the figure), which is configured to determine whether to update the plan data in the subsequent logistics link according to the comparison result of the latest updated version identifier of the subsequent logistics link and the version identifier of the practical operation information for the subsequent logistics link located after the logistics link in the routing plan of the target waybill.

[0100] In some embodiments, the subsequent link update subunit can be further configured to respond to determining that the latest updated version identifier of the subsequent logistics link is less than the version identifier of the actual operation information, adjust the planning data of the subsequent logistics link according to the actual operation information, and update the latest updated version identifier of the subsequent logistics link.

[0101] In some embodiments, the routing data processing device 500 may also include a concurrent processing unit (not shown in the figure), which is configured to respond to at least two actual operation information of the target waybill received concurrently, select the target actual operation information from the at least two actual operation information according to the version identifier, wherein the target actual operation information is the actual operation information with the largest version identifier; and update the data of the target logistics link in the routing plan of the target waybill according to the target actual operation information; update the data of the corresponding logistics link in the routing plan according to other actual operation information except the target actual operation information in the at least two actual operation information, wherein the corresponding logistics link is the logistics link where the other actual operation information is 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 planning time of each logistics link. The planning 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 also include an abnormal operation determination unit (not shown in the figure), which is configured to determine whether the operation indicated by the operation information is an abnormal operation; in response to determining that it is not an abnormal operation, determine the logistics node sequence corresponding to the operation information.

[0104] In some embodiments, the abnormal operation determination unit can be further configured to determine that the operation indicated by the actual operation information is an abnormal operation in response to determining that the operation time of the actual operation indicated by the actual operation information is outside the operation time period of the logistics node to which the actual 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 actual operation indicated by the actual operation information is later than the operation time of a subsequent logistics link adjacent to the logistics link where the actual operation information is located, determine that the operation indicated by the actual operation information is an abnormal operation.

[0105] It is understood that the units described in the routing data processing device 500 are similar to those described in the reference Figures 1 to 4 Therefore, the operations, features and beneficial effects described above for the method are also applicable to the processing device 500 and the units included therein, and will not be described in detail here.

[0106] Reference below Figure 6 , which shows a structural schematic diagram of an electronic device 600 suitable for implementing some embodiments of the present disclosure. Figure 6 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0107] like Figure 6 As shown, the electronic device 600 may include a processing device 601 (e.g., a central processing unit, a graphics processing unit, etc.), which 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. In the RAM 603, various programs and data required for the operation of the terminal device 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0108] Typically, the following devices may be connected to the I / O interface 605: input devices 606 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; output devices 607 including, for example, a speaker, a vibrator, etc.; storage devices 608 including, for example, a disk, a hard disk, etc.; and communication devices 609. The communication devices 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. Figure 6 The electronic device 600 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead. Figure 6 Each block shown in the figure may represent one device, or may represent multiple devices as required.

[0109] In particular, according to some embodiments of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, some embodiments of the present disclosure include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In some such embodiments, the computer program can be downloaded and installed from the network through the communication device 609, or installed from the storage device 608, or installed from the ROM 602. When the computer program is executed by the processing device 601, the above-mentioned functions defined in the method of some embodiments of the present disclosure are executed.

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

[0111] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (Hyper Text Transfer Protocol), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.

[0112] The computer-readable medium may be included in the electronic device; or it may exist independently without being assembled into the electronic device. The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device: in response to receiving the actual operation information of the target waybill sent by the production terminal, according to the historical actual operation information of the received target waybill, determine the order of logistics nodes corresponding to the actual operation information, wherein the actual operation information includes the node information of the logistics node to which the actual operation belongs; based on the order of logistics nodes and the logistics links of the actual operation information in the logistics node to which it belongs, determine the version identification of the actual operation information, wherein each logistics node contains at least one associated logistics link, and the order of each logistics link in the logistics node is fixed; based on the version identification, according to the actual operation information, update the data of the target logistics link in the routing plan of the target waybill, wherein the target logistics link includes the logistics link where the actual operation information is located, and / or the logistics link located after the logistics link.

[0113] In addition, computer program code for performing the operations of some embodiments of the present disclosure may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate 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 a remote computer, the remote computer may 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 may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0114] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some implementations as replacements, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0115] The units described in some embodiments of the present disclosure may be implemented by software or by hardware. The described units may also be provided in a processor, for example, may be described as: a processor including a node sequence determination unit, a version determination unit, and a plan update unit. Among them, the names of these units do not constitute a limitation on the unit itself in certain cases, for example, the node sequence determination unit may also be described as a "unit for determining the sequence of logistics nodes corresponding to practical operation information."

[0116] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chip (SOCs), complex programmable logic devices (CPLDs), and the like.

[0117] Some embodiments of the present disclosure further provide a computer program product, including a computer program, which implements any of the above-mentioned routing data processing methods when executed by a processor.

[0118] The above descriptions are only some preferred embodiments of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of the invention involved in the embodiments of the present disclosure is not limited to the technical solutions formed by a specific combination of the above-mentioned technical features, but should also cover other technical solutions formed by any combination of the above-mentioned technical features or their equivalent features without departing from the above-mentioned inventive concept. For example, the above-mentioned features are replaced with the technical features with similar functions disclosed in the embodiments of the present disclosure (but not limited to) and the technical solutions formed.

Claims

1. A method for processing routing data, comprising: In response to receiving the actual operation information of the target waybill sent by the production terminal, determining the order of logistics nodes corresponding to the actual operation information according to the received historical actual operation information of the target waybill, wherein the actual operation information includes node information of the logistics node to which the actual operation belongs; Determine the version identifier of the practical operation information based on the order of the logistics nodes and the logistics links of the practical operation information in the logistics nodes to which it belongs, wherein each logistics node contains at least one associated logistics link, and the order of each logistics link in the logistics node is fixed; Based on the version identifier and according to the practical operation information, data of the target logistics link in the routing plan of the target waybill is updated, wherein the target logistics link includes the logistics link where the practical operation information is located, and / or the logistics link located after the logistics link.

2. The method for processing routing data according to claim 1, wherein: The determining the version identifier of the practical operation information based on the order of the logistics nodes and the logistics links of the practical operation information in the logistics nodes to which it belongs includes: Determine the product value of the sequence value of the logistics node to which it belongs and the preset parameter, and determine the sum of the sequence value of the logistics link where the actual operation information is located in the logistics node to which it belongs and the product value as the version identifier of the actual operation information, wherein the preset parameter is greater than the maximum number of logistics links.

3. The method for processing routing data according to claim 2, wherein: The determining, based on the received historical practical operation information of the target waybill, a logistics node sequence corresponding to the practical operation information includes: In response to determining that the logistics node to which the actual operation information belongs is located between the logistics nodes to which each received historical actual operation information belongs, the sequence value of the logistics node to which the actual operation information belongs is determined according to the sequence values ​​of two adjacent logistics nodes; Among them, 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 previous logistics node.

4. The method for processing routing data according to claim 1, wherein: The updating of data of the target logistics link in the routing plan of the target waybill based on the version identifier and according to the practical operation information includes: For the logistics link where the practical operation information is located in the routing plan of the target waybill, updating the practical operation data in the logistics link according to the practical operation information, wherein the practical operation data includes the latest updated version identifier; and For the subsequent logistics link after the logistics link in the routing plan of the target waybill, it is determined whether to update the planned data in the subsequent logistics link based on the comparison result of the latest updated version identifier of the subsequent logistics link and the version identifier of the practical operation information.

5. The method for processing routing data according to claim 4, wherein: The determining whether to update the planning data in the subsequent logistics link according to the comparison result of the latest updated version identification of the subsequent logistics link and the version identification of the practical operation information includes: In response to determining that the latest updated version identifier of the subsequent logistics link is less than the version identifier of the actual operation information, the planning data of the subsequent logistics link is adjusted according to the actual operation information, and the latest updated version identifier of the subsequent logistics link is updated.

6. The method for processing routing data according to claim 1, wherein: The method further comprises: In response to concurrently receiving at least two pieces of actual operation information of the target waybill, selecting target actual operation information from the at least two pieces of actual operation information according to version identifiers, wherein the target actual operation information is the actual operation information with the largest version identifier; and According to the target practical operation information, data of the target logistics link in the routing plan of the target waybill is updated; According to the other practical operation information except the target practical operation information among the at least two practical operation information, data of the corresponding logistics link in the routing plan is updated, wherein the corresponding logistics link is the logistics link where the other practical operation information is located, and the logistics link between the logistics link and the target logistics link.

7. The method for processing routing data according to claim 1, wherein: The planning data in the routing plan includes the planning time of each logistics link, and the planning 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.

8. The method for processing routing data according to any one of claims 1 to 7, wherein: Before determining the order of logistics nodes corresponding to the historical practical operation information of the received target waybill, the method further includes: Determining whether the operation indicated by the operation information is an abnormal operation; In response to determining that it is not an abnormal operation, the order of logistics nodes corresponding to the actual operation information is determined.

9. The method for processing routing data according to claim 8, wherein: The determining whether the practical operation indicated by the practical operation information is an abnormal practical operation includes: In response to determining that an 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, determining that the operation indicated by the operation information is an abnormal operation, wherein the operation data in the routing plan includes the operation time of each logistics link; or In response to determining that an operation time of the operation indicated by the operation information is later than an operation time of a subsequent logistics link adjacent to the logistics link where the operation information is located, the operation indicated by the operation information is determined to be an abnormal operation.

10. A routing data processing device, comprising: A node sequence determination unit is configured to, in response to receiving the actual operation information of the target waybill sent by the production terminal, determine the logistics node sequence corresponding to the actual operation information according to the received historical actual operation information of the target waybill, wherein the actual operation information includes the node information of the logistics node to which the actual operation belongs; A version determination unit is configured to determine a version identifier of the practical operation information based on the order of the logistics nodes and the logistics links of the practical operation information in 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 in the logistics node is fixed; The plan update unit is configured to update the data of the target logistics link in the routing plan of the target waybill based on the version identifier and according to the actual operation information, wherein the target logistics link includes the logistics link where the actual operation information is located, and / or the logistics link located after the logistics link.

11. An electronic device, comprising: one or more processors; a storage device having one or more programs stored thereon, 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 as described in any one of claims 1-9.

12. A computer readable medium having a computer program stored thereon, wherein: When the computer program is executed by a processor, the routing data processing method as described in any one of claims 1 to 9 is implemented.

13. A computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the computer program implements the routing data processing method according to any one of claims 1 to 9.

Images