A method, device, medium and product for bin warehousing

Abstract

The present application provides a method, device, medium and product for bin warehousing. According to the storage location utilization rate of each storage area and the site busyness of available sites in the storage area, the target storage area for the bin to be warehoused and the corresponding warehousing site in the target storage area are determined; the first storage location information of the target bin stored in the target storage area and the storage availability of the target storage area are determined; according to the first storage location information, the storage availability, the commodity attribute information of the bin to be warehoused and the second storage location information corresponding to other bins located on the same handling vehicle as the bin to be warehoused, the third storage location information of the bin to be warehoused in the target storage area is determined; the operation of moving the bin to be warehoused from the warehousing site to the corresponding storage location is performed according to the third storage location information. In this way, the present application can improve the rationality of bin storage location allocation, thereby improving the bin outbound efficiency.

Description

Technical Field

[0001] The present application relates to the technical field of warehousing, and in particular, to a method, device, medium and product for bin warehousing. Background Art

[0002] In the existing bin warehousing method, after receiving the bin to be warehoused at the warehousing starting point, the bin is transported to the warehousing station through a conveyor line body, and then the bin placed on the warehousing station is transported to the storage location on the shelf by a forklift. Since the storage location of the bin in the warehouse affects the subsequent outbound efficiency, if the storage layout of the bins in the warehouse is unreasonable, the outbound efficiency of the bins will be affected. Summary of the Invention

[0003] In view of this, the purpose of the present application is to provide a method, device, medium and product for bin warehousing, which can improve the rationality of bin storage location allocation and thus improve the outbound efficiency of bins.

[0004] In a first aspect, an embodiment of the present application provides a bin warehousing method, which is used to transport the bin to be warehoused into a warehouse. The warehouse is divided into multiple storage areas, and each storage area includes at least one bin transfer station and at least one shelf. The storage locations for storing bins on the shelf are arranged in a matrix layout; the method includes:

[0005] Determine the target storage area when the bin to be warehoused is warehoused and the corresponding warehousing station in the target storage area according to the storage location utilization rate of each storage area and the station busy degree of the available stations in the storage area;

[0006] Determine the first storage location information of the target bin already stored in the target storage area and the storage vacancy degree of the target storage area; wherein, the target bin is a bin with the same commodity attribute information as the bin to be warehoused; the storage vacancy degree includes the storage location utilization rate of the aisle and the storage location utilization rate of each column on the shelf;

[0007] Determine the third storage location information of the bin to be warehoused in the target storage area according to the first storage location information, the storage vacancy degree, the commodity attribute information of the bin to be warehoused, and the second storage location information corresponding to other bins on the same forklift as the bin to be warehoused;

[0008] Perform the operation of transporting the bin to be warehoused from the warehousing station to the corresponding storage location according to the third storage location information.

[0009] Optionally, the step of determining the target storage area when the bin to be warehoused is warehoused and the corresponding warehousing station in the target storage area according to the storage location utilization rate of each storage area and the station busy degree of the available stations in the storage area includes:

[0010] Create a list of storage areas according to the storage location utilization rate of each storage area;

[0011] For each storage area in the list of storage areas, create a list of available sites according to the site busyness of all available sites in the storage area;

[0012] Determine the warehousing site when the bin to be warehoused is warehoused according to the commodity attribute information of the bins already placed on each available site in the list of available sites and the commodity attribute information of the bin to be warehoused, and determine the storage area corresponding to the warehousing site as the target storage area.

[0013] Optionally, the step of creating a list of storage areas according to the storage location utilization rate of each storage area includes:

[0014] Sort the multiple storage areas in ascending order of storage location utilization rate to obtain the initial storage area sorting of all storage areas;

[0015] Determine the difference in storage location utilization rate between any two storage areas;

[0016] If it is detected that the difference in storage location utilization rate is not greater than the target utilization rate difference threshold, then determine the difference in the number of bins between the two storage areas according to the number of target bins already stored in the two storage areas;

[0017] If the difference in the number of bins is not greater than the target bin number difference threshold, update the order of the storage areas in the initial storage area sorting, and determine the list of storage areas based on the updated storage area sorting.

[0018] Optionally, the step of determining the warehousing site when the bin to be warehoused is warehoused according to the commodity attribute information of the bins already placed on each available site in the list of available sites and the commodity attribute information of the bin to be warehoused includes:

[0019] For each available site in the list of available sites, detect whether the commodity attribute information of the bins already placed on the available site is the same as the commodity attribute information of the bin to be warehoused;

[0020] If so, determine the first available site as the warehousing site when the bin to be warehoused is warehoused; wherein, there is a bin on the first available site with the same commodity attribute information as the bin to be warehoused;

[0021] If not, determine the second available site as the warehousing site when the bin to be warehoused is warehoused; wherein, the number of bins already placed on the second available site is the least among the number of bins already placed on all available sites.

[0022] Optionally, the second storage location information includes the aisle where the other bins are located in the target storage area and the columns where the other bins are located on the shelves on both sides of the aisle; the first storage location information includes the aisle where the target bin has been stored in the target storage area and the columns where the target bin has been stored on the shelves on both sides of the aisle;

[0023] The step of determining the third storage location information of the to-be-inwarehouse bin in the target storage area according to the first storage location information, the storage availability, the commodity attribute information of the to-be-inwarehouse bin, and the second storage location information corresponding to the other bins located on the same carrier as the to-be-inwarehouse bin includes:

[0024] Construct a first candidate aisle set, a second candidate aisle set, and a third candidate aisle set; wherein, the first candidate aisle set refers to the set of aisles in the target storage area that meet the aisle selection conditions, the second candidate aisle set refers to the set of aisles where all other bins are located in the target storage area, and the third candidate aisle set refers to the set of aisles where all the target bins that have been stored are located in the target storage area;

[0025] According to the commodity attribute information of the to-be-inwarehouse bin, the first candidate aisle set, the second candidate aisle set, and the third candidate aisle set, determine the target aisle of the to-be-inwarehouse bin;

[0026] Construct a first candidate column set, a second candidate column set, and a third candidate column set; wherein, the first candidate column set refers to the set of columns on the shelves on both sides of the target aisle that meet the column selection conditions, the second candidate column set refers to the set of columns where all other bins are located on the shelves on both sides of the target aisle, and the third candidate column set refers to the set of columns where all the target bins that have been stored are located on the shelves on both sides of the target aisle;

[0027] According to the commodity attribute information of the to-be-inwarehouse bin, the first candidate column set, the second candidate column set, and the third candidate column set, determine the target column of the to-be-inwarehouse bin;

[0028] According to the target aisle and the target column, determine the third storage location information of the to-be-inwarehouse bin in the target storage area.

[0029] Optionally, the first candidate aisle set is constructed through the following steps:

[0030] Sort all the aisles in the target storage area according to the aisle parameters of the aisles to obtain the aisle position sorting of all the aisles in the target storage area; wherein, the aisle parameters include the storage utilization rate of the aisles.

[0031] Select the first candidate roadway set consisting of the top target number of roadways in the roadway position sorting.

[0032] Optionally, the sorting all roadways in the target storage area according to the roadway parameters of the roadways to obtain the roadway position sorting of all roadways in the target storage area includes:

[0033] Sort all roadways in the target storage area in ascending order of the storage location utilization rate of the roadways to obtain the initial roadway sorting corresponding to the target storage area;

[0034] For roadways with the same storage location utilization rate, sort the roadways with the same storage location utilization rate in ascending order of roadway busyness to obtain the sub-roadway sorting of the roadways with the same storage location utilization rate;

[0035] Determine the roadway position sorting according to the initial roadway sorting and the sub-roadway sorting.

[0036] Optionally, the steps of determining the target roadway of the to-be-stored bin according to the commodity attribute information of the to-be-stored bin, the first candidate roadway set, the second candidate roadway set, and the third candidate roadway set include:

[0037] Detect whether the roadway corresponding to the roadway position of the stored target bin in the target storage area belongs to the third candidate roadway set;

[0038] If it is detected that the roadway corresponding to the roadway position of the stored target bin in the target storage area does not belong to the third candidate roadway set, then detect whether the roadway corresponding to the roadway position of other bins in the target storage area belongs to the second candidate roadway set;

[0039] If so, select the roadway with the smallest sum of distance differences between all roadways in the first candidate roadway set and the second candidate roadway set as the target roadway;

[0040] If not, randomly select a roadway from the first candidate roadway set as the target roadway.

[0041] Optionally, the steps of determining the target roadway position of the to-be-stored bin according to the commodity attribute information of the to-be-stored bin, the first candidate roadway set, the second candidate roadway set, and the third candidate roadway set further include:

[0042] If it is detected that the roadway corresponding to the roadway position of the stored target bin in the target storage area belongs to the third candidate roadway set, then detect whether there are other new roadways in the third candidate roadway set; where the other roadways refer to the newly added roadways in the target storage area for storing the target bin;

[0043] If it is detected that there are other newly added lanes in the third candidate lane set, select a lane with the largest sum of distance differences between all lanes in the third candidate lane set from the first candidate lane set as the target lane;

[0044] If it is detected that there are no other newly added lanes in the third candidate lane set, check whether the lanes corresponding to the lane positions of other bins in the target storage area belong to the second candidate lane set;

[0045] If so, select a lane with the smallest sum of distance differences between all lanes in the third candidate lane set from the second candidate lane set as the target lane;

[0046] If not, randomly select a lane from the third candidate lane set as the target lane.

[0047] In a second aspect, an embodiment of the present application further provides an electronic device, including a memory, a processor, and a computer program stored on the memory. The processor executes the computer program to implement the bin warehousing method as described above.

[0048] In a third aspect, an embodiment of the present application further provides a computer-readable storage medium, on which a computer program / instruction is stored. When the computer program / instruction is executed by a processor, the bin warehousing method as described above is implemented.

[0049] In a fourth aspect, an embodiment of the present application further provides a computer program product, including a computer program / instruction. When the computer program / instruction is executed by a processor, the bin warehousing method as described above is implemented.

[0050] An embodiment of the present application provides a bin warehousing method, device, medium, and product. The method includes: determining a target storage area for a bin to be warehoused and the corresponding warehousing station in the target storage area according to the storage utilization rate of each storage area and the station busyness of available stations in the storage area; determining the first storage location information of the target bin already stored in the target storage area and the storage vacancy rate of the target storage area; where the bin to be warehoused is a bin with the same commodity attribute information as the bin to be warehoused; the storage vacancy rate includes the storage utilization rate of the lanes and the storage utilization rate of each column on the shelf; determining the third storage location information of the bin to be warehoused in the target storage area according to the first storage location information, the storage vacancy rate, the commodity attribute information of the bin to be warehoused, and the second storage location information corresponding to other bins located on the same forklift as the bin to be warehoused; performing an operation of transporting the bin to be warehoused from the warehousing station to the corresponding storage location according to the third storage location information.

[0051] The embodiments of the present application can select the inbound station and the target storage area corresponding to the inbound station according to the storage location utilization rate of each storage area and the station busyness of the available stations in the storage area, so that the bin inbound is reasonable and efficient; by combining the first storage location information, the second storage location information, the storage location utilization rate of the roadway, and the storage location utilization rate of each column on the shelf, the relatively reasonable storage location of the bin to be inbound can be analyzed. Furthermore, while ensuring that the storage layout of bins with the same commodity attribute information is easy to manage and traceable to the commodity source, the travel distance of the forklift is reduced and time is saved. Commodities with the same commodity attribute information are aggregated and dispersed, which reduces the busyness of the roadway and improves the inventory safety. It can improve the rationality of the storage location allocation of the bin, provide great convenience for the bin outbound, and thus improve the outbound efficiency of the bin.

[0052] To make the above objects, features, and advantages of the present application more obvious and understandable, the following specifically enumerates preferred embodiments and, in conjunction with the accompanying drawings, makes the following detailed description. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] To more clearly illustrate the technical solutions of the embodiments of the present application, the following briefly introduces the drawings required for use in the embodiments. It should be understood that the following drawings only show some embodiments of the present application and should not be regarded as limiting the scope. For those of ordinary skill in the art, other related drawings can be obtained based on these drawings without creative efforts.

[0054] Figure 1 The structural schematic diagram of an electronic device provided by the embodiments of the present application;

[0055] Figure 2 The flowchart of a bin inbound method provided by the embodiments of the present application;

[0056] Figure 3 The structural schematic diagram of a bin inbound device provided by the embodiments of the present application. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0057] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the following will clearly and completely describe the technical solutions in the embodiments of this application with reference to the accompanying drawings in the embodiments of this application. Obviously, the described embodiments are only a part rather than all of the embodiments of this application. Components of the embodiments of this application usually described and illustrated in the accompanying drawings here can be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of this application provided in the accompanying drawings is not intended to limit the scope of the claimed application, but merely represents selected embodiments of this application. Based on the embodiments of this application, every other embodiment obtained by those skilled in the art without creative efforts falls within the scope of protection of this application.

[0058] Embodiment 1:

[0059] First, refer to Figure 1 to describe an exemplary electronic device 100 for implementing a bin warehousing method and a warehousing system according to an embodiment of the present invention.

[0060] As Figure 1 shown in the structural schematic diagram of an electronic device, the electronic device 100 includes one or more processors 102, one or more storage devices 104, an input device 106, an output device 108, and an image acquisition device 110. These components are interconnected through a bus system 112 and / or other forms of connection mechanisms (not shown). It should be noted that Figure 1 the components and structure of the electronic device 100 shown are exemplary rather than restrictive. According to needs, the electronic device may also have other components and structures.

[0061] The processor 102 can be implemented in at least one hardware form of a digital signal processor (DSP), a field programmable gate array (FPGA), or a programmable logic array (PLA). The processor 102 can be a central processing unit (CPU), a graphics processing unit (GPU), or a combination of one or more of other forms of processing units with data processing capabilities and / or instruction execution capabilities, and can control other components in the electronic device 100 to perform desired functions.

[0062] The storage device 104 may include one or more computer program products, and the computer program products may include various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. The volatile memory may include, for example, random access memory (RAM) and / or cache memory, etc. The non-volatile memory may include, for example, read-only memory (ROM), hard disk, flash memory, etc. One or more computer program instructions may be stored on the computer-readable storage media, and the processor 102 may run the program instructions to implement the client functions (implemented by the processor) in the embodiments of the present invention described below and / or other desired functions. Various application programs and various data may also be stored in the computer-readable storage media, such as various data used and / or generated by the application programs, etc.

[0063] The input device 106 may be a device used by a user to input instructions, and may include one or more of a keyboard, a mouse, a microphone, a touch screen, etc.

[0064] The output device 108 may output various information (such as images or sounds) to the outside (for example, to the user), and may include one or more of a display, a speaker, etc.

[0065] The image acquisition device 110 may capture an image desired by the user (such as a photo, a video, etc.), and store the captured image in the storage device 104 for use by other components.

[0066] Exemplarily, an example electronic device for implementing the bin storage method, device, and intelligent warehousing system according to the embodiments of the present invention may be implemented as an intelligent terminal such as a smart phone, a tablet computer, a computer, etc.

[0067] Embodiment 2:

[0068] With the development of intelligent technologies such as the Internet of Things (IoT), artificial intelligence (AI), and big data, the demand for using these intelligent technologies to transform and upgrade the traditional logistics industry has become even stronger, and intelligent logistics (Intelligent Logistics System) has become a research hotspot in the logistics field. Intelligent logistics utilizes AI, big data, and various IoT devices and technologies such as information sensors, radio frequency identification (RFID) technology, and global positioning system (GPS), and is widely applied to basic activity links such as material transportation, warehousing, distribution, packaging, loading and unloading, and information services, to achieve intelligent analysis and decision-making, automated operation, and high-efficiency optimization management in the material management process. IoT technologies include sensing devices, RFID technology, laser infrared scanning, infrared induction identification, etc. The IoT can effectively connect the materials in logistics with the network, can monitor the materials in real time, and can also sense environmental data such as the humidity and temperature of the warehouse to ensure the storage environment of the materials. Through big data technology, all data in logistics can be sensed and collected, uploaded to the data layer of the information platform, and operations such as filtering, mining, and analyzing the data are performed. Finally, accurate data support is provided for business processes (such as transportation, warehousing, storage, picking, packaging, sorting, outbound, inventory, distribution, etc.). The application directions of AI in logistics can be roughly divided into two types: 1) using intelligent devices empowered by AI technology, such as driverless trucks, automated guided vehicles (AGVs), autonomous mobile robots (AMRs), forklifts, shuttle cars, stacker cranes, driverless delivery vehicles, drones, service robots, robotic arms, intelligent terminals, etc., to replace some manual labor; 2) improving manual efficiency through software systems driven by technologies or algorithms such as computer vision, machine learning, and operations research optimization, such as transportation equipment management systems, warehouse management, equipment scheduling systems, order allocation systems, etc. With the research and progress of intelligent logistics, this technology has been applied in many fields, such as retail and e-commerce, electronics, tobacco, medicine, industrial manufacturing, footwear, textiles, food, etc.

[0069] In the existing method for bin warehousing, after receiving the bin to be warehoused at the warehousing starting point, the bin is transported to the warehousing station through a conveyor line body, and then the bin placed on the warehousing station is transported to the storage location on the shelf by a handling vehicle. Here, the conveyor line body can be a conveyor belt, and the handling vehicle can be an AGV, a forklift, an AMR, etc.

[0070] In the embodiment of the present application, the Warehouse Execution System (WES) uses a certain algorithm to move the bins (storage units in the warehouse, which can also be pallets, etc.) that need to be placed in the warehouse to the corresponding vacant storage locations. When moving, generally a whole bin is placed on a vacant storage location. When it is necessary to ship out later, these bins that have been put into storage can be moved to the goods distribution site for the shipping-out operation. Among them, the goods distribution site can refer to the location in the warehouse where goods are shipped out, generally the elevator entrance or the warehouse entrance and exit, etc. In practice, the location where the bins are put into storage will affect the subsequent shipping-out efficiency.

[0071] Generally, there are two ways to determine the storage locations for the bins. One way is to randomly select vacant storage locations in the warehouse for bin storage. However, the random selection method may result in some bins being far from the goods distribution site. When shipping out, the forklift needs to move a long distance, resulting in low shipping-out efficiency. Another way is to place the bins at the vacant storage locations closer to the above-mentioned goods distribution site. However, this way may cause serious congestion when shipping out from the storage locations near the goods distribution site, resulting in low shipping-out efficiency.

[0072] It can be seen that during the process of bin storage, the layout of the storage locations for storing the bins is often unreasonable, resulting in congestion during the handling process by the handling vehicle, thus leading to low shipping-out efficiency.

[0073] Based on this, this embodiment provides a bin storage method, device, medium and product, which can improve the rationality of bin storage location allocation, and further improve the shipping-out efficiency of the bins.

[0074] Specifically, the bin storage method provided by the embodiment of the present application is used to transport the bins to be stored into the warehouse. The warehouse is divided into multiple storage areas, and each storage area includes at least one bin transfer station and at least one shelf. The storage locations on the shelf for storing the bins are arranged in a matrix layout.

[0075] Specifically, the warehouse includes multiple storage areas, and each storage area includes at least one bin transfer station for temporarily storing bins and at least one shelf. Each shelf includes multiple storage locations for storing bins. The storage locations in the same storage area are arranged on the shelf in a matrix layout. A roadway is formed between two rows of shelves that are relatively arranged at intervals in the same storage area. Among them, the commodity attributes of the goods in the same bin are the same. There is also a handling vehicle in the warehouse, which is used to move the bins temporarily stored in the bin transfer station to the storage locations.

[0076] Exemplarily, in the method provided by the embodiments of the present application, the warehouse mentioned is divided into multiple storage areas, and each storage area can be regarded as a sub-warehouse. Each storage area (sub-warehouse) includes multiple shelves arranged side by side. Among these shelves arranged side by side, some are attached back to back, and some are arranged relatively with a gap. As a result, an aisle is formed between two rows of shelves arranged relatively with a gap. Each shelf is provided with multiple storage locations in a multi-row and multi-column manner, and these storage locations are used to store the bins.

[0077] In one implementation, this bin inbound method can be implemented within the WES system. When the bin to be inbound enters the sub-warehouse, it will first trigger the algorithm for selecting the inbound station. When the bin to be inbound is picked up by the corresponding transporter, it will trigger the algorithm for selecting the storage location and finally be transported by the transporter to the storage location.

[0078] Specifically, the embodiments of the present application provide a warehousing system, including: a processor, and a conveyor line body and a transporter respectively communicatively connected to the processor; the processor is used to execute the bin inbound method; the transporter is used to transport the bin to be inbound to the target storage location when the bin to be inbound on the conveyor line body reaches the inbound station.

[0079] Please refer to Figure 2 , Figure 2 which is a flowchart of a bin inbound method provided by the embodiments of the present application. As Figure 2 shown, this method includes:

[0080] S210. Determine the target storage area for the bin to be inbound and the corresponding inbound station within the target storage area according to the storage location utilization rate of each storage area and the station busyness of the available stations within the storage area.

[0081] S220. Determine the first storage location information of the target bin already stored in the target storage area and the storage availability of the target storage area; wherein, the bin to be inbound is a bin with the same commodity attribute information as the bin to be inbound; the storage availability includes the storage location utilization rate of the aisle and the storage location utilization rate of each column on the shelf.

[0082] S230. Determine the third storage location information of the bin to be inbound within the target storage area according to the first storage location information, the storage availability, the commodity attribute information of the bin to be inbound, and the second storage location information corresponding to other bins on the same transporter as the bin to be inbound.

[0083] S240. Perform the operation of transporting the bin to be inbound from the inbound station to the corresponding storage location according to the third storage location information.

[0084] The bin storage-in method provided by the embodiments of this application can select a storage-in site and the target storage area corresponding to the storage-in site according to the storage space utilization rate of each storage area and the site busyness of the available sites in the storage area, making the bin storage-in reasonable and efficient; by combining the first storage location information, the second storage location information, the storage space utilization rate of the roadway, and the storage space utilization rate of each column on the shelf, the relatively reasonable storage location for the bin to be stored can be analyzed. Furthermore, while ensuring that the storage layout of bins with the same commodity attribute information is convenient for management and easy to trace the source of the commodity, the travel distance of the forklift is reduced and time is saved. Commodities with the same commodity attribute information are both aggregated and dispersed, reducing the roadway busyness and having a higher inventory safety level. It can improve the rationality of bin storage location allocation, provide great convenience for bin storage-out, and thus improve the storage-out efficiency of bins.

[0085] Specifically, in step S210, the storage area is obtained by dividing the warehouse. Each storage area includes multiple storage locations for storing bins. The storage locations are arranged in a matrix (multiple rows and multiple columns) on the shelf. Among them, a storage area can include multiple shelves. That is to say, each storage area will include a large number of storage locations.

[0086] Among them, the bin to be stored refers to the bin that currently enters the warehouse.

[0087] The storage space utilization rate is determined according to the ratio between the number of occupied storage locations in the storage area and the number of all storage locations in the storage area. The number of occupied storage locations is determined by the WES system, which includes the storage locations that already store bins at the current moment, and also includes the storage locations that the WES system has determined will store bins in the future. For example, it is determined that the bin to be stored on this storage location is already on the way when the forklift transports the bin to this storage location.

[0088] The available site refers to the site that can be used to continue storing bins. Each site can temporarily store a predetermined number of bins. As long as the number of bins currently stored at this site does not reach the predetermined number, it can be used as an available site. For example, a site can temporarily store 10 bins. If 6 bins are currently stored at the current moment and there is still space for 4 other bins to be temporarily stored, then this site can be considered an available site.

[0089] The site busyness of the available site refers to the number of bins already placed on the available site. The more bins are placed, the greater the site busyness, indicating that the available site is busier. When selecting the storage-in site for the bin to be stored, an available site with a lower site busyness can be selected.

[0090] Exemplarily, under the condition that the number of all storage locations in the storage area is the same, the smaller the utilization rate of the storage locations in the storage area, the more storage locations can be used to store the bins. Furthermore, under this condition, the bins can be distributed and arranged dispersedly during storage according to the utilization rate of the storage locations, so that the number of forklifts in the storage area will not be excessive and cause congestion.

[0091] Furthermore, according to the utilization rate of the storage locations in each storage area, the storage areas with relatively small utilization rates of the storage locations can be preferentially considered from multiple storage areas. For the storage area with a relatively small utilization rate of the storage locations, combined with the site busyness degree, an available site with a relatively small site busyness degree can be selected from multiple available sites as the inbound site for the bins to be warehoused, and at the same time, the storage area corresponding to the inbound site is determined as the target storage area. Among them, if the utilization rates of the storage locations among multiple storage areas are similar, the number of bins of the target bins (bins with the same commodity attribute information as the bins to be warehoused and stored in the target storage area) already stored in the storage area can be further considered, and the storage area for storing the bins to be warehoused is preferentially considered according to the utilization rate of the storage locations in the storage area and the number of bins of the target bins already stored in the storage area. Here, the commodity attribute information refers to the inherent properties of the commodity itself, which is a set of differences (properties different from other commodities) of the commodity in different fields. That is to say, the commodity attribute is a set of commodity properties. For example, if the commodity is food, the commodity attributes can be information such as the taste and size of the commodity; if the commodity is stationery, the commodity attributes can be information such as the category and model of the stationery.

[0092] In a preferred embodiment, step S210 includes:

[0093] Step 2101, create a storage area list according to the utilization rate of the storage locations in each storage area.

[0094] Step 2102, for each storage area in the storage area list, create an available site list according to the site busyness degree of all available sites in the storage area.

[0095] Step 2103, determine the inbound site when the bins to be warehoused are warehoused according to the commodity attribute information of the bins already placed on each available site in the available site list and the commodity attribute information of the bins to be warehoused, and determine the storage area corresponding to the inbound site as the target storage area.

[0096] Specifically, in step 2101, a storage area list can be created according to the utilization rate of the storage locations in each storage area in ascending order of the utilization rate of the storage locations; among them, the utilization rate of the storage locations is determined according to the ratio between the number of occupied storage locations in the storage area and the number of all storage locations in the storage area.

[0097] Here, the storage area list stores all storage areas sorted in ascending order of storage location utilization rate.

[0098] When there are storage areas with similar storage location utilization rates, the number of target bins already stored in these storage areas can be further considered to determine whether to update the sorting of the storage areas in the storage area list. The specific implementation method is as follows:

[0099] Sort multiple storage areas in ascending order of storage location utilization rate to obtain the initial storage area sorting of all storage areas; determine the difference in storage location utilization rate between any two storage areas; if it is detected that the difference in storage location utilization rate is not greater than the target utilization rate difference threshold, then determine the difference in the number of bins between these two storage areas according to the number of target bins already stored in these two storage areas; if the difference in the number of bins is not greater than the target number of bins difference threshold, then update the order of the storage areas in the initial storage area sorting, and determine the storage area list based on the updated storage area sorting.

[0100] In this step, if the difference in storage location utilization rate is not greater than the target utilization rate difference threshold, it means that the storage location utilization rates between these two storage areas are not much different. At this time, it is necessary to further compare the number of target bins already stored in the two storage areas. If the difference in the number of bins is also not greater than the target number of bins difference threshold, it means that the number of target bins already stored in the two storage areas is not much different. Since the storage location utilization rates of these two storage areas are similar and the number of target bins already stored is similar, the difference between these two storage areas can be ignored at this time. In this way, the sorting between these two storage areas can be randomly adjusted, and thus a storage area list can be created for all storage areas based on the updated storage area sorting.

[0101] Here, the updated storage area sorting can be the same as the initial storage area sorting. At this time, it can also be considered that the storage area list is determined based on the initial storage area sorting; the updated storage area sorting can also be different from the initial storage area sorting. In this case, the storage area list is determined based on the updated initial storage area sorting.

[0102] It should be noted that the WES system can pre-obtain the commodity attribute information of the bins to be warehoused, as well as the commodity attribute information of all the bins already existing in each storage area, and then find the bins with the same commodity attribute information as the bins to be warehoused from these two storage areas, and use the bins with the same commodity attribute information as the bins to be warehoused as the target bins already stored. Calculate the number of target bins already stored in these two storage areas respectively, and then obtain the difference in the number of bins between these two storage areas.

[0103] Exemplarily, the difference in storage location utilization rate is calculated as follows: If there are three storage areas in the warehouse, defined as the first storage area, the second storage area, and the third storage area respectively, the difference in storage location utilization rate between the first storage area and the second storage area can be calculated based on the storage location utilization rate of the first storage area and the storage location utilization rate of the second storage area; then, based on the storage location utilization rate of the first storage area and the storage location utilization rate of the third storage area, the difference in storage location utilization rate between the first storage area and the third storage area can be calculated, and so on. Finally, the difference in storage location utilization rate between the second storage area and the third storage area is calculated. Similarly, the difference in the number of boxes between two storage areas is also calculated in the above manner.

[0104] For example, the threshold value of the utilization rate difference and the threshold value of the item number difference can be set according to the actual situation in the warehouse. In a specific embodiment, the threshold value of the utilization rate difference can be 0.002, and the threshold value of the box number difference can be 6. Of course, other values can also be used. Among them, the specific values of the threshold value of the utilization rate difference and the threshold value of the box number difference can be adjusted according to the actual situation. For each incoming bin, it is necessary to sort all storage areas in ascending order of the storage location utilization rate of the storage area to obtain the storage area sorting. If the difference in storage location utilization rate of the storage area is not greater than 0.002 and the difference in the number of boxes is not greater than 6, the storage area sorting can be updated, and a storage area list can be re-created according to the updated storage area sorting.

[0105] In step 2102, for each storage area in the storage area list, an available site list is created according to the site busy degree of all available sites in the storage area.

[0106] Here, for all available sites in the storage area, an available site list is created in ascending order of the site busy degree. Among them, the smaller the site busy degree, the more idle the available site is.

[0107] In step 2103, according to the commodity attribute information of the bins already placed on each available site in the available site list and the commodity attribute information of the incoming bin, the incoming site when the incoming bin is stored is determined, and the storage area corresponding to the incoming site is determined as the target storage area.

[0108] In this step, for each available site in the available site list, the incoming site when the incoming bin is stored can be determined from the available site list according to the correlation degree between the commodity attribute information of the bins already placed on the available site and the commodity attribute information of the incoming bin, and the storage area corresponding to the incoming site is determined as the target storage area.

[0109] In one embodiment, the degree of association can be expressed as the similarity. That is, the incoming storage site for the incoming storage bin can be selected from the list of available sites according to the similarity between the commodity attribute information of the bins already placed on each available site and the commodity attribute information of the incoming storage bin. When performing the similarity comparison, each commodity attribute in the commodity attribute information needs to be compared separately. For example, if the commodity attribute information includes taste and weight, then the comparison needs to be performed separately for taste and weight, and the final similarity result is obtained comprehensively. If the taste is the same and the weight is the same, the similarity is 1; if the taste is the same but the weight is different, or the taste is different but the weight is the same, the final similarity result can be set to 0.5. Here, the similarity threshold can be set in advance. For example, the similarity threshold is selected as 0.99. If the similarity between the commodity attribute information of the bins already placed on each available site and the commodity attribute information of the incoming storage bin exceeds the similarity threshold, then the available site where the bin with the same commodity attribute information as the incoming storage bin is located can be determined as the incoming storage site for the incoming storage bin; if the similarity does not exceed the similarity threshold, then the least busy available site can be selected as the incoming storage site for the incoming storage bin. If there is more than one least busy available site, any one of the least busy available sites can be selected as the incoming storage site. Among them, the available site with the smallest site busy degree is the least busy available site.

[0110] In another embodiment, the degree of association between the commodity attribute information of the bins already placed on each available site and the commodity attribute information of the incoming storage bin is used to indicate that there is a bin among the bins already placed on each available site that includes the same commodity attribute information as the incoming storage bin. Furthermore, based on this degree of association, the available site where the bin with the same commodity attribute information as the incoming storage bin is located can be used as the incoming storage site for the incoming storage bin.

[0111] For example, a commodity number can be set for each bin, and the bins corresponding to the same attribute information have the same commodity number. It can be determined whether the commodity numbers of the bins already placed on each available site are the same as the commodity number of the incoming storage bin according to the commodity number of each bin. If they are the same, then the available site where the bin with the same commodity number is located can be determined as the incoming storage site for the incoming storage bin.

[0112] In a preferred implementation manner, the incoming storage site for the incoming storage bin can be determined through the following steps:

[0113] For each available site in the list of available sites, detect whether the commodity attribute information of the bins already placed on the available site is the same as the commodity attribute information of the incoming storage bin.

[0114] The commodity attribute information here refers to all the commodity attributes of the commodities stored in the bin. The same commodity attribute information means that all commodity attributes are exactly the same. For example, commodity attributes include taste, weight, brand, etc.

[0115] If so, determine the first available site as the warehousing site when the bin to be warehoused is warehoused; among them, there is a bin with the same commodity attribute information as the bin to be warehoused on the first available site.

[0116] Here, if it is detected that the bins already placed on the available site include a bin with the same commodity attribute information as the bin to be warehoused, determine the first available site where the bin with the same commodity attribute information as the bin to be warehoused is located as the warehousing site when the bin to be warehoused is warehoused.

[0117] If not, determine the second available site as the warehousing site when the bin to be warehoused is warehoused; among them, the number of bins already placed on the second available site is the least among the numbers of bins already placed on all available sites.

[0118] Here, if it is detected that the bins already placed on the available site do not include a bin with the same commodity attribute information as the bin to be warehoused, determine the second available site as the warehousing site when the bin to be warehoused is warehoused; among them, the number of bins already placed on the second available site is the least among the numbers of bins already placed on all available sites.

[0119] In an alternative implementation, when the bin to be stored enters the sub-warehouse, it will first trigger the algorithm for selecting the storage site. Specifically, after sorting the multiple storage areas in the warehouse, a storage area list is constructed with all storage areas arranged according to the storage area sorting. In the WES system, the storage area list is cycled through in order of storage area sorting. For each storage area, the following process is to be executed: First, it is determined whether the storage site for the bin to be stored has been selected. Process 1: If the storage site has been selected, it is then determined whether the storage area list has been cycled through. If it has not been cycled through, for the next storage area in the storage area list, it is continued to determine whether the storage site has been selected (the selected storage site here is for the bin to be stored. If the storage site for the bin to be stored has been selected, then for any storage area in the storage area list, the output result is that the storage site has been selected). If the storage area list has been cycled through, the output result is given, and the output result is the selected storage site. Process 2: If the storage site has not been selected, the available sites in this storage area are collected, and an available site list is established according to the site busyness. If there are no available sites, the established available site list is an empty set. If the available site list is an empty set, for the next storage area in the storage area list, it is continued to determine whether the storage site has been selected; if the available site list is not an empty set, the available site list is cycled through. For each site in the available site list, the commodity attribute information of all the bins on that site is obtained, and it is determined whether there is a bin with the same commodity attribute information as the bin to be stored on that site. If there is, that site is selected as the storage site; if not, it is determined whether the available site list has been cycled through. If it has not been cycled through, the available site list is continued to be cycled through, and the following step is continued for the next site in the available site list: obtaining the commodity attribute information of all the bins on that site and determining whether there is a bin with the same commodity attribute information as the bin to be stored on that site, until the cycle is completed, which means that there is no site with the same commodity attribute information as the bin to be stored. At this time, the least busy site is selected as the storage site for the bin to be stored.

[0120] In step S220, the first storage location information of the target bin stored in the target storage area and the storage availability of the target storage area are determined; wherein, the bin to be stored is the bin with the same commodity attribute information as the bin to be stored; the storage availability includes the storage utilization rate of the aisle and the storage utilization rate of each column on the shelf.

[0121] In this step, the target bin is the bin with the same commodity attribute information as the bin to be warehoused, and the target bin has been stored in the target storage area. Furthermore, the stored target bin refers to the bin with the same commodity attribute information as the bin to be warehoused and stored in the target storage area. Here, the stored target bin can include the bin that has been stored in the target storage area at the current moment and has the same commodity attribute information as the bin to be warehoused, and also includes the bin that has been determined by the WES system to be about to be stored and has the same commodity attribute information as the bin to be warehoused.

[0122] Furthermore, the storage availability includes the storage utilization rate of the aisle and the storage utilization rate of each column on the shelf. Among them, the storage utilization rate of the aisle is determined according to the ratio between the number of occupied storage locations on the shelves on both sides of the aisle and the number of all storage locations on the shelves on both sides of the aisle. The number of occupied storage locations on the shelves on both sides of the aisle refers to the number of occupied storage locations on the shelves on both sides of the aisle determined by the WES system; the storage utilization rate of each column on the shelf is determined according to the ratio between the number of occupied storage locations in each column on the shelf and the number of all storage locations in that column.

[0123] For example, assume that there are 200 storage locations on each of the shelves on both sides of A aisle, and the storage locations on the shelf are arranged in the form of 20 rows and 10 columns; then the number of storage locations on the shelves on both sides of A aisle is 400. If the WES system determines that 60 storage locations will store bins, and these 60 storage locations include 50 storage locations that have already stored bins, and there are 10 storage locations that do not have bins yet, but the allocated bins are already on the handling vehicle being transported, then the storage utilization rate of the aisle is (400 - 60) / 400 = 85%; for any one column on the shelves on both sides of A aisle, there are 20 storage locations in each column. If the WES system determines that 9 storage locations will store bins, and these 9 storage locations include 6 storage locations that have already stored bins, and there are 3 storage locations that do not have bins yet, but the allocated bins are already on the handling vehicle being transported, then the storage utilization rate of each column on the shelf is (20 - 9) / 20 = 55%.

[0124] In addition, the storage availability also includes the aisle busyness, and the aisle busyness is determined according to the number of handling vehicles determined for the aisle. When the storage utilization rates of the aisles are the same, the target aisle for storing the bin to be warehoused can be further selected according to the aisle busyness.

[0125] For example, for the above-mentioned A aisle, if the WES system informs that the number of handling vehicles with tasks in this aisle is 5. For example, 3 of these 5 handling vehicles are already on this aisle, and the other two handling vehicles are about to arrive at this aisle, then the aisle busyness is the number of determined handling vehicles, which is 5.

[0126] In step S230, based on the first storage location information, storage availability, the commodity attribute information of the bin to be stored in the warehouse, and the second storage location information corresponding to other bins on the same handling vehicle as the bin to be stored in the warehouse, determine the third storage location information of the bin to be stored in the warehouse within the target storage area.

[0127] Here, other bins refer to the bins that are carried on the same handling vehicle as the bin to be stored in the warehouse and have already been assigned storage locations.

[0128] The second storage location information includes the aisle where other bins are located in the target storage area and the columns where other bins are located on the shelves on both sides of the aisle; the first storage location information includes the aisle where the target bin has been stored in the target storage area and the columns where the target bin has been stored on the shelves on both sides of the aisle. Here, the second storage location information or the first storage location information may include the aisle and the column, but preferably, the second storage location information or the first storage location information includes the aisle and the column, as well as the position information corresponding to the aisle and the column respectively. The position information here can be represented by coordinates.

[0129] Preferably, the target storage location of the bin to be stored in the warehouse within the target storage area can be determined according to the target aisle position and the target column position of the bin to be stored in the warehouse. Here, the target aisle position can be used as the abscissa of the bin to be stored in the warehouse within the target storage area, and the target column position can be used as the ordinate of the bin to be stored in the warehouse within the target storage area. According to the abscissa and ordinate of the bin to be stored in the warehouse within the target storage area, the target storage location of the bin to be stored in the warehouse within the target storage area can be determined, and the target storage location here is the third storage location information.

[0130] Furthermore, step S230 specifically includes:

[0131] Step 2301, construct a first candidate aisle set, a second candidate aisle set, and a third candidate aisle set; among them, the first candidate aisle set refers to the set composed of the aisles in the target storage area that meet the aisle selection conditions, the second candidate aisle set refers to the set composed of the aisles where all other bins are located in the target storage area, and the third candidate aisle set refers to the set composed of the aisles where all the target bins that have been stored are located in the target storage area.

[0132] Step 2302, determine the target aisle of the bin to be stored in the warehouse according to the commodity attribute information of the bin to be stored in the warehouse, the first candidate aisle set, the second candidate aisle set, and the third candidate aisle set.

[0133] Step 2303: Construct the first candidate column set, the second candidate column set, and the third candidate column set. The first candidate column set refers to the set of columns on the shelves on both sides of the target lane that meet the column selection conditions. The second candidate column set refers to the set of columns where all other bins are located on the shelves on both sides of the target lane. The third candidate column set refers to the set of columns where all the target bins that have been stored are located on the shelves on both sides of the target lane.

[0134] Step 2304: Determine the target column of the bin to be stored based on the commodity attribute information of the bin to be stored, the first candidate column set, the second candidate column set, and the third candidate column set.

[0135] Step 2305: Determine the third storage location information of the bin to be stored in the target storage area based on the target lane and the target column.

[0136] Specifically, in Step 2301, construct the first candidate lane set according to the storage location utilization rate of the lanes, construct the second candidate lane set according to the lanes where other bins are located in the target storage area, and construct the third candidate lane set according to the lanes where the target bins that have been stored are located in the target storage area.

[0137] Exemplarily, the first candidate lane set refers to the set of lanes in the target storage area that meet the lane selection conditions. Specifically, construct the first candidate lane set through the following steps:

[0138] Sort all the lanes in the target storage area according to the lane parameters of the lanes to obtain the lane position sorting of all the lanes in the target storage area. The lane parameters include the storage location utilization rate of the lanes. Select the first target number of lanes in the lane position sorting to form the first candidate lane set.

[0139] Here, the lane position can be represented by coordinates. Sort the lane positions corresponding to all the lanes in ascending order according to the storage location utilization rate of the lanes to obtain the lane position sorting of all the lanes in the target storage area.

[0140] For example, for a certain storage area in a warehouse, the aisles are numbered in a certain order (such as from the left side to the right side of the storage area), successively as aisle 1, 2, 3, 4... 21. Among them, an aisle is formed between two rows of shelves that are relatively arranged at intervals. Here, the aisle position can be directly represented by the number. Furthermore, in order to clearly represent the position of the aisle, coordinates need to be used for representation. The aisles are numbered with abscissas in the order from left to right, and the aisles are numbered with ordinates in the direction from near the conveyor line body to away from the conveyor line body. The aisles corresponding to the first row of shelves are successively aisle (1,1), (1,2), (1,3)... (1,8), and the aisles corresponding to the second row of shelves are successively (2,1), (2,2)... (2,8).Furthermore, taking the third storage area 230 as an example, the first row of shelves from left to right are a1 (10 occupied storage positions), b1 (20 occupied storage positions), c1 (20 occupied storage positions), d1 (0 occupied storage positions), e1 (10 occupied storage positions), f1 (45 occupied storage positions), g1 (20 occupied storage positions), h1 (42 occupied storage positions), i1 (30 occupied storage positions). The second row of shelves from left to right are a2 (5 occupied storage positions), b2 (2 occupied storage positions), c2 (14 occupied storage positions), d2 (28 occupied storage positions), e2 (10 occupied storage positions), f2 (17 occupied storage positions), g2 (20 occupied storage positions), h2 (28 occupied storage positions), i2 (30 occupied storage positions). Among them, the specifications of the first row of shelves and the second row of shelves are unified, and each shelf has 50 storage positions. Furthermore, the shelves on both sides of the roadway (1,1) are shelf a1 and shelf b1, and the corresponding storage position utilization rate is 30 / 100 = 30%. The shelves on both sides of the roadway (1,2) are shelf b1 and shelf c1, and the corresponding storage position utilization rate is 40%. And so on, the storage position utilization rate corresponding to the roadway (1,3) is 20%, the storage position utilization rate corresponding to the roadway (1,4) is 10%, the storage position utilization rate corresponding to the roadway (1,5) is 55%, the storage position utilization rate corresponding to the roadway (1,6) is 65%, the storage position utilization rate corresponding to the roadway (1,7) is 62%, the shelves on both sides of the roadway (1,8) are shelf h1 and shelf i1, and the corresponding storage position utilization rate is 72%. The shelves on both sides of the roadway (2,1) are shelf a2 and shelf b2, and the corresponding storage position utilization rate is 7%. The shelves on both sides of the roadway (2,2) are shelf b2 and shelf c2, and the corresponding storage position utilization rate is 16%. The storage position utilization rate corresponding to the roadway (2,3) is 42%, the storage position utilization rate corresponding to the roadway (2,4) is 38%, the storage position utilization rate corresponding to the roadway (2,5) is 17%, the storage position utilization rate corresponding to the roadway (2,6) is 27%, the storage position utilization rate corresponding to the roadway (2,7) is 48%, the shelves on both sides of the roadway (2,8) are shelf h2 and shelf i2, and the corresponding storage position utilization rate is 58%. Sort all the roadway positions in ascending order according to the storage position utilization rate of the roadway, and obtain the roadway position sorting: roadway (2,1), roadway (1,4), roadway (2,2), roadway (2,5), roadway (1,3), roadway (2,6), roadway (1,1), roadway (2,4), roadway (1,2), roadway (2,3), roadway (2,7), roadway (1,5), roadway (2,8), roadway (1,7), roadway (1,6), roadway (1,8).

[0141] Select the top target number of roadways in the roadway location ranking to form the first candidate roadway set. Here, the target number can be selected according to the actual situation. For example, the target number can be selected as 5.

[0142] For example, when the target number is 5, the first candidate roadway set formed is roadway (2,1), roadway (1,4), roadway (2,2), roadway (2,5), roadway (1,3).

[0143] Furthermore, when the storage availability also includes the roadway busyness, step 2301 further includes:

[0144] Sort all the roadways in the target storage area in ascending order of the storage space utilization rate of the roadways to obtain the initial roadway ranking corresponding to the target storage area; for the roadways with the same storage space utilization rate, sort the roadways with the same storage space utilization rate in ascending order of the roadway busyness to obtain the sub-roadway ranking of the roadways with the same storage space utilization rate; determine the roadway location ranking according to the initial roadway ranking and the sub-roadway ranking.

[0145] Here, for the roadways with the same storage space utilization rate, when it is impossible to determine the roadway location ranking of the two, the roadways with the same storage space utilization rate can be further sorted in ascending order of the roadway busyness to obtain the sub-roadway ranking, so as to obtain the roadway location ranking of all the roadways in the target storage area, and select the top target number of roadways in the roadway location ranking to form the first candidate roadway set.

[0146] In addition, construct the second candidate roadway set through the following steps: form the second candidate roadway set with the roadways where other bins are located in the target storage area. Similarly, construct the third candidate roadway set through the following steps: form the third candidate roadway set with the roadways where the target bins have been stored in the target storage area.

[0147] Exemplarily, the WES system will obtain the roadways where other bins are located in the target storage area, and form the second candidate roadway set with all the roadways where other bins are located in the target storage area. Similarly, the WES system will obtain the roadways where the target bins have been stored in the target storage area, and form the third candidate roadway set with all the roadways where the target bins have been stored in the target storage area.

[0148] In step 2302, determine the target roadway of the bin to be warehoused according to the commodity attribute information of the bin to be warehoused, the first candidate roadway set, the second candidate roadway set, and the third candidate roadway set.

[0149] This step 2302 specifically includes:

[0150] Detect whether the lane corresponding to the lane position of the stored target bin in the target storage area belongs to the third candidate lane set; if it is detected that the lane corresponding to the lane position of the stored target bin in the target storage area does not belong to the third candidate lane set, then detect whether the lanes corresponding to the lane positions of other bins in the target storage area belong to the second candidate lane set; if so, select the lane with the smallest sum of distance differences between all lanes in the second candidate lane set from the first candidate lane set as the target lane; if not, randomly select a lane from the first candidate lane set as the target lane.

[0151] Here, for the bin to be stored in the warehouse, when the third candidate lane set is an empty set, it means that there is no stored target bin with the same commodity attribute information as the bin to be stored in the target storage area. Then, when allocating the bin to be stored in the warehouse, there is no need to consider the storage location of the stored target bin (which can be regarded as the "senior" of the bin to be stored in the warehouse) in the target storage area. Furthermore, continue to check the second candidate lane set to detect whether there are lanes of other bins in the second candidate lane set, that is, to detect whether there are other bins in the target storage area. If there are lanes of other bins in the target storage area, then the lanes of other bins in the target storage area need to be referred to when allocating the lane for the bin to be stored in the warehouse. Specifically, select a lane from the first candidate lane set with the smallest sum of distance differences between all lanes in the second candidate lane set as the target lane.

[0152] Specifically, first determine all lanes in the first candidate lane set, and then determine all lanes in the second candidate lane set. For each lane in the first candidate lane set, it needs to be compared with all lanes in the second candidate lane set; among them, for a one-dimensional target storage area, the lane numbers can be directly subtracted; for the first lane in the first candidate lane set, calculate the difference in distance between the first lane in the first candidate lane set and each lane in the second candidate lane set, and this difference is an absolute value. For a two-dimensional target storage area, the horizontal and vertical coordinates can be subtracted separately and then summed; for the first lane in the first candidate lane set, subtract the horizontal and vertical coordinates of the first lane in the first candidate lane set from the horizontal and vertical coordinates of each lane in the second candidate lane set respectively and then sum to get the difference, and this difference and the result of subtraction are also absolute values. Furthermore, sum up all the obtained differences, and so on, calculate the sum of the differences between all lanes in the first candidate lane set and all lanes in the second candidate lane set, then select the lane with the smallest sum of differences from the first candidate lane set, and use this lane as the target lane for the bin to be stored in the warehouse in the target storage area.

[0153] For example, for a certain storage area in the warehouse, the aisles are numbered in order from left to right as aisle 1, 2, 3, 4... 21. If the first candidate aisle set is determined to be aisle 2, aisle 6, and aisle 21; since there are multiple other bins, there are multiple aisles in the second candidate aisle set, which are aisle 1 and aisle 9 respectively. For aisle 2 in the first candidate aisle set, after calculating the distance differences with all the aisles in the second candidate aisle set and then summing them up, the sum of the distance differences between aisle 2 in the first candidate aisle set and all the aisles in the second candidate aisle set is (2 - 1) + (8 - 2) = 7; similarly, the sum of the distance differences between aisle 6 in the first candidate aisle set and all the aisles in the second candidate aisle set is 8; the sum of the distance differences between aisle 21 in the first candidate aisle set and all the aisles in the second candidate aisle set is 32. Thus, it can be seen that aisle 2 in the first candidate aisle set is selected as the target aisle.

[0154] Further, in order to clearly represent the position of the aisles, coordinates need to be used for representation. The aisles are numbered with abscissas in order from left to right, and the aisles are numbered with ordinates in the direction from close to the conveyor line body to away from the conveyor line body. The aisles corresponding to the first row of shelves are successively aisle (1, 1), (1, 2), (1, 3)... (1, 8), and the aisles corresponding to the second row of shelves are successively (2, 1), (2, 2)... (2, 8). If the first candidate aisle set is determined to be aisle (1, 1), (1, 3), and (2, 8), since there are multiple other bins, there are multiple aisle positions in the second candidate aisle set, which are (1, 8) and (2, 6) respectively. For aisle (1, 1) in the first candidate aisle set, after calculating the distance differences with all the aisles in the second candidate aisle set and then summing them up, the sum of the distance differences between aisle (1, 1) in the first candidate aisle set and all the aisles in the second candidate aisle set is ((1 - 1) + (8 - 1)) + ((2 - 1) + (6 - 1)) = 13. Similarly, the sum of the distance differences between aisle (1, 3) in the first candidate aisle set and all the aisles in the second candidate aisle set can be obtained as 9; the sum of the distance differences between aisle (2, 8) in the first candidate aisle set and all the aisles in the second candidate aisle set is 3. Thus, it can be seen that aisle (2, 8) in the first candidate aisle set is selected as the target aisle.

[0155] Under the condition that there is no lane in the third candidate lane set where the stored target bin is located in the target storage area, if it is detected that there is no lane position in the second candidate lane set where other bins are located in the target storage area, a lane position is randomly selected from the first candidate lane set as the target lane position. Here, under the condition that there is no stored target bin with the same commodity attribute information as the bin to be stored in the target storage area, if there are no other bins in the target storage area either, a lane can be randomly selected from the first candidate lane set as the target lane, that is, a lane is randomly selected as the target lane for the bin to be stored.

[0156] This step 2302 specifically further includes:

[0157] If it is detected that the lane corresponding to the lane position where the stored target bin is located in the target storage area belongs to the third candidate lane set, it is detected whether there are other newly added lanes in the third candidate lane set; where other lanes refer to the newly added lanes in the target storage area for storing the target bin; if it is detected that there are other newly added lanes in the third candidate lane set, a lane with the largest sum of distance differences from all lanes in the third candidate lane set is selected from the first candidate lane set as the target lane; if it is detected that there are no other newly added lanes in the third candidate lane set, it is detected whether the lane corresponding to the lane position where other bins are located in the target storage area belongs to the second candidate lane set; if so, a lane with the smallest sum of distance differences from all lanes in the second candidate lane set is selected from the third candidate lane set as the target lane; if not, a lane is randomly selected from the third candidate lane set as the target lane.

[0158] In this step, if it is detected that there is a lane in the third candidate lane set where the stored target bin is located in the target storage area, it is further detected whether there are other newly added lanes in the third candidate lane set; if it is detected that there are other newly added lanes in the third candidate lane set, a lane with the largest sum of distance differences from all lanes in the third candidate lane set is selected from the first candidate lane set as the target lane.

[0159] Here, first determine whether the number of existing lanes in the third candidate lane set exceeds the first quantity threshold. If it reaches the first quantity threshold, no new lanes will be added; if it does not reach the first quantity threshold, determine whether the minimum number of bins included in the existing lanes in the third candidate lane set exceeds the second quantity threshold; if it exceeds, new lanes will be added to the third candidate lane set; if it does not exceed, no new lanes will be added to the third candidate lane set. Furthermore, the condition for adding lanes is that the number of existing lanes in the third candidate lane set does not exceed the first quantity threshold and the minimum number of bins included in the existing lanes exceeds the second quantity threshold.

[0160] Here, other lanes refer to the lanes newly added in the target storage area for storing the target bins. For each bin to be stored in the warehouse, the so-called "newly added" here means whether the number of lanes in the third candidate lane set increases compared to the number of lanes in the third candidate lane set corresponding to the previous bin to be stored in the warehouse. If the above lane addition condition is met, lanes are added to the third candidate lane set.

[0161] Specifically, a lane with the largest sum of distance differences between all lanes in the third candidate lane set can be selected from the first candidate lane set as the target lane. The implementation method here can refer to the description of "selecting a lane with the smallest sum of distance differences between all lanes in the second candidate lane set from the first candidate lane set as the target lane" in the above first step, and will not be elaborated here.

[0162] Here, it should be noted that when there are stored target bins with the same commodity attribute information as the bin to be stored in the warehouse in the target storage area and the number of stored target bins is increasing, other lanes need to be added to store the bins. To relieve the storage pressure in the target storage area, the bin to be stored in the warehouse and the stored target bins (with the same commodity attribute information as the bin to be stored in the warehouse) can be stored dispersedly. In this way, the same commodities can be both aggregated and dispersed, which can reduce the lane busyness and improve the inventory safety.

[0163] Under the condition that there are lanes with stored target bins in the third candidate lane set, if it is detected that no other lanes are newly added in the third candidate lane set, then it is detected whether there are lanes with other bins in the second candidate lane set; if it is detected that there are lanes with other bins in the second candidate lane set, then a lane with the smallest sum of distance differences between all lanes in the third candidate lane set and all lanes in the second candidate lane set is selected as the target lane.

[0164] Here, when there are stored target bins with the same commodity attribute information as the bin to be stored in the warehouse in the target storage area, first, it is necessary to determine whether new lanes are added in the target storage area. If not, then continue to detect whether there are other bins in the target storage area. If there are other bins, it is necessary to determine the target lane of the bin to be stored in the warehouse in the target storage area according to the storage location of the other bins in the target storage area. Specifically, a lane with the smallest sum of distance differences between all lanes in the third candidate lane set and all lanes in the second candidate lane set can be selected as the target lane. The implementation method here can refer to the description of "selecting a lane with the smallest sum of distance differences between all lanes in the second candidate lane set from the first candidate lane set as the target lane" in the above first step, and will not be elaborated here.

[0165] If it is detected that there is no lane for other bins in the second candidate lane set, a lane is randomly selected from the third candidate lane set as the target lane. Here, under the condition that the target bin has been stored in the target storage area but there are no other bins, the target lane for the bin to be stored can be selected in combination with the lane where the target bin has been stored in the target storage area. Specifically, a lane position can be directly randomly selected from the third candidate lane set as the target lane.

[0166] For example, for a target lane selection process provided in an embodiment of the present application, specifically, first define the first candidate lane set as set N, the second candidate lane set as set M, and the third candidate lane set as set P. Among them, the following process (loop bin) needs to be executed for each bin to be stored: first, construct the first candidate lane set according to the storage utilization rate and lane busy degree of the lane, represented by set N, then construct the second candidate lane set according to the second storage information, represented by set M, and construct the third candidate storage position set according to the first storage information, represented by set P.

[0167] Judge whether set P is an empty set (that is, judge whether there is a stored target bin with the same commodity attribute information as the bin to be stored in the target storage area);

[0168] If set P is an empty set (that is, there is no stored target bin with the same commodity attribute information as the bin to be stored in the target storage area), then continue to judge whether set M is an empty set (that is, judge whether there are other bins in the target storage area). If set M is an empty set (that is, there are no other bins in the target storage area), then randomly select a lane that meets the space requirements from set N; if set M is not an empty set (that is, there are other bins in the target storage area), then determine a lane with the smallest sum of distance differences from all elements of set M according to set N, where the element refers to the lane, that is, select a lane position with the smallest sum of distance differences from all lanes in set M from set N as the target lane.

[0169] If the set P is not an empty set (that is, there is a stored target bin in the target storage area with the same commodity attribute information as the bin to be stored), then determine whether there are new elements in the set P. If there are new elements, determine a lane with the largest sum of distance differences from all elements of the set P according to the set N, where the element refers to a lane, that is, select a lane from the set N with the largest sum of distance differences from all lanes in the set P as the target lane; if there are no new elements, continue to determine whether the set M is an empty set (that is, determine whether there are other bins in the target storage area). If the set M is an empty set (that is, there are no other bins in the target storage area), randomly select a lane that meets the space requirements from the set P; if the set M is not an empty set (that is, there are other bins in the target storage area), determine a lane with the smallest sum of distance differences from all elements of the set M according to the set P, where the element refers to a lane, that is, select a lane from the set P with the smallest sum of distance differences from all lanes in the set M as the target lane.

[0170] In step 2303, construct a first candidate column set, a second candidate column set, and a third candidate column set; where the first candidate column set refers to the set composed of the columns that meet the column selection conditions on the shelves on both sides of the target lane, the second candidate column set refers to the set composed of the columns where all other bins are located on the shelves on both sides of the target lane, and the third candidate column set refers to the set composed of the columns where all stored target bins are located on the shelves on both sides of the target lane.

[0171] Here, construct the first candidate column set according to the storage location utilization rate of each column on the shelves on both sides of the target lane, construct the second candidate column set according to the column positions where other bins are located on the shelves on both sides of the target lane, and construct the third candidate column set according to the column positions where the stored target bins are located on the shelves on both sides of the target lane.

[0172] Specifically, the WES system pre-obtains the positions of each column on the shelf, where the column position can be represented as a coordinate; sort the column positions corresponding to all columns on the shelf in ascending order of the storage location utilization rate of each column on the shelf to obtain the column position sorting of all column positions on the shelf. Select the column positions that meet the preset column selection conditions to form the first candidate column set. The preset column selection conditions can be to select the top m, and m can be selected according to the actual situation. For example, m can be selected as 3. In this way, the first candidate column set can be determined in the same way as determining the first candidate lane set, which will not be elaborated here.

[0173] Furthermore, construct the second candidate column set through the following steps: form the second candidate column set with the column positions where other bins are located in the target storage area. Similarly, construct the third candidate column set through the following steps: form the third candidate column set with the column positions where the stored target bins are located in the target storage area.

[0174] Here, it should be noted that bins with the same commodity attributes are placed in the same column during storage. Furthermore, after determining the target aisle in the embodiment of the present application, the target column is further determined.

[0175] In step 2304, based on the commodity attribute information of the bin to be warehoused, the first candidate column set, the second candidate column set, and the third candidate column set, the target column of the bin to be warehoused is determined.

[0176] The selection method for the target column is similar to the selection method for the target aisle in step 2302, and will not be elaborated here.

[0177] In step 2305, based on the target aisle and the target column, the third storage location information of the bin to be warehoused in the target storage area is determined.

[0178] Here, the target aisle is used as the abscissa of the bin to be warehoused in the target storage area, and the target column is used as the ordinate of the bin to be warehoused in the target storage area. Based on the abscissa and ordinate of the bin to be warehoused in the target storage area, the third storage location information of the bin to be warehoused in the target storage area is determined. The third storage location information includes the target storage location of the bin to be warehoused in the target storage area.

[0179] Specifically, based on the target aisle, the two shelf positions where the bin to be warehoused should be stored can be determined. In fact, the target aisle corresponds to the positions of two shelves in the target storage area. Then, based on the target column, it can be specifically determined which column of the shelf the bin to be warehoused is on. That is to say, from the perspective of looking down at the target storage area, it can be considered that the target aisle is the abscissa and the target column is the ordinate, and the target storage location of the bin to be warehoused in the target storage area can be specifically determined through the abscissa and ordinate.

[0180] In step S240, according to the third storage location information, the operation of transporting the bin to be warehoused from the warehousing station to the corresponding storage location is performed.

[0181] In this step, the handling vehicle is controlled to transport the bin to be warehoused from the warehousing station to the target storage location corresponding to the third storage location information.

[0182] Here, when the bin to be warehoused is picked up by the corresponding handling vehicle, it will trigger the storage location selection algorithm of the WES system, and then control the handling vehicle to transport the bin to be warehoused from the warehousing station to the target storage location.

[0183] The embodiments of the present application can select the inbound station and the target storage area corresponding to the inbound station according to the storage utilization rate of each storage area and the station busyness of the available stations in the storage area, so that the inbound of the bins is reasonable and efficient; by combining the first storage location information, the second storage location information, the storage utilization rate of the roadway, and the storage utilization rate of each column on the shelf, the relatively reasonable storage location of the bins to be inbound can be analyzed. Furthermore, while ensuring that the storage layout of the bins with the same commodity attribute information is convenient for management and easy to trace the source of the commodity, the travel distance of the forklift is reduced and time is saved. The commodities with the same commodity attribute information are aggregated and dispersed at the same time, which reduces the roadway busyness and has a higher inventory safety level. It can improve the rationality of the storage location allocation of the bins, provide great convenience for the outbound of the bins, and thus improve the outbound efficiency of the bins.

[0184] Specifically, the embodiments of the present application can combine the storage utilization rate of each storage area, the existing bins and busyness on the station, the commodity attribute information and the shelf layout, as well as the allocated results of other bins with the forklift, etc., to provide great convenience for the outbound of the bins, reduce the travel distance and time cost of the forklift; the commodities with the same commodity attribute information are aggregated and dispersed at the same time, which reduces the roadway busyness and has a higher inventory safety level. It can improve the rationality of the storage location allocation of the bins, and thus improve the outbound efficiency of the bins. Finally, each link in the entire chain reaches a reasonable and efficient state and the inventory layout meets the requirements of the outbound business.

[0185] Based on the same inventive concept, the embodiments of the present application also provide a bin inbound device corresponding to the bin inbound method. Since the principle of solving problems by the device in the embodiments of the present application is similar to the above-mentioned bin inbound method in the embodiments of the present application, the implementation of the device can refer to the implementation of the method, and the repeated parts will not be elaborated.

[0186] Please refer to Figure 3 , Figure 3 which is a schematic structural diagram of a bin inbound device provided by the embodiments of the present application. The bin inbound device provided by the embodiments of the present application is used to transport the bins to be inbound into the warehouse. The warehouse is divided into multiple storage areas, and each storage area includes at least one bin transfer station and at least one shelf. The storage locations for storing bins on the shelf are arranged in a matrix layout. As Figure 3 shown in

[0187] a station selection module 310, configured to determine the target storage area when the bins to be inbound are inbound and the corresponding inbound station in the target storage area according to the storage utilization rate of each storage area and the station busyness of the available stations in the storage area;

[0188] An information determination module 320 is configured to determine the first storage location information of the target bin stored in the target storage area and the storage availability of the target storage area; wherein, the target bin is a bin with the same commodity attribute information as the bin to be warehoused; the storage availability includes the storage utilization rate of the aisle and the storage utilization rate of each column on the shelf;

[0189] A storage location determination module 330 is configured to determine the third storage location information of the bin to be warehoused in the target storage area according to the first storage location information, the storage availability, the commodity attribute information of the bin to be warehoused, and the second storage location information corresponding to other bins on the same handling vehicle as the bin to be warehoused;

[0190] An execution handling module 340 is configured to execute the operation of handling the bin to be warehoused from the warehousing site to the corresponding storage location according to the third storage location information.

[0191] Optionally, the site selection module 310 is specifically configured to:

[0192] Create a storage area list according to the storage utilization rates of each storage area;

[0193] For each storage area in the storage area list, create a list of available sites according to the site busy degrees of all available sites in this storage area;

[0194] Determine the warehousing site when the bin to be warehoused is warehoused according to the commodity attribute information of the bins already placed on each available site in the available site list and the commodity attribute information of the bin to be warehoused, and determine the storage area corresponding to the warehousing site as the target storage area.

[0195] Optionally, the site selection module 310 is specifically further configured to:

[0196] Sort the multiple storage areas in ascending order of storage utilization rate to obtain the initial storage area sorting of all storage areas;

[0197] Determine the difference in storage utilization rate between any two storage areas;

[0198] If it is detected that the difference in storage utilization rate is not greater than the target utilization rate difference threshold, then determine the difference in the number of boxes between these two storage areas according to the number of target boxes already stored in these two storage areas;

[0199] If the difference in the number of boxes is not greater than the target box number difference threshold, then update the order of the storage areas in the initial storage area sorting, and determine the storage area list based on the updated storage area sorting.

[0200] Optionally, the site selection module 310 is specifically further configured to:

[0201] For each available site in the list of available sites, detect whether the product attribute information of the bins placed on the available site is the same as the product attribute information of the bin to be warehoused.

[0202] If so, determine the first available site as the warehousing site when the bin to be warehoused is warehoused; wherein, there is a bin on the first available site with the same product attribute information as the bin to be warehoused.

[0203] If not, determine the second available site as the warehousing site when the bin to be warehoused is warehoused; wherein, the number of bins already placed on the second available site is the least among the numbers of bins already placed on all available sites.

[0204] Optionally, the second storage location information includes the aisle where the other bins are located in the target storage area and the column where the other bins are located on the shelves on both sides of the aisle; the first storage location information includes the aisle where the target bin has been stored in the target storage area and the column where the target bin has been stored on the shelves on both sides of the aisle; the storage location determination module 330 is specifically configured to:

[0205] Construct a first candidate aisle set, a second candidate aisle set, and a third candidate aisle set; wherein, the first candidate aisle set refers to the set of aisles in the target storage area that meet the aisle selection conditions, the second candidate aisle set refers to the set of aisles where all other bins are located in the target storage area, and the third candidate aisle set refers to the set of aisles where all the target bins that have been stored are located in the target storage area;

[0206] Determine the target aisle of the bin to be warehoused according to the product attribute information of the bin to be warehoused, the first candidate aisle set, the second candidate aisle set, and the third candidate aisle set.

[0207] Construct a first candidate column set, a second candidate column set, and a third candidate column set; wherein, the first candidate column set refers to the set of columns on the shelves on both sides of the target aisle that meet the column selection conditions, the second candidate column set refers to the set of columns where all other bins are located on the shelves on both sides of the target aisle, and the third candidate column set refers to the set of columns where all the target bins that have been stored are located on the shelves on both sides of the target aisle;

[0208] Determine the target column of the bin to be warehoused according to the product attribute information of the bin to be warehoused, the first candidate column set, the second candidate column set, and the third candidate column set.

[0209] Determine the third storage location information of the bin to be warehoused in the target storage area according to the target aisle and the target column.

[0210] Optionally, the storage location determination module 330 is configured to construct a first candidate roadway set through the following steps:

[0211] Sort all the roadways in the target storage area according to the roadway parameters of the roadways to obtain the roadway position sorting of all the roadways in the target storage area; wherein, the roadway parameters include the storage location utilization rate of the roadways.

[0212] Select the first target number of roadways in the roadway position sorting to form a first candidate roadway set.

[0213] Optionally, the storage location determination module 330 is specifically configured to:

[0214] Sort all the roadways in the target storage area in ascending order of the storage location utilization rate of the roadways to obtain the initial roadway sorting corresponding to the target storage area.

[0215] For the roadways with the same storage location utilization rate, sort the roadways with the same storage location utilization rate in ascending order of the roadway busyness degree to obtain the sub-roadway sorting of the roadways with the same storage location utilization rate.

[0216] Determine the roadway position sorting according to the initial roadway sorting and the sub-roadway sorting.

[0217] Optionally, the storage location determination module 330 is further specifically configured to:

[0218] Detect whether the roadway corresponding to the roadway position of the stored target bin in the target storage area belongs to the third candidate roadway set.

[0219] If it is detected that the roadway corresponding to the roadway position of the stored target bin in the target storage area does not belong to the third candidate roadway set, then detect whether the roadway corresponding to the roadway position of other bins in the target storage area belongs to the second candidate roadway set.

[0220] If so, select the roadway with the smallest sum of distance differences between all the roadways in the first candidate roadway set and all the roadways in the second candidate roadway set as the target roadway.

[0221] If not, randomly select a roadway from the first candidate roadway set as the target roadway.

[0222] Optionally, the storage location determination module 330 is further specifically configured to:

[0223] If it is detected that the roadway corresponding to the roadway position of the stored target bin in the target storage area belongs to the third candidate roadway set, then detect whether there are other new roadways in the third candidate roadway set; wherein, the other roadways refer to the new roadways in the target storage area for storing the target bin.

[0224] If it is detected that there are other lanes newly added to the third candidate lane set, then select, from the first candidate lane set, a lane with the largest sum of distance differences between all lanes in the third candidate lane set as the target lane;

[0225] If it is detected that there are no other lanes newly added to the third candidate lane set, then detect whether the lanes corresponding to the lane positions of other bins in the target storage area belong to the second candidate lane set;

[0226] If so, then select, from the third candidate lane set, a lane with the smallest sum of distance differences between all lanes in the second candidate lane set as the target lane;

[0227] If not, then randomly select a lane from the third candidate lane set as the target lane.

[0228] The embodiments of the present application further provide a computer-readable storage medium, on which a computer program / instructions are stored, and when the computer program / instructions are executed by a processor, the following is implemented Figure 2 The above-mentioned bin warehousing method.

[0229] The embodiments of the present application further provide a computer program product, including a computer program / instructions, and when the computer program / instructions are executed by a processor, the following is implemented Figure 2 The above-mentioned bin warehousing method.

[0230] Those skilled in the art can clearly understand that, for the convenience and conciseness of description, the specific working processes of the above-described system, device, and unit can refer to the corresponding processes in the foregoing method embodiments, and will not be elaborated herein.

[0231] In several embodiments provided by the present application, it should be understood that the disclosed system, device, and method can be implemented in other ways. The device embodiments described above are merely illustrative. For example, the division of the units is only a logical function division, and there may be other division methods in actual implementation. For another example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point, the displayed or discussed mutual coupling or direct coupling or communication connection may be through some communication interfaces, and the indirect coupling or communication connection of the device or unit may be in an electrical, mechanical, or other form.

[0232] The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0233] In addition, in each embodiment of the present application, each functional unit can be integrated into a processing unit, can exist physically alone for each unit, or two or more units can be integrated into one unit.

[0234] If the above-mentioned function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a non-volatile computer-readable storage medium executable by a processor. Based on such an understanding, the technical solution of the present application, in essence, or the part that contributes to the prior art, or a part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in each embodiment of the present application. The foregoing storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical discs that can store program codes.

[0235] Finally, it should be noted that: the above-mentioned embodiments are only specific implementation manners of the present application, used to illustrate the technical solutions of the present application, rather than limiting it. The protection scope of the present application is not limited thereto. Although the present application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: any person skilled in the art within the technical scope disclosed by the present application can still modify the technical solutions recorded in the foregoing embodiments, or can easily think of changes, or perform equivalent replacements for some of the technical features; and these modifications, changes or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present application, and should all be covered by the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A method for bin warehousing, characterized in that, The method is used to transport the bins to be stored into the warehouse, which is divided into multiple storage areas. Each storage area includes at least one bin transfer station and at least one shelf. The storage locations for storing bins on the shelf are arranged in a matrix layout; the method includes: Determine the target storage area for the bin to be stored and the corresponding storage station in the target storage area when the bin is stored according to the storage location utilization rate of each storage area and the station busy degree of the available stations in the storage area; Determine the first storage location information of the target bin already stored in the target storage area and the storage free degree of the target storage area; wherein, the target bin is a bin with the same commodity attribute information as the bin to be stored; the storage free degree includes the storage location utilization rate of the aisle and the storage location utilization rate of each column on the shelf; the first storage location information includes the aisle where the target bin is stored in the target storage area and the column where the target bin is stored on the shelves on both sides of the aisle; Determine the third storage location information of the bin to be stored in the target storage area according to the first storage location information, the storage free degree, the commodity attribute information of the bin to be stored, and the second storage location information corresponding to other bins on the same handling vehicle as the bin to be stored; the second storage location information includes the aisle where the other bin is stored in the target storage area and the column where the other bin is stored on the shelves on both sides of the aisle; the third storage location information includes the target storage location of the bin to be stored in the target storage area, and the target storage location includes the target aisle and the target column; Control the handling vehicle to transport the bin to be stored from the storage station to the target storage location corresponding to the third storage location information.

2. The method according to claim 1, wherein The step of determining the target storage area for the bin to be stored and the corresponding storage station in the target storage area when the bin is stored according to the storage location utilization rate of each storage area and the station busy degree of the available stations in the storage area includes: Create a storage area list according to the storage location utilization rate of each storage area; For each storage area in the storage area list, create an available station list according to the station busy degree of all available stations in the storage area; Determine the storage station for the bin to be stored when it is stored according to the commodity attribute information of the bins already placed on each available station in the available station list and the commodity attribute information of the bin to be stored, and determine the storage area corresponding to the storage station as the target storage area.

3. The method according to claim 2, wherein The step of creating a storage area list according to the storage location utilization rate of each storage area includes: Sort the multiple storage areas in ascending order of the storage location utilization rate to obtain the initial storage area sorting of all storage areas; Determine the difference in storage location utilization rate between any two storage areas; If it is detected that the difference in storage location utilization rate is not greater than the target utilization rate difference threshold, then determine the difference in the number of bins between these two storage areas according to the number of target bins already stored in these two storage areas; If the difference in the number of bins is not greater than the target bin number difference threshold, update the order of the storage areas in the initial storage area sorting, and determine the storage area list based on the updated storage area sorting.

4. The method according to claim 2, characterized in that The steps of determining the inbound site for the inbound bin based on the commodity attribute information of the bins already placed on each available site in the available site list and the commodity attribute information of the inbound bin include: For each available site in the available site list, detect whether the commodity attribute information of the bins already placed on the available site is the same as the commodity attribute information of the inbound bin; If so, determine the first available site as the inbound site for the inbound bin; wherein, there is a bin with the same commodity attribute information as the inbound bin on the first available site; If not, determine the second available site as the inbound site for the inbound bin; wherein, the number of bins already placed on the second available site is the least among the number of bins already placed on all available sites.

5. The method according to any one of claims 1-4, characterized in that, The steps of determining the third storage location information of the inbound bin in the target storage area based on the first storage location information, the storage availability, the commodity attribute information of the inbound bin, and the second storage location information corresponding to other bins on the same handling vehicle as the inbound bin include: Construct a first candidate roadway set, a second candidate roadway set, and a third candidate roadway set; wherein, the first candidate roadway set refers to the set of roadways in the target storage area that meet the roadway selection conditions, the second candidate roadway set refers to the set of roadways where all other bins are located in the target storage area, and the third candidate roadway set refers to the set of roadways where all the target bins already stored are located in the target storage area; Determine the target roadway of the inbound bin according to the commodity attribute information of the inbound bin, the first candidate roadway set, the second candidate roadway set, and the third candidate roadway set; Construct a first candidate column set, a second candidate column set, and a third candidate column set; wherein, the first candidate column set refers to the set of columns on the shelves on both sides of the target roadway that meet the column selection conditions, the second candidate column set refers to the set of columns where all other bins are located on the shelves on both sides of the target roadway, and the third candidate column set refers to the set of columns where all the target bins already stored are located on the shelves on both sides of the target roadway; Determine the target column of the inbound bin according to the commodity attribute information of the inbound bin, the first candidate column set, the second candidate column set, and the third candidate column set; Determine the third storage location information of the inbound bin in the target storage area according to the target roadway and the target column.

6. The method according to claim 5, wherein Construct the first candidate roadway set through the following steps: Sort all the roadways in the target storage area according to the roadway parameters of the roadways to obtain the roadway position sorting of all the roadways in the target storage area; wherein, the roadway parameters include the storage utilization rate of the roadways; Select the first target number of roadways in the roadway position sorting to form the first candidate roadway set.

7. The method according to claim 6, wherein Sorting all the roadways in the target storage area according to the roadway parameters of the roadway to obtain the roadway position sorting of all the roadways in the target storage area includes: Sorting all the roadways in the target storage area in ascending order of the storage space utilization rate of the roadways to obtain the initial roadway sorting corresponding to the target storage area; For roadways with the same storage space utilization rate, sorting the roadways with the same storage space utilization rate in ascending order of the roadway busyness to obtain the sub-roadway sorting of the roadways with the same storage space utilization rate; Determine the roadway position sorting according to the initial roadway sorting and the sub-roadway sorting.

8. The method according to claim 5, wherein The steps of determining the target roadway of the incoming bin according to the commodity attribute information of the incoming bin, the first candidate roadway set, the second candidate roadway set, and the third candidate roadway set include: Detect whether the roadway corresponding to the roadway position of the stored target bin in the target storage area belongs to the third candidate roadway set; If it is detected that the roadway corresponding to the roadway position of the stored target bin in the target storage area does not belong to the third candidate roadway set, then detect whether the roadway corresponding to the roadway position of other bins in the target storage area belongs to the second candidate roadway set; If so, select the roadway with the smallest sum of distance differences between all the roadways in the second candidate roadway set from the first candidate roadway set as the target roadway; If not, randomly select a roadway from the first candidate roadway set as the target roadway.

9. The method according to claim 8, wherein The steps of determining the target roadway position of the incoming bin according to the commodity attribute information of the incoming bin, the first candidate roadway set, the second candidate roadway set, and the third candidate roadway set further include: If it is detected that the roadway corresponding to the roadway position of the stored target bin in the target storage area belongs to the third candidate roadway set, then detect whether there are other new roadways in the third candidate roadway set; where the other roadways refer to the newly added roadways in the target storage area for storing the target bin; If it is detected that there are other new roadways in the third candidate roadway set, then select the roadway with the largest sum of distance differences between all the roadways in the third candidate roadway set from the first candidate roadway set as the target roadway; If it is detected that there are no other new roadways in the third candidate roadway set, then detect whether the roadway corresponding to the roadway position of other bins in the target storage area belongs to the second candidate roadway set; If so, select the roadway with the smallest sum of distance differences between all the roadways in the second candidate roadway set from the third candidate roadway set as the target roadway; If not, randomly select a roadway from the third candidate roadway set as the target roadway.

10. An electronic device, comprising a memory, a processor, and a computer program stored on the memory, characterized in that The processor executes the computer program to implement the bin warehousing method according to any one of claims 1-9.

11. A computer-readable storage medium having computer programs / instructions stored thereon, characterized in that, When the computer program / instructions are executed by the processor, the bin warehousing method according to any one of claims 1-9 is implemented.

12. A computer program product, comprising a computer program / instructions, characterized in that, When the computer program / instructions are executed by the processor, the bin warehousing method according to any one of claims 1-9 is implemented.

Images