Method and system for using multiple express cabinet groups in series
Through multi-dimensional priority evaluation and quantum random number selection algorithm, the series use of multiple express cabinet groups is realized, which solves the problem of inefficient users' efficiency in finding available cabinet groups when express cabinets are fully loaded in the prior art, and improves the user's first delivery success rate.
Patent Information
- Application Number
- CN202510554129.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-04-29
- Publication Date
- 2025-08-15
AI Technical Summary
Existing express cabinets are usually independently deployed single systems and cannot be dynamically scheduled across cabinet groups, resulting in users needing to manually find nearby available cabinet groups when the main cabinet group is fully loaded, resulting in inefficiency and deterioration of user experience.
By establishing a multi-dimensional priority evaluation function and a quantum random number generation selection algorithm, multiple express cabinet groups can be used in series, and neighboring cabinet groups with closer distances, higher idle rates, and lower historical loads are preferred to ensure that the user's first delivery is successful.
The resource sharing of regional express cabinets has been realized, which has significantly improved the user's first delivery success rate and solved the problems of inefficiency and poor user experience caused by full load of cabinet groups in the existing technology.
Smart Images
Figure CN120482574A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of express logistics, and in particular to a method and system for serially using multiple express cabinet groups. Background Art
[0002] Existing express lockers are typically independently deployed, single systems that cannot be dynamically scheduled across multiple locker groups. When the main locker group is full, a full-load alarm is triggered, forcing users to manually search for nearby available lockers, resulting in low efficiency and a poor user experience. Summary of the Invention
[0003] The main purpose of the present invention is to solve the technical problem in the prior art that when sending a parcel, when the current parcel cabinet is full, it is necessary to go to another parcel cabinet, which wastes a lot of time. A method for using multiple parcel cabinets in series includes the following steps: Log in to the cabinet group terminal; match the free slot status of the current cabinet group. If there is an available slot: lock the corresponding physical slot and mark it as occupied to complete the delivery and retrieval; if there is no available slot: search for the adjacent available cabinet group. If there is an available slot in the adjacent available cabinet group, lock the corresponding physical slot and mark it as occupied to complete the delivery and retrieval. If there is no available slot in any of the adjacent available cabinet groups, return the full load information.
[0004] The specific steps of searching for adjacent available cabinet groups are: establishing a multi-dimensional priority evaluation function, and calculating the priority factors of adjacent available cabinet groups based on: priority factor = α×(1 / distance weight) + β×proportion of idle slots + γ×(1 / historical full load rate) + δ×time correction factor; wherein the parameters α, β, γ, δ are weights; the time correction factor is set to: daytime period 8:00-18:00: δ=0.8; nighttime period 18:00-22:00: δ=0.7; late night period 22:00-8:00: δ=0.5; select the adjacent available cabinet group according to the size of the priority factor.
[0005] When multiple terminals compete for the same grid port, a timestamp-based priority queue is used: requests closer to the current location are given priority; when the distance is the same, a quantum random number generation selection algorithm is used.
[0006] The algorithm for prioritizing requests that are closer to the current location is: Step 1: Calculate the spatiotemporal validity of each request ri: Time validity: T_diff ≤ ΔT; Spatial validity: D(ri)≤ R0; in: D(ri)=│GPS coordinates of ri - coordinates of target cabinet group│; T_diff=T_current - T_ri; ΔT and R0 are the preset time and space thresholds; T_current and T_ri are the current time and request time respectively; Filter invalid requests and get candidate set C Step 2: Time and space priority sorting Establish a sorting priority function and calculate the Priority value: Priority(ri) = w1D(ri) + w2(1 / T_diff(ri)) W1 and w2 are weights. The candidate set C is sorted in descending order of Priority value, and the request is selected based on the Priority value.
[0007] If the Priority values are the same, go to step 3: Step 3: Quantum random number winning algorithm 3.1 Hardware-level true random number generation: Call the quantum entropy source device IDQ Quantis PCIe to capture the quantum transition event of photons: QRN = {q1,q2...q128} ← QuantumRNG() Where qi∈{0,1}, generates a 128-bit true random string; 3.2 Constructing competitive terminal feature fingerprints: For each candidate terminal ci∈C: F_i = SHA3(SHA3(ci.ID || QRN[0:63])) || represents a connector, and SHA3 uses a 512-bit hash. 3.3 Winning Selection: a) Generate a winning key: K = QRN[64:127] XOR (T_current mod 2^64) b) Calculate the eigenvalue difference: ∀ci∈C, calculate Score_i = POPCOUNT(F_i XOR K) POPCOUNT is a counting function for binary 1 c) Select the one with the largest score. If repeated, recursively execute until a unique terminal is selected.
[0008] A second aspect of the present invention provides a system for serially connecting multiple express delivery cabinets, comprising: Login unit, used to log in to the cabinet terminal; The first matching unit is used to match the free slot status of the current cabinet group. If there is an available slot, the corresponding physical slot is locked and marked as occupied, completing the delivery and retrieval. The second matching unit, if there is no available slot: it searches for the adjacent available cabinet group. If there is an available slot in the adjacent available cabinet group, it locks the corresponding physical slot and marks it as occupied, completing the delivery and retrieval. If there are no available slots in all the adjacent available cabinet groups, it returns the full load information.
[0009] The third aspect of the present invention provides an electronic device, comprising: a memory and at least one processor, wherein instructions are stored in the memory, and the memory and the at least one processor are interconnected through a line; the at least one processor calls the instructions in the memory so that the electronic device executes the above-mentioned method for serial use of multiple express cabinet groups as described above.
[0010] A fourth aspect of the present invention provides a computer-readable storage medium, which stores instructions. When the computer-readable storage medium is run on a computer, it enables the computer to execute the above-mentioned method for serial use of multiple express cabinet groups as described above.
[0011] The present invention has the following beneficial effects: Through serial scheduling, the barriers of independent operation of cabinet groups are broken, regional express cabinet resource sharing is achieved, and the user's first-time delivery success rate is significantly improved.
[0012] The present invention introduces a four-dimensional weight function: distance / idle rate / historical load / time correction, so that the cabinet group selection is more in line with the actual operation scenario. BRIEF DESCRIPTION OF THE DRAWINGS
[0013] Figure 1 A flowchart of a method for serially using multiple express cabinet groups provided in an embodiment of the present invention. DETAILED DESCRIPTION
[0014] The terms "first," "second," "third," "fourth," and so on (if any) in the description and claims of the present invention and in the accompanying drawings are used to distinguish similar items and are not necessarily used to describe a particular order or sequential sequence. It should be understood that the terms used in this manner are interchangeable under appropriate circumstances, so that the embodiments described herein can be implemented in an order other than that shown or described herein. In addition, the terms "including," "comprising," "having," and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or apparatus that includes a series of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, product, or apparatus.
[0015] For ease of understanding, the specific process of the embodiment of the present invention is described below. Figure 1 The first embodiment of the method for serially using multiple express cabinet groups in an embodiment of the present invention includes: Cabinet terminal login and port matching The user logs in to the current target cabinet group through a terminal device (such as a mobile app or cabinet interface) and requests delivery or pickup services.
[0016] The terminal device sends a service request containing user identity, geographic location, and operation type to the central server.
[0017] The central server queries the current cabinet group's slot status database in real time.
[0018] If there is a free slot (the slot status is marked as available): Immediately lock the physical switch of the grid, update its status to occupied, generate a unique pickup code and return it to the user terminal.
[0019] If there is no free slot (the status is full): execute the adjacent cabinet group search process.
[0020] Neighboring cabinet group priority search algorithm: A multi-dimensional priority evaluation function is established, and the priority factors of adjacent available cabinet groups are calculated: Priority factor = α×(1 / distance weight) + β×proportion of free slots + γ×(1 / historical full load rate) + δ×time correction factor; the parameters α, β, γ, and δ are weights; the time correction factor is set to: Daytime period 8:00-18:00: δ=0.8; Nighttime period 18:00-22:00: δ=0.7; Late-night period 22:00-8:00: δ=0.5; select adjacent available cabinet groups based on the size of the priority factor.
[0021] When multiple terminals compete for the same grid port, a timestamp-based priority queue is used: requests closer to the current location are given priority; when the distance is the same, a quantum random number generation selection algorithm is used.
[0022] The algorithm for prioritizing requests that are closer to the current location is: Step 1: Calculate the spatiotemporal validity of each request ri: Time validity: T_diff ≤ ΔT; Spatial validity: D(ri)≤ R0; in: D(ri)=│GPS coordinates of ri - coordinates of target cabinet group│; T_diff=T_current - T_ri; ΔT and R0 are the preset time and space thresholds; T_current and T_ri are the current time and request time respectively; Filter invalid requests and get candidate set C Step 2: Time and space priority sorting Establish a sorting priority function and calculate the Priority value: Priority(ri) = w1D(ri) + w2(1 / T_diff(ri)) W1 and w2 are weights. The candidate set C is sorted in descending order of Priority value, and the request is selected based on the Priority value.
[0023] If the Priority values are the same, go to step 3: Step 3: Quantum random number winning algorithm 3.1 Hardware-level true random number generation: Call the quantum entropy source device IDQ Quantis PCIe to capture the quantum transition event of photons: QRN = {q1,q2...q128} ← QuantumRNG() Where qi∈{0,1}, generates a 128-bit true random string; 3.2 Constructing competitive terminal feature fingerprints: For each candidate terminal ci∈C: F_i = SHA3(SHA3(ci.ID || QRN[0:63])) || represents a connector, and SHA3 uses a 512-bit hash. 3.3 Winning Selection: a) Generate a winning key: K = QRN[64:127] XOR (T_current mod 2^64) b) Calculate the eigenvalue difference: ∀ci∈C, calculate Score_i = POPCOUNT(F_i XOR K) POPCOUNT is a counting function for binary 1 c) Select the one with the largest score. If repeated, recursively execute until a unique terminal is selected.
[0024] Full load processing: If there are no vacant slots in the adjacent cabinet groups, a "full load message" will be returned to the user terminal, along with an estimated idle time. Communication fault handling: If communication between the central server and the cabinet group is interrupted, the cabinet group switches to offline mode, only managing the local grid and caching operation logs, and synchronizes data after recovery.
[0025] The above describes the method for using multiple express cabinets in series according to an embodiment of the present invention. The following describes the device for using multiple express cabinets in series according to an embodiment of the present invention: Login unit, used to log in to the cabinet terminal; The first matching unit is used to match the free slot status of the current cabinet group. If there is an available slot, the corresponding physical slot is locked and marked as occupied, completing the delivery and retrieval. The second matching unit, if there is no available slot: it searches for the adjacent available cabinet group. If there is an available slot in the adjacent available cabinet group, it locks the corresponding physical slot and marks it as occupied, completing the delivery and retrieval. If there are no available slots in all the adjacent available cabinet groups, it returns the full load information.
[0026] An embodiment of the present invention further provides an electronic device that may vary significantly due to different configurations or performance, and may include one or more central processing units (CPUs) (e.g., one or more processors) and memory, and one or more storage media (e.g., one or more mass storage devices) for storing applications or data. The memory and storage media may be either transient or persistent storage. The program stored on the storage medium may include one or more modules, each of which may include a series of instruction operations on the electronic device. Furthermore, the processor may be configured to communicate with the storage medium and execute the series of instruction operations on the storage medium on the electronic device.
[0027] The electronic device may further include one or more power supplies, one or more wired or wireless network interfaces, one or more input and output interfaces, and / or one or more operating systems, such as Windows Server, Mac OS X, Unix, Linux, FreeBSD, etc. Those skilled in the art will appreciate that the electronic device structure in this embodiment does not constitute a limitation to electronic devices, and may include more or fewer components, or combine certain components, or arrange the components differently.
[0028] An embodiment of the present invention provides a structure of an electronic device, which may vary significantly due to different configurations or performance, and may include one or more processors (central processing units, CPUs) (for example, one or more processors) and memories, and one or more storage media for storing applications or data (for example, one or more mass storage devices). The memories and storage media may be either transient or persistent storage. The program stored in the storage medium may include one or more modules, each of which may include a series of instruction operations on the electronic device. Furthermore, the processor may be configured to communicate with the storage medium to execute the series of instruction operations in the storage medium on the electronic device.
[0029] The electronic device may further include one or more power supplies, one or more wired or wireless network interfaces, one or more input and output interfaces, and / or one or more operating systems, such as Windows Server, Mac OS X, Unix, Linux, FreeBSD, etc. Those skilled in the art will appreciate that the electronic device structure does not constitute a limitation on the electronic device, and may include more or fewer components than those described above, or combine certain components, or arrange the components differently.
[0030] The present invention also provides a computer-readable storage medium, which may be a non-volatile computer-readable storage medium or a volatile computer-readable storage medium. The computer-readable storage medium stores instructions that, when executed on a computer, cause the computer to execute the steps of the aforementioned method.
[0031] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described systems, devices, and units can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.
[0032] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the portion that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes various media that can store program code, such as a USB flash drive, a mobile hard drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.
[0033] As described above, the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the above embodiments, those skilled in the art should understand that the technical solutions described in the above embodiments can still be modified, or some of the technical features thereof can be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims
1. A method for using multiple express cabinets in series, characterized in that: The following steps are involved: Log in to the cabinet terminal; Match the free slot status of the current cabinet group. If there is an available slot, lock the corresponding physical slot and mark it as occupied to complete the delivery and retrieval. If there is no available slot: search for the adjacent available cabinet group. If there is an available slot in the adjacent available cabinet group, lock the corresponding physical slot and mark it as occupied, and complete the delivery and retrieval. If there are no available slots in any of the adjacent available cabinet groups, return the full load information.
2. A method for serially connecting multiple express cabinets according to claim 1, characterized in that: The specific steps of searching for adjacent available cabinet groups are: A multi-dimensional priority evaluation function is established to calculate the priority factors of adjacent available cabinet groups: Priority factor = α×(1 / distance weight) + β×proportion of idle slots + γ×(1 / historical full load rate) + δ×time correction factor; The parameters α, β, γ, and δ are weights; The time correction factor is set to: Daytime 8:00-18:00: δ=0.8 Nighttime 18:00-22:00: δ=0.7 Late night 22:00-8:00: δ=0.5; Select the adjacent available cabinet group based on the priority factor.
3. The method for serially connecting multiple express delivery cabinets according to claim 1, characterized in that: When multiple terminals compete for the same slot, a timestamp-based priority queue is used: Prioritize requests that are closer to the current location; When the distance is the same, the quantum random number generation selection algorithm is used.
4. The method for serially connecting multiple express delivery cabinets according to claim 3, characterized in that: The algorithm for prioritizing requests that are closer to the current location is: Step 1: Calculate the spatiotemporal validity of each request ri: Time validity: T_diff ≤ ΔT; Spatial validity: D(ri)≤ R0; in: D(ri)=│GPS coordinates of ri - coordinates of target cabinet group│; T_diff=T_current - T_ri; ΔT and R0 are the preset time and space thresholds; T_current and T_ri are the current time and request time respectively; Filter invalid requests and get candidate set C Step 2: Time and space priority sorting Establish a sorting priority function and calculate the Priority value: Priority(ri) = w1D(ri) + w2(1 / T_diff(ri)) W1 and w2 are weights. The candidate set C is sorted in descending order of Priority value, and the request is selected based on the Priority value.
5. The method for serially connecting multiple express delivery cabinets according to claim 4, characterized in that: If the Priority values are the same, go to step 3: Step 3: Quantum random number winning algorithm 3.1 Hardware-level true random number generation: Call the quantum entropy source device IDQ Quantis PCIe to capture the quantum transition event of photons: QRN = {q1,q2...q128} ← QuantumRNG() Where qi∈{0,1}, generates a 128-bit true random string; 3.2 Constructing competitive terminal feature fingerprints: For each candidate terminal ci∈C: F_i = SHA3(SHA3(ci.ID || QRN[0:63])) || represents a connector, and SHA3 uses a 512-bit hash. 3.3 Winning Selection: a) Generate a winning key: K = QRN[64:127] XOR (T_current mod 2^64) b) Calculate the eigenvalue difference: ∀ci∈C, calculate Score_i = POPCOUNT(F_i XOR K) POPCOUNT is a counting function for binary 1 c) Select the one with the largest score. If repeated, recursively execute until a unique terminal is selected.
6. A system for serial use of multiple express cabinets, characterized in that: The system comprises: Login unit, used to log in to the cabinet terminal; The first matching unit is used to match the free slot status of the current cabinet group. If there is an available slot, the corresponding physical slot is locked and marked as occupied, completing the delivery and retrieval. The second matching unit, if there is no available slot: it searches for the adjacent available cabinet group. If there is an available slot in the adjacent available cabinet group, it locks the corresponding physical slot and marks it as occupied, completing the delivery and retrieval. If there are no available slots in all the adjacent available cabinet groups, it returns the full load information.
7. An electronic device comprising a memory and at least one processor, wherein the memory stores instructions; The at least one processor calls the instructions in the memory to enable the electronic device to execute each step of the method for serial use of multiple express cabinet groups as described in any one of claims 1 to 5.
8. A computer-readable storage medium having instructions stored thereon, characterized in that: When the instructions are executed by the processor, the various steps of the method for serial use of multiple express cabinet groups as described in any one of claims 1 to 5 are implemented.