Goods allocation method and device, electronic equipment and storage medium

Abstract

The invention provides a goods allocation method and device, electronic equipment and a storage medium, and relates to the technical field of intelligent storage. According to the specific implementation scheme, the method comprises the steps of obtaining goods allocation information of each goods allocation in the warehousing system; according to the goods allocation information of each goods allocation and the size information of the to-be-warehoused container, determining a plurality of candidate goods allocations corresponding to the to-be-warehoused container; and based on the to-be-warehoused container and the goods allocation information of each candidate goods allocation, determining a target goods allocation for storing the to-be-warehoused container in the plurality of candidate goods allocations. According to the technical scheme, the condition of the to-be-warehoused container and the goods allocation information of each goods allocation in the warehousing system can be comprehensively considered, a multi-dimensional goods allocation screening mechanism is established, the goods allocation finally allocated to the to-be-warehoused container is screened and determined step by step and hierarchically, the defects of a traditional goods allocation mode can be effectively overcome, and the goods allocation efficiency is improved. Optimal allocation of goods allocation resources is achieved, the storage space utilization rate and the goods storing and taking efficiency are improved, and the method is particularly suitable for storage systems with terrain limitation or diversified goods allocation specifications.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of intelligent warehousing, and in particular to a storage location allocation method and device, an electronic device, and a storage medium. BACKGROUND

[0002] In a traditional warehouse storage scheme, the storage locations in a warehousing system are often uniformly designed. With the increase in supply demand, maximizing the utilization rate of warehouse space has become an important concern for enterprises. However, to improve the utilization rate of warehouse space, it is inevitable to arrange the warehouse and the storage locations in accordance with the actual topography, and thus irregular storage location arrangement may occur in some areas. Such irregular storage location arrangement also poses a challenge to the orderly management of storage locations in automated warehousing. SUMMARY

[0003] Embodiments of the present application provide a storage location allocation method and device, an electronic device, and a storage medium to orderly manage irregularly arranged storage locations in a warehouse.

[0004] In a first aspect, embodiments of the present application provide a storage location allocation method, including:

[0005] Obtaining storage location information of each storage location in a warehousing system, the storage location information including a storage state of the storage location and size information of the storage location;

[0006] Determining, according to the storage location information of each storage location and size information of a container to be stored, a plurality of candidate storage locations corresponding to the container to be stored; wherein the storage state of each candidate storage location is an idle state or a to-be-released state, and the size information of each candidate storage location is greater than or equal to the size information of the container to be stored;

[0007] Determining, based on the storage location information of the container to be stored and each candidate storage location, a target storage location for storing the container to be stored from the plurality of candidate storage locations.

[0008] In some embodiments, determining, based on the storage location information of the container to be stored and each candidate storage location, a target storage location for storing the container to be stored from the plurality of candidate storage locations, includes:

[0009] Determining a size difference between the size information of each candidate storage location and the size information of the container to be stored;

[0010] Determining, based on the size difference corresponding to each candidate storage location, a target storage location matching the number of the container to be stored from the plurality of candidate storage locations.

[0011] In some embodiments, determining, based on the size difference corresponding to each candidate storage location, a target storage location matching the number of the container to be stored from the plurality of candidate storage locations, includes:

[0012] determine, from the plurality of candidate storage locations, a first candidate storage location, wherein the first candidate storage location is determined based on size information of the first candidate storage location matching size information of the to-be-stored container;

[0013] If the number of the first candidate storage locations is greater than or equal to the number of the to-be-stored containers, determine a target storage location from the first candidate storage locations, wherein the target storage location is determined based on the number of the target storage location matching the number of the to-be-stored containers.

[0014] In some embodiments, the target storage location is determined from the plurality of candidate storage locations based on a size difference corresponding to each candidate storage location, and the method further comprises:

[0015] If the number of the first candidate storage locations is less than the number of the to-be-stored containers, determine a number difference between the number of the first candidate storage locations and the number of the to-be-stored containers;

[0016] determine a second candidate storage location from the candidate storage locations other than the first candidate storage location, and determine the first candidate storage location and the second candidate storage location as the target storage location, wherein the number of the second candidate storage location is equal to the number difference, and a size difference corresponding to the target storage location is less than or equal to a size difference corresponding to a non-target storage location from the plurality of candidate storage locations.

[0017] In some embodiments, the storage location information further comprises location information of the storage location in the warehouse system, and the target storage location is determined from the plurality of candidate storage locations based on the size difference corresponding to each candidate storage location, and the method further comprises:

[0018] In a case where the to-be-stored container comprises a plurality of containers that need to be stored in a centralized manner, the priority of each candidate storage location is determined based on the size difference corresponding to each candidate storage location, wherein the size difference corresponding to a candidate storage location with a high priority is less than the size difference corresponding to a candidate storage location with a low priority.

[0019] The target storage location is determined from the plurality of candidate storage locations based on the priority and the location information of each candidate storage location.

[0020] In some embodiments, the target storage location is determined from the plurality of candidate storage locations based on the priority and the location information of each candidate storage location, and the method further comprises:

[0021] construct a target set based on the candidate storage locations with a priority higher than the i-th priority and the candidate storage locations with a priority equal to the i-th priority, wherein i is an integer greater than or equal to 1;

[0022] determine whether a target subset exists in the target set according to the location information of each candidate storage location in the target set, wherein the number of the candidate storage locations in the target subset is greater than or equal to the number of the to-be-stored containers, and the candidate storage locations in the target subset are located in the same aisle or the same area.

[0023] In a case where the target subset exists in the target set, a target location matching the number of the to-be-warehoused containers is determined in the target subset;

[0024] In a case where the target subset does not exist in the target set, a new target set is constructed based on the candidate locations with a priority higher than the i+1 priority and the candidate locations with a priority equal to the i+1 priority, and a target subset is determined in the new target set.

[0025] In some embodiments, determining the target locations matching the number of the to-be-warehoused containers in the target subset comprises:

[0026] In a case where the number of the target subsets is one, a target location matching the number of the to-be-warehoused containers is determined in the target subset, wherein the priority of each target location is higher than or equal to the priority of a non-target location in the target subset.

[0027] In some embodiments, determining the target locations matching the number of the to-be-warehoused containers in the target subset comprises:

[0028] In a case where the number of the target subsets is multiple, an optimal location combination of the to-be-warehoused containers is respectively determined in each target subset, wherein the optimal location combination is a location combination containing candidate locations matching the number of the to-be-warehoused containers and having the highest average priority of the contained candidate locations;

[0029] An optimal location combination having the highest average priority is determined in the optimal location combinations corresponding to the target subsets, and the candidate locations in the optimal location combination are determined as the target locations.

[0030] In some embodiments, the location information further comprises a pick-and-place cost of the location, and the method further comprises: obtaining a historical warehousing and de-warehousing frequency of a type of goods in the to-be-warehoused containers in the warehousing system;

[0031] Based on the size difference corresponding to each candidate location, a target location matching the number of the to-be-warehoused containers is determined in the multiple candidate locations, comprising:

[0032] In a case where the historical warehousing and de-warehousing frequency is higher than a preset frequency, a matching degree of each candidate location with the to-be-warehoused containers is calculated based on the pick-and-place cost of each candidate location and the size difference corresponding to each candidate location;

[0033] According to the matching degree of each candidate location with the to-be-warehoused containers, a target location matching the number of the to-be-warehoused containers is determined in the multiple candidate locations, wherein the matching degree corresponding to each target location is higher than or equal to the matching degree corresponding to a non-target location in each candidate location.

[0034] In some embodiments, calculating the matching degree of each candidate location with the to-be-warehoused containers based on the pick-and-place cost of each candidate location and the size difference corresponding to each candidate location comprises:

[0035] P = S1 / k + S2 / L

[0036] Where P represents the matching degree between the candidate storage location and the container to be stored, S1 and S2 are the first preset weight and the second preset weight, respectively, k represents the picking and placing cost of the candidate storage location, and L represents the size difference corresponding to the candidate storage location.

[0037] In some embodiments, the storage location information further includes the type of goods that can be stored, and determines multiple candidate storage locations corresponding to the container to be stored based on the storage location information of each storage location and the size information of the container to be stored, including:

[0038] Based on the size information and storage status of each storage location, identify multiple available storage locations in each storage location whose size information is greater than or equal to the size information of the container to be stored. Among these available storage locations, there are vacant storage locations and / or storage locations to be released.

[0039] Based on the storable goods types of each available storage location and the goods stored in the container to be received, multiple candidate storage locations for the container to be received are determined in each available storage location, wherein the storable goods types of the candidate storage locations include the goods types stored in the container to be received.

[0040] In some embodiments, after determining a target storage location for storing the container to be received from a plurality of candidate storage locations, the method further includes:

[0041] Update the storage status of each target storage location to non-idle;

[0042] Based on the goods stored in the containers to be received, update the types of goods that can be stored in other available locations in the same aisle or area as each target location.

[0043] Secondly, embodiments of this application provide a cargo location allocation device, comprising:

[0044] The information acquisition module is used to acquire the location information of each storage location in the warehousing system. The location information includes the storage status and size information of the storage location.

[0045] The first determining module is used to determine multiple candidate storage locations corresponding to the container to be stored based on the storage location information of each storage location and the size information of the container to be stored; wherein, the storage status of the candidate storage location is either idle or pending release, and the size information of the candidate storage location is greater than or equal to the size information of the container to be stored.

[0046] The second determining module is used to determine the target storage location for storing the container to be stored from multiple candidate storage locations based on the storage location information of the container to be stored and each candidate storage location. It is used to obtain the storage location information of each storage location in the warehousing system, including the storage status and size information of the storage location.

[0047] In a third aspect, an electronic device is provided, which includes a memory, a processor, and a computer program stored in the memory. The processor implements the method of any of the embodiments of the present application when executing the computer program.

[0048] In a fourth aspect, a computer readable storage medium is provided, which stores a computer program. The computer program is executed by a processor to implement the method of any of the embodiments of the present application.

[0049] In a fifth aspect, a computer program product is provided, which includes a computer program. The computer program is executed by a processor to implement the method of any of the implementations of the first aspect.

[0050] Based on the method of the embodiments of the present application, the situation of the container to be stored in the warehouse and the location information of each location in the warehouse system can be comprehensively considered, a multi-dimensional location screening mechanism is established, and the location finally allocated to the container to be stored in the warehouse is screened and determined step by step and hierarchically. The method can effectively solve the shortcomings of the traditional location allocation method, realize the optimal allocation of location resources, improve the utilization rate of warehouse space and the efficiency of goods storage and retrieval, and is especially suitable for the warehouse system with terrain restrictions or diversified location specifications.

[0051] The above description is only a summary of the technical solutions of the present application. In order to more clearly understand the technical means of the present application, the embodiments can be implemented in accordance with the content of the description, and in order to make the above and other purposes, characteristics and advantages of the present application more obvious and easy to understand, the specific embodiments of the present application are described below. BRIEF DESCRIPTION OF DRAWINGS

[0052] The accompanying drawings are used to better understand the present application and do not constitute a limitation of the present application. Among them:

[0053] Figure 1 is a schematic diagram of a warehouse system provided by an exemplary embodiment of the present application;

[0054] Figure 2A is a schematic diagram of a storage area provided by an exemplary embodiment of the present application;

[0055] Figure 2B is a schematic diagram of another storage area provided by an exemplary embodiment of the present application;

[0056] Figure 3A is a schematic diagram of a location arrangement provided by an exemplary embodiment of the present application;

[0057] Figure 3B is a schematic diagram of another location arrangement provided by an exemplary embodiment of the present application;

[0058] Figure 4is a flowchart of a method for allocating a storage location according to an example embodiment of the present application Figure 1 ;

[0059] Figure 5 is a flowchart of a method for allocating a storage location according to an example embodiment of the present application

[0060] Figure 6 is a flowchart of a method for allocating a storage location according to an example embodiment of the present application

[0061] Figure 7 is a logic diagram of a method for allocating a storage location according to an example embodiment of the present application

[0062] Figure 8 is a schematic diagram of a device for allocating a storage location according to an example embodiment of the present application

[0063] Figure 9 is a schematic diagram of an internal structure of an electronic device according to an example embodiment of the present application DETAILED DESCRIPTION

[0064] In the following, only certain example embodiments are simply described. As those skilled in the art can recognize, the described embodiments can be modified in various different ways without departing from the concept or scope of the present application. Therefore, the drawings and the description are considered to be exemplary in nature, rather than limiting.

[0065] For the purpose of understanding the technical solutions of the embodiments of the present application, the related technologies of the embodiments of the present application are described below. The following related technologies can be combined with the technical solutions of the embodiments of the present application in any manner as optional solutions, which all belong to the protection scope of the embodiments of the present application.

[0066] Application Scenarios

[0067] Figure 1 is a schematic diagram of a warehouse system according to an example embodiment of the present application

[0068] In some embodiments, as shown in Figure 1 the warehouse system 100 includes an inventory area 10, a control device 110, a plurality of first handling devices 120, a plurality of second handling devices 130, and at least one workstation 140. It should be noted that, Figure 1 is a top view of the inventory area 10.

[0069] In some examples, the first handling device 120, the second handling device 130, and the work station 140 can communicate with the control device 110 through a network, respectively. For example, the control device can be connected with the first handling device 120, the second handling device 130, and the work station 140 through a Local Area Network (LAN), a Wireless Local Area Network (WLAN), and other networks.

[0070] In some embodiments, the control device can be a server or a terminal device, or a device deployed with a Warehouse Management System (WMS) and a Robot Management System (RMS). The terminal device can include at least one of a personal computer, a notebook computer, a smart phone, a tablet computer, and a portable wearable device, and the server can include a stand-alone server or a server cluster composed of multiple servers, which are not limited in the embodiments of the present application.

[0071] In some embodiments, the inventory area 10 includes a plurality of carriers 11, which can be placed in a preset arrangement manner. For example, the plurality of carriers 11 can be arranged in a single-column multi-row manner, and a passage formed between two adjacent carriers 11 can be referred to as a lane.

[0072] Exemplarily, the carrier 11 includes, but is not limited to, a partitioned shelf, a box support, a pallet support, and the like, and the carrier 11 can have one or more storage locations. Each storage location can carry at least one container. Based on different types of carriers 11, the containers carried on the storage locations of the carriers 11 include, but are not limited to, a tote, a box, a case, a pallet, a package, a cage, and the like. A storage location without a container can be regarded as an idle storage location, and a storage location with a container can be regarded as a non-idle storage location.

[0073] Exemplarily, the first handling device 120 and the second handling device 130 can be handling robots. The first handling device 120 is configured to move between the inventory area 10 and the work station 140, and the second handling device 130 is configured to move within the inventory area 10.

[0074] In some embodiments, the workstation 140 can be an inbound station, which can receive, inspect and information input, etc. the goods in the to-be-inbound container, and then determine a target storage location for storing the to-be-inbound container in the empty storage location of the storage area 10, and send the position information of the target storage location to the first and second carrying devices 120 and 130 for carrying the to-be-inbound container. The first and second carrying devices 120 and 130 can cooperate with each other to carry the to-be-inbound container from the workstation 140 to the position of the target storage location in the storage area 10, so as to store the to-be-inbound container in the target storage location.

[0075] Figure 2A is a schematic diagram of a storage area provided by an exemplary embodiment of the present application.

[0076] In some embodiments, as shown in Figure 2A each carrier 11 in the storage area can include multiple layers of crossbeams, and each layer of crossbeams can be provided with multiple storage locations 12 for placing containers 13 for storing goods.

[0077] Exemplarily, the first carrying device 120 can be a carrying robot, which can move in the storage area 10 and between the storage area 10 and the workstation 140. The second carrying device 130 can be a box robot, which can move in the storage area 10. The second carrying device 130 is provided with a container taking and placing device 14, which can move up and down in the vertical direction, and can take and place the container 13 on the carrier 11 through the telescopic fork, suction cup, etc. structure therein.

[0078] Exemplarily, after receiving the position information of the storage location, the first carrying device 120 can carry the to-be-inbound container from the workstation 140 to the temporary storage area (generally the bottom layer area of the carrier 11, not specifically shown in the figure) of the corresponding aisle in the storage area 10, and then the second carrying device 130 can take out the to-be-inbound container in the temporary storage area through the container taking and placing device 14, and carry the container to the storage location allocated for the to-be-inbound container in the carrier 11 through the horizontal movement of the second carrying device 130 and / or the vertical movement of the container taking and placing device 14, to complete the inbound operation of the to-be-inbound container.

[0079] Figure 2B is a schematic diagram of another storage area provided by an exemplary embodiment of the present application.

[0080] Exemplarily, as shown in Figure 2BAs shown, the carriers 11 in the inventory area 10 can be tray racks, which include a plurality of storage layers 31, and each storage layer 31 can be provided with a plurality of storage locations 32, which can be used to place a tray 33, and the tray 33 can be used to place goods. The inventory area 10 can further include a docking conveyor line 34 and an elevator 35, and each storage layer 31 in the carrier 11 can run a four-way shuttle (not shown in the figure).

[0081] In combination Figure 1 and Figure 2B , the second handling device 130 configured to move in the inventory area 10 can place the to-be-stored container (the tray 33 carrying the goods) on the docking conveyor line 34, transport the to-be-stored container to the elevator 35 through the docking conveyor line 34, and the elevator 35 carries the to-be-stored container to the storage layer 31 where the target storage location is located, and finally carries the to-be-stored container to the target storage location through the four-way shuttle running on the storage layer 31, thereby completing the storage of the to-be-stored container.

[0082] In a conventional warehouse storage scheme, it is generally ensured that the storage locations in the same aisle or the same area in the inventory area have consistent specifications, or at least that each layer of storage locations has consistent specifications. However, in actual scenarios, due to the environmental and topographical limitations of the warehouse system, the design of storage locations with the same specifications will cause a certain degree of waste of storage space.

[0083] Figure 3A is a schematic diagram of a storage location arrangement provided by an example embodiment of the present application, as shown in Figure 3A The first to fifth layers of the carrier are each arranged with 9 storage locations with a height of Z1, while the sixth layer (the topmost layer) has a local low-height condition at the top of the region, and the available heights on both sides are less than Z1, which causes the two sides to be unable to arrange storage locations with a height of Z1, and only 5 storage locations are arranged on the topmost layer. Therefore, Figure 3A The arrangement of goods in

[0084] Therefore, in combination with the topographical limitations of the inventory area, in order to more fully utilize the storage space in the inventory area, Figure 3B is another schematic diagram of a storage location arrangement provided by an example embodiment of the present application, as shown in Figure 3B The first to fifth layers of the right carrier are arranged with 9 storage locations with a height of Z1, which is consistent with the arrangement in Figure 3A , and the sixth layer is arranged with 4 storage locations with a height of Z1 at positions that support a height of Z1, and 3 storage locations with a height less than Z1 (indicated by Zn in the figure) at other positions.

[0085] Figure 3BThe six-layer cargo layout of the left-side vehicle differs from that of the right-side vehicle. By setting the height limit of the first to third layers to Z1 and the height limit of the third to sixth layers to Z2, and combining the height limit of the seventh layer with the limit of the top structure of the area to arrange cargo spaces of height Zn, a seven-layer cargo layout is formed with the same total height as the right-side vehicle. In the third layer, the storage space is also limited by special structures such as fire pipes, so that both Z1 and Z2 height cargo spaces exist in the same layer.

[0086] It should be noted that, Figure 3A and Figure 3B The example only shows the difference in storage location specifications using storage location height as an example. However, in actual application scenarios, considering the limitations of the warehousing environment and the specific vertical storage plan, there may be more differences in the specifications of storage locations in the same aisle in the storage area. This application does not impose any restrictions on this.

[0087] Traditional automated storage and retrieval systems (AS / RS) allow for standardized management of storage locations based on the regularity of their specifications, allowing for unified management of locations according to the vehicle or aisle. However, when storage location specifications differ, this unified management approach struggles to accurately adapt to different specifications, potentially leading to reduced storage utilization or inefficient storage.

[0088] Based on this, in order to achieve refined allocation of storage locations of different specifications, thereby improving the utilization rate of storage locations and the efficiency of goods storage and retrieval in complex warehousing environments, this application proposes a storage location allocation method. By uniformly managing the storage availability of each storage location through storage location information, and considering multiple dimensions such as storage status, size information, priority, retrieval cost, and types of goods that can be stored, the method filters and determines the storage locations to be allocated to containers waiting to be stored in a step-by-step and hierarchical manner. This method can effectively solve the shortcomings of traditional storage location allocation methods, achieve optimized allocation of storage location resources, improve the utilization rate of warehousing space and the efficiency of goods storage and retrieval, and is especially suitable for warehousing systems with terrain limitations or diverse storage location specifications.

[0089] Exemplary Methods

[0090] Figure 4 This is a schematic flowchart of a storage location allocation method provided in an exemplary embodiment of this application. This embodiment can be applied to electronic devices and... Figure 1 In the warehousing system, such as Figure 4 As shown, in some embodiments, the storage location allocation method provided in this application includes steps S410-S430:

[0091] Step S410: Obtain the location information of each storage location in the warehousing system. The location information includes the storage status and size information of the storage location.

[0092] Exemplarily, the system can store the storage space information of each storage space, and the storage space information of each storage space can include storage state and size information. The size information of the storage space can include length, width, height, etc. that the storage space can accommodate, to help the system determine whether the storage space is sufficient to accommodate the to-be-stored container, so as to select the available storage space for the to-be-stored container. The storage state of the storage space can be divided into an idle state, a to-be-released state, and a non-idle state. The storage space in the idle state can be a storage space that is currently not storing a container and is not assigned a to-be-stored container. The storage space in the to-be-released state can be a storage space that is currently storing a to-be-picked container. The storage space in the non-idle state can include a storage space that is currently storing a non-to-be-picked container and a storage space that is currently not storing a container but is assigned a to-be-stored container. The to-be-stored container can be a container that has not been stored in the assigned storage space, including a container waiting to be stored and a container in the process of being stored. The to-be-picked container can be understood as a container that has been selected by a picking task but has not been removed from the storage space.

[0093] It can be understood that the storage state of the storage space in the warehouse system is dynamically changing. Since the storage and picking of the container require a certain execution time, even if the storage space is assigned a to-be-stored container or the container stored in the storage space is selected for picking, the storage space can not be immediately occupied or released. If the candidate storage space is selected based on whether the storage space stores a container, the selection result of the candidate storage space can not match the actual available storage space, affecting the accuracy and timeliness of the storage space allocation. Therefore, the storage state of the storage space is more specifically divided into the idle state, the to-be-released state, and the non-idle state in the storage space information, which can help the system timely grasp the actual available state of the storage space, ensure that the basic data for selecting the candidate storage space is real and reliable, and realize the reasonable allocation of the storage space resource.

[0094] In some embodiments, the storage space information can further include location information of the storage space in the warehouse system. The location information can be embodied in the form of a lane or a carrier to which the storage space belongs, so that after the storage space is assigned for the to-be-stored container, the location information of the storage space can be sent to the handling device, to facilitate the handling device to store the to-be-stored container in the storage area corresponding to the assigned storage space. The location information of the storage space can also be embodied in the form of three-dimensional coordinates of the storage space in the warehouse map, to facilitate the handling device in the storage area to store the to-be-stored container in the assigned storage space after the storage space is assigned for the to-be-stored container, and to realize the accurate storage of the to-be-stored container.

[0095] In some embodiments, the system can update the storage information of the involved storage locations in real time based on the real-time update of the out-of-storage status of the stored containers and the storage location allocation status of the in-storage containers, so that the system can grasp the actual available status of the storage locations in the storage area in real time. In this case, the system can also recommend storage locations according to the distribution of available storage locations in the warehouse system, for example, preferentially recommend storage locations in the storage area with a high proportion of idle storage locations and to-be-released storage locations, in order to avoid excessive concentration of storage locations in a certain storage area, which may lead to congestion of the handling path during subsequent storage and retrieval, and improve the smoothness of the overall warehouse operation. For another example, in the intelligent warehouse scenario, the system can recommend storage locations according to the operation status of the handling robots in the storage area, so as to avoid allocating in-storage containers to the intensive operation area of the handling robots as much as possible, so as to reduce the conflict and waiting time between robots and improve the overall handling efficiency.

[0096] Therefore, the storage location information of each storage location in the warehouse system obtained in step S410 can include the process of calling and obtaining the stored storage location information, or the process of obtaining the recommended storage location information based on the distribution of available storage locations in the storage area and the operation status of the robots in the storage area, so that the system can guide the storage location allocation by recommending the storage locations before actually allocating the storage locations for the in-storage containers, thereby reducing the calculation amount during the subsequent allocation of the storage locations for the in-storage containers and improving the efficiency of the storage location allocation.

[0097] In step S420, a plurality of candidate storage locations corresponding to the in-storage container are determined according to the storage location information of each storage location and the size information of the in-storage container; wherein the storage state of the candidate storage location is an idle state or a to-be-released state, and the size information of the candidate storage location is greater than or equal to the size information of the in-storage container.

[0098] For example, when the in-storage container needs to be allocated a storage location, for each storage location whose storage location information is obtained in step S410, it is first determined whether the storage location is an actually available storage location according to the storage state of the storage location, for example, the storage locations with a non-idle state are filtered out according to the storage state of each storage location. For the storage locations with an idle state or a to-be-released state, the size information (including length, width, and height) of the storage location is compared with the size information of the in-storage container one by one. Only when the length, width, and height of the storage location are all greater than or equal to the corresponding size of the in-storage container, the storage location is preliminarily determined as a candidate storage location for the in-storage container. In this way, a plurality of candidate storage locations that meet the basic storage conditions are screened out.

[0099] In some embodiments, the storable goods type can also be predefined for the goods locations in different areas. In step S420, the multiple candidate goods locations corresponding to the to-be-warehoused container are determined according to the goods location information of each goods location and the size information of the to-be-warehoused container, including: determining, according to the size information and the storage state of each goods location, multiple available goods locations in each goods location whose size information is greater than or equal to the size information of the to-be-warehoused container, the available goods locations including idle goods locations and / or to-be-released goods locations; determining, based on the storable goods type of each available goods location and the goods stored in the to-be-warehoused container, multiple candidate goods locations of the to-be-warehoused container in each available goods location, wherein the storable goods type of the candidate goods location contains the type of the goods stored in the to-be-warehoused container.

[0100] For example, the storage area is divided into refrigeration area, normal temperature area, fragile goods area, etc., and the goods locations in each area are only allowed to store goods of the corresponding type. At this time, when screening the candidate goods locations, in addition to considering the storage state and the size information, it is also necessary to judge whether the storable goods type of the goods location matches the type of the goods in the to-be-warehoused container. In the case where the storage state and the size information both meet the requirements, only the goods location whose storable goods type matches the type of the goods in the to-be-warehoused container can be included in the range of candidate goods locations. In this way, the rationality and safety of goods location allocation can be further improved, and the quality risk or management confusion that may be caused by the mixed storage of different types of goods can be avoided. For example, for medicines that need to be stored at low temperature, they can only be allocated to the goods locations in the refrigeration area, but not to the goods locations in the normal temperature area, even if the size and the storage state of the goods locations in the normal temperature area both meet the requirements.

[0101] The embodiment introduces the storable goods type as a screening dimension, so that the screening of the candidate goods locations is more accurate and meets the needs of actual warehouse management.

[0102] In step S430, the target goods location for storing the to-be-warehoused container is determined from the multiple candidate goods locations based on the goods location information of the to-be-warehoused container and each candidate goods location.

[0103] For example, the target goods location for storing the to-be-warehoused container is determined from the multiple candidate goods locations based on the goods location information of the to-be-warehoused container and each candidate goods location, including: determining the size difference between the size information of each candidate goods location and the size information of the to-be-warehoused container; and determining, based on the size difference corresponding to each candidate goods location, the target goods location that matches the quantity of the to-be-warehoused container from the multiple candidate goods locations.

[0104] In some embodiments, in consideration of fully utilizing storage space and avoiding waste of storage resources, for the to-be-warehoused containers without additional storage requirements, a candidate storage location with a smaller size difference from the to-be-warehoused container should be preferentially selected, including: determining candidate storage locations with size information adapted to the size information of the to-be-warehoused container as first candidate storage locations; if the number of the first candidate storage locations is greater than or equal to the number of the to-be-warehoused containers, determining target storage locations in the first candidate storage locations that match the number of the to-be-warehoused containers.

[0105] Here, since the storage location needs to carry the container and ensure the stable placement of the container on the storage location, the adaptation can be understood as that the size information of the storage location is slightly larger than the size information of the to-be-warehoused container, and the size difference between the size information of the storage location and the size information of the to-be-warehoused container is less than or equal to a preset threshold (subsequently, the description that the size information of the storage location is equal to the size information of the container should be understood as that the size difference between the size information of the storage location and the size information of the container is less than or equal to the preset threshold, and the description that the size information of the storage location is greater than the size information of the container should be understood as that the size difference between the size information of the storage location and the size information of the container is greater than the preset threshold).

[0106] It should be noted that in actual operation, the adaptation can refer to that the size difference between the storage location and the to-be-warehoused container in any of the length, width and height is less than or equal to the preset threshold; or the size difference between the storage location and the to-be-warehoused container in each of the length, width and height is less than or equal to the preset threshold; or the size difference can be quantified by calculating the sum of the absolute values of the size difference between the length, width and height of the candidate storage location and the corresponding size of the to-be-warehoused container, or calculating the sum of squares of each dimension difference, which is not limited in the present application.

[0107] If the number of the first candidate storage locations is less than the number of the to-be-warehoused containers, the number difference between the first candidate storage locations and the to-be-warehoused containers is determined; second candidate storage locations are determined in other candidate storage locations except the first candidate storage locations, and the first candidate storage locations and the second candidate storage locations are determined as target storage locations; wherein the number of the second candidate storage locations is equal to the number difference, and the size difference corresponding to the target storage locations is less than or equal to the size difference corresponding to the non-target storage locations in the plurality of candidate storage locations.

[0108] Exemplarily, when the number of the first candidate storage locations adapted to the size information of the to-be-warehoused container is insufficient, the assignable first candidate storage locations can be assigned to the corresponding to-be-warehoused containers, and for other to-be-warehoused containers without assigned storage locations, the candidate storage locations can be sorted according to the size difference between each candidate storage location and the to-be-warehoused container from small to large by comparing the size difference between each candidate storage location and the to-be-warehoused container, and the candidate storage locations with a higher ranking can be preferentially determined as second candidate storage locations according to the number of the to-be-warehoused containers requiring to be assigned storage locations, so that the first candidate storage locations and the second candidate storage locations both belong to the target storage locations for the to-be-warehoused containers.

[0109] Taking the height of the container to be stored as an example, if the height of the container to be stored is Z3, there are two candidate storage locations, the storage location A has a storage height of Z3+1 cm, and the storage location B has a storage height of Z3+5 cm. At this time, the storage height of the storage location A is more similar to the height of the container to be stored, and selecting the storage location A for storage can more effectively reduce space waste.

[0110] In some embodiments, the calculation of the size difference can also be realized by weighted summation of the absolute values of the differences in length, width, and height of the storage location and the container. The weights can be set according to the priority of space utilization in the warehouse system for different dimensions. For example, for a warehouse scenario mainly limited by height, the weight proportion of height difference in size difference calculation can be increased, so that the selection of the storage location suitable for the container to be stored is more in line with the needs of the warehouse scenario.

[0111] The embodiment can ensure the adaptability of the container to be stored and the storage location while ensuring the utilization of storage space through the stepped size matching strategy, and avoid space waste caused by selecting a storage location with too large a size.

[0112] In some embodiments, the container to be stored may have some special storage requirements based on the container batch, the type of goods stored in the container, and the historical storage and retrieval frequency of the goods type in the warehouse system. After selecting multiple candidate storage locations that meet the basic storage conditions for the container to be stored in step S430, the specific situation of the container to be stored, such as the target goods for storing the container to be stored, can be further determined.

[0113] The following lists two ways to determine the target storage location in special storage requirement scenarios:

[0114] Storage requirement scenario one (centralized storage)

[0115] In the case where the container to be stored includes multiple containers that need to be stored centrally, it is necessary to ensure that these containers are stored in the same area, for example, assigning the same batch or highly correlated containers to be stored to adjacent or same aisle storage locations, to reduce the moving path and time of the handling equipment during subsequent access to goods, and further improve the overall operation efficiency of the warehouse system, while trying to fully utilize the storage space.

[0116] At this time, the priority of each candidate storage location can be determined based on the size difference corresponding to each candidate storage location, and the target storage location matching the number of containers to be stored can be determined from the multiple candidate storage locations based on the priority and position information of each candidate storage location.

[0117] The size difference corresponding to the candidate storage location with high priority is smaller than the size difference corresponding to the candidate storage location with low priority, so that by dividing the priority of each candidate storage location, the space utilization information when using different candidate storage locations to store the to-be-warehoused container is contained in the priority of the candidate storage location, which facilitates judging whether there are enough candidate storage locations in the same aisle or the same region combined with the position information of each candidate storage location, so as to judge whether there are candidate storage locations meeting the number of to-be-warehoused containers in each aisle or each region.

[0118] In some embodiments, as shown in FIG. 5, determining the target storage location matching the number of to-be-warehoused containers from the plurality of candidate storage locations based on the priority and position information of each candidate storage location includes steps S510-S540: Figure 5

[0119] Step S510: constructing a target set based on the candidate storage locations with priority higher than the i-th priority and the candidate storage locations with priority equal to the i-th priority.

[0120] Step S520: determining whether there is a target subset in the target set according to the position information of each candidate storage location in the target set; wherein the number of candidate storage locations in the target subset is greater than or equal to the number of to-be-warehoused containers, and the candidate storage locations in the target subset are located in the same aisle or the same region.

[0121] Step S530: in the case that there is a target subset in the target set, determining the target storage location matching the number of to-be-warehoused containers in the target subset.

[0122] Step S540: in the case that there is no target subset in the target set, constructing a new target set based on the candidate storage locations with priority higher than the i+1-th priority and the candidate storage locations with priority equal to the i+1-th priority, and determining the target subset in the new target set.

[0123] In specific implementation, the initial value of i can be set to 1, that is, the target set is first constructed from the candidate storage location with the highest priority. For example, assuming that the number of to-be-warehoused containers is 5, there are 8 candidate storage locations with priority 1, of which 3 are in aisle A and 5 are in aisle B. When i=1, the target set constructed contains all candidate storage locations with priority 1, and at this time, the 5 candidate storage locations in aisle B form a target subset, which can be directly determined as the target storage location. If the total number of candidate storage locations with priority 1 is 4 (less than 5), i is increased to 2, the candidate storage locations with priority 1 and priority 2 are jointly constructed to form a target set, and then it is judged whether there is a target subset with the same aisle or region and the number of which is greater than or equal to 5 in the set, and so on, until the target subset meeting the condition is found or all candidate storage locations with different priorities are traversed.

[0124] ​In some embodiments, the step S530 of determining the target storage locations in the target subset matching the number of the containers to be stored includes: in the case that the number of the target subset is single, determining the target storage locations in the target subset matching the number of the containers to be stored, wherein the priority of each target storage location is higher than or equal to the priority of the non-target storage locations in the target subset.

[0125] When the number of the target subset is single and the number of the candidate storage locations in the target subset is greater than the number of the containers to be stored, the target storage locations can be selected according to the priority of the candidate storage locations. Assuming that the containers to be stored are a batch of goods with a uniform length of 120 cm, a width of 100 cm, and a height of 125 cm, and the number of the containers is 3. There are 5 candidate storage locations in the target subset, and the information of each candidate storage location is as follows:

[0126] Candidate storage location 1 (length 132 cm, width 102 cm, height 127 cm);

[0127] Candidate storage location 2 (length 135 cm, width 105 cm, height 130 cm);

[0128] Candidate storage location 3 (length 130 cm, width 100 cm, height 125 cm);

[0129] Candidate storage location 4 (length 140 cm, width 110 cm, height 135 cm);

[0130] Candidate storage location 5 (length 133 cm, width 103 cm, height 128 cm).

[0131] The priority calculated according to the size difference is ranked from high to low as: storage location 3 > storage location 1 > storage location 5 > storage location 2 > storage location 4. Therefore, storage locations 3, 1, and 5 are selected as the target storage locations, which not only ensures the adaptability of the storage locations to the goods, but also takes into account the utilization rate of the storage space.

[0132] In some embodiments, the step S530 of determining the target storage locations in the target subset matching the number of the containers to be stored includes: in the case that the number of the target subset is multiple, respectively determining the optimal storage location combination of the containers to be stored in each target subset, wherein the optimal storage location combination is a storage location combination containing candidate storage locations matching the number of the containers to be stored, and the average priority of the contained candidate storage locations is the highest; determining the optimal storage location combination with the highest average priority from the optimal storage location combinations corresponding to each target subset, and determining the candidate storage locations in the optimal storage location combination as the target storage locations.

[0133] For example, if there are two target subsets, subset A contains candidate location A (priority 1), candidate location B (priority 1), and candidate location C (priority 2), subset B contains candidate location D (priority 1), candidate location E (priority 2), and candidate location F (priority 2), and the number of containers to be stored is 2. For subset A, the optimal location combination is A and B, and the average priority is 1; for subset B, the optimal location combination is D and E, and the average priority is (1+2) / 2=1.5. At this time, the average priority of the optimal location combination of subset A is higher, so A and B are determined as the target locations. In this way, the location combination with higher priority can be selected as much as possible while meeting the centralized storage requirement, balancing space utilization and storage management convenience.

[0134] By using the method of the embodiment, when processing the container to be stored with centralized storage requirement, the dual-dimensional screening of priority and location information can be used to ensure the centralized storage of the container in the physical space to improve the access efficiency, and the step-by-step priority matching mechanism can be used to minimize the waste of storage space.

[0135] The method meets the management requirement of centralized storage and minimizes the space waste as much as possible through priority division, and is suitable for scenarios such as the same batch of goods, associated goods, and the like that need centralized management.

[0136] In some embodiments, the container to be stored can be a plurality of containers with different sizes, and in this case, in order to store the batch of containers to be stored in the same area, the size information of the containers to be stored can also be obtained, and the storage state, size information, and location information of each location are combined to lock the candidate area that can store the batch of containers to be stored in the warehouse system.

[0137] For example, if the container to be stored contains two size specifications, size A (length 120 cm, width 110 cm, height 125 cm) and size B (length 140 cm, width 115 cm, height 135 cm), and the number of each size is 3, then the candidate area contains at least 3 locations that can accommodate size A containers and 3 locations that can accommodate size B containers.

[0138] To avoid the intersection of the two types of storage spaces resulting in the inability to actually accommodate the to-be-stored container, a size specification with a large size can be used for screening to screen out a first candidate area that meets the storage requirements of the size A container (at least three storage spaces capable of accommodating the size A container are required), and then 3 storage spaces in each first candidate area are pre-assigned for accommodating the size A container, and the pre-assigned storage spaces are marked as non-idle state, and then a second candidate area that meets the storage requirements of the size B container is screened out in each first candidate area (at least three storage spaces capable of accommodating the size B container are required), so that each second candidate area finally screened out can meet the storage requirements of the to-be-stored container.

[0139] After the second candidate area is screened out, if the second candidate area is still multiple, the method in step S530 can be used to determine the optimal storage space combination in each second candidate area, and the space utilization of each optimal storage space combination is compared according to the size difference between the storage space and the to-be-stored container, and the storage space combination with the highest space utilization is selected for storing the to-be-stored container.

[0140] The embodiment can ensure that containers of different size specifications can find suitable storage positions in the same area, and improves the flexibility and practicality of warehouse management.

[0141] Storage requirement scenario two (high-frequency warehouse-in and warehouse-out goods)

[0142] The historical warehouse-in and warehouse-out frequency refers to the number of times of warehouse-in and warehouse-out operations of a certain goods in the warehouse system within a certain period of time. It reflects the flow activity level of the goods in the warehouse system, and is an important indicator for measuring the turnover speed of the goods.

[0143] For the inventory area in the warehouse system, the storage spaces close to the workstation are obviously more convenient for operation. For example, when the workstation is on one side of the inventory area, the storage spaces on the side close to the workstation in the inventory area correspond to shorter carrying distances when the carrying device carries the container into the warehouse, and the storage spaces on the side away from the workstation correspond to longer carrying distances. When workstations are arranged around the inventory area, the storage spaces on the periphery of the inventory area correspond to shorter carrying distances, and the storage spaces in the central area of the inventory area correspond to longer carrying distances. When the storage spaces closer to the workstations in the horizontal direction are selected as the target storage spaces, the moving path of the carrying device between the workstations and the storage spaces can be shortened, and when the storage spaces closer to the bottom layer of the carrier or the height of the storage spaces corresponds to the original height of the container handling device in the vertical direction are selected as the target storage spaces, the power consumption of the container handling device on the hoist or the carrying device when the container is stored or taken out can be reduced.

[0144] Therefore, for goods with high frequency of warehouse entry and exit, such as daily necessities in the to-be-warehoused container, the system can preferentially select a candidate storage location close to the workstation or the entrance of the aisle and convenient for taking and placing, so as to shorten the subsequent delivery path and delivery time during warehouse exit; if the goods are seasonal goods with low frequency of turnover, the goods can be allocated to a candidate storage location far from the workstation and inconvenient for taking and placing, so as to occupy the storage space inconvenient for delivery in the storage area, and realize the reasonable allocation of storage resources.

[0145] In order to automatically allocate appropriate storage locations for the to-be-warehoused container with high frequency of warehouse entry and exit based on the detection of the type of goods in the to-be-warehoused container, the system can also pre-store the taking and placing cost of the storage location in the storage location information of each storage location. The factors for considering the taking and placing cost can include the vertical movement distance of the second delivery device when taking and placing the container at the storage location, the complexity of the horizontal movement path, the distance between the area where the storage location is located and the sorting workstation, and the like.

[0146] On the basis of the taking and placing cost in the storage location information, for the to-be-warehoused container, the historical frequency of warehouse entry and exit of the type of goods in the to-be-warehoused container in the warehouse system can be obtained. In step S430, when determining the target storage location for storing the to-be-warehoused container from the plurality of candidate storage locations, the method further includes: in the case that the historical frequency of warehouse entry and exit is higher than a preset frequency, calculating the matching degree of each candidate storage location and the to-be-warehoused container based on the taking and placing cost of each candidate storage location and the size difference corresponding to each candidate storage location; and determining the target storage location matching the quantity of the to-be-warehoused container from the plurality of candidate storage locations according to the matching degree of each candidate storage location and the to-be-warehoused container, wherein the matching degree corresponding to each target storage location is higher than or equal to the matching degree corresponding to the non-target storage location in each candidate storage location.

[0147] The preset frequency is a frequency threshold set by the warehouse system according to its own operation strategy, characteristics of goods, and actual business needs. Higher than the preset frequency means that the goods have more frequent warehouse entry and exit operations in the warehouse system, and belong to high-frequency turnover goods.

[0148] The target storage location is selected in combination with the taking and placing cost and the size difference. The purpose is to comprehensively consider the space utilization efficiency and the convenience of goods warehouse entry and exit operation in the warehouse system, so as to optimize the overall performance of the warehouse system. The introduction of the taking and placing cost focuses on the convenience of goods warehouse entry and exit operation. For goods with high frequency of warehouse entry and exit, storing them in a storage location with low taking and placing cost can significantly shorten the delivery path and time during subsequent warehouse exit.

[0149] The matching degree of each candidate storage location and the to-be-warehoused container is calculated based on the taking and placing cost and the size difference.

[0150] P = S1 / k + S2 / L Formula (1)

[0151] Wherein, P represents the matching degree of the candidate storage location and the to-be-warehoused container, S1 and S2 are respectively the first preset weight and the second preset weight, k represents the pick-and-place cost of the candidate storage location, and L represents the size difference corresponding to the candidate storage location.

[0152] In the formula (1), the first preset weight and the second preset weight are used to balance the influence of the pick-and-place cost and the size difference in the matching degree calculation. For example, for high-frequency warehousing and de-warehousing goods, the first preset weight can be set to a larger value (such as 0.6), and the second preset weight can be set to a smaller value (such as 0.4), so as to highlight the influence of the pick-and-place cost on the matching degree and preferentially select the storage location with low pick-and-place cost; if the current warehousing system pays more attention to space utilization, the proportion of the second preset weight can be increased (such as 0.7), so that the storage location with smaller size difference has more advantages in the matching degree calculation. By dynamically adjusting the weight parameters, the optimization target in different warehousing scenarios can be flexibly adapted, and the storage efficiency and space utilization of high-frequency warehousing and de-warehousing goods can be improved.

[0153] In this embodiment, the target storage location is selected by combining the size difference and the pick-and-place cost. For different types of goods, whether the goods are large or small in size, or whether the goods are high-frequency or low-frequency warehousing and de-warehousing, the goods can find a suitable storage location, avoiding the idle and waste of space and improving the storage density of the warehousing system. In terms of operation efficiency, the goods can be reasonably allocated to the storage locations according to the warehousing and de-warehousing frequency, reducing the moving distance and time of the handling equipment, reducing the labor and material costs, and improving the warehousing and de-warehousing efficiency.

[0154] The above describes the specific application logic of the present storage location allocation method in response to the concentrated storage demand and the high-frequency warehousing and de-warehousing scenario by arranging two special storage demand scenarios, and demonstrates the flexibility and adaptability of the method in different actual business scenarios. In the concentrated storage scenario, the balance between space utilization and concentrated management is achieved through priority division and target subset screening; in the high-frequency warehousing and de-warehousing scenario, the pick-and-place cost and the size difference are combined by means of the matching degree formula, and the operation efficiency and storage rationality are taken into account. The solutions to the two scenarios together constitute the application framework of the storage location allocation method, and provide a reliable implementation scheme for the intelligent management of the warehousing system.

[0155] In some embodiments, as shown in FIG. 4B, after the target storage location for storing the to-be-warehoused container is determined in the plurality of candidate storage locations in step S430, the storage location allocation method of the present application further includes: Figure 6

[0156] Step S640, updating the storage state of each target storage location to a non-idle state.

[0157] ​Exemplarily, in addition to updating the storage state of the target storage location, the correspondence between the to-be-warehoused container and the target storage location can also be recorded, such as the correspondence between the container identifier and the storage location number, so as to subsequently perform inventory checking, warehousing and de-warehousing operation tracking, and storage location state management.

[0158] By updating the storage state of the storage location in real time and establishing the association between the container and the storage location, the accuracy of the storage location information of the warehousing system can be ensured, data support can be provided for functions such as storage location scheduling and inventory early warning in the warehousing system, and the fine level of warehousing management can be further improved.

[0159] In step S650, based on the goods stored in the to-be-warehoused container, the storable goods types of other idle storage locations in the same aisle or the same area as the target storage location are updated.

[0160] The foregoing storable goods types in the storage location information are pre-defined, and the storable goods types initially configured for each storage location can be defined according to the storage area (such as the refrigeration area and the normal temperature area) where the storage location is located, so that each storage location is initially configured to store one or more types of goods.

[0161] However, after the to-be-warehoused container is stored in the allocated target storage location, the storable goods types of other idle storage locations in the area or the aisle where the target storage location is located can also change. For example, if the target storage location stores food with a tendency to absorb odor or material that is prone to repel other materials due to chemical properties, the storable goods types configured in the storage location information of other idle storage locations in the same aisle or area can be modified in real time. For example, if the target storage location stores food with a tendency to absorb odor, the storable goods types of other idle storage locations in the same area can be modified to the same type of food. For another example, if the target storage location stores material that is prone to repel other materials due to chemical properties, the storable goods types of other idle storage locations in the same area can be excluded from the storable goods types that conflict with the material.

[0162] In some embodiments, in step S650, for other idle storage locations in the same aisle or the same area as the target storage location, the storable goods types of these idle storage locations can be excluded from the storable goods types stored in the target storage location (i.e., the goods types in the foregoing to-be-warehoused container). The purpose of this is to avoid different batches of the same type of goods being stored too close together, thereby affecting the management of the batches of goods in the warehousing system.

[0163] For example, if a target storage location in a certain area stores batch A of electronic components a, to prevent batch B of the electronic components from being confused with batch A due to being stored too close together during picking, the system can automatically exclude the storable goods types of other idle storage locations in the area from “electronic components a”, and guide batch B of the electronic components to be allocated to other independent areas, so as to ensure the physical isolation of different batches of goods and improve the accuracy of inventory management.

[0164] In this embodiment, by dynamically adjusting the storable goods types of the associated storage locations, the real-time optimization of the storage location information is realized, so that the use of the storage space meets the needs of the characteristics of the goods and conforms to the fine management specification, providing more accurate constraint conditions for subsequent storage location allocation decisions, and ensuring the compatibility and rationality of the storage of goods in the same area.

[0165] Figure 7 is a schematic diagram of the storage location allocation logic provided by an example embodiment of the present application.

[0166] As shown in Figure 7 , in the container warehouse detection stage, the size information and the goods type of the container to be stored can be obtained, and the historical warehouse in-out frequency data can be queried according to the goods type, and the storage location information of each storage location in the warehouse system can be called, and then the candidate storage locations with matching sizes can be selected from the idle storage locations based on the size information of the container.

[0167] After the candidate storage locations are determined, it can be determined whether there is a special storage requirement, and a corresponding storage location allocation strategy is selected to select the target storage location. For the container to be stored without special storage requirements, a step-by-step size matching strategy can be used to ensure the adaptability of the container to be stored and the storage location, so as to avoid space waste caused by selecting a storage location with too large size.

[0168] For the container to be stored with special storage requirements, for example, when the container to be stored is an associated goods that needs to be stored in a centralized manner, the priority of each candidate storage location can be determined based on the size difference between each storage location and the container to be stored, and then the corresponding content of steps S510-S540 in Figure 5 is executed based on the priority and the location information of each candidate storage location, so that when the container to be stored with centralized storage requirements is processed, the priority and the location information are used for double-dimensional screening, and the storage space waste is reduced on the basis of meeting the centralized storage requirements.

[0169] For example, when the goods type in the container to be stored is a high-frequency in-out warehouse goods, the matching degree of each candidate storage location and the container to be stored can be calculated by combining the pick-and-place cost of the candidate storage location and the size difference between the candidate storage location and the container to be stored, using formula (1), and then the target storage location that takes into account the pick-and-place cost and the space utilization rate is determined.

[0170] The whole storage location allocation process realizes the intelligentization of the whole process of storage location allocation from preliminary screening to fine management through the comprehensive consideration of multi-dimensional parameters and the dynamic adjustment mechanism, effectively improving the overall operation efficiency and management accuracy of the warehouse system.

[0171] The specific settings and implementation modes of the embodiments of the application are described from different angles above. By using the method provided by the above embodiments, the size information of the to-be-warehoused container, the type of goods, the historical warehousing and de-warehousing frequency, and other multi-dimensional factors can be comprehensively considered, the storage state, the size, the position, and the taking and placing cost of the goods location are combined, the target goods location is dynamically screened and determined, and through this multi-dimensional and extensible goods location screening and target determination mechanism, the goods location allocation method can flexibly adapt to the diversified needs in different warehousing scenarios. At the same time, the storage state of the goods location and the storable goods types associated with the goods location are updated in real time, which effectively improves the utilization rate of the warehousing space, the operation efficiency of the goods warehousing and de-warehousing, and the fine level of inventory management, and provides reliable method support for the efficient operation of the warehousing system.

[0172] Exemplary Apparatuses

[0173] As an implementation of the above method, as shown in Figure 8 the embodiments of the application also provide a goods location allocation device, which can include:

[0174] The information acquisition module 810 is configured to acquire the goods location information of each goods location in the warehousing system, and the goods location information includes the storage state of the goods location and the size information of the goods location.

[0175] The first determination module 820 is configured to determine a plurality of candidate goods locations corresponding to the to-be-warehoused container according to the goods location information of each goods location and the size information of the to-be-warehoused container; wherein the storage state of the candidate goods location is in an idle state or a to-be-released state, and the size information of the candidate goods location is greater than or equal to the size information of the to-be-warehoused container.

[0176] The second determination module 830 is configured to determine a target goods location for storing the to-be-warehoused container from the plurality of candidate goods locations based on the goods location information of the to-be-warehoused container and each candidate goods location, and is configured to acquire the goods location information of each goods location in the warehousing system, and the goods location information includes the storage state of the goods location and the size information of the goods location.

[0177] In some embodiments, the second determination module 830 is further configured to determine the size difference between the size information of each candidate goods location and the size information of the to-be-warehoused container, and determine the target goods location matching the number of to-be-warehoused containers from the plurality of candidate goods locations based on the size difference corresponding to each candidate goods location.

[0178] In some embodiments, the second determination module 830 is further configured to determine the candidate goods location with the size information matching the size information of the to-be-warehoused container in the plurality of candidate goods locations as a first candidate goods location, and if the number of the first candidate goods location is greater than or equal to the number of the to-be-warehoused container, determine the target goods location matching the number of to-be-warehoused containers from the first candidate goods location.

[0179] In some embodiments, the second determining module 830 is further configured to: if the number of the first candidate storage locations is less than the number of the to-be-warehoused containers, determine a number difference between the first candidate storage locations and the to-be-warehoused containers; determine a second candidate storage location from among the other candidate storage locations other than the first candidate storage locations, and determine the first candidate storage location and the second candidate storage location as the target storage locations; and wherein the number of the second candidate storage locations is equal to the number difference, and a size difference corresponding to the target storage locations is less than or equal to a size difference corresponding to non-target storage locations among the plurality of candidate storage locations.

[0180] In some embodiments, the storage location information further comprises location information of the storage locations in the warehouse system, and the second determining module 830 is further configured to: in a case where the to-be-warehoused containers comprise a plurality of containers that need to be stored in a centralized manner, assign a priority to each candidate storage location based on the size difference corresponding to the candidate storage location, wherein the priority of a candidate storage location corresponding to a smaller size difference is higher than the priority of a candidate storage location corresponding to a larger size difference; and determine the target storage locations from among the plurality of candidate storage locations based on the priority and the location information of each candidate storage location, wherein the target storage locations match the number of the to-be-warehoused containers.

[0181] In some embodiments, the second determining module 830 is further configured to: construct a target set based on candidate storage locations with a priority higher than the i-th priority and candidate storage locations with a priority equal to the i-th priority, wherein i is an integer greater than or equal to 1; determine whether a target subset exists in the target set according to the location information of each candidate storage location in the target set, wherein the number of candidate storage locations in the target subset is greater than or equal to the number of the to-be-warehoused containers, and the candidate storage locations in the target subset are located in the same aisle or the same area; in a case where the target subset exists in the target set, determine the target storage locations from among the target subset, wherein the target storage locations match the number of the to-be-warehoused containers; and in a case where the target subset does not exist in the target set, construct a new target set based on candidate storage locations with a priority higher than the i+1-th priority and candidate storage locations with a priority equal to the i+1-th priority, and determine the target subset in the new target set.

[0182] In some embodiments, the second determining module 830 is further configured to: in a case where the number of the target subsets is a single target subset, determine the target storage locations from among the target subset, wherein the priority of each target storage location is higher than or equal to the priority of a non-target storage location in the target subset.

[0183] In some embodiments, the second determining module 830 is further configured to: in a case where the number of the target subsets is a plurality of target subsets, respectively determine an optimal storage location combination of the to-be-warehoused containers in each target subset, wherein the optimal storage location combination is a storage location combination that contains candidate storage locations matching the number of the to-be-warehoused containers and has the highest average priority of the contained candidate storage locations; determine an optimal storage location combination with the highest average priority from among the optimal storage location combinations corresponding to the target subsets, and determine the candidate storage locations in the optimal storage location combination as the target storage locations.

[0184] In some embodiments, the location information further comprises a pick-and-place cost of the location, and the information obtaining module 810 is further configured to obtain a historical storage and retrieval frequency of the type of goods in the to-be-stored container in the warehouse system.

[0185] The second determining module 830 is further configured to: in a case where the historical storage and retrieval frequency is higher than a preset frequency, calculate a matching degree of each candidate location and the to-be-stored container based on the pick-and-place cost of each candidate location and the size difference corresponding to each candidate location; and determine, according to the matching degrees of each candidate location and the to-be-stored container, a target location matching the quantity of the to-be-stored container from the plurality of candidate locations, wherein the matching degree corresponding to each target location is higher than or equal to the matching degree corresponding to a non-target location in each candidate location.

[0186] In some embodiments, the second determining module 830 is further configured to:

[0187] P = S1 / k + S2 / L

[0188] wherein P represents the matching degree of the candidate location and the to-be-stored container, S1 and S2 are respectively a first preset weight and a second preset weight, k represents the pick-and-place cost of the candidate location, and L represents the size difference corresponding to the candidate location.

[0189] In some embodiments, the first determining module 820 is further configured to: determine, according to the size information and the storage state of each location, a plurality of available locations from the plurality of locations, wherein the size information of each available location is greater than or equal to the size information of the to-be-stored container, and the available location comprises an idle location and / or a to-be-released location; and determine, based on the storable goods type of each available location and the goods stored in the to-be-stored container, a plurality of candidate locations of the to-be-stored container from the available locations, wherein the storable goods type of each candidate location comprises the type of goods stored in the to-be-stored container.

[0190] In some embodiments, the apparatus further comprises an information updating module, which is configured to: update the storage state of each target location to a non-idle state; and update, based on the goods stored in the to-be-stored container, the storable goods type of other idle locations in the same aisle or the same area as each target location.

[0191] The functions of each unit, module or sub-module in each apparatus in the embodiments of the present application can be referred to the corresponding description in the method embodiments, and has the corresponding beneficial effects, which will not be described here again.

[0192] Exemplary Electronic Devices and Computer-Readable Storage Media

[0193] As Figure 9As shown in the figure, it is an internal structure schematic diagram of an electronic device provided in the embodiment. The electronic device can be a server. The electronic device includes a processor, a memory and a network interface connected through a system bus. The processor of the electronic device is configured to provide computing and control capabilities. The memory of the electronic 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 running the operating system and the computer program in the non-volatile storage medium. The database of the electronic device is configured to store a height parameter quantity and three-dimensional map data. The network interface of the electronic device is configured to communicate with an external terminal through a network connection. The computer program is executed by the processor to implement the method of the embodiment of the application.

[0194] Those skilled in the art can understand that, Figure 9 The structure shown in the figure is only a block diagram of part of the structure related to the scheme of the application, and does not constitute a limitation on the electronic device to which the scheme of the application is applied. Specifically, the electronic device can include more or fewer components than those shown in the figure, or combine certain components, or have a different component arrangement.

[0195] In a specific implementation, the embodiment of the application provides a computer readable storage medium, which stores a computer program. The computer program is executed by the processor to implement the steps of the method in any of the above embodiments.

[0196] In a specific implementation, the embodiment of the application provides a computer program product, which includes a computer program. The computer program is executed by the processor to implement the steps of the method in any of the above embodiments.

[0197] The embodiment of the application also provides a chip. The chip includes a processor, which is configured to call and run instructions stored in a memory, so that a communication device installed with the chip executes the method provided in the embodiment of the application.

[0198] The embodiment of the application also provides a chip. The chip includes an input interface, an output interface, a processor and a memory. The input interface, the output interface, the processor and the memory are connected through an internal connection path. The processor is configured to execute code in the memory. When the code is executed, the processor is configured to execute the method provided in the embodiment of the application.

[0199] It is to be understood that the above-described processor can be a CPU, and can also be other general-purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), FPGAs or other programmable logic devices, discrete gates or transistor logic, discrete hardware components, or the like. The general-purpose processor can be a microprocessor or any conventional processor, or the like. It is to be noted that the processor can be a processor supporting an Advanced RISC Machines (ARM) architecture.

[0200] Further, the memory can include a read-only memory and a random access memory, optionally. The memory can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memory. The non-volatile memory can include a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically EPROM (EEPROM), or a flash memory, for example. The volatile memory can include a Random Access Memory (RAM) used as an external cache memory. Many forms of RAM are available by way of example but not limitation. For example, a Static RAM (SRAM), a Dynamic RAM (DRAM), a Synchronous DRAM (SDRAM), a Double Data Rate SDRAM (DDR SDRAM), an Enhanced SDRAM (ESDRAM), a Sync Link DRAM (SLDRAM), and a Direct Rambus RAM (DR RAM) can be used.

[0201] In the above embodiments, all or part can be implemented by software, hardware, firmware or any combination thereof. When implemented by software, all or part can be implemented in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions according to the present application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network or other programmable device. The computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another.

[0202] The computer program product can be written in any combination of one or more programming languages, including an object-oriented programming language such as Java, C++, and the like, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can be executed entirely on a user computing device, partially on a user device, as a separate software package, partially on a user computing device and partially on a remote computing device, or entirely on a remote computing device or server.

[0203] It should be understood that parts of the present application can be implemented in hardware, software, firmware or a combination thereof. In the above embodiments, a plurality of steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. All or part of the steps of the above method embodiments can be instructed by a program to complete the relevant hardware, which can be stored in a computer readable storage medium, and the program includes one or a combination of the steps of the method embodiments when executed.

[0204] In addition, the functional units in each embodiment of the present application can be integrated in one processing module, or each unit can be physically present separately, or two or more units can be integrated in one module. The above integrated module can be realized in the form of hardware or software function module. When the above integrated module is realized in the form of software function module and sold or used as an independent product, it can also be stored in a computer readable storage medium. The storage medium can be a read-only memory, a magnetic disk or an optical disk.

[0205] The above is only an exemplary embodiment of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of various changes or replacements within the technical scope disclosed in the present application, which should be covered within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A method for allocating cargo space, characterized in that, include: Obtain the location information of each storage location in the warehousing system, wherein the location information includes the storage status and size information of the storage location; Based on the location information of each storage location and the size information of the container to be stored, multiple candidate storage locations corresponding to the container to be stored are determined; wherein, the storage status of the candidate storage locations is either idle or pending release, and the size information of the candidate storage locations is greater than or equal to the size information of the container to be stored. Based on the storage information of the container to be stored and each of the candidate storage locations, a target storage location for storing the container to be stored is determined from the plurality of candidate storage locations.

2. The method according to claim 1, characterized in that, The step of determining the target storage location for storing the container to be received from among the multiple candidate storage locations based on the storage location information of the container to be received and each of the candidate storage locations includes: Determine the size difference between the size information of each candidate storage location and the size information of the container to be stored; Based on the size differences corresponding to each of the candidate storage locations, a target storage location matching the number of containers to be stored is determined from the plurality of candidate storage locations.

3. The method according to claim 2, characterized in that, The step of determining a target storage location that matches the quantity of containers to be received from among the multiple candidate storage locations based on the size differences corresponding to each candidate storage location includes: The candidate storage location whose size information matches the size information of the container to be stored is determined as the first candidate storage location; If the number of the first candidate storage locations is greater than or equal to the number of containers to be received, a target storage location matching the number of containers to be received is determined from the first candidate storage locations.

4. The method according to claim 3, characterized in that, The step of determining a target storage location that matches the quantity of containers to be received from among the multiple candidate storage locations based on the size differences corresponding to each candidate storage location further includes: If the number of the first candidate storage locations is less than the number of containers to be put into storage, determine the difference between the number of the first candidate storage locations and the number of containers to be put into storage. A second candidate storage location is determined from other candidate storage locations besides the first candidate storage location, and the first candidate storage location and the second candidate storage location are determined as the target storage location; wherein, the number of the second candidate storage locations is equal to the quantity difference, and the size difference corresponding to the target storage location is less than or equal to the size difference corresponding to the non-target storage locations among the plurality of candidate storage locations.

5. The method according to claim 2, characterized in that, The storage location information also includes the location information of the storage location in the warehousing system. The step of determining a target storage location that matches the quantity of containers to be received from among the multiple candidate storage locations based on the size differences corresponding to each candidate storage location includes: When the containers to be stored include multiple containers that need to be centrally stored, priority is assigned to each candidate storage location based on the size difference corresponding to each candidate storage location, wherein the size difference corresponding to the candidate storage location with higher priority is smaller than the size difference corresponding to the candidate storage location with lower priority. Based on the priority and location information of each candidate storage location, a target storage location matching the number of containers to be stored is determined from among the multiple candidate storage locations.

6. The method according to claim 5, characterized in that, The step of determining the target storage location that matches the number of containers to be received from the plurality of candidate storage locations based on the priority and location information of each candidate storage location includes: A target set is constructed based on candidate storage locations with a priority higher than the i-th priority and candidate storage locations with a priority equal to the i-th priority, where i is an integer greater than or equal to 1; Based on the location information of each candidate storage location in the target set, determine whether there is a target subset in the target set; wherein, the number of candidate storage locations in the target subset is greater than or equal to the number of containers to be put into storage, and the candidate storage locations in the target subset are located in the same aisle or the same area; If the target subset exists in the target set, a target storage location matching the quantity of the containers to be received is determined in the target subset; If the target subset does not exist in the target set, a new target set is constructed based on candidate storage locations with a priority higher than the (i+1)th priority and candidate storage locations with a priority equal to the (i+1)th priority, and a target subset is determined in the new target set.

7. The method according to claim 6, characterized in that, The step of determining the target storage location in the target subset that matches the quantity of the containers to be received includes: When the number of the target subset is a single unit, target storage locations matching the number of containers to be received are determined in the target subset, wherein the priority of each target storage location is higher than or equal to the priority of the non-target storage locations in the target subset.

8. The method according to claim 6, characterized in that, The step of determining the target storage location in the target subset that matches the quantity of the containers to be received includes: When there are multiple target subsets, the optimal storage location combination of the containers to be put into storage in each target subset is determined respectively. The optimal storage location combination is the storage location combination that contains the number of candidate storage locations that matches the number of containers to be put into storage, and has the highest average priority of the candidate storage locations. Among the optimal storage location combinations corresponding to each of the target subsets, determine the optimal storage location combination with the highest average priority, and then determine the candidate storage locations in the optimal storage location combination as the target storage locations.

9. The method according to claim 2, characterized in that, The location information also includes the cost of retrieving and placing goods at the location, and the method further includes: Obtain the historical inbound and outbound frequencies of the types of goods in the containers to be put into storage in the warehousing system. The step of determining a target storage location that matches the quantity of containers to be received from among the multiple candidate storage locations based on the size differences corresponding to each candidate storage location includes: If the historical inbound / outbound frequency is higher than the preset frequency, the matching degree between each candidate storage location and the container to be stored is calculated based on the retrieval and placement costs of each candidate storage location and the size differences corresponding to each candidate storage location. Based on the matching degree between each candidate storage location and the container to be stored, a target storage location matching the quantity of the container to be stored is determined from the plurality of candidate storage locations, wherein the matching degree corresponding to each target storage location is higher than or equal to the matching degree corresponding to the non-target storage location among the candidate storage locations.

10. The method according to claim 9, characterized in that, The matching degree between each candidate storage location and the container to be received is calculated based on the retrieval and placement costs of each candidate storage location and the size differences corresponding to each candidate storage location, including: P = S1 / k + S2 / L Wherein, P represents the matching degree between the candidate storage location and the container to be stored, S1 and S2 are the first preset weight and the second preset weight, respectively, k represents the picking and placing cost of the candidate storage location, and L represents the size difference corresponding to the candidate storage location.

11. The method according to any one of claims 1-10, characterized in that, The storage location information also includes the types of goods that can be stored. The step of determining multiple candidate storage locations corresponding to the container to be stored, based on the storage location information of each storage location and the size information of the container to be stored, includes: Based on the size information and storage status of each storage location, multiple available storage locations with size information greater than or equal to the size information of the container to be stored are determined in each storage location. The available storage locations include vacant storage locations and / or storage locations to be released. Based on the storable goods types of each available storage location and the goods stored in the container to be received, multiple candidate storage locations for the container to be received are determined among the available storage locations, wherein the storable goods types of the candidate storage locations include the goods types stored in the container to be received.

12. The method according to claim 11, characterized in that, After determining the target storage location for storing the container to be received from the plurality of candidate storage locations, the method further includes: Update the storage status of each target storage location to a non-idle state; Based on the goods stored in the containers to be put into storage, update the types of goods that can be stored in other vacant storage locations that are in the same aisle or area as each of the target storage locations.

13. A cargo location allocation device, characterized in that, The device includes: The information acquisition module is used to acquire the location information of each storage location in the warehousing system. The location information includes the storage status of the storage location and the size information of the storage location. The first determining module is used to determine multiple candidate storage locations corresponding to the container to be stored based on the storage location information of each storage location and the size information of the container to be stored; wherein the storage status of the candidate storage locations is an idle state or a state to be released, and the size information of the candidate storage locations is greater than or equal to the size information of the container to be stored. The second determining module is used to determine a target storage location for storing the container to be stored from among the multiple candidate storage locations based on the storage location information of the container to be stored and each of the candidate storage locations, and is used to obtain the storage location information of each storage location in the warehousing system, wherein the storage location information includes the storage status of the storage location and the size information of the storage location.

14. An electronic device, characterized in that, It includes a memory, a processor, and a computer program stored in the memory, wherein the processor, when executing the computer program, implements the method of any one of claims 1-12.

15. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the method of any one of claims 1-12.

16. A computer program product, characterized in that, Includes a computer program that, when executed by a processor, implements the method as described in any one of claims 1-12.

Images