CN114881564A

CN114881564A - Multi-deep goods location allocation method and device, computer equipment and storage medium

Info

Publication number: CN114881564A
Application number: CN202210537820.9A
Authority: CN
Inventors: 王铎; 余周斌; 李博; 付洋洋; 谷春光
Original assignee: Zhejiang Galaxis Technology Group Co Ltd
Current assignee: Zhejiang Galaxis Technology Group Co Ltd
Priority date: 2022-05-18
Filing date: 2022-05-18
Publication date: 2022-08-09

Abstract

The application relates to a multi-deep goods space allocation method, a multi-deep goods space allocation device, computer equipment and a storage medium. The method comprises the following steps: for the current warehousing task, screening out idle goods positions matched with the goods corresponding to the current warehousing task from the warehouse, and forming an idle goods position set; screening a target idle goods space set from the idle goods space sets according to the principle that the number of idle goods spaces in a single roadway is large and the number of tasks being executed in a goods shelf layer is small; and selecting the target idle goods position with the closest distance from the current position of the carrying trolley executing the current warehousing task from the target idle goods position set as the warehousing goods position of the goods corresponding to the current warehousing task. The idle goods space set can be screened according to the principle that the number of idle goods spaces in a single roadway is large and the number of tasks being executed in a goods shelf layer is small, so that the warehousing task quantities of different warehousing dimensions are averaged, the excessive warehousing task quantity of certain warehousing dimensions and the excessive warehousing task quantity of certain warehousing dimensions are avoided, and the warehousing efficiency is improved.

Description

Multi-deep goods location allocation method and device, computer equipment and storage medium

Technical Field

The application relates to the technical field of warehouse logistics, in particular to a multi-deep goods space distribution method and device, computer equipment and a storage medium.

Background

In recent years, along with the development of society and the prosperity of the electronic commerce industry, in order to improve the warehouse efficiency, modern logistics construction and warehouse transformation are performed in a plurality of logistics centers, in the transformation process, in order to better utilize the limited space of a warehouse, the goods storage as much as possible is realized on the minimum occupied area in the warehouse, the stock turnover rate is improved, and the automatic warehouse in the mode of carrying trolleys and storage with multiple deep goods positions frequently appears in the warehouse transformation and the new warehouse construction. In the mode, a plurality of storage units are continuously arranged in the channel for multi-deep goods storage, the goods are stored and taken out by the carrying trolley, and the goods can be rapidly taken out from the multi-layer warehouse in a very fast time by matching with the dispatching and the cooperation of a plurality of sets of logistics equipment such as a lifting machine, a goods-to-people sorting station, a conveying line and the like, and are conveyed to a specified position. Compared with a tray shelf, a fluent shelf, an automatic stereoscopic warehouse or an overhead warehouse, the multi-deep storage has the advantages that the space utilization rate is obviously higher, and more applicable scenes are provided. In addition, the goods of different varieties, different lengths or different specifications can be stored and taken out by matching the carrying trolley. Since the allocation of goods positions during warehousing directly affects the warehousing operation efficiency of the warehouse, a method for allocating goods positions is urgently needed for the warehouse with multiple deep goods position storage.

Disclosure of Invention

In view of the above, it is desirable to provide a method, an apparatus, a computer device and a storage medium for allocating a plurality of deep cargo spaces, which can improve the efficiency of warehousing.

In a first aspect, the present application provides a multi-deep cargo space allocation method. The method comprises the following steps:

for the current warehousing task, screening out idle goods positions matched with the goods corresponding to the current warehousing task from the warehouse, and forming an idle goods position set; the spare goods space set comprises goods space information of each spare goods space, and the goods space information comprises a tunnel to which the goods space belongs and a shelf layer to which the goods space belongs;

screening a target idle goods space set from the idle goods space sets according to the principle that the number of idle goods spaces in a single roadway is large and the number of tasks being executed in a goods shelf layer is small;

and selecting the target idle goods position with the closest distance from the current position of the carrying trolley executing the current warehousing task from the target idle goods position set as the warehousing goods position of the goods corresponding to the current warehousing task.

In one embodiment, the current warehousing task means that whether a delivered ex-warehouse task exists or not is judged for the goods which reach the warehousing point, and if yes, warehousing processing is not performed; and if not, determining the goods arriving at the warehousing point as the current warehousing task.

In one embodiment, the screening out the free goods space adapted to the goods corresponding to the current warehousing task in the warehouse includes:

determining the goods position of the goods in the warehouse, which has the same management information as the current warehousing task, wherein the management information is used as a judgment basis for the goods with the possibility of being simultaneously taken out of the warehouse;

and determining the idle goods position matched with the goods corresponding to the current warehousing task in the idle goods positions in the same group with the occupied goods positions.

In one embodiment, the management information includes at least one of wave number information or an affiliated demand party, and the wave number information includes delivery wave number or loading wave number.

In one embodiment, each set of cargo space includes a shallow cargo space and at least one deep cargo space; determining the idle goods position matched with the goods corresponding to the current warehousing task in the idle goods positions in the same group with the occupied goods positions, wherein the idle goods position matched with the goods corresponding to the current warehousing task comprises the following steps:

acquiring a storage allocation type mark, wherein the storage allocation type mark is used for indicating the priority of the idle deep goods position and the idle shallow goods position during allocation;

if the storage allocation type mark indicates that the priority of the idle shallow cargo space is higher, judging whether a shallow cargo space in the same group with the occupied cargo space is idle or not and whether the deep cargo space is completely occupied or not, and if so, forming an alternative idle cargo space set by the idle shallow cargo space in the same group with the occupied cargo space;

and if the set of the spare goods spaces is empty, adding spare deep goods spaces in the same group with the occupied goods spaces into the set of the spare goods spaces.

In one embodiment, the method further comprises:

and determining idle goods positions matched with the goods corresponding to the current warehousing task from the candidate idle goods position set according to a first preset rule, wherein the first preset rule comprises that the total number of the idle goods positions in the shelf layer to which the goods positions belong is greater than the number of the reserved goods positions, the shelf layer to which the goods positions belong has an adjustable carrying trolley, and the conveying lines and the lifting machines corresponding to the goods positions are in an allocable state.

In one embodiment, the method further comprises:

and if the spare goods positions meeting the first preset rule in the spare goods position set do not exist, determining the spare goods positions matched with the goods corresponding to the current warehousing task from the spare goods position set according to a second preset rule, wherein the second preset rule comprises that the total number of the spare goods positions in the shelf layer to which the goods positions belong is more than the number of the reserved goods positions.

In one embodiment, determining an idle slot adapted to a cargo corresponding to the current warehousing task from the candidate idle slot set includes:

and for each idle goods space in the alternative idle goods space set, obtaining the goods space information of each idle goods space, and selecting the idle goods space with more idle goods spaces in the tunnel and less task quantity being executed in the goods shelf layer as the idle goods space matched with the goods corresponding to the current warehousing task.

In a second aspect, the present application further provides a multi-deep cargo space distribution device. The device comprises:

the first screening module is used for screening out the idle goods positions matched with the goods corresponding to the current warehousing task from the warehouse for the current warehousing task and forming an idle goods position set; the spare goods space set comprises goods space information of each spare goods space, and the goods space information comprises a tunnel to which the goods space belongs and a shelf layer to which the goods space belongs;

the second screening module is used for screening a target idle goods space set from the idle goods space set according to the principle that the number of idle goods spaces in a single roadway is large and the number of tasks being executed in a goods shelf layer is small;

and the selecting module is used for selecting the target idle goods position which is closest to the current position of the carrying trolley executing the current warehousing task from the target idle goods position set as the warehousing goods position of the goods corresponding to the current warehousing task.

In a third aspect, the present application also provides a computer device. The computer device comprises a memory and a processor, the memory stores a computer program, and the processor realizes the following steps when executing the computer program:

In a fourth aspect, the present application further provides a computer-readable storage medium. A computer-readable storage medium, on which a computer program is stored, which computer program, when being executed by a processor, carries out the steps of:

In a fifth aspect, the present application further provides a computer program product. Computer program product comprising a computer program which, when executed by a processor, performs the steps of:

According to the multi-deep goods location distribution method, the multi-deep goods location distribution device, the computer equipment and the storage medium, the idle goods locations in the warehouse can be screened based on the rule that the goods with the possibility of being delivered from the warehouse are put together, so that the carrying trolley can be prevented from moving back and forth due to goods scattering when being delivered, and the delivery efficiency can be improved. In addition, the idle goods space set can be screened according to the principle that the number of idle goods spaces in a single roadway is large and the number of tasks being executed in a goods shelf layer is small, so that the warehousing task quantities of different warehousing dimensions can be averaged, the excessive warehousing task quantity of certain warehousing dimensions and the excessive warehousing task quantity of certain warehousing dimensions are avoided, and the warehousing efficiency can be improved. And finally, when the carrying trolley executes the task, the carrying trolley can traverse the idle goods positions in the target idle goods position set from the near end to the far end according to the current position to find the nearest idle goods position, so that the warehousing efficiency can be improved.

Drawings

FIG. 1 is a schematic diagram of a warehouse cargo space in one embodiment;

FIG. 2 is a schematic flow chart diagram illustrating a multi-deep cargo space allocation method according to one embodiment;

FIG. 3 is a schematic flow chart of a method for allocating multiple deep cargo spaces in another embodiment;

FIG. 4 is a schematic flow chart illustrating a multi-deep cargo space allocation method according to yet another embodiment;

FIG. 5 is a schematic flow chart illustrating a method for allocating multiple deep cargo spaces in yet another embodiment;

FIG. 6 is a block diagram of a multi-deep cargo space allocation apparatus according to one embodiment;

FIG. 7 is a diagram illustrating an internal structure of a computer device according to an embodiment.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.

The multi-deep goods location allocation method provided by the embodiment of the application can be applied to a warehouse for storing multi-deep goods locations. For ease of understanding, the multi-deep cargo space storage will now be described in conjunction with FIG. 1. Fig. 1 can be seen as a top view of a warehouse with a multi-deep cargo space storage, with three gray frames in fig. 1 as a set of cargo spaces. When the carrying trolley moves back and forth in the first roadway, the goods position close to the first roadway can be stored or taken out without passing through other goods positions, so that the goods position close to the first roadway can be called as a shallow goods position. For the remaining two cargo spaces in the group of cargo spaces, the two cargo spaces pass through the shallow cargo space when being put in or out of the warehouse, so that the two cargo spaces can be called as deep cargo spaces. It should be noted that the number of deep cargo spaces in different warehouses can be designed according to requirements, and the scenario of two deep cargo spaces shown in fig. 1 is only exemplary.

As shown in fig. 1, every three adjacent cargo spaces in the vertical row are a group of cargo spaces, and the left and right groups of cargo spaces can be put in or taken out of a warehouse when the carrying trolley moves back and forth in the first roadway. It should be noted that fig. 1 is a schematic diagram of only one layer of cargo space, and the left and right cargo spaces in fig. 1 are actually left and right cargo spaces on the same shelf layer. In the practical implementation process, when the carrying trolley shuttles in the roadway, the two sides of the carrying trolley are provided with the goods shelves formed by a plurality of goods shelf layers. In addition, the dashed box in fig. 1 is a deflector by which the cart can be steered from the lateral movement to the longitudinal movement in fig. 1.

In conjunction with the above description of multiple deep bays, in one embodiment, a multiple deep bay allocation method is provided, as shown in fig. 2. The method may be implemented by means of a computer device, which may be, but is not limited to, various personal computers, laptops, smartphones, tablets, internet of things devices, portable wearable devices, and servers. The Internet of things equipment can be an intelligent sound box, an intelligent television, an intelligent air conditioner, intelligent vehicle-mounted equipment and the like. The portable wearable device can be a smart watch, a smart bracelet, a head-mounted device, and the like. The server may be implemented as a stand-alone server or as a server cluster consisting of a plurality of servers. Taking the application of the method to the server as an example, the method comprises the following steps:

and 202, screening out idle goods positions matched with the goods corresponding to the current warehousing task from the warehouse for the current warehousing task, and forming an idle goods position set.

The idle goods space set comprises the goods space information of each idle goods space, the goods space information comprises a tunnel and a shelf layer of the goods space, and the current warehousing task is actually goods to be warehoused. In practical implementation, the goods are usually placed in the box and put into the warehouse to be placed on the goods position. Therefore, the current warehousing task can be represented by the corresponding bin number. It will be appreciated that goods that have reached the point of warehousing (code scanning) may be shipped at any time. The goods are transmitted to the warehousing point for a certain time, and the ex-warehousing task of the corresponding goods may be generated in the time period. At this time, the storage of the product is obviously not needed, and the product can be directly taken out of the warehouse.

Therefore, in the step, whether the goods which reach the warehousing point are issued with warehouse-out tasks or not can be judged. In actual implementation, the box number can represent the corresponding goods, so that whether the box number is issued to the warehouse or not can be judged. If the warehouse-out task is issued, the warehouse-out task can be directly issued without allocating goods space. At this time, the warehousing process for the good ends. If the warehouse-out task is not issued, the goods which reach the warehouse-in point can be determined as the current warehouse-in task, and the idle goods position which is matched with the goods corresponding to the current warehouse-in task can be screened out from the warehouse. It should be noted that in actual implementation, because some shelf layers have faults, for example, an entrance has faults, the fault layer may be removed first, and then the idle goods position adapted to the goods corresponding to the current warehousing task is screened out from the warehouse.

The main problem with the "adapted" mentioned in the above process is which cargo space in the warehouse the goods are placed in. The consideration of "fitting" may include storing the goods with the possibility of simultaneous delivery in some adjacent cargo spaces, as embodied in: the same customer's goods are collected in several adjacent cargo spaces for storage, etc. Through will have the goods that the possibility of leaving warehouse simultaneously concentrated and deposit in some adjacent goods positions, follow-up when leaving warehouse to these goods, floor truck can be more conveniently with these goods concentrated taking out in the lump to because of goods dispersion round trip movement when can avoiding going out the goods, improve shipment efficiency. Besides, it can be embodied as follows: the goods at the same shipment moment are concentrated in some adjacent goods positions for storage, and when the goods arrive at the shipment moment subsequently, the carrying trolley can conveniently collect all the goods which need to be shipped at the shipment moment and take out the goods together, so that the goods can be prevented from moving back and forth due to the scattering of the goods during shipment, and the shipment efficiency is improved. Of course, the consideration of "adapting" in practical implementation may also include other matters, which are not specifically limited in the embodiments of the present application.

It will be appreciated that the above mentioned considerations of "adaptation" may all be used as a basis for the screening in this step. For ease of understanding, the screening process of this step is explained by taking the reference of the screening basis of this step as "store-first, wave-second-best" as an example. The "store priority" refers to that the goods of the same store are preferentially put together, for example, in the same group of goods spaces, and the goods of the same customer can be concentrated in some adjacent goods spaces for storage corresponding to the above-mentioned priority. "wave priority" means that the goods delivered by the same wave are preferably put together, and the goods delivered by the same wave can be stored in adjacent places corresponding to the above mentioned goods concentrated at the same delivery time, for example, in the same group of places. The screening mentioned above is based on the principle of substantially facilitating the delivery of the relevant cargo space together with the delivery of the cargo space. Through this screening basis, can avoid as far as possible when shipment because of goods dispersion round trip movement to improve shipment efficiency.

Based on the screening basis, in this step, for the target goods corresponding to the current warehousing task, which goods locations in the warehouse are stored in the goods belonging to the same store and belonging to the same order can be determined in the warehouse, and these goods locations are used as the related goods locations. The group of the related goods positions corresponding to some related goods positions may not be fully stored, and the vacant goods positions which are not fully stored can be used as the goods positions to be selected. Obviously, the target goods are placed on the goods position to be selected, so that the goods position can be stored without scattering, the utilization rate of the goods position is improved, and the subsequent goods delivery is facilitated. Therefore, in this step, the goods to be selected mentioned in the above process may be used as the idle goods space adapted to the goods corresponding to the current warehousing task, and the idle goods space set may be formed by the goods spaces.

In addition, when the computer device processes the free goods space set, the free goods space set needs to be represented by data in some form. In the embodiment of the application, each cargo space in the free cargo space set can be represented by cargo space information. As can be seen from fig. 1, the cargo space is usually located at a certain position in a certain rack level in a certain roadway. Thus, the cargo space information may include the belonging lane and the belonging shelf level of the cargo space. In addition, as can be seen from fig. 1, all the cargo spaces of each shelf layer are laid out flat for being arranged in rows and columns, so that the cargo space information can also introduce the coordinates of the cargo space in the shelf layer to which the cargo space belongs, so as to further specify the specific position of the cargo space.

And 204, screening out a target idle goods space set from the idle goods space set according to the principle that the number of idle goods spaces in a single roadway is large and the number of tasks being executed in a goods shelf layer is small.

It is understood that the cargo space is divided into lanes and shelf levels. Different roadways and different shelf levels may exhibit different degrees of warehouse busyness in view of the randomness of the warehouse entry task. The warehouse-in busy degree can be represented by the occupation ratio of the free goods space. For example, the warehouse entry busyness degree corresponding to a certain lane may be quantified by a ratio between the number of all free cargo spaces in the lane and the number of all cargo spaces in the lane.

Taking the warehouse entry dimension as an example, the lanes involved in the idle goods space set may refer to the lanes to which the idle goods spaces in the idle goods space set belong. For any one of all the tunnels related to the free goods space set, if the warehousing busyness degree of the tunnel is higher, the free goods space of the tunnel can be deleted from the free goods space set, namely the principle of 'more free goods spaces in a single tunnel' is fitted as much as possible, the free goods space of the tunnel with more free goods spaces in the tunnel can be selected as much as possible, and therefore the screening process in the step is completed. The warehousing busy degree of the roadway can be represented by the ratio mentioned above, and the "warehousing busy degree is higher" can mean that the ratio is greater than a preset threshold.

Taking the warehousing dimension as the shelf layer as an example, the shelf layer related in the free goods space set can refer to the shelf layer to which the free goods space in the free goods space set belongs. For any one of all the shelf layers related to the free goods space set, if the warehousing busyness degree of the shelf layer is higher, the free goods space of which the shelf layer belongs to is the shelf layer can be deleted from the free goods space set, namely, the principle of less task quantity being executed in the shelf layer is attached as much as possible, the free goods space of which the shelf layer belongs to is the shelf layer with less task quantity being executed is selected as much as possible, and therefore the screening process in the step is completed. The warehousing busyness degree of the shelf layer can be represented by the task amount being executed in the shelf layer, and the 'warehousing busyness degree is higher' can mean that the task amount being executed is larger than a preset threshold value.

And step 206, selecting the target idle goods position with the closest distance from the current position of the carrying trolley executing the current warehousing task from the target idle goods position set as the warehousing goods position of the goods corresponding to the current warehousing task.

In particular, for a carrier assigned to a current warehousing task, it typically enters from the entrance of a certain shelf level of a certain roadway while performing the task. Therefore, the current position mentioned in this step may refer to the entrance from which some empty slots in the target empty slot set are distributed in the shelf layer of the roadway. In this step, the cargo space may be traversed from the near end away from the entrance to the far end away from the entrance, and the idle cargo space closest to the entrance is preferentially selected as the warehousing cargo space of the cargo corresponding to the current warehousing task.

In the above embodiment, because can be based on the rule of going out of the warehouse together of the goods that have the possibility of going out of the warehouse simultaneously, filter the idle goods position in the warehouse to can avoid floor truck because of goods dispersion round trip movement when the shipment, and then can improve shipment efficiency. In addition, the idle goods position sets can be screened based on the warehousing busyness degrees corresponding to different warehousing dimensions, so that the warehousing task quantities of different warehousing dimensions can be averaged, the excessive warehousing task quantity of certain warehousing dimensions and the excessive warehousing task quantity of certain warehousing dimensions are avoided, and the warehousing efficiency can be improved. And finally, when the carrying trolley executes the task, the carrying trolley can traverse the idle goods positions in the target idle goods position set from the near end to the far end according to the current position to find the nearest idle goods position, so that the warehousing efficiency can be improved.

In some embodiments, the current warehousing task means that whether a delivered ex-warehouse task exists or not is judged for the goods which reach the warehousing point, and if yes, warehousing processing is not performed; and if not, determining the goods arriving at the warehousing point as the current warehousing task.

Specifically, if the goods that have arrived at the warehousing point have been issued the ex-warehouse task on the way to the warehousing point, they may be directly ex-warehouse without warehousing. If the warehouse-out task is not issued, the goods which reach the warehouse-in point can be determined as the current warehouse-in task. It can be understood that each cargo that has reached the warehousing point can be judged whether it can be used as the current warehousing task by adopting the above-mentioned judgment method.

In the embodiment, the current warehousing task can be determined by adopting a judging mode, and the goods which are issued with the warehousing task on the way of reaching the warehousing point can be directly delivered out of the warehouse, so that redundant warehousing operation of the goods can be avoided, and the warehousing efficiency can be improved.

In some embodiments, the method for screening out the free goods space adapted to the goods corresponding to the current warehousing task in the warehouse is not specifically limited in the embodiments of the present application, and includes but is not limited to: determining the goods position of the goods in the warehouse, which has the same management information as the current warehousing task, wherein the management information is used as a judgment basis for the goods with the possibility of being simultaneously taken out of the warehouse; and determining the idle goods position matched with the goods corresponding to the current warehousing task in the idle goods positions in the same group with the occupied goods positions.

The wave frequency information can be understood as the wave frequency of the goods leaving the goods shelf, the wave frequency information can have different contents based on different guiding results after the goods leave the goods shelf, and the affiliated demand party can refer to the party needing the goods. For convenience of understanding, the management information includes the wave number information and the affiliated requesting party at the same time, where the wave number information is the ex-warehouse wave number and the affiliated requesting party is the affiliated store as an example. If the current warehousing task needs to be delivered in the second frequent of the day, and the goods corresponding to the current warehousing task belong to the store A, the goods corresponding to the occupied goods positions in the warehouse can be searched, belong to the store A, and need to be delivered in the second frequent. After the occupied goods positions meeting the conditions are found, the goods positions can be used as related goods positions, and the idle goods positions in the same group with the related goods positions can be used as idle goods positions matched with the goods corresponding to the current warehousing task.

In the embodiment, because the idle goods positions can be screened through the management information, the associated goods positions can be conveniently taken out of the warehouse together during subsequent warehouse-out, so that the carrying trolley can be prevented from moving back and forth due to goods scattering during the warehouse-out, and the warehouse-out efficiency can be improved.

In some embodiments, the management information includes at least one of wave number information or an affiliated requesting party, and the wave number information includes delivery wave number or loading wave number.

Specifically, the demanded party may correspond to the aforementioned "store-priority", and the wave-order information may correspond to the aforementioned "wave-order-priority", where the wave-order-priority may be classified as an outbound wave order or an inbound wave order. The second best of the delivery wave refers to putting the goods delivered by the same wave together, and the second best of the loading wave refers to putting the goods loaded by the same wave together. Of course, in the actual implementation process, the "second best of the outbound wave" and the "second best of the loading wave" may also be considered at the same time, which is not specifically limited in the embodiment of the present application.

In the embodiment, because the free goods positions can be screened out based on the second-order priority of the delivery waves and the second-order priority of the loading waves, the goods delivered or loaded at the same time can be put together, and the associated goods positions can be conveniently delivered together during subsequent delivery or loading, so that the carrying trolley can be prevented from moving back and forth due to goods dispersion during delivery, and the delivery efficiency can be improved.

In some embodiments, each set of cargo spaces includes at least one deep cargo space and one shallow cargo space; accordingly, referring to fig. 3, the embodiment of the present application does not specifically limit the manner of determining the idle cargo space adapted to the cargo corresponding to the current warehousing task from the idle cargo spaces in the same group as the occupied cargo space, and includes but is not limited to:

and 302, acquiring a storage allocation type mark, wherein the storage allocation type mark is used for indicating the priority of the idle deep cargo space and the idle shallow cargo space during allocation.

It will be appreciated that in the same group of empty cargo spaces as occupied cargo spaces, there may be only empty shallow cargo spaces, or only empty deep cargo spaces, or both. In the embodiment of the application, the free goods positions need to be further screened so as to determine the free goods positions adapted to the goods corresponding to the current warehousing task. Since the free cargo spaces need to be screened, it may be necessary to screen out the free shallow cargo spaces first or the free deep cargo spaces first. Therefore, the storage allocation type mark is provided in the application embodiment, and the storage allocation type mark is mainly used for indicating whether the free shallow cargo space is screened out firstly or the free deep cargo space is screened out firstly. Wherein, the bin allocation type flag can be marked as Q, and Q can be represented by a numerical value. Specifically, a value of 1 may represent that the empty shallow cargo space is screened first, and a value of 2 may represent that the empty deep cargo space is screened first, which is not specifically limited in this embodiment of the present application.

304, if the storage allocation type mark indicates that the priority of the idle shallow cargo space is higher, judging whether the shallow cargo space in the same group with the occupied cargo space is idle and whether the deep cargo space is completely occupied, if so, forming an alternative idle cargo space set by the idle shallow cargo space in the same group with the occupied cargo space.

In the embodiment of the present application, taking the case that the library allocation type flag indicates that the priority of the empty shallow cargo space is higher, it can be determined whether the shallow cargo space in the same group as the occupied cargo space is empty and whether the deep cargo space is completely occupied. It will be appreciated that there may be more than one occupied bay in the warehouse with the same management information as the current warehousing task. Therefore, the above-mentioned determination process is mainly described by taking an occupied cargo space as an example. For any occupied goods space, if the shallow goods space in the same group with the occupied goods space is free and the deep goods space is completely occupied, it means that only the outermost shallow goods space in the goods space group where the occupied goods space is located is free. For other occupied goods spaces, the judgment process is also adopted, and the spare shallow goods spaces in the same group with the occupied goods spaces meeting the condition form a spare shallow goods space set which can be recorded as a set L1. Thus, the set of alternate empty cargo spaces may be more than one empty shallow cargo space, and may also be empty.

If the spare empty goods space set is not empty, all the empty shallow goods spaces in the spare empty goods space set can be directly used as the empty goods spaces matched with the goods corresponding to the current warehousing task. In the actual implementation process, under the condition that the spare empty goods space set is not empty, the spare empty goods space set can be further screened. Although available free shallow goods positions exist in the candidate free goods position set, no available carrying trolley may exist in the shelf layer to which the free shallow goods positions belong, so that the free goods positions of the unavailable carrying trolley in the shelf layer to which the candidate free goods position set belongs can be deleted from the candidate free goods position set under the condition that the candidate free goods position set is not empty, and the remaining free goods positions are used as the free goods positions matched with the goods corresponding to the current warehousing task.

And 306, if the set of the spare empty goods spaces is empty, adding the spare deep goods spaces in the same group with the occupied goods spaces to the set of the spare empty goods spaces.

The procedure given in the embodiments of the present application is a case where the set of alternative free cargo spaces is empty, in which case free deep cargo spaces of the same group as occupied cargo spaces may be added to the set of alternative free cargo spaces. It should be noted that, in the embodiment of the present application, the reason that the cargo space group with only one empty shallow cargo space is to be filled is to improve the utilization rate of the cargo space, and during subsequent shipment, the cargoes in the same store and in the same time can be shipped in the whole group, so that the shipment efficiency can be improved. And then, directly taking the rest idle goods positions in the spare idle goods position set as idle goods positions matched with the goods corresponding to the current warehousing task. Of course, the method can be further screened according to the requirement, and this is not particularly limited in the embodiment of the present application.

It should be noted that the above-mentioned processes of steps 304 to 306 are all derived processes in which the library allocation type flag indicates that the priority of the empty shallow cargo space is higher. In actual implementation, it is possible that the bin allocation type flag indicates that the priority of the free deep cargo space is high. At this time, in combination with step 306, a process of "forming an alternative idle goods space set by idle deep goods spaces in the same group as the occupied goods space" is performed, a process of "screening the alternative idle goods space set based on a preset rule" is performed, and a process of "adding an idle shallow goods space in the same group as the occupied goods space to the alternative idle goods space set if the alternative idle goods space set is empty" is performed. And finally, determining the idle goods position adapted to the goods corresponding to the current warehousing task. In an actual implementation process, a scheme combination can be performed based on the above mentioned screening concept according to requirements, and this is not specifically limited in the embodiment of the present application.

In the above embodiment, the spare shallow cargo space in the cargo space group where only one spare shallow cargo space is left can be preferentially taken as the spare shallow cargo space to be added into the spare shallow cargo space set to be taken as the spare warehousing cargo space, so that the utilization rate of the cargo space is improved. Secondly, the goods in the same store with the same frequency can be delivered in the whole group during subsequent delivery, and the delivery efficiency can be improved. In addition, under the condition that the spare empty goods space set is empty, the spare deep goods spaces in the same group with the occupied goods spaces can be added to the spare empty goods space set, so that the current warehousing task can be guaranteed to have spare goods spaces for warehousing.

In some embodiments, the method further comprises: and determining idle goods positions matched with the goods corresponding to the current warehousing task from the candidate idle goods position set according to a first preset rule, wherein the first preset rule comprises that the total number of the idle goods positions in the shelf layer to which the goods positions belong is greater than the number of the reserved goods positions, the shelf layer to which the goods positions belong has an adjustable carrying trolley, and the conveying lines and the lifting machines corresponding to the goods positions are in an allocable state.

The first preset rule is mainly used for guaranteeing warehousing safety and guaranteeing that the carrying trolleys, the conveying lines and the lifting machines which can be used on the goods shelf layer can be distributed and scheduled. The first preset rule is used for screening the set of the alternative idle goods spaces, and the first screening process can be understood. The first predetermined rule is embodied in that, for example, the shelf layer has 256 total cargo spaces, but usually not all of the cargo spaces are filled with the cargo spaces, but some of the cargo spaces are reserved as maintenance passages for maintenance workers to enter into maintenance, and as avoidance spaces for workers to avoid the carrier cars, and these cargo spaces are reserved cargo spaces. In addition, the pallet layer also needs to have a transport trolley available for use, namely, only a free goods position is available for realizing warehousing, and the transport trolley also needs to be provided, and whether the corresponding conveying line and the corresponding elevator are in a distributable scheduling state or not is judged. Each spare goods position in the spare goods position set corresponds to goods position information, and the goods position information comprises a tunnel to which the goods position belongs, a shelf layer to which the goods position belongs, correspondingly configured conveying lines and correspondingly configured elevators, so that whether a reserved space exists in the shelf layer to which the goods position belongs can be judged easily according to the goods position information, whether a carrying trolley exists in the shelf layer to which the goods position belongs can also be judged, and whether the correspondingly configured conveying lines and the elevators are in a distributable scheduling state can also be judged simultaneously.

Specifically, for any free cargo space in the candidate free cargo space set, taking the free cargo space at the jth layer (jth rack layer) of the ith roadway as an example, the total number of the free cargo spaces at the jth layer of the ith roadway may be denoted as Rij, and the number of reserved cargo spaces reserved for ensuring the security at the jth layer of the ith roadway may be denoted as S. Wherein, S can be calculated by the following method: if the total number of the cargo space of the jth layer of the ith roadway is 200, the total number of the cargo space of the jth layer of the ith roadway is multiplied by a preset proportion (for example, 5%), and S is 40. It should be noted that the "there is a configurable carrier on the shelf layer to which the cargo space belongs" mentioned in the embodiments of the present application includes not only the case of "there is a carrier on the shelf layer to which the cargo space belongs" but also the case of "there is no carrier on the shelf layer to which the cargo space belongs but there is a carrier assigned to the shelf layer to which the cargo space belongs". It can be understood that the premise that the conveyor line and the elevator corresponding to the goods location are in the distributable state is warehousing-available.

The idle goods position which is determined from the candidate idle goods position set according to the first preset rule and is adapted to the goods corresponding to the current warehousing task not only needs to meet the first preset rule, but also can be specifically realized through the following two sub-screening processes. And after the first sub-screening process is executed, if the screening result of the first sub-screening process is empty, executing the second sub-screening process again, and taking the screening result of the second sub-screening process as the idle goods position meeting the first preset rule in the standby idle goods position set. And if the screening result of the first sub-screening process is not empty, the second sub-screening process is not executed, and the screening result of the first sub-screening process is directly used as the idle goods position meeting the first preset rule in the spare idle goods position set.

Wherein, the first sub-screening process comprises the following steps: for the roadway closest to the goods outlet, the roadway closest to the goods outlet can be used as a target roadway, the front preset number of goods shelves near the goods outlet in the target roadway are determined according to the distance between each goods shelf and the goods outlet in the target roadway, and the rest goods shelves except the front preset number of goods shelves near the goods outlet in the target roadway are determined; screening out the idle goods positions of the rest goods shelf layers from the spare idle goods position set; and screening out the idle goods positions of which the tunnels are not the target tunnels in the alternative idle goods position set.

The second sub-screening process comprises: and screening the idle goods positions of the shelf layers which belong to the spare goods position set, wherein the idle goods positions are the shelf layers with the preset number.

By including 2 tunnels in the warehouse, be first tunnel and second tunnel respectively, each tunnel all includes 12 goods shelves layers, and first tunnel is close to the shipment mouth, and the preceding a predetermined number of goods shelves layers that are closer to the shipment mouth in the first tunnel is 7 to 12 layers as an example, then above-mentioned first time sub-screening process and the sub-screening process of second time can be expressed through following process:

first sub-screening process: in the spare idle goods space set, the idle goods spaces of 1 to 6 goods shelf layers of the belonging goods shelf layer belonging to the first roadway are screened out, and the idle goods spaces of 1 to 12 goods shelf layers of the belonging goods shelf layer belonging to the second roadway are screened out.

The second sub-screening process: and screening out the idle goods positions of 7 to 12 shelf layers belonging to the shelf layer in the first roadway from the candidate idle goods position set.

It should be noted that, in combination with the above example, the first sub-screening process is preferentially performed, mainly because the first lane is close to the shipment port, and the second lane is close to the shipment port, that is, based on the shipment port, the first lane is located further inside than the second lane. If all goods are preferentially sent to the first roadway for warehousing instead of warehousing in two parts like the first sub-screening process, a large amount of goods are blocked in the transmission process when being sent to the first roadway, so that the goods can be expected to enter the second roadway close to the warehousing port for warehousing, the warehousing can not be realized, and the warehousing efficiency is reduced.

Therefore, the first sub-screening process in the embodiment of the present application is divided into two parts for storage. And the warehouse entry is divided into two parts, so that the warehouse entry efficiency can be improved, and the shunting of different roadways is realized. In addition, the reason why the empty goods positions firstly enter 1 to 6 shelf layers in the first roadway is that the empty goods positions are relatively far away from the goods outlet, so that the empty goods positions which are relatively inconvenient to deliver goods can be filled preferentially, and the empty goods positions which are relatively convenient to deliver goods and are 7 to 12 shelf layers are reserved for subsequent use, so that the subsequent scheduling flexibility can be improved.

In the above embodiment, the set of spare empty goods spaces can be primarily screened, so that equipment can be allocated when warehousing is ensured, and a current warehousing task can be ensured to have spare empty goods spaces for warehousing. In addition, the subdivision screening can be carried out through the first sub-screening process and the second sub-screening process, so that the blocking in the warehouse can be avoided, and the warehouse entry efficiency and the subsequent scheduling flexibility are improved.

In some embodiments, the method further comprises: and if the spare goods positions meeting the first preset rule in the spare goods position set do not exist, determining the spare goods positions matched with the goods corresponding to the current warehousing task from the spare goods position set according to a second preset rule, wherein the second preset rule comprises that the total number of the spare goods positions in the shelf layer to which the goods positions belong is more than the number of the reserved goods positions.

Specifically, the second preset rule may be mainly used to ensure the warehousing security. The spare free goods space set is screened through the second preset rule, and the second screening process executed under the condition that the spare goods spaces meeting the first preset rule in the spare free goods space set do not exist can be understood. The idle goods space adapted to the goods corresponding to the current warehousing task, which is determined from the candidate idle goods space set according to the second preset rule, needs to meet the second preset rule, and the determining process may also be implemented by the above-mentioned first sub-screening process and second sub-screening process, which is not specifically limited in this embodiment of the present application.

The spare free space set obtained by the primary screening may be recorded as L2, and the spare free space set obtained by the secondary screening may be recorded as L3. It should be noted that after the candidate free goods space set is screened again, if the candidate free goods space set is directly empty, that is, any available free goods space is not screened, it may be determined that the warehouse cannot currently put goods corresponding to the current warehousing task into the warehouse. At this time, the goods corresponding to the current warehousing task may be allocated to the reject port, and the warehousing process in the warehouse is ended.

In the above embodiment, since the set of spare idle goods spaces can be screened again, it is ensured that the current warehousing task has idle goods spaces to be warehoused under the condition that the available idle goods spaces are not screened out under the high requirement of primary screening. In addition, the subdivision screening can be carried out through the first sub-screening process and the second sub-screening process, so that the blocking in the warehouse can be avoided, and the warehouse entry efficiency and the subsequent scheduling flexibility are improved.

In some embodiments, the method for determining the idle goods space adapted to the goods corresponding to the current warehousing task from the candidate idle goods space set is not specifically limited in the embodiments of the present application, and includes but is not limited to: and for each idle goods position in the candidate idle goods position set, obtaining the goods position information of each idle goods position, and selecting the idle goods position with more idle goods positions in a single tunnel and less task quantity being executed in the goods shelf layer as the idle goods position matched with the goods corresponding to the current warehousing task.

For each free cargo space in the alternative free cargo space set, the number of layer tasks allocated in the shelf layer to which each free cargo space belongs and not yet put in storage (i.e. executing) can be obtained. And selecting the idle goods position with the least layer task quantity from the candidate idle goods position set, namely selecting the idle goods position with the less task quantity being executed in the goods shelf layer as the idle goods position matched with the goods corresponding to the current warehousing task.

For the dimension of the lane, specifically, for each free goods space in the candidate free goods space set, the number of free goods spaces of the lane to which each free goods space belongs may be obtained. It can be understood that there are usually a large number of empty cargo spaces in some lanes and a small number of empty cargo spaces in some lanes. In this embodiment, the phrase "more idle cargo spaces in a single lane" may refer to that a lane with a larger number of idle cargo spaces is screened out as much as possible, for example, the lane with the largest number of idle cargo spaces is screened out, so that the lane belonging to the candidate idle cargo space set is the idle cargo space of the lane and serves as the idle cargo space adapted to the cargo corresponding to the current warehousing task. It should be noted that the free cargo space screened by the two dimensions needs to satisfy a second preset rule.

It is to be understood that the warehousing process may have warehousing tasks "on the road". For any free goods space in the candidate free goods space set, taking the fact that the free goods space is located at the jth layer of the ith roadway as an example, the number of layer tasks which are allocated in the jth layer of the ith roadway and are not stored in the jth layer of the ith roadway can be recorded as Tij. In the actual implementation process, the idle goods space with the minimum number of layer tasks can be selected from the candidate idle goods space set, and the idle goods space of the tunnel with the maximum idle goods space in the tunnel to which the idle goods space belongs can also be selected as the idle goods space adapted to the goods corresponding to the current warehousing task.

In addition, in the actual implementation process, the set of the spare idle goods spaces can be screened based on the preset task number threshold corresponding to the roadway, so that the idle goods spaces matched with the goods corresponding to the current warehousing task can be obtained. The screening process can be specifically realized as follows: for the jth layer of the ith roadway, if the total goods position number is 12, the warehousing task which can be buffered by the jth roadway is considered to be more than 12 actually. The number of the buffered warehousing tasks is a preset task number threshold, and the value of the number of the warehousing tasks can be set according to actual conditions. For example, in this embodiment of the application, the preset task number threshold corresponding to the first lane may be 4, and the preset task number threshold corresponding to the second lane may be 3.

For any idle goods space in the candidate idle goods space set, taking the idle goods space at the jth layer of the ith roadway as an example, the number of layer tasks which are allocated in the jth layer of the ith roadway and are not stored in the jth layer of the ith roadway can be recorded as Tij, and the preset task number threshold corresponding to the ith roadway can be recorded as Mi. In the embodiment of the application, the idle cargo space with Tij greater than Mi can be deleted first. It is understood that the empty slots are removed to avoid overloading the jth layer of the ith lane.

If the deleted backup selection free goods space set is not empty, the spare selection free goods space set at the moment can be recorded as L4, and the rest free goods spaces in L4 are determined as the free goods spaces matched with the goods corresponding to the current warehousing task. If the spare idle goods space set is empty directly after deletion, the idle goods space corresponding to the minimum layer task number in the spare idle goods space set before deletion operation can be used as the idle goods space adapted to the goods corresponding to the current warehousing task.

In the above embodiment, since the spare goods slots with more spare goods slots in the tunnel and the spare goods slots with less task amount being executed by the shelf layer can be selected from the candidate spare goods slot set, it is possible to avoid that the shelf layer in some tunnels is overloaded. Meanwhile, warehousing tasks can be averaged, and therefore efficiency is improved through parallel processing.

In some embodiments, taking the example of a warehouse including two lanes; the embodiment of the application does not specifically limit the manner of screening out the target free goods space set from the free goods space set according to the principle that the number of free goods spaces in a single roadway is large and the number of tasks being executed in a goods shelf layer is small, and the method includes but is not limited to the following steps: judging whether the idle goods position set relates to two roadways at the same time; if yes, judging whether the ratio of the total number of the distributed warehousing tasks of the first roadway to the total number of the distributed warehousing tasks of the second roadway is larger than a preset ratio threshold value, if so, deleting the spare cargo space of the first roadway from the spare cargo space set, and if not, deleting the spare cargo space of the second roadway from the spare cargo space set; for all the shelf layers related in the free shelf position set, obtaining the free shelf position ratio of each shelf layer in all the shelf layers, and taking the shelf layer corresponding to the maximum free shelf position ratio as a target shelf layer; and screening out the idle goods positions of which the shelf layers are the target shelf layers from the idle goods position set.

Specifically, it may be determined first whether the set of free cargo spaces involves two lanes. If not, the method can directly continue to execute the steps of acquiring the idle goods space occupation ratio of each goods shelf layer in all the goods shelf layers and taking the goods shelf layer corresponding to the maximum idle goods space occupation ratio as the target goods shelf layer for all the goods shelf layers involved in the idle goods space set.

If so, the total number of allocated warehousing tasks of the first lane may be obtained and may be recorded as T1. The total number of allocated warehousing tasks for the second lane is obtained and may be denoted as T2. And calculating whether the T1/T2 is larger than a preset ratio threshold value, and if so, indicating that the load of the first lane is too heavy, so that the idle goods space of the lane which belongs to the first lane can be deleted from the idle goods space set. Otherwise, the overload of the second lane is indicated, so that the idle goods space of the second lane can be deleted from the idle goods space set.

For any free cargo space in the free cargo space set, taking the fact that the free cargo space is located at the jth layer of the ith roadway as an example, the total number of the free cargo spaces at the jth layer of the ith roadway can be recorded as Rij, and the total number of the total cargo spaces at the jth layer of the ith roadway can be recorded as Aij. Therefore, the empty space occupation ratio of the jth layer of the ith roadway can be calculated, the shelf layer of which roadway the maximum empty space occupation ratio is can be determined, and the shelf layer of the roadway can be used as the target shelf layer. And screening out the idle goods positions of which the shelf layers are the target shelf layers from the idle goods position set, and forming a target idle goods position set.

In the above embodiment, because the free goods space set relates to two lanes, the free goods space with the overloaded lane can be deleted from the free goods space set according to the respective load conditions of the two lanes, so that the overload of some lanes can be avoided. Meanwhile, warehousing tasks can be averaged, and the efficiency is improved through parallel processing. In addition, the idle goods positions of the shelf layer corresponding to the maximum idle goods position occupation ratio of the shelf layer can be further screened out, so that the utilization rate of the goods positions can be further improved, and high concurrency can be realized to improve the warehousing efficiency.

The overall process mentioned in the embodiments of the present application may refer to fig. 4 and fig. 5. Fig. 4 mainly shows a process of obtaining an idle goods space set, and fig. 5 includes a process of obtaining a target idle goods space set and a process of obtaining a warehousing goods space of goods corresponding to a current warehousing task. The meanings of the parameters in fig. 4 and 5 can refer to the contents of the above embodiments, and are not repeated here. In practice, in the implementation process, when the carrying trolley is put in storage each time, if a delivery demand exists near the storage goods position, the goods corresponding to the delivery task can be taken out by the way when the storage is finished. Similarly, when the carrying trolley is delivered out of the warehouse every time, if a goods entering demand exists near the goods delivery position, goods to be warehoused are taken before delivery is started, and the goods are warehoused in the delivery process. The warehouse-in task can be executed in sequence, and the warehouse-out task can be executed in sequence, so that the efficiency of warehouse-in and warehouse-out can be improved.

In addition, with reference to fig. 1, when the carrying trolley is put in storage, the goods can be put into the left goods group first, the right goods group is put after the left goods group is fully put, and the carrying trolley is pushed forward after both sides are fully put, so that the storage task is continuously executed. Because every time the left and right cargo space groups are fully filled, the carrying trolley can be pushed forward, so that the invalid movement of the carrying trolley can be reduced, and the warehousing efficiency can be improved.

It should be understood that, although the steps in the flowcharts related to the embodiments are shown in sequence as indicated by the arrows, the steps are not necessarily executed in sequence as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least a part of the steps in the flowcharts related to the above embodiments may include multiple steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of performing the steps or stages is not necessarily sequential, but may be performed alternately or alternately with other steps or at least a part of the steps or stages in other steps.

Based on the same inventive concept, the embodiment of the application also provides a multi-deep goods position distribution device for realizing the multi-deep goods position distribution method. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the method, so that specific limitations in one or more embodiments of the multi-deep cargo space allocation device provided below can be referred to the limitations on the multi-deep cargo space allocation method in the foregoing, and details are not described herein again.

In one embodiment, as shown in fig. 6, a multi-deep cargo space allocation apparatus is provided, comprising a first screening module 602, a second screening module 604, and a selection module 606, wherein:

a first screening module 602, configured to screen, for a current warehousing task, an idle goods space adapted to goods corresponding to the current warehousing task in a warehouse, and form an idle goods space set; the spare goods space set comprises goods space information of each spare goods space, and the goods space information comprises a tunnel to which the goods space belongs and a shelf layer to which the goods space belongs;

a second screening module 604, configured to screen out a target idle goods space set from the idle goods space set according to a principle that there are many idle goods spaces in a single lane and a principle that there are few tasks being executed in a shelf layer;

and the selecting module 606 is configured to select, from the target idle goods space set, a target idle goods space closest to the current position of the carriage executing the current warehousing task as the warehousing goods space of the goods corresponding to the current warehousing task.

In some embodiments, the current warehousing task is to judge whether a delivered ex-warehouse task exists for the goods which have reached the warehousing point, and if so, the warehousing processing is not performed; if not, determining the goods arriving at the warehousing point as the current warehousing task.

In some embodiments, the first screening module 602 is configured to determine a cargo space where a cargo in the warehouse is located, where the cargo has the same management information as a current warehousing task, where the management information is used as a criterion for determining the cargo having the possibility of being simultaneously ex-warehoused; and determining the idle goods position matched with the goods corresponding to the current warehousing task in the idle goods positions in the same group with the occupied goods positions.

In some embodiments, each set of cargo spaces includes at least one deep cargo space and one shallow cargo space; the first screening module 602 is further configured to obtain a stock location allocation type flag, where the stock location allocation type flag is used to indicate a priority of the idle deep cargo space when the idle shallow cargo space is allocated; if the storage allocation type mark indicates that the priority of the idle shallow cargo space is higher, judging whether a shallow cargo space in the same group with the occupied cargo space is idle or not and whether the deep cargo space is completely occupied or not, and if so, forming an alternative idle cargo space set by the idle shallow cargo space in the same group with the occupied cargo space; and if the set of the spare goods spaces is empty, adding spare deep goods spaces in the same group with the occupied goods spaces into the set of the spare goods spaces.

In some embodiments, the first screening module 602 is further configured to determine, according to a first preset rule, an idle goods slot adapted to a goods corresponding to the current warehousing task from the candidate idle goods slot set, where the first preset rule includes that the total number of idle goods slots in the shelf layer to which the goods slot belongs is greater than the number of reserved goods slots, an allocable carrying cart exists in the shelf layer to which the goods slot belongs, and both a conveying line and a hoist corresponding to the goods slot are in an allocable state.

In some embodiments, the first screening module 602 is further configured to, when there is no free goods space in the candidate free goods space set that meets the first preset rule, determine, according to a second preset rule, a free goods space adapted to a goods corresponding to the current warehousing task from the candidate free goods space set, where the second preset rule includes that the total number of free goods spaces in the shelf layer to which the goods space belongs is greater than the number of reserved goods spaces.

In some embodiments, the first screening module 602 is further configured to, for each idle goods space in the candidate idle goods space set, obtain goods space information of each idle goods space, and select an idle goods space with a large number of idle goods spaces in the corresponding lane and a small number of tasks being executed in the shelf layer as an idle goods space adapted to goods corresponding to the current warehousing task.

The modules in the multi-deep cargo space allocation device can be wholly or partially realized by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.

In some embodiments, a computer device is provided, which may be a server, the internal structure of which may be as shown in fig. 7. The computer device includes a processor, a memory, and a network interface connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer equipment is used for storing warehousing and ex-warehousing data. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a multi-deep cargo space allocation method.

Those skilled in the art will appreciate that the architecture shown in fig. 7 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.

In one embodiment, a computer device is further provided, which includes a memory and a processor, the memory stores a computer program, and the processor implements the steps of the above method embodiments when executing the computer program.

In an embodiment, a computer-readable storage medium is provided, in which a computer program is stored which, when being executed by a processor, carries out the steps of the above-mentioned method embodiments.

In one embodiment, a computer program product or computer program is provided that includes computer instructions stored in a computer-readable storage medium. The computer instructions are read by a processor of a computer device from a computer-readable storage medium, and the computer instructions are executed by the processor to cause the computer device to perform the steps in the above-mentioned method embodiments.

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, database, or other medium used in the embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high-density embedded nonvolatile Memory, resistive Random Access Memory (ReRAM), Magnetic Random Access Memory (MRAM), Ferroelectric Random Access Memory (FRAM), Phase Change Memory (PCM), graphene Memory, and the like. Volatile Memory can include Random Access Memory (RAM), external cache Memory, and the like. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), among others. The databases referred to in various embodiments provided herein may include at least one of relational and non-relational databases. The non-relational database may include, but is not limited to, a block chain based distributed database, and the like. The processors referred to in the embodiments provided herein may be general purpose processors, central processing units, graphics processors, digital signal processors, programmable logic devices, quantum computing based data processing logic devices, etc., without limitation. The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.

The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims

1. A multi-deep cargo space allocation method, the method comprising:

for the current warehousing task, screening out idle goods positions matched with the goods corresponding to the current warehousing task from a warehouse, and forming an idle goods position set; the spare goods space set comprises goods space information of each spare goods space, and the goods space information comprises a tunnel to which the goods space belongs and a shelf layer to which the goods space belongs;

screening out a target idle goods space set from the idle goods space set according to the principle that the number of idle goods spaces in a single roadway is large and the number of tasks being executed in a goods shelf layer is small;

2. The method according to claim 1, wherein the current warehousing task is to judge whether a delivered ex-warehouse task exists for goods which have reached a warehousing point, and if so, do not perform warehousing processing; and if not, determining the goods arriving at the warehousing point as the current warehousing task.

3. The method of claim 1, wherein the screening out free cargo space in the warehouse for the cargo corresponding to the current warehousing task comprises:

determining the goods position of the goods in the warehouse, which has the same management information as the current warehousing task, wherein the management information is used as a judgment basis for the goods with the possibility of being exported simultaneously;

4. The method of claim 3, wherein the management information comprises at least one of wave number information or an affiliated party, and wherein the wave number information comprises a delivery wave number or a loading wave number.

5. The method of claim 3, wherein each set of cargo spaces includes a shallow cargo space and at least one deep cargo space; the step of determining the idle goods position adapted to the goods corresponding to the current warehousing task in the idle goods positions in the same group with the occupied goods positions comprises the following steps:

if the storage space allocation type mark indicates that the priority of the idle shallow cargo space is higher, judging whether a shallow cargo space in the same group with the occupied cargo space is idle or not and whether a deep cargo space is completely occupied or not, and if so, forming an alternative idle cargo space set by the idle shallow cargo space in the same group with the occupied cargo space;

and if the spare empty goods space set is empty, adding the spare deep goods spaces in the same group with the occupied goods spaces into the spare empty goods space set.

6. The method of claim 5, further comprising:

and determining the idle goods positions matched with the goods corresponding to the current warehousing task from the candidate idle goods position set according to a first preset rule, wherein the first preset rule comprises that the total number of the idle goods positions in the shelf layer to which the goods positions belong is greater than the number of the reserved goods positions, the shelf layer to which the goods positions belong has an allocable carrying trolley, and the conveying lines and the elevators corresponding to the goods positions are in an allocable state.

7. The method of claim 6, further comprising:

and if the spare goods positions meeting the first preset rule in the spare goods position set do not exist, determining the spare goods positions matched with the goods corresponding to the current warehousing task from the spare goods position set according to a second preset rule, wherein the second preset rule comprises that the total number of the spare goods positions in the shelf layer to which the goods positions belong is greater than the number of the reserved goods positions.

8. The method according to claim 7, wherein the determining the free slot adapted to the goods corresponding to the current warehousing task from the set of candidate free slots comprises:

and for each idle goods position in the candidate idle goods position set, obtaining the goods position information of each idle goods position, and selecting the idle goods position with more idle goods positions in the tunnel and less task quantity being executed in the goods shelf layer as the idle goods position matched with the goods corresponding to the current warehousing task.

9. A multi-deep cargo space allocation device, the device comprising:

the first screening module is used for screening out idle goods positions matched with goods corresponding to the current warehousing task from the warehouse for the current warehousing task and forming an idle goods position set; the spare goods space set comprises goods space information of each spare goods space, and the goods space information comprises a tunnel to which the goods space belongs and a shelf layer to which the goods space belongs;

10. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor, when executing the computer program, implements the steps of the method of any of claims 1 to 8.