Warehouse resource scheduling method, device, computer equipment and storage medium

Abstract

The present application relates to a storage resource scheduling method, device, computer equipment and storage medium. The method includes: determining candidate shelves in the warehouse that meet the caching conditions, wherein the caching conditions include that the depth of the candidate shelves is less than or equal to the depth threshold; selecting the candidate shelves whose distance is less than or equal to the distance threshold as the target shelves according to the distance between the candidate shelves and the warehouse exit; using the storage locations contained in the target shelves as the cache area of ​​the warehouse, wherein the cache area is used to cache the goods. The method selects shelves with a smaller depth and close to the warehouse exit as the cache area in the warehouse, which is beneficial for the rapid removal of goods from the shelves on the one hand, and for the rapid arrival of goods at the warehouse exit on the other hand, thereby improving the efficiency of goods leaving the warehouse.

Description

Technical Field

[0001] The present application relates to the field of warehousing technology, and in particular to a warehousing resource scheduling method, device, computer equipment and storage medium. Background Art

[0002] As the warehousing field pays more and more attention to the rational use of land resources, intensive storage technology has received increasing attention. The so-called intensive storage usually refers to the use of special access methods or shelf structures to achieve continuous storage of goods on the shelf depth to maximize storage density. Intensive storage requires increasing capacity in the same warehouse area to save space resources.

[0003] In traditional technology, in order to save space resources, the method of reducing the number of shelves is adopted to increase storage density, and the shelves are made to operate at multiple depths to realize the entry and exit of goods.

[0004] However, with the traditional method, due to the small number of operating channels, the outbound efficiency is low when the outbound task is busy. Summary of the invention

[0005] Based on this, it is necessary to provide a warehouse resource scheduling method, device, computer equipment and storage medium that can improve the efficiency of warehouse delivery in response to the above technical problems.

[0006] A storage resource scheduling method, the method comprising:

[0007] Determine a candidate shelf in the warehouse that meets a caching condition, wherein the caching condition includes that the depth of the candidate shelf is less than or equal to a depth threshold;

[0008] According to the distance between the candidate shelf and the exit, a candidate shelf whose distance is less than or equal to a distance threshold is selected as a target shelf;

[0009] The storage locations included in the target shelf are used as a cache area of ​​the warehouse, wherein the cache area is used to cache goods.

[0010] A storage resource scheduling device, the device comprising:

[0011] A candidate shelf determination module, used to determine a candidate shelf in the warehouse that meets a cache condition, wherein the cache condition includes that the depth of the candidate shelf is less than or equal to a depth threshold;

[0012] A target shelf determination module is used to select a candidate shelf whose distance is less than or equal to a distance threshold as a target shelf according to the distance between the candidate shelf and the warehouse exit;

[0013] The buffer area determination module is used to use the storage location contained in the target shelf as the buffer area of ​​the warehouse, wherein the buffer area is used to cache goods.

[0014] A computer device comprises a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0015] Determine a candidate shelf in the warehouse that meets a caching condition, wherein the caching condition includes that the depth of the candidate shelf is less than or equal to a depth threshold;

[0016] According to the distance between the candidate shelf and the exit, a candidate shelf whose distance is less than or equal to a distance threshold is selected as a target shelf;

[0017] The storage locations included in the target shelf are used as a cache area of ​​the warehouse, wherein the cache area is used to cache goods.

[0018] A computer-readable storage medium stores a computer program, which, when executed by a processor, implements the following steps:

[0019] Determine a candidate shelf in the warehouse that meets a caching condition, wherein the caching condition includes that the depth of the candidate shelf is less than or equal to a depth threshold;

[0020] According to the distance between the candidate shelf and the exit, a candidate shelf whose distance is less than or equal to a distance threshold is selected as a target shelf;

[0021] The storage locations included in the target shelf are used as a cache area of ​​the warehouse, wherein the cache area is used to cache goods.

[0022] The above-mentioned warehouse resource scheduling method, device, computer equipment and storage medium select shelves with a specific depth and close to the delivery port as the buffer area in the warehouse. On the one hand, it is beneficial for the goods to be quickly taken out of the shelves, and on the other hand, it is beneficial for the goods to quickly arrive at the delivery port, thereby improving the delivery efficiency of the goods. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] Figure 1 An application environment diagram of a storage resource scheduling method in one embodiment;

[0024] Figure 2 It is a flowchart of a storage resource scheduling method in one embodiment;

[0025] Figure 3 A schematic diagram of a flow chart of a supplementary solution for performing cache scheduling of goods in a cache area in one embodiment;

[0026] Figure 4A schematic flow chart of a supplementary solution for performing cache scheduling of goods in a cache area in another embodiment;

[0027] Figure 5 It is a flowchart of a supplementary solution for performing cache scheduling of goods in a cache area in another embodiment;

[0028] Figure 6 is a structural block diagram of a storage resource scheduling device in one embodiment;

[0029] Figure 7 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0030] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0031] In an exemplary embodiment, the storage resource scheduling method involved in the present application is applied to a storage resource scheduling device for example. It can be understood that, if Figure 1 As shown, the storage resource scheduling device can be a terminal 102, a server 104, or a system including the terminal 102 and the server 104, and is implemented through the interaction between the terminal 102 and the server 104. The terminal 102 can be, but is not limited to, various personal computers, laptops, smart phones, tablet computers, and portable wearable devices, and the server 104 can be implemented by an independent server or a server cluster consisting of multiple servers.

[0032] In an exemplary embodiment, if Figure 2 As shown, a storage resource scheduling method is provided, with a storage resource scheduling device as Figure 1 The server in the example is used to illustrate, which can be implemented by the following steps:

[0033] Step S202, determining candidate shelves in the warehouse that meet the caching conditions.

[0034] The cache condition includes that the depth of the candidate shelf is less than or equal to the depth threshold. The depth of the shelf refers to the number of shelves in the direction of goods entering and exiting the shelf. The depth of the shelf can be measured by the number of containers that can be placed. For example, the depth of the shelf is x, which means that the number of shelves in the horizontal direction of the shelf is x, and the number of containers that can be placed side by side is x. Optionally, the container includes a pallet, a storage cage, etc.

[0035] It should be clear that a warehouse is a building used to store goods. The warehouse is divided into different areas for storing different goods, and such areas are called warehouse areas. In the warehouse area, shelves are placed, and the shelves contain storage locations for placing goods. Usually, lanes are set up next to some shelves to facilitate the passage of goods transportation equipment in the lanes to store or retrieve goods from shelves on both sides of or near the lanes. Each shelf can have multiple layers in the height direction, and each layer of the shelf can contain at least one storage location in the depth direction, which is used to achieve continuous storage of goods in the depth of the shelf. Goods transportation equipment can move along the lanes to realize the entry and exit of goods. Goods can be placed in containers, and the storage or retrieval of the goods placed in the container can be achieved by storing or taking out the container in which the goods are placed.

[0036] Specifically, the storage resource scheduling device can obtain the distribution information of the storage locations in the warehouse, and use the distribution information of the storage locations to find the shelves with a depth less than or equal to the depth threshold among all the shelves as candidate shelves. For example, in order to ensure that the goods are not hindered by other goods during shipment, the depth threshold can be set to 2, so that the candidate shelf can be a shelf containing one storage location. For another example, some shelves are provided with multiple openings so that the goods placed in the shelves can enter and exit from each opening. Assuming that there are two openings on both sides of a shelf, the candidate shelf is a double-opening aisle containing two openings. In addition, in actual application scenarios, given the variety of shelf structures, for shelves with different structures, candidate shelves can be selected based on the principle that they are not hindered by other goods at all or have little impact from the obstruction during shipment.

[0037] The distribution information of the storage locations includes the location of each storage location in the warehouse.

[0038] Step S204, based on the distance between the candidate shelf and the delivery port, select the candidate shelf whose distance is less than or equal to the distance threshold as the target shelf.

[0039] The exit is where the goods are shipped out of the warehouse. Usually, a lift is provided at the exit to transport goods to different levels of upper and lower shelves so as to ship goods at different heights out of the warehouse. For example, the goods transport equipment may be a four-way shuttle vehicle or the like.

[0040] Specifically, the storage resource scheduling device first determines the distance between each candidate shelf and the exit according to the location of each candidate shelf and the location of the exit. Next, the storage resource scheduling device searches for a candidate shelf whose distance between the candidate shelf and the exit is less than or equal to a distance threshold among all candidate shelves based on the distance between each candidate shelf and the exit, and uses it as the target shelf. Optionally, the distance threshold can be set according to the geometric dimensions of the shelf or according to an empirical value. It can be understood that the smaller the distance threshold is set, the smaller the distance between the target shelf and the exit, which is more conducive to improving the efficiency of goods exiting the warehouse.

[0041] Step S206: Use the storage locations included in the target shelf as the buffer area of ​​the warehouse.

[0042] Among them, the cache area is used to cache goods.

[0043] Specifically, after determining the target shelf, the storage resource scheduling device uses the storage locations contained in the target shelf as the warehouse buffer area. Optionally, the storage locations in the buffer area can be adjusted according to actual shipping needs. For example, when there are fewer shipping tasks, the storage locations in the buffer area can be reduced, and when there are more shipping tasks, the storage locations in the buffer area can be appropriately increased.

[0044] In the above-mentioned warehouse resource scheduling method, by selecting shelves with smaller depth and close to the delivery port as the buffer area in the warehouse, it is beneficial for the goods to be quickly taken out of the shelves on the one hand, and it is beneficial for the goods to quickly reach the delivery port on the other hand, thereby improving the delivery efficiency of the goods.

[0045] In some application scenarios, the goods in some containers will be picked out of the warehouse and returned to the storage location in batches. Due to the frequent entry and exit of such goods, the moving distance is too long, which affects the efficiency of their outbound delivery. In an exemplary embodiment, in order to reduce the moving distance consumed by the goods in and out of the warehouse, this embodiment selects a high-speed cache area in the above-mentioned cache area. The purpose of the high-speed cache area is to reserve a small number of storage locations to cache certain goods that are frequently in and out of the warehouse, so as to cope with the situation of multiple batches of zero-picking out of the warehouse within a period of time, increase the outbound throughput, and improve the outbound efficiency.

[0046] Optionally, the candidate shelf has a depth of 1, or a depth of 2 and openings on both sides.

[0047] Based on the above embodiment, in an exemplary embodiment, it is related to an implementation process of performing cache scheduling of goods in the above cache area. Figure 3 As shown, the method further comprises the following steps:

[0048] Step S212, determining the goods to be cached according to the number of picking times of each type of goods;

[0049] Step S214, determining a container to be cached from the containers containing the goods to be cached;

[0050] Step S216, caching the container to be cached into an idle storage location in the cache area.

[0051] The picking times refers to the number of times the goods go to the picking station. For example, suppose there are 2 orders (not placed at the same time), one order requires 1 box of goods, and the other order requires 2 boxes of goods. In this case, the container containing the goods first goes to the picking station to pick out 1 box of goods, then returns to the warehouse, and then the container goes to the picking station to pick out 2 boxes of goods. Therefore, the picking times of the goods is 2.

[0052] Specifically, the warehouse resource scheduling device first obtains the picking times of each type of goods, and determines the goods to be cached according to the picking times of each type of goods. Optionally, the warehouse resource scheduling device may use goods whose picking times are greater than or equal to the times threshold as goods to be cached. For example, within a certain period of time, the picking times of item a reaches 20 times, which exceeds the set times threshold of 10, then item a can be used as goods to be cached. Usually, there are multiple containers containing goods to be cached, and the warehouse resource scheduling device determines the container to be cached from multiple containers containing goods to be cached. The warehouse resource scheduling device can use any container containing goods to be cached as a container to be cached. Optionally, a container containing scattered goods to be cached can be used as a container to be cached. Scattered containers of goods to be cached can be understood as containers that are not filled with goods. Next, the warehouse resource scheduling device caches the container to be cached in an idle storage location in the cache area.

[0053] In the embodiment of the present application, the moving distance consumed by the frequent entry and exit of goods in the warehouse can be reduced, the outbound throughput can be increased, and the outbound efficiency can be improved.

[0054] Optionally, in one example, the number of times each type of goods is picked for the outbound order is used as the number of times each type of goods is picked. By analyzing historical orders to predict which goods need to be put into the cache area, these goods can be put into the cache area in advance, so that when they need to be shipped out, the time for such goods to arrive at the cache area from the warehouse area is saved, further improving the outbound efficiency of goods.

[0055] In an exemplary embodiment, a possible implementation process of determining a container to be cached from containers containing goods to be cached is involved. Based on the above embodiment, step S214 can be specifically implemented by the following steps:

[0056] Step S214a, according to the quantity of the goods to be cached in each container, a container whose quantity of the goods to be cached is less than the quantity threshold is selected as a container to be cached.

[0057] Specifically, considering that the goods are used for piecemeal picking, in order to ensure the overall outbound efficiency of the goods in the warehouse, the container containing scattered goods to be cached is used as a container to be cached, so that the storage resources can be effectively allocated. Among them, the storage resource scheduling device first obtains the number of goods to be cached in each container, and then determines whether the number of goods to be cached is less than a quantity threshold. The quantity threshold can be the number of goods when the container is full. If the number of goods to be cached is less than the quantity threshold, it indicates that the container is a container containing scattered goods to be cached. At this time, the container is used as a container to be cached.

[0058] In the embodiment of the present application, using a container containing scattered goods to be cached as a cache container is beneficial to ensuring the overall outbound efficiency of the goods in the warehouse.

[0059] In an exemplary embodiment, a possible implementation process of determining the goods to be cached according to the number of picking times of each type of goods is involved. Based on the above embodiment, step S212 can be specifically implemented by the following steps:

[0060] Step S212a, determining the goods to be cached according to the number of picking times of each type of goods and the number of containers required for each type of goods to be shipped out.

[0061] Specifically, the storage resource scheduling device determines the average number of picking times for each type of goods according to the number of picking times for each type of goods and the number of containers required for each type of goods to be shipped out. Optionally, the average number of picking times is the ratio of the number of picking times for each type of goods to the number of containers required for each type of goods to be shipped out. Next, the storage resource scheduling device determines the type of goods to be cached according to the ratio and the ratio threshold, wherein the ratio threshold is equal to or greater than 2. Next, the storage resource scheduling device determines the goods to be cached according to the type of goods to be cached.

[0062] In the embodiment of the present application, the goods to be cached are determined by the number of picking times of each type of goods and the number of containers required for each type of goods to be shipped out, which is conducive to improving the accuracy of the goods to be cached and further improving the shipping efficiency.

[0063] Taking the container as a pallet as an example, the applicant found through research that, assuming that only a certain product is picked no more than 1 pallet for a total of p times (corresponding to the above number of pickings), it takes s less time to ship the product from the buffer area than from the warehouse area. It takes d pallets (corresponding to the number of containers mentioned above) to complete the picking, and it takes c time to move from the warehouse area to the buffer area. Then the profit is:

[0064] benefit = sp – cd.

[0065] In other words, the profit is positive only when p / d>c / s. Among them, c is almost equal to s, that is, when the average number of picks per pallet of the current product is greater than 1, it is beneficial to place the scattered pallets of the product in the buffer area.

[0066] Based on the above research, in an exemplary embodiment, a possible implementation process of determining the type of goods to be cached according to the ratio and the ratio threshold is involved. Based on the above embodiment, this embodiment can be specifically implemented by the following steps:

[0067] Step S2122, determining candidate product types whose ratios are greater than the ratio threshold;

[0068] Step S2124, according to the size of the ratio, the candidate product types are sorted in descending order, and the top m candidate product types are used as the product types to be cached.

[0069] Here, m is the smaller value between the number of candidate product types and the number of free storage locations in the buffer area.

[0070] Specifically, the storage resource scheduling device compares the ratio with the ratio threshold. If the ratio is greater than the ratio threshold, the product type is determined as a candidate product type. Next, the storage resource scheduling device counts the number of candidate product types and checks the number of free storage locations in the cache area, thereby selecting the smaller value between the two as the number m of types of products to be cached. Next, the storage resource scheduling device arranges the candidate product types in descending order according to the size of the ratio, and selects the first m candidate product types as the product types to be cached.

[0071] In the embodiment of the present application, goods with an average picking number greater than 1 are placed in a cache area for caching. Based on the above research results, it can be seen that this is beneficial to improving the efficiency of goods outbound.

[0072] In an exemplary embodiment, the method further comprises the following steps:

[0073] Step S222, obtaining various types of goods and their quantities required for the order to be shipped;

[0074] Step S224, determining the picking times of each type of goods according to the types of goods and their quantities required for the outbound order.

[0075] Specifically, the warehouse resource scheduling device can obtain the various types of goods and their quantities required for the orders to be shipped from the order database. The warehouse resource scheduling device determines which goods and containers need to be shipped out to meet the needs of the orders to be shipped based on the various types of goods and their quantities required for the orders to be shipped. It should be clear that the same goods can be placed in multiple containers due to the large quantity. Usually, there are multiple orders to be shipped. In order to meet different order requirements, the goods in each container may need to be shipped out multiple times. Therefore, for all orders to be shipped within a period of time, the number of picking times of each type of goods is counted.

[0076] In the embodiment of the present application, the picking times of each type of goods can be accurately determined based on the types of goods and their quantities required for the outbound order.

[0077] In an exemplary embodiment, a possible implementation process is involved in determining the number of picking times for each type of goods according to the types of goods and their quantities required for the outbound order. Based on the above embodiment, step S224 can be specifically implemented by the following steps:

[0078] Step S2242, based on the various types of goods and their quantities required for the outbound order, as well as the goods in each container and their quantities, determine the picking times for each type of goods and the number of containers required for outbound delivery of each type of goods.

[0079] Specifically, the warehouse resource scheduling device first obtains the various types of goods and their quantities required for the order to be shipped, and the goods and their quantities in each container in the warehouse. Optionally, the goods can be stored in stock keeping units (SKUs), and the number of goods can be counted in boxes. Among them, SKU is the smallest available unit in inventory management. For example, a SKU in textiles usually represents a specification, color or style of clothing, and in chain retail, a single commodity is sometimes called a SKU. Next, the warehouse resource scheduling device determines which goods and containers need to be shipped out to meet the needs of the order to be shipped, based on the various types of goods and their quantities required for the order to be shipped, as well as the goods and their quantities in each container, specifically determining the number of picking times for each type of goods and the number of containers required for each type of goods to be shipped out.

[0080] In an exemplary embodiment, the method further comprises the following steps:

[0081] Step S232, receiving a product update message of a to-be-shipped order, and determining that the product information in the cache area is a completed or cancelled to-be-cache product;

[0082] Step S234, moving the to-be-cached goods whose product information in the cache area is completed or cancelled out of the cache area.

[0083] Specifically, the warehouse resource scheduling device receives the product update message of the order to be shipped sent by the order processing device, and the product update message of the order to be shipped includes product information of completion, product information of cancellation, or product information of suspension, etc. Next, the warehouse resource scheduling device determines the product to be cached in the cache area whose product information is completion or cancellation, and moves the product to be cached out of the cache area.

[0084] In the embodiment of the present application, the goods are promptly moved out of the buffer area so that other goods can be temporarily stored in time, thereby improving the efficiency of goods outbound delivery.

[0085] In some application scenarios, some users hope to complete the delivery of goods in the shortest time after the truck arrives at the platform. In this regard, in an exemplary embodiment, in order to shorten the delivery time, this embodiment selects a pre-delivery temporary storage area in the above-mentioned buffer area. The purpose of the pre-delivery temporary storage area is to store all the goods of the above-mentioned user in a location in the buffer area with a faster delivery time after the goods are picked.

[0086] Based on the above embodiment, in an exemplary embodiment, another implementation process of performing product cache scheduling in the above cache area is involved. Figure 4 As shown, the method further comprises the following steps:

[0087] Step S242, obtaining various types of goods and their quantities required for the outbound order.

[0088] Among them, the orders to be shipped can be the orders that the above-mentioned users hope to ship out in the shortest time.

[0089] Specifically, the warehouse resource scheduling device can obtain various types of goods and their quantities required for the outbound orders from the order database.

[0090] Step S244, obtaining parameters of the container in the warehouse.

[0091] Specifically, the storage resource scheduling device obtains container parameters of the containers in the warehouse, and the container parameters include the length, width, height, and load capacity of the container.

[0092] Step S246, determining the number of containers required for the order to be shipped and the goods to be shipped in each container according to the types of goods and their quantities and the parameters of the containers required for the order to be shipped.

[0093] Specifically, the warehouse resource scheduling device uses a palletizing algorithm to analyze the order information of the outbound order and the parameters of the container to determine the number of containers required for the outbound order, that is, how many containers are needed, and the outbound goods in each container, that is, what goods are placed in each container. Since each container needs to occupy a storage location for storage, it is necessary to reserve a number of storage locations equal to the number of containers in the pre-outbound temporary storage area.

[0094] Step S248, selecting the first shelf in the buffer area that contains the most free storage locations.

[0095] Specifically, after determining the number of required storage locations, the storage resource scheduling device sends a storage location temporary storage request to the pre-delivery temporary storage area. If the number of free storage locations in the pre-delivery temporary storage area is greater than or equal to the number of required storage locations, a request success message is returned. If the number of free storage locations in the pre-delivery temporary storage area is less than the number of required storage locations, a request failure message is returned. After the request is successful, the storage resource scheduling device first selects the first shelf containing the most free storage locations in the pre-delivery temporary storage area.

[0096] Step S250: When the number of containers is less than or equal to the number of free storage locations included in the first shelf, the goods to be shipped out in each container are cached in the free storage locations of the first shelf.

[0097] Specifically, the warehouse resource scheduling device determines whether the number of containers is greater than the number of free storage locations contained in the first shelf. If not, that is, when the number of containers is less than or equal to the number of free storage locations contained in the first shelf, it indicates that the first shelf is sufficient to accommodate all containers. The warehouse resource scheduling device then caches the goods to be shipped out after picking is completed in the free storage locations of the first shelf.

[0098] In the embodiment of the present application, the same batch of goods to be shipped out are picked and temporarily stored in a pre-shipping temporary storage area, so that the shipment of this batch of goods can be completed in the shortest time, thereby improving the shipment efficiency.

[0099] In an exemplary embodiment, the method further comprises the following steps:

[0100] Step S252, when the number of containers is greater than the number of free storage locations included in the first shelf, obtaining the difference between the number of containers and the number of free storage locations included in the first shelf;

[0101] Step S254, determining a second shelf in the buffer area having a number of free storage locations greater than or equal to the difference, and selecting a third shelf having the least free storage locations from the second shelf;

[0102] Step S256, cache the goods to be shipped out in each container to the free storage locations of the first shelf and the third shelf.

[0103] Specifically, the storage resource scheduling device determines whether the number of containers is greater than the number of free storage locations included in the first shelf. When the number of containers is greater than the number of free storage locations included in the first shelf, it indicates that the first shelf is insufficient to accommodate all containers. Then, the difference between the number of containers and the number of free storage locations included in the first shelf is calculated, and a second shelf with a number of free storage locations greater than or equal to the difference in the pre-delivery temporary storage area is searched. At the same time, among all the second shelves, the third shelf with the least free storage locations is selected. In this way, after determining the first shelf and the third shelf, the storage resource scheduling device caches the goods to be shipped after picking to the free storage locations of the first shelf and the third shelf.

[0104] In the embodiment of the present application, when the first shelf is insufficient to accommodate all containers, further selecting the third shelf containing the least free storage space is helpful to save aisles that can be directly shipped out of the warehouse and improve the utilization rate of storage resources.

[0105] In an exemplary embodiment, when the above-mentioned goods are shipped out or canceled, the goods are moved out of the buffer area, and the status of the first shelf, or the first shelf and the third shelf is updated to an idle state, so that other goods can be temporarily stored in time.

[0106] In a dense storage system, warehouse exits are usually equipped with elevators. Due to the performance bottleneck of the elevator, when the number of goods transport equipment to be shipped out is greater than the number of exits, a jam will occur near the exit, affecting the efficiency of goods shipment. In this regard, in an exemplary embodiment, in order to alleviate or eliminate the jam and ensure that the goods transport equipment to be shipped out can smoothly reach the target exit, a temporary storage area is selected in the above-mentioned buffer area.

[0107] Assuming that the number of cargo transport equipment to be shipped out is n, and the number of warehouse outlets is m, then the number of warehouse digits contained in the temporary storage area can be determined based on the difference of nm. Optionally, the number of warehouse digits contained in the temporary storage area is less than or equal to (nm). In this way, when the target warehouse outlet to be reached by the cargo transport equipment is occupied by other cargo transport equipment, the cargo transport equipment can be temporarily stored in the temporary storage area until the target warehouse outlet is idle, and then the cargo transport equipment is moved to the target warehouse outlet, thereby effectively alleviating or eliminating the congestion and improving the efficiency of cargo shipping out.

[0108] Based on the above embodiment, in an exemplary embodiment, another implementation process of performing product cache scheduling in the above cache area is involved. Figure 5 As shown, the method further comprises the following steps:

[0109] Step S262, obtaining the number of cargo transport equipment to be shipped out of the warehouse, and obtaining the number of shipping ports;

[0110] Step S264, when the number of cargo transportation equipment is greater than the number of warehouse exits, cargo transportation equipment whose number is equal to the difference between the number of cargo transportation equipment and the number of warehouse exits is cached in the cache area.

[0111] Specifically, during the goods outbound process, the storage resource scheduling device obtains the number of goods transport equipment to be outbound and the number of outbound ports. When the number of goods transport equipment is greater than the number of outbound ports, it indicates that some goods transport equipment cannot reach the outbound ports. At this time, the excess goods transport equipment is cached in a temporary storage area until the target outbound port to be reached by the goods transport equipment is in an idle state, and then the goods transport equipment is moved to the target outbound port to complete the outbound task. Optionally, the goods transport equipment includes a pallet shuttle.

[0112] In the embodiment of the present application, by setting up a temporary storage area, the congestion of the goods transportation equipment can be effectively alleviated or eliminated, thereby improving the efficiency of goods outbound.

[0113] It should be understood that although Figure 2-5 The steps in the flowchart are shown in sequence as indicated by the arrows, but these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified in this document, there is no strict order restriction for the execution of these steps, and these steps can be executed in other orders. Moreover, Figure 2-5 At least part of the steps may include multiple steps or multiple stages. These steps or stages are not necessarily performed at the same time, but can be performed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed in turn or alternately with other steps or at least part of the steps or stages in other steps.

[0114] In an exemplary embodiment, if Figure 6 As shown, a storage resource scheduling device is provided, including: a candidate shelf determination module 302, a target shelf determination module 304 and a buffer area determination module 306, wherein:

[0115] The candidate shelf determination module 302 is used to determine a candidate shelf in the warehouse that meets a cache condition, wherein the cache condition includes that the depth of the candidate shelf is less than or equal to a depth threshold;

[0116] The target shelf determination module 304 is used to select a candidate shelf whose distance is less than or equal to a distance threshold as a target shelf according to the distance between the candidate shelf and the warehouse exit;

[0117] The buffer area determination module 306 is used to use the storage location included in the target shelf as the buffer area of ​​the warehouse, wherein the buffer area is used to cache goods.

[0118] In the above-mentioned warehouse resource scheduling device, by selecting shelves with smaller depth and close to the delivery port as the buffer area in the warehouse, it is beneficial for the goods to be quickly taken out of the shelves on the one hand, and it is beneficial for the goods to quickly reach the delivery port on the other hand, thereby improving the delivery efficiency of the goods.

[0119] In an exemplary embodiment, the warehouse resource scheduling device also includes: a module for determining goods to be cached, a module for determining containers to be cached, and a cache module, wherein the module for determining goods to be cached is used to determine the goods to be cached according to the number of picking times of each type of goods; the module for determining containers to be cached is used to determine the containers to be cached from the containers containing the goods to be cached; and the cache module is used to cache the containers to be cached into the free storage locations in the cache area.

[0120] In an exemplary embodiment, the to-be-cached container determination module is specifically configured to select a container whose quantity of to-be-cached goods is less than a quantity threshold as a to-be-cached container according to the quantity of to-be-cached goods in each container.

[0121] In an exemplary embodiment, the module for determining goods to be cached is specifically used to determine the goods to be cached according to the number of picking times of each type of goods and the number of containers required for each type of goods to be shipped out.

[0122] In an exemplary embodiment, the module for determining goods to be cached is specifically used to determine the ratio of the number of picking times for each type of goods to the number of containers required for each type of goods to be shipped out; determine the type of goods to be cached based on the ratio and the ratio threshold; determine the goods to be cached based on the type of goods to be cached, wherein the ratio threshold is equal to or greater than 2.

[0123] In an exemplary embodiment, the module for determining goods to be cached is specifically used to determine candidate goods types whose ratios are greater than a ratio threshold; according to the size of the ratios, the candidate goods types are arranged in descending order, and the first m candidate goods types in the order are used as the goods types to be cached; m is the smaller value between the number of candidate goods types and the number of free storage locations in the cache area.

[0124] In an exemplary embodiment, the warehouse resource scheduling device also includes: an order information acquisition module and a picking number determination module, wherein the order information acquisition module is used to obtain various types of goods and their quantities required for the orders to be shipped; the picking number determination module is used to determine the picking number of each type of goods based on the various types of goods and their quantities required for the orders to be shipped.

[0125] In an exemplary embodiment, the picking times determination module is specifically used to determine the picking times of each type of goods and the number of containers required for shipping of each type of goods based on the types of goods and their quantities required for the orders to be shipped, as well as the goods in each container and their quantities.

[0126] In an exemplary embodiment, the warehouse resource scheduling device also includes: an update message receiving module and a product removal module, wherein the update message receiving module is used to receive product update messages of orders to be shipped out, and determine the product information in the cache area is completed or cancelled to be cached; the product removal module is used to move the product information in the cache area that is completed or cancelled to be cached out of the cache area.

[0127] In an exemplary embodiment, the picking times determination module is further configured to use the picking times of each type of goods required for the outbound order as the picking times of each type of goods.

[0128] In an exemplary embodiment, the warehouse resource scheduling device also includes: an order information acquisition module, a container parameter acquisition module, an order processing module, a first shelf selection module and a cache module, wherein the order information acquisition module is used to obtain various types of goods and their quantities required for the order to be shipped; the container parameter acquisition module is used to obtain the parameters of the containers in the warehouse; the order processing module is used to determine the number of containers required for the order to be shipped and the goods to be shipped in each container according to the various types of goods and their quantities required for the order to be shipped and the parameters of the containers; the first shelf selection module is used to select the first shelf containing the most free storage locations in the cache area; the cache module is used to cache the goods to be shipped in each container to the free storage locations of the first shelf when the number of containers is less than or equal to the number of free storage locations contained in the first shelf.

[0129] In an exemplary embodiment, the warehouse resource scheduling device also includes: a difference acquisition module, a third shelf selection module and a cache module, wherein the difference acquisition module is used to obtain the difference between the number of containers and the number of free storage locations contained in the first shelf when the number of containers is greater than the number of free storage locations contained in the first shelf; the third shelf selection module is used to determine the second shelf in the cache area whose number of free storage locations is greater than or equal to the difference, and select the third shelf containing the least free storage locations from the second shelf; the cache module is used to cache the goods to be shipped out in each container into the free storage locations of the first shelf and the third shelf.

[0130] In an exemplary embodiment, the warehouse resource scheduling device also includes: a quantity acquisition module and a cache module, wherein the quantity acquisition module is used to obtain the number of cargo transportation equipment to be shipped out of the warehouse, and the number of shipping ports; the cache module is used to cache the cargo transportation equipment whose quantity is equal to the difference between the number of cargo transportation equipment and the number of shipping ports into the cache area when the number of cargo transportation equipment is greater than the number of shipping ports.

[0131] In an exemplary embodiment, the candidate shelf has a depth of 1, or a depth of 2 and openings on both sides.

[0132] For the specific definition of the warehouse resource scheduling device, please refer to the definition of the warehouse resource scheduling method above, which will not be repeated here. Each module in the above-mentioned warehouse resource scheduling device can be implemented in whole or in part by software, hardware and a combination thereof. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

[0133] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Figure 7 As shown. The computer device includes a processor, a memory and a network interface connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a storage resource scheduling method is implemented.

[0134] Those skilled in the art will understand that Figure 7 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0135] In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the following steps are implemented:

[0136] Determine a candidate shelf in the warehouse that meets a caching condition, wherein the caching condition includes that the depth of the candidate shelf is less than or equal to a depth threshold;

[0137] According to the distance between the candidate shelf and the exit, the candidate shelf whose distance is less than or equal to the distance threshold is selected as the target shelf;

[0138] The storage locations contained in the target shelf are used as the cache area of ​​the warehouse, where the cache area is used to cache the goods.

[0139] In the above-mentioned computer equipment, by selecting a shelf with a smaller depth and close to the delivery port as the cache area in the warehouse, it is beneficial for the goods to be quickly taken out of the shelf on the one hand, and it is beneficial for the goods to quickly reach the delivery port on the other hand, thereby improving the delivery efficiency of the goods.

[0140] In an exemplary embodiment, when the processor executes the computer program, the following steps are also implemented: determining the goods to be cached according to the number of picking times of each type of goods; determining the containers to be cached from the containers containing the goods to be cached; and caching the containers to be cached into the free storage locations in the cache area.

[0141] In an exemplary embodiment, when the processor executes the computer program, the following steps are also implemented: according to the quantity of goods to be cached in each container, a container whose quantity of goods to be cached is less than a quantity threshold is selected as a container to be cached.

[0142] In an exemplary embodiment, when the processor executes the computer program, the following steps are also implemented: determining the goods to be cached according to the number of picking times of each type of goods and the number of containers required for each type of goods to be shipped out of the warehouse.

[0143] In an exemplary embodiment, when the processor executes the computer program, the following steps are also implemented: determining the ratio of the number of picking times for each type of goods to the number of containers required for each type of goods to be shipped out of the warehouse; determining the type of goods to be cached based on the ratio and the ratio threshold; determining the goods to be cached based on the type of goods to be cached, wherein the ratio threshold is equal to or greater than 2.

[0144] In an exemplary embodiment, when the processor executes the computer program, the following steps are also implemented: determining the candidate product types whose ratios are greater than a ratio threshold; arranging the candidate product types in descending order according to the size of the ratios, and using the first m candidate product types in the order as the product types to be cached; m is the smaller value between the number of candidate product types and the number of free storage locations in the cache area.

[0145] In an exemplary embodiment, when the processor executes the computer program, it also implements the following steps: obtaining various types of goods and their quantities required for the orders to be shipped; and determining the picking times of various types of goods based on the various types of goods and their quantities required for the orders to be shipped.

[0146] In an exemplary embodiment, when the processor executes the computer program, it also implements the following steps: according to the types of goods and their quantities required for the orders to be shipped out, as well as the goods in each container and their quantities, determine the picking times for each type of goods and the number of containers required for shipping out each type of goods.

[0147] In an exemplary embodiment, when the processor executes the computer program, the following steps are also implemented: receiving a product update message of an order to be shipped out, determining that the product information in the cache area is completed or canceled and the product to be cached; and moving the product information in the cache area to be completed or canceled and the product to be cached out of the cache area.

[0148] In an exemplary embodiment, when the processor executes the computer program, the following steps are further implemented: the picking times of each type of goods required for the outbound order are used as the picking times of each type of goods.

[0149] In an exemplary embodiment, the processor also implements the following steps when executing the computer program: obtaining various types of goods and their quantities required for the orders to be shipped; obtaining parameters of containers in the warehouse; determining the number of containers required for the orders to be shipped and the goods to be shipped in each container based on the various types of goods and their quantities required for the orders to be shipped and the parameters of the containers; selecting the first shelf in the cache area that contains the most free storage locations; when the number of containers is less than or equal to the number of free storage locations contained in the first shelf, caching the goods to be shipped in each container into the free storage locations of the first shelf.

[0150] In an exemplary embodiment, the processor also implements the following steps when executing the computer program: when the number of containers is greater than the number of free storage locations contained in the first shelf, obtain the difference between the number of containers and the number of free storage locations contained in the first shelf; determine the second shelf in the cache area whose number of free storage locations is greater than or equal to the difference, and select the third shelf containing the least free storage locations from the second shelf; cache the goods to be shipped out in each container in the free storage locations of the first shelf and the third shelf.

[0151] In an exemplary embodiment, when the processor executes the computer program, it also implements the following steps: obtaining the number of cargo transportation equipment to be shipped out of the warehouse, and obtaining the number of shipping ports; when the number of cargo transportation equipment is greater than the number of shipping ports, based on the difference between the number of cargo transportation equipment and the number of shipping ports, caching the cargo transportation equipment whose number is equal to the difference into the cache area.

[0152] In an exemplary embodiment, a computer readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

[0153] Determine a candidate shelf in the warehouse that meets a caching condition, wherein the caching condition includes that the depth of the candidate shelf is less than or equal to a depth threshold;

[0154] According to the distance between the candidate shelf and the exit, the candidate shelf whose distance is less than or equal to the distance threshold is selected as the target shelf;

[0155] The storage locations contained in the target shelf are used as the cache area of ​​the warehouse, where the cache area is used to cache the goods.

[0156] In the above-mentioned computer-readable storage medium, by selecting a shelf with a smaller depth and close to the delivery port as the cache area in the warehouse, it is beneficial for the goods to be quickly taken out of the shelf on the one hand, and it is beneficial for the goods to quickly reach the delivery port on the other hand, thereby improving the delivery efficiency of the goods.

[0157] In an exemplary embodiment, when the computer program is executed by the processor, the following steps are also implemented: determining the goods to be cached according to the number of picking times of each type of goods; determining the containers to be cached from the containers containing the goods to be cached; and caching the containers to be cached into the free storage locations in the cache area.

[0158] In an exemplary embodiment, when the computer program is executed by the processor, the following steps are also implemented: according to the quantity of goods to be cached in each container, a container whose quantity of goods to be cached is less than a quantity threshold is selected as a container to be cached.

[0159] In an exemplary embodiment, when the computer program is executed by the processor, the following steps are also implemented: determining the goods to be cached according to the number of picking times of each type of goods and the number of containers required for each type of goods to be shipped out of the warehouse.

[0160] In an exemplary embodiment, when the computer program is executed by the processor, the following steps are also implemented: determining the ratio of the number of picking times for each type of goods to the number of containers required for each type of goods to be shipped out; determining the type of goods to be cached based on the ratio and the ratio threshold; determining the goods to be cached based on the type of goods to be cached, wherein the ratio threshold is equal to or greater than 2.

[0161] In an exemplary embodiment, when the computer program is executed by the processor, the following steps are also implemented: determining the candidate product types whose ratios are greater than a ratio threshold; arranging the candidate product types in descending order according to the size of the ratios, and using the first m candidate product types in the order as the product types to be cached; m is the smaller value between the number of candidate product types and the number of free storage locations in the cache area.

[0162] In an exemplary embodiment, when the computer program is executed by the processor, the following steps are also implemented: obtaining various types of goods and their quantities required for the orders to be shipped; and determining the number of picking times for each type of goods based on the various types of goods and their quantities required for the orders to be shipped.

[0163] In an exemplary embodiment, when the computer program is executed by the processor, the following steps are also implemented: based on the types of goods and their quantities required for the orders to be shipped out, as well as the goods in each container and their quantities, the number of picking times for each type of goods and the number of containers required for shipping out each type of goods are determined.

[0164] In an exemplary embodiment, when the computer program is executed by the processor, the following steps are also implemented: receiving a product update message of an order to be shipped out, determining that the product information in the cache area is completed or canceled and the product to be cached; and moving the product information in the cache area to be completed or canceled out of the cache area.

[0165] In an exemplary embodiment, when the computer program is executed by the processor, the following steps are further implemented: the picking times of each type of goods required for the outbound order are used as the picking times of each type of goods.

[0166] In an exemplary embodiment, when the computer program is executed by the processor, the following steps are also implemented: obtaining various types of goods and their quantities required for the orders to be shipped; obtaining parameters of containers in the warehouse; determining the number of containers required for the orders to be shipped and the goods to be shipped in each container based on the various types of goods and their quantities required for the orders to be shipped and the parameters of the containers; selecting the first shelf in the cache area that contains the most free storage locations; when the number of containers is less than or equal to the number of free storage locations contained in the first shelf, caching the goods to be shipped in each container into the free storage locations of the first shelf.

[0167] In an exemplary embodiment, when the computer program is executed by the processor, the following steps are also implemented: when the number of containers is greater than the number of free storage locations contained in the first shelf, the difference between the number of containers and the number of free storage locations contained in the first shelf is obtained; a second shelf in the cache area having a number of free storage locations greater than or equal to the difference is determined, and a third shelf containing the least free storage locations is selected from the second shelf; and the goods to be shipped out in each container are cached in the free storage locations of the first shelf and the third shelf.

[0168] In an exemplary embodiment, when the computer program is executed by the processor, the following steps are also implemented: obtaining the number of cargo transport equipment to be shipped out of the warehouse, and obtaining the number of shipping ports; when the number of cargo transport equipment is greater than the number of shipping ports, based on the difference between the number of cargo transport equipment and the number of shipping ports, caching the cargo transport equipment whose number is equal to the difference into the cache area.

[0169] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory or optical memory, etc. Volatile memory can include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM).

[0170] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0171] The above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the attached claims.

Claims

1. A storage resource scheduling method, characterized in that: The method comprises: Determine a candidate shelf in the warehouse that meets a caching condition, wherein the caching condition includes that the depth of the candidate shelf is less than or equal to a depth threshold; According to the distance between the candidate shelf and the warehouse exit, a candidate shelf whose distance is less than or equal to a distance threshold is selected as a target shelf; The storage location included in the target shelf is used as a buffer area of ​​the warehouse, wherein the buffer area is used to buffer goods; Obtain the various types of goods and quantities required for the outbound orders; Obtaining parameters of containers in the warehouse; Determine the number of containers required for the order to be shipped and the goods to be shipped in each container according to the types of goods and their quantities required for the order to be shipped and the parameters of the container; Selecting the first shelf in the buffer area that contains the most free storage locations; When the number of the containers is less than or equal to the number of free storage spaces included in the first shelf, the goods to be shipped out in each container are cached in the free storage spaces of the first shelf.

2. The method according to claim 1, characterized in that The method further comprises: Determine the goods to be cached based on the number of times each type of goods is picked; Determine a container to be cached from the containers containing the goods to be cached; The container to be cached is cached in an idle storage location in the cache area.

3. The method according to claim 2, characterized in that The step of determining a container to be cached from containers containing the goods to be cached comprises: According to the quantity of the to-be-cached goods in each container, a container whose quantity of the to-be-cached goods is less than a quantity threshold is selected as the to-be-cached container.

4. The method according to claim 2, characterized in that: The method of determining the goods to be cached according to the picking times of each type of goods includes: The goods to be cached are determined based on the number of times each type of goods is picked and the number of containers required for each type of goods to be shipped out.

5. The method according to claim 4, characterized in that The method of determining the goods to be cached according to the number of picking times of each type of goods and the number of containers required for each type of goods to be shipped out of the warehouse includes: Determine the ratio of the number of picking times for each type of goods to the number of containers required for the shipment of each type of goods; Determine the type of goods to be cached according to the ratio and the ratio threshold, wherein the ratio threshold is equal to or greater than 2; The goods to be cached are determined according to the type of the goods to be cached.

6. The method according to claim 5, characterized in that Determining the type of goods to be cached according to the ratio and the ratio threshold includes: Determine the candidate product type whose ratio is greater than the ratio threshold; According to the size of the ratio, the candidate product types are arranged in descending order, and the first m candidate product types in the order are used as the product types to be cached; m is the smaller value between the number of the candidate product types and the number of free storage locations in the cache area.

7. The method according to any one of claims 2 to 6, characterized in that: The method further comprises: Obtain the various types of goods and quantities required for the outbound orders; The picking times of each type of goods are determined according to the types of goods and quantities required by the outbound order.

8. The method according to claim 7, characterized in that Determining the picking times of each type of goods according to the types of goods and quantities required by the to-be-shipped order includes: According to the various types of goods and their quantities required for the order to be shipped, as well as the goods in each container and their quantities, the picking times of the various types of goods and the quantity of containers required for shipping the various types of goods are determined.

9. The method according to claim 8, characterized in that The method further comprises: Receive a product update message of the order to be shipped, and determine that the product information in the cache area is the completed or cancelled product to be cached; The to-be-cached goods whose product information in the cache area is completed or cancelled are moved out of the cache area.

10. The method according to any one of claims 2 to 6, characterized in that: The method further comprises: The number of picking times required for each type of goods in the outbound order is used as the number of picking times for each type of goods.

11. The method according to claim 1, characterized in that: The method further comprises: When the number of the containers is greater than the number of free storage locations included in the first shelf, obtaining a difference between the number of the containers and the number of free storage locations included in the first shelf; Determine a second shelf in the buffer area that has a number of free storage locations that is greater than or equal to the difference, and select a third shelf in the second shelf that has the least free storage locations; The goods to be shipped out of the containers are cached in the free storage spaces of the first shelf and the third shelf.

12. The method according to claim 1, characterized in that The method further comprises: Obtain the number of cargo transport equipment to be shipped out of the warehouse, and obtain the number of shipping ports; When the number of the cargo transportation equipment is greater than the number of the warehouse exits, cargo transportation equipment whose number is equal to the difference between the number of the cargo transportation equipment and the number of the warehouse exits is cached in the cache area.

13. The method according to claim 1, characterized in that The candidate shelves include shelves with a depth of 1, or shelves with a depth of 2 and openings on both sides.

14. A storage resource scheduling device, characterized in that: The device comprises: A candidate shelf determination module, used to determine a candidate shelf in the warehouse that meets a cache condition, wherein the cache condition includes that the depth of the candidate shelf is less than or equal to a depth threshold; A target shelf determination module is used to select a candidate shelf whose distance is less than or equal to a distance threshold as a target shelf according to the distance between the candidate shelf and the warehouse exit; A buffer area determination module, used to use the storage location included in the target shelf as the buffer area of ​​the warehouse, wherein the buffer area is used to cache goods; The order information acquisition module is used to obtain the various types of goods and their quantities required for the outbound orders; The container parameter acquisition module is used to obtain the parameters of the container in the warehouse; An order processing module, used to determine the number of containers required for the order to be shipped and the goods to be shipped in each container according to the types of goods and their quantities and parameters of the containers required for the order to be shipped; The first shelf selection module is used to select the first shelf containing the most free storage locations in the buffer area; The cache module is used to cache the goods to be shipped out in each container into the free storage locations of the first shelf when the number of containers is less than or equal to the number of free storage locations included in the first shelf.

15. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 13 are implemented.

16. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 13 are implemented.

Images