A digital sharing method for logistics based on contactless coding

Abstract

The present invention relates to the field of data processing technology, and specifically to a method for digital sharing of logistics based on contactless coding, including: obtaining logistics information and logistics identification code of each item; obtaining the correlation of logistics information of any two items based on the logistics information and logistics identification code of the items; clustering based on the correlation of logistics information between items to obtain a number of clusters; obtaining the number of partitions based on the number of clusters and the correlation of logistics information between items in the clusters; partitioning the logistics information of the items according to the number of partitions, and tracing and verifying. The present invention improves the overall performance of the regional chain network by processing the logistics information in a partitioned manner.

Description

Technical Field

[0001] The present invention relates to the technical field of data processing, and in particular to a digital sharing method for logistics based on contactless coding. Background Art

[0002] The logistics industry is a vital part of modern economic activities, but traditional logistics management methods may have many problems, such as information islands, low efficiency, high costs, etc. With the rapid development of information technology, digital technologies such as the Internet of Things, big data, and artificial intelligence have matured and are widely used in various fields. These technologies provide strong support for the digital transformation of the logistics industry, allowing logistics information to be acquired, processed, and shared more accurately and in real time. In the digital age, building a logistics information sharing platform has become an important means to promote the development of the logistics industry. By establishing an open, secure, and efficient digital sharing platform, the sharing and exchange of logistics information can be realized, the visibility and transparency of the logistics supply chain can be improved, and the coordinated development of information flow, logistics, and capital flow can be promoted.

[0003] Traditional logistics coding usually relies on manual or machine marking of goods, but there are certain limitations, such as high cost, low efficiency, and prone to errors. These problems usually stem from factors such as data inconsistency, lack of information, and easy tampering in the intermediate links of information transmission. It usually relies on centralized management and trust models and is vulnerable to single point failures and data tampering. Contactless coding technology is a technology based on object recognition and information collection. It can track and identify objects and digitally manage the information of objects, so that participants can complete trust transactions and information sharing without a centralized management agency. Blockchain-based information sharing verification provides a safe and reliable way of information sharing for contactless coding logistics digital sharing, but the scalability of blockchain networks is a challenge. As the amount of information increases, blockchain networks may face delays and congestion, reducing overall performance. Summary of the invention

[0004] The present invention provides a digital sharing method for logistics based on contactless coding to solve the existing problems.

[0005] A method for digital sharing of logistics based on contactless coding of the present invention adopts the following technical solution:

[0006] One embodiment of the present invention provides a method for digital sharing of logistics based on contactless coding, the method comprising the following steps:

[0007] Obtain logistics information and logistics identification code for each item;

[0008] According to the logistics information and logistics identification code of the items, obtain the correlation between the logistics information of any two items;

[0009] Clustering is performed based on the correlation of logistics information between items to obtain a number of clusters; the number of partitions is obtained according to the number of clusters and the correlation of logistics information between items in the clusters;

[0010] The logistics information of items is partitioned according to the number of partitions, and traced and verified.

[0011] Furthermore, the specific steps of obtaining the logistics information and logistics identification code of each item are as follows:

[0012] All information on the back-end terminal server of the operating company is used as logistics information, which includes the origin and the corresponding dispatch time, each transfer station and the corresponding arrival time and dispatch time, the destination and the corresponding arrival time, and obtains the logistics information corresponding to each item;

[0013] The logistics identification code of each item is obtained based on the logistics information of the item.

[0014] Furthermore, the obtaining of the correlation between the logistics information of any two items according to the logistics information and the logistics identification code of the goods includes the following specific steps:

[0015] According to the digital matrix corresponding to the logistics identification code of the items, the correlation of each digit in the digital matrix corresponding to the logistics identification codes of any two items is obtained; according to the dispatch time of the origin, the arrival time of each transfer station and the arrival time of the destination in the logistics information, and the correlation of each digit in the digital matrix corresponding to the logistics identification code, the correlation of the logistics information of any two items is obtained.

[0016] Furthermore, the correlation between the logistics information of any two items is obtained based on the dispatch time of the origin, the arrival time of each transfer station and the arrival time of the destination in the logistics information, and the correlation of each digit in the digital matrix corresponding to the logistics identification code, and the specific steps include the following:

[0017]

[0018] Where q(a,b) represents the correlation between the logistics information of the a-th item and the logistics information of the b-th item, i represents the number of numbers in the digital matrix corresponding to the logistics identification code, and N i Represents the correlation of the i-th digit in the digital matrix corresponding to the logistics identification codes of the two items, t ajrepresents the time of the jth transportation node in the logistics information of the ath item, the transportation node includes the origin, the transfer station and the destination, and the time of the transportation node includes the departure time of the origin, the arrival time of each transfer station and the arrival time of the destination; t bj It represents the time of the jth transportation node in the logistics information of the bth item, and n represents the number of transportation nodes.

[0019] Furthermore, the step of obtaining the correlation between each digit in the digital matrix corresponding to the logistics identification codes of any two items according to the digital matrix corresponding to the logistics identification codes of the items includes the following specific steps:

[0020]

[0021] Among them, N i is the correlation between the ith digit in the digital matrix corresponding to the logistics identification code of the a-th item and the b-th item; F ai Indicates the value of the i-th digit in the logistics identification code of the a-th item, F bi Represents the value of the i-th digit in the logistics identification code of the b-th item.

[0022] Furthermore, clustering is performed based on the correlation of logistics information between items to obtain a number of clusters, and the specific steps included are as follows:

[0023] The DBSCAN density clustering algorithm is used to cluster all items. The minimum number of clusters and the cluster radius are set. The distance metric is 1 minus the difference between the correlation of the logistics information between the items to obtain several clusters.

[0024] Furthermore, the method of obtaining the number of partitions according to the number of clusters and the correlation of logistics information between items in the clusters includes the following specific steps:

[0025] The ratio of the difference obtained by subtracting the minimum value of the correlation of logistics information between items in any cluster from the maximum value of the correlation of logistics information between items to the number of items in the cluster is recorded as the first eigenvalue of the cluster; the number of partitions is obtained according to the number of clusters, the first eigenvalues ​​of each cluster, the number of items and the number of blocks in the blockchain system.

[0026] Furthermore, the method of obtaining the number of partitions according to the number of clusters, the first eigenvalue of each cluster, the number of items, and the number of blocks in the blockchain system includes the following specific steps:

[0027]

[0028] Among them, K represents the number of partitions, M represents the number of clusters, and maxq trepresents the maximum value of the correlation between the logistics information of the items in the tth cluster, minq t represents the minimum value of the correlation between logistics information of items in the tth cluster, Represents the maximum value of the first eigenvalue of all clusters, Represents the minimum value of the first eigenvalue of all clusters, R t represents the number of items in the tth cluster, H represents the number of items, and U represents the number of blocks in the blockchain system. Indicates rounding down.

[0029] Furthermore, the specific steps of partitioning the logistics information of the items according to the number of partitions are as follows:

[0030] Arrange all clusters in descending order according to the number of items in the clusters, to obtain a first data sequence; calculate the difference between the number of partitions and the number of clusters, and record it as the first difference;

[0031] The items and their logistics information in the clusters are partitioned according to the first data sequence and the first difference.

[0032] Furthermore, the partitioning of the items and their logistics information in the clusters according to the first data sequence and the first difference value includes the following specific steps:

[0033] The clusters with the first difference value in the first data sequence are recorded as clusters to be segmented, and the remaining clusters are recorded as unsegmented clusters. Each cluster to be segmented is evenly divided into two sub-clusters, and each sub-cluster and unsegmented cluster is stored in a block respectively.

[0034] The beneficial effects of the technical solution of the present invention are as follows: by obtaining the logistics information and logistics identification code of each item, the correlation of the logistics information between the items is quantified to reflect the similarity of the time and distance of the items during transportation, and to provide a basis for the subsequent clustering of the items and partitioning on the blockchain; according to the correlation of the logistics information of any two items, the logistics information is partitioned through clustering processing, and combined with the number of clusters and the correlation of the logistics information between the items in the clusters, and traced and verified; the greater the similarity of the data in the same block, the more overall the record and verification can be performed; thereby ensuring that the blockchain can fully utilize the computing power through partitioning when processing the logistics information of a large number of items, thereby effectively avoiding excessive logistics information, resulting in delays and congestion in the regional chain network, and improving the overall performance of the regional chain network. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0036] Figure 1 The present invention is a flowchart of the steps of a method for digital sharing of logistics based on contactless coding. DETAILED DESCRIPTION

[0037] In order to further explain the technical means and effects adopted by the present invention to achieve the predetermined invention purpose, the following is a detailed description of the specific implementation method, structure, features and effects of a digital sharing method for logistics based on contactless coding proposed by the present invention in combination with the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" does not necessarily refer to the same embodiment. In addition, specific features, structures or characteristics in one or more embodiments may be combined in any suitable form.

[0038] Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.

[0039] The following is a detailed description of a specific scheme of a contactless coding logistics digital sharing method provided by the present invention in conjunction with the accompanying drawings.

[0040] See also Figure 1 , which shows a flow chart of a method for digital sharing of logistics based on contactless coding provided by an embodiment of the present invention, the method comprising the following steps:

[0041] Step S001: Obtain the logistics information and logistics identification code of each item.

[0042] The main purpose of this embodiment is to digitally share logistics information, so the logistics information needs to be collected first; and for a certain operating company, all the logistics information of the company is stored on the background terminal server.

[0043] Specifically, the logistics information of all items is obtained through the backend terminal server. The logistics information includes the origin, destination, information of each transit station, and the time information of arrival and departure at each station. It should be noted that each item has its own logistics information, and its format is: the origin and the corresponding dispatch time, each transit station and the corresponding arrival time and dispatch time, the destination and the corresponding arrival time, and the logistics information corresponding to each item is obtained.

[0044] It should be further explained that in the process of logistics transportation, each item has its own corresponding QR code. Each QR code contains the product information and logistics information of the item. The QR code is essentially a digital matrix, which is equivalent to a string of data sequences. The origin and destination of the product can be identified based on the QR code. Therefore, in the process of tracing the logistics information of the product, the real-time status of the item can be obtained based on the data information contained in the QR code.

[0045] Specifically, a logistics identification code of each item is obtained based on the logistics information of the item. The logistics identification code can be directly obtained in the background terminal server according to the logistics information, and this embodiment will not be repeated.

[0046] At this point, the logistics information and logistics identification code of each item are obtained.

[0047] Step S002: Obtain the correlation between the logistics information of any two items based on the logistics information and logistics identification codes of the items.

[0048] It should be noted that in the process of digital sharing of logistics information, blockchain technology is a decentralized distributed ledger technology. Its core idea is to record and verify transaction data in a distributed manner to ensure the transparency, immutability and security of the data. Each participating node has a complete copy of the ledger to record data information in each link. Therefore, when sharing data, the real-time status of logistics information in each link can be accurately known.

[0049] It should be further explained that partitioning is the process of dividing the blockchain network into multiple smaller blockchain fragments. Each partition can run and process a part of the transactions independently, which can improve the throughput and processing power of the network. The account status partitions are stored in different nodes or partitions. Each partition only needs to maintain part of the account status information, which can reduce the amount of data that each node needs to process and improve the processing efficiency of the network. Therefore, it is necessary to identify and process information based on logistics information, thereby improving the data processing capacity of the distributed network.

[0050] It should be further explained that, first, the correlation is calculated based on the obtained logistics information and logistics identification code, because the biggest feature of logistics information is its high repeatability. For example, if an item is transported from cities B, C, and D in province A to cities Z, X, and V in province Y respectively, then in the transportation process, the goods in cities B, C, and D will first be transported to the provincial transit center in province A, and then sent to the provincial transit center in province Y, and then from the provincial transit center in city Y to cities Z, X, and V. In the process of transporting the items, there are common logistics information segments, and the common logistics information segments can use the same data segments when recording information, and when determining the same data segments, it is necessary to determine which items can use the same logistics information segments based on the logistics information of each item, so it is necessary to calculate their correlation.

[0051] Specifically, the calculation formula for the correlation between the logistics information of the a-th item and the logistics information of the b-th item is as follows:

[0052]

[0053] Where q(a,b) represents the correlation between the logistics information of the a-th item and the logistics information of the b-th item, I represents the number of numbers in the digital matrix corresponding to the logistics identification code, and N i Represents the correlation of the i-th digit in the digital matrix corresponding to the logistics identification codes of the two items, t aj represents the time of the jth transportation node in the logistics information of the ath item, where the transportation node includes the origin, the transfer station and the destination. The time of the transportation node includes the departure time of the origin, the arrival time of each transfer station and the arrival time of the destination; t bj represents the time of the jth transportation node in the logistics information of the bth item, n represents the number of transportation nodes, where the number of transportation nodes is calculated using the minimum value of the number of transportation nodes corresponding to the two items; N i is the correlation between the ith digit in the digital matrix corresponding to the logistics identification code of the a-th item and the b-th item; F ai Indicates the value of the i-th digit in the logistics identification code of the a-th item, F bi Represents the value of the i-th digit in the logistics identification code of the b-th item.

[0054] It should be noted that because the logistics identification code is represented by a QR code, which is a digital matrix, representing data information of the same length, when the departure and destination of two items are the same, the location identification bits on the logistics identification code are the same, similar to the first six digits of the ID card number, which can be used to locate it. Therefore, the numbers in the same position on the logistics identification code are subtracted here. If the numbers in the same position are subtracted to zero, it means that the data uniformity is better, and therefore the logistics information correlation of the two items is greater. It indicates the correlation of the time between two items during the transportation process. Because the transportation time of items with the same place of shipment and destination is not uniform, the correlation is also smaller. Therefore, here, according to the time difference of the items at each transportation node during the transportation process, the smaller the difference, the greater the correlation.

[0055] According to the above method, the correlation of logistics information between any two items is obtained.

[0056] At this point, the correlation of logistics information between items is obtained.

[0057] Step S003: clustering is performed based on the correlation of logistics information between items to obtain a number of clusters; and the number of partitions is obtained according to the number of clusters and the correlation of logistics information between items in the clusters.

[0058] It should be noted that the relevance of logistics information is reflected in the unity of time and space, that is, the unity of the origin and the destination in the same time period. The more unified it is, the more data of the same type can be processed centrally when the blockchain network is processing data. This can not only reduce the amount of data that needs to be processed, but also reduce the network load, thereby increasing the ability to process other data. When partitioning the blockchain network, the more complex the data type, the more partition areas there are, and the more data types that need to be processed, the more partition areas there will be, so that different types of data can be processed quickly. On the contrary, the simpler the data type, even if the amount of data is large, only a smaller area is needed to process these similar data, and the processing of a large amount of data can still be completed. Therefore, the correlation of logistics information between different items is calculated here to represent the relationship between data, so that the blockchain network can be better partitioned.

[0059] Specifically, all items are clustered using the DBSCAN density clustering algorithm. The distance metric is the difference between 1 and the correlation of the logistics information between the items. In this embodiment, the minimum number of clusters is set to 4, and the cluster radius is set to 2. The set parameters are empirical values, and the implementer can set them according to different implementation environments to obtain several clusters. Among them, the DBSCAN density clustering algorithm is an existing well-known technology and will not be described in detail here. Then, the number of partitions is determined according to the obtained clusters. The calculation formula is as follows:

[0060]

[0061] Among them, K represents the number of partitions, M represents the number of clusters, and maxq t represents the maximum value of the correlation between the logistics information of the items in the tth cluster, minq t represents the minimum value of the correlation between logistics information of items in the tth cluster, Represents all clusters The maximum value in Represents all clusters The minimum value in R t represents the number of items in the tth cluster, H represents the number of items, and U represents the number of blocks in the blockchain system. Indicates rounding down.

[0062] It should be noted that < represents the number of clusters, because the more clusters there are, the more data types there are in the logistics information, so the more data needs to be partitioned, so that the data can be partitioned, thereby improving the computing power and stability of the system, maxq t ―minq t It represents the maximum value of correlation in the tth cluster minus the minimum value of correlation, which represents the difference of data in the cluster. The greater the difference of data, the more partitions will be needed. The ratio of the range of the correlation in the cluster to the data type is recorded as the first eigenvalue. The larger the data type, the smaller the range, which means that the data in the cluster is more similar and contains more data. Therefore, the fewer partitions should be, and the greater the computing power contained in each partition, the more data can be processed. represents the maximum value of the first eigenvalue among all clusters. It represents the minimum value of the first eigenvalue in all clusters. Its ratio represents the distribution characteristics of the data in all logistics information. The larger the ratio, the more data types there are, so the larger the number of partitions. It represents the ratio of the system's raw computing power to the amount of data required. The larger the ratio, the larger the amount of data that needs to be processed, and therefore the larger the number of partitions.

[0063] At this point, the number of partitions is obtained.

[0064] Step S004: partition the logistics information of the items according to the number of partitions, and perform traceability and verification.

[0065] It should be noted that the logistics information is partitioned according to the number of partitions. The greater the similarity of the data in the same block, the more comprehensive the overall record and verification can be. When the logistics data is partitioned, different amounts of data require different processing capabilities of the blockchain. Therefore, the original data is partitioned according to the number of divided blocks. In order to improve the data processing capabilities of the blockchain, it is necessary to divide the data into clusters with large amounts of data and distribute them in different blocks for data processing.

[0066] Specifically, all clusters are arranged in descending order from large to small according to the number of items in the clusters to obtain a first data sequence; the difference obtained by subtracting the number of clusters from the number of partitions is calculated and recorded as the first difference; the clusters with the first difference in the first data sequence are recorded as clusters to be divided, and the remaining clusters are recorded as undivided clusters. Each cluster to be divided is evenly divided into two sub-clusters, and each sub-cluster and undivided cluster is stored in a block respectively. At this time, the number of all sub-clusters and undivided clusters is equal to the number of partitions; for example: the number of items is 80, and 10 clusters are clustered according to the correlation of logistics information between the items, and there are 15 blocks in the blockchain, that is, the number of partitions is 15, so the first 5 clusters in the first data sequence are evenly divided, each cluster is divided into two sub-clusters, and then the newly divided five sub-clusters are placed in unoccupied blocks for data processing.

[0067] Furthermore, when the logistics information of one item is in the same block as the logistics information of another item, it means that the two items may be transported from area A to area B in the same time period; when the logistics information of an item is lost, the information can be traced based on the logistics information of other commodities in the same block, thereby realizing the digital management of logistics information.

[0068] At this point, this embodiment is completed.

[0069] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A digital sharing method for logistics based on contactless coding, characterized in that: The method comprises the following steps: Obtain logistics information and logistics identification code for each item; According to the logistics information and logistics identification code of the items, obtain the correlation between the logistics information of any two items; Clustering is performed based on the correlation of logistics information between items to obtain a number of clusters; the number of partitions is obtained according to the number of clusters and the correlation of logistics information between items in the clusters; Divide the logistics information of items according to the number of partitions, and perform traceability and verification; The specific steps of obtaining the logistics information and logistics identification code of each item are as follows: All information on the back-end terminal server of the operating company is used as logistics information, which includes the origin and the corresponding dispatch time, each transfer station and the corresponding arrival time and dispatch time, the destination and the corresponding arrival time, and obtains the logistics information corresponding to each item; Obtain a logistics identification code for each item based on the item's logistics information; The specific steps of obtaining the correlation between the logistics information of any two items according to the logistics information and the logistics identification code of the items are as follows: According to the digital matrix corresponding to the logistics identification code of the items, the correlation of each digit in the digital matrix corresponding to the logistics identification code of any two items is obtained; according to the dispatch time of the origin, the arrival time of each transfer station and the arrival time of the destination in the logistics information, and the correlation of each digit in the digital matrix corresponding to the logistics identification code, the correlation of the logistics information of any two items is obtained; The specific steps of obtaining the correlation of logistics information of any two items according to the dispatch time of the origin, the arrival time of each transfer station and the arrival time of the destination in the logistics information, and the correlation of each digit in the digital matrix corresponding to the logistics identification code are as follows: Where q(a,b) represents the correlation between the logistics information of the a-th item and the logistics information of the b-th item, I represents the number of numbers in the digital matrix corresponding to the logistics identification code, and N i Represents the correlation of the i-th digit in the digital matrix corresponding to the logistics identification codes of the two items, t aj represents the time of the jth transportation node in the logistics information of the ath item, the transportation node includes the origin, the transfer station and the destination, and the time of the transportation node includes the departure time of the origin, the arrival time of each transfer station and the arrival time of the destination; t bj It represents the time of the jth transportation node in the logistics information of the bth item, and n represents the number of transportation nodes.

2. According to claim 1, a method for digital sharing of logistics based on contactless coding is characterized in that: The specific steps of obtaining the correlation between each digit in the digital matrix corresponding to the logistics identification codes of any two items according to the digital matrix corresponding to the logistics identification codes of the items are as follows: Among them, N i is the correlation between the ith digit in the digital matrix corresponding to the logistics identification code of the a-th item and the b-th item; F ai Indicates the value of the i-th digit in the logistics identification code of the a-th item, F bi Represents the value of the i-th digit in the logistics identification code of the b-th item.

3. According to claim 1, a method for digital sharing of logistics based on contactless coding is characterized in that: The clustering is performed based on the correlation of the logistics information between the items to obtain a number of clusters, and the specific steps include the following: The DBSCAN density clustering algorithm is used to cluster all items. The minimum number of clusters and the cluster radius are set. The distance metric is 1 minus the difference between the correlation of the logistics information between the items to obtain several clusters.

4. According to claim 1, a method for digital sharing of logistics based on contactless coding is characterized in that: The specific steps of obtaining the number of partitions according to the number of clusters and the correlation of logistics information between items in the clusters are as follows: The ratio of the difference obtained by subtracting the minimum value of the correlation of logistics information between items in any cluster from the maximum value of the correlation of logistics information between items to the number of items in the cluster is recorded as the first eigenvalue of the cluster; the number of partitions is obtained according to the number of clusters, the first eigenvalues ​​of each cluster, the number of items and the number of blocks in the blockchain system.

5. According to claim 4, a method for digital sharing of logistics based on contactless coding is characterized in that: The method of obtaining the number of partitions according to the number of clusters, the first eigenvalue of each cluster, the number of items, and the number of blocks in the blockchain system includes the following specific steps: Among them, K represents the number of partitions, M represents the number of clusters, and maxq t represents the maximum value of the correlation between the logistics information of the items in the tth cluster, minq t represents the minimum value of the correlation between logistics information of items in the tth cluster, Represents the maximum value of the first eigenvalue of all clusters, Represents the minimum value of the first eigenvalue of all clusters, R t represents the number of items in the tth cluster, H represents the number of items, and U represents the number of blocks in the blockchain system. Indicates rounding down.

6. According to claim 1, a method for digital sharing of logistics based on contactless coding is characterized in that: Partitioning the logistics information of items according to the number of partitions includes the following specific steps: Arrange all clusters in descending order according to the number of items in the clusters, to obtain the first data sequence; Calculate the difference between the number of partitions and the number of clusters, and record it as the first difference; The items and their logistics information in the clusters are partitioned according to the first data sequence and the first difference.

7. According to claim 6, a method for digital sharing of logistics based on contactless coding, characterized in that: Partitioning the items and their logistics information in the clusters according to the first data sequence and the first difference value includes the following specific steps: The clusters with the first difference value in the first data sequence are recorded as clusters to be segmented, and the remaining clusters are recorded as unsegmented clusters. Each cluster to be segmented is evenly divided into two sub-clusters, and each sub-cluster and unsegmented cluster is stored in a block respectively.

Images