CN112734316A

CN112734316A - Inventory arrangement method and device

Info

Publication number: CN112734316A
Application number: CN201910974508.4A
Authority: CN
Inventors: 沈婧楠
Original assignee: Beijing Jingdong Qianshi Technology Co Ltd
Current assignee: Beijing Jingdong Qianshi Technology Co Ltd
Priority date: 2019-10-14
Filing date: 2019-10-14
Publication date: 2021-04-30

Abstract

The invention discloses an inventory sorting method and device, and relates to the technical field of computers. One embodiment of the method comprises: determining storage positions in a warehouse, in which the articles are stored, according to the identifiers of the articles, and acquiring the storage amount of the articles in each storage position to obtain the total storage amount of the articles; determining the storage capacity and the volume of each article except the article in each storage position to obtain the occupied volume of all the articles except the article in each storage position, and combining the volume of each storage position to further obtain the residual volume of each storage position after the occupied volume is removed; and obtaining the bearing capacity of each storage position to the articles according to the residual volume and the volume of the articles, if the maximum bearing capacity is greater than or equal to the total storage capacity, extracting the storage position corresponding to the maximum bearing capacity, and taking the extracted storage position as the target storage position for transferring the articles. The embodiment realizes the purpose that the same article is only stored in one storage position by transferring the same article in the rest storage positions to the storage position with the maximum bearing capacity.

Description

Inventory arrangement method and device

Technical Field

The invention relates to the field of warehouse logistics, in particular to a warehouse sorting method and device.

Background

In order to facilitate warehouse management, a plurality of storage positions are divided in the warehouse for storing commodities. Each storage position can store one or more kinds of commodities, the types of the commodities which can be stored in a single storage position (namely one storage position) are limited, and the total volume of the commodities cannot exceed the upper limit of the volume which can be stored in the storage position, so that a reasonable commodity storage layout strategy needs to be set so as to effectively improve the commodity in and out efficiency of the commodities in the warehouse.

In the process of implementing the invention, the inventor finds that the prior art has at least the following problems:

1) when the number of articles stored in the same storage position is large, the picking personnel may need to spend a long time to pick the articles; when the same article is stored in a plurality of storage positions, a goods picker may need to go to and fro to pick the goods in the plurality of storage positions, so that the delivery efficiency of the article is influenced;

2) the storage of the articles in the warehouse is more disordered, which may result in no empty storage positions or less empty storage positions. When a new good needs to be put in storage, a situation (e.g., a burst of storage) may occur where no storage location is available.

3) At present, articles are mostly merged and arranged manually, but no systematic and intelligent arrangement scheme exists.

Disclosure of Invention

In view of this, embodiments of the present invention provide a method and an apparatus for warehousing, which can at least solve the problem in the prior art that the types and volumes of articles stored in storage locations are limited and are not suitable for warehousing new articles.

To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided an inventory sorting method including:

determining storage positions in the warehouse, in which the articles are stored, according to the identifiers of the articles, and acquiring the storage amount of the articles in each storage position to obtain the total storage amount of the articles;

determining the storage capacity and the volume of each article except the article in each storage position to obtain the occupied volume of all the articles except the article in each storage position, and combining the volume of each storage position to further obtain the residual volume of each storage position after the occupied volume is removed;

and obtaining the bearing capacity of each storage position to the articles according to the residual volume and the volume of the articles, if the maximum bearing capacity is greater than or equal to the total storage capacity, extracting the storage position corresponding to the maximum bearing capacity, and taking the extracted storage position as a target storage position for transferring the articles.

Optionally, after obtaining the carrying capacity of each storage position for the articles, the method further includes:

if the maximum bearing capacity is smaller than the total storage capacity, sequencing the obtained bearing capacities from large to small, and accumulating the bearing capacities step by step according to the sequencing;

if the accumulated bearing capacity is larger than or equal to the total storage capacity, extracting the storage bit corresponding to the accumulated bearing capacity, and taking the extracted storage bit as the target storage bit for transferring the articles.

Optionally, after the step of taking the extracted storage location as a destination storage location for transferring the article, the method further includes:

counting the total number of the determined storage bits, determining the difference between the total number and the number of the determined target storage bits, and taking the obtained difference as the number of the storage bits of the article to be transferred;

and if the number of the storage positions is larger than or equal to a first preset number threshold value, determining the articles as articles which are sorted in priority.

Optionally, the determining the articles as prioritized articles further includes:

according to the storage amount of each article in each storage position, the volume of each article and the volume of each storage position, the storage position utilization rate of all storage positions for storing articles is obtained;

if first articles with the same quantity as the storage positions of the articles exist, comparing the storage position utilization rate of the articles with the storage position utilization rate of the first articles, and taking the articles with smaller storage position utilization rate or the first articles as articles prioritized; or

And if a second article equal to the storage space utilization rate of the article exists, comparing the storage space quantity of the article with the storage space quantity of the second article, and taking the article with larger storage space quantity or the second article as the article to be sorted preferentially.

Optionally, after obtaining the storage amount of the items in each storage space, the method further includes:

sequencing the obtained storage amounts from large to small, extracting a first storage amount with the first sequencing, and determining a first storage position corresponding to the article and the first storage amount;

according to the storage amount of each article in the first storage position, the volume of each article and the volume of the first storage position, obtaining a first residual volume of the first storage position after the volume occupied by all articles is removed;

obtaining a first storable amount of the first storage location for the item in the first remaining volume from the first remaining volume and the volume of the item;

if the second storage amount of the last-but-one ordering is less than or equal to the first storage amount, extracting the articles of the second storage amount from a second storage position to be stored in the first storage position; or

And if the second storage amount is larger than the first storable amount, extracting the first storable amount of the articles from the second storage position to dump the articles into the first storage position.

Optionally, after the items in the second storage amount are extracted from the second storage location to be transferred to the first storage location, the method further includes:

determining the difference between the first storage amount and the second storage amount to obtain the remaining storage amount of the first storage position to the article;

if the third storage amount of the last but one of the orders is less than or equal to the remaining storage amount, extracting the articles with the third storage amount from a third storage position to be transferred and stored into the first storage position; or

And if the third storage amount is larger than the residual storable amount, extracting the articles with the residual storable amount from the third storage position to dump into the first storage position.

Optionally, after the first storable amount of items is extracted from the second storage location for unloading into the first storage location, the method further includes:

determining the difference between the second storage amount and the first storage amount to obtain the remaining article transfer amount of the second storage position;

extracting a fourth storage amount of the second sorting, and according to the storage amount of each article in a fourth storage position, the volume of each article and the volume of the fourth storage position, obtaining a second residual volume of the fourth storage position after the volume occupied by all articles is removed;

obtaining a second storable amount of the fourth storage location for the item in the second remaining volume from the second remaining volume and the volume of the item;

if the residual inventory transferring amount is less than or equal to the second storage amount, extracting the articles of the residual inventory transferring amount from the second storage position to transfer the articles to the fourth storage position; or

If the residual inventory is larger than the second storable amount, the second storable amount of articles are extracted from the second storage position to be dumped into the fourth storage position.

Optionally, before determining the storage location in the warehouse where the article is stored according to the identifier of the article, the method further includes:

monitoring the use state of each storage position in the warehouse, determining an empty storage position and a non-empty storage position, counting the number of the empty storage positions, and further obtaining the proportion of the number of the empty storage positions in the total number of the storage positions;

determining the storage capacity of each article in each non-empty storage position, and combining the volume of each article and the volume of each non-empty storage position to obtain the utilization rate of all non-empty storage positions in the warehouse;

obtaining the health degree of the warehouse inventory according to the proportion and the utilization rate; wherein the health degree is a quantitative index for measuring the health degree of the warehouse;

and if the health degree is lower than a preset health degree threshold value, triggering the reminding and sorting operation of the stored articles in the warehouse.

To achieve the above object, according to another aspect of the embodiments of the present invention, there is provided an inventory finishing device including:

the storage capacity acquisition module is used for determining storage positions in the warehouse where the articles are stored according to the identifiers of the articles, acquiring the storage capacity of the articles in each storage position and obtaining the total storage capacity of the articles;

the residual volume determining module is used for determining the storage volume and the volume of each article except the article in each storage position, obtaining the occupied volume of all the articles except the article in each storage position, and combining the volume of each storage position to further obtain the residual volume of each storage position after the occupied volume is removed;

and the target storage position determining module is used for obtaining the bearing capacity of each storage position to the articles according to the residual volume and the volume of the articles, extracting the storage position corresponding to the maximum bearing capacity if the maximum bearing capacity is greater than or equal to the total storage capacity, and taking the extracted storage position as the target storage position for transferring the articles.

Optionally, the destination storage position determining module is further configured to:

Optionally, the system further comprises a prioritized article determining module, configured to:

Optionally, the prioritized item determining module is further configured to:

Optionally, the system further includes a storage amount determining module, configured to:

Optionally, the storage amount determining module is further configured to:

Optionally, the system further comprises an inventory health monitoring module, configured to:

To achieve the above object, according to still another aspect of embodiments of the present invention, there is provided an inventory settling electronic device.

The electronic device of the embodiment of the invention comprises: one or more processors; a storage device for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement any of the inventory finishing methods described above.

To achieve the above object, according to a further aspect of the embodiments of the present invention, there is provided a computer-readable medium on which a computer program is stored, the program, when executed by a processor, implementing any one of the inventory finishing methods described above.

According to the scheme provided by the invention, one embodiment of the invention has the following advantages or beneficial effects: when the number of the empty storage positions in the warehouse is small and the utilization rate of the non-empty storage positions is low, aiming at the condition that the same article is stored in a plurality of storage positions in a scattered manner, the article in the rest storage positions can be transferred to the storage position with the maximum bearing capacity, and the article with low storage capacity can also be transferred to the storage position with high storage capacity, so that the merging operation of the articles in the storage positions is realized, and the subsequent sorting and delivery efficiency of the article is improved.

Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.

Drawings

The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:

fig. 1 is a schematic main flow diagram of an inventory sorting method according to an embodiment of the present invention;

FIG. 2 is a schematic flow diagram of an alternative inventory finishing method according to an embodiment of the invention;

FIG. 3 is a schematic flow diagram of an alternative inventory finishing method according to an embodiment of the invention;

FIG. 4 is a schematic flow diagram of yet another alternative inventory finishing method according to an embodiment of the invention;

FIG. 5 is a schematic flow diagram of yet another alternative inventory finishing method according to an embodiment of the invention;

FIG. 6 is a schematic diagram of the main modules of an inventory arrangement device according to an embodiment of the invention;

FIG. 7 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;

FIG. 8 is a schematic block diagram of a computer system suitable for use with a mobile device or server implementing an embodiment of the invention.

Detailed Description

Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

It should be noted that the articles have a volume attribute, and the storage location also has a volume attribute, and when the total volume of the articles stored exceeds the volume, the storage location cannot carry more articles, so the volume of the storage location is an essential factor.

The restriction of the article types is business restriction, and when the number of the article types stored in one storage position is small, the operation of warehousing and ex-warehouse can be conveniently carried out. For example, the storage space stores more than ten kinds of goods, and the pickers may need to find a long time to find the needed goods when picking the goods in the storage space, but if only one kind of goods (for example, two kinds of upper limit) is placed, the picking delivery efficiency is significantly improved, and for new types of goods, more empty storage spaces can be selected for storage.

In addition, the weight, the fragility and other properties of the article are related to the actual scene, and some scenes may not need to be considered, so the invention mainly considers two factors of the volume and the type of the article.

Referring to fig. 1, a main flowchart of an inventory sorting method according to an embodiment of the present invention is shown, including the following steps:

s101: determining storage positions in a warehouse, in which the articles are stored, according to the identifiers of the articles, and acquiring the storage amount of the articles in each storage position to obtain the total storage amount of the articles;

s102: determining the storage capacity and the volume of each article except the article in each storage position to obtain the occupied volume of all the articles except the article in each storage position, and combining the volume of each storage position to further obtain the residual volume of each storage position after the occupied volume is removed;

s103: and obtaining the bearing capacity of each storage position on the article according to each residual volume and the volume of the article, if the maximum bearing capacity is greater than or equal to the total storage capacity, extracting the storage position corresponding to the maximum bearing capacity, and taking the extracted storage position as a target storage position for transferring the article.

In the above embodiment, for step S101, after the warehouse manager (or other authorized person or machine) receives the tally reminder, a tally request may be transmitted to the warehouse Management system wms (route Management system).

The 'storage position-article' comparison table is stored in the warehouse, and when an article is stored on the storage position in the warehouse, the article can be recorded in the comparison table; when the article is taken out of the storage position, the corresponding record in the comparison table is deleted/updated.

Therefore, after receiving the tally request, the WMS determines which storage locations store the item according to the identification of the item in the request, and obtains the corresponding storage amount, for example, 1-apple-20 storage locations. Specifically, according to the identification of the article s, the storage position in which the article s is stored is determined, and the determined storage positions are combined to obtain a storage position set B corresponding to the article s_S。

Setting an article s in a storage position i (i belongs to B)_S) The memory space in (1) is q_i.sSo as to obtain the total storage capacity of the article s in all storage positions

Furthermore, when the articles are stored in only one storage position, the articles do not need to be sorted, so the invention is mainly directed to an article sorting layout for storing articles in a certain number of storage positions, for example, articles below 2 storage positions do not need to be sorted. The invention is mainly directed to | B_SAnd | ≧ 2.

For step S102, since article sorting is performed one by one, that is, when the article is sorted, the rest of articles are not movable, only after the article is sorted and the "stock place-article" comparison table is updated, other articles are sorted, so as to avoid the condition that information confusion causes article sorting errors.

For the storage position i, on the premise of not moving other articles except the article s, calculating the residual volume V after removing the occupied volume of the articles_i：

Wherein, V_i.maxIs the volume of the reservoir i, S_iIs a collection of items stored in storage location i, q_ijIs an item j (j belongs to S)_iAnd j ≠ s) storage in bin i, with a volume v_j。

For step S103, according to the bit set B_SResidual volume V obtained from middle storage position i_iCombined with volume v of article s_sTo obtain the bearing capacity of the storage position i to the articles s

(i.e., the maximum number that can be accommodated), i.e.:

it should be noted that the obtained carrying capacity is greater than or equal to the storage capacity of the articles s in the corresponding storage positions

For example, the storage capacity of the apples in the storage position 1 is 20, but the calculated carrying capacity is 100.

In actual operation, the same article can be stored in the same storage position or the storage positions as few as possible, so that article management is facilitated, and the efficiency of subsequent article warehousing is improved. Therefore, by comparing the carrying capacity with the total storage capacity of the articles in the warehouse, if the maximum carrying capacity is greater than or equal to the total storage capacity, the articles in other storage positions are all transferred to the storage position corresponding to the maximum carrying capacity, namely the target storage position.

For example, referring to table 1, the storage and carrying capacity of the plurality of bins for apples:

TABLE 1 storage and bearing capacity of each storage bit to apple

Storage position	Storage capacity for apples	Calculated load capacity
			Storage position 1	20	100
Storage position 2	30	90
			Storage position 3	50	80

The total storage capacity of the obtained apples in the storage is 20+30+50 to 100, and the bearing capacity in the storage bit 1 is equal to the total storage capacity, that is, the storage bit 1 can be determined to be the target storage bit for transferring the apples, the apples in the storage bits 2 and 3 need to be transferred into the storage bit 1, and the storage bits 2 and 3 do not contain the apples after transfer.

Taking the storage location 2 as an example, after the apples are transferred, the storage location is an empty storage location or the remaining volume is larger. When a new type of article is put in storage, the storage position 2 can be used as an alternative storage position, so that the situation that no storage position is available when the new article is put in storage is avoided.

In the method provided by the above embodiment, the carrying capacity of each storage position in the storage position set for the articles is determined, and the same article in the rest storage positions is transferred to the storage position corresponding to the maximum carrying capacity under the condition that the maximum carrying capacity is greater than or equal to the total storage capacity, so that the purpose that the same article is stored in only one storage position is achieved, and the subsequent picking efficiency is improved.

Referring to fig. 2, a schematic flow chart of an alternative inventory finishing method according to an embodiment of the present invention is shown, including the following steps:

s201: determining storage positions in a warehouse, in which the articles are stored, according to the identifiers of the articles, and acquiring the storage amount of the articles in each storage position to obtain the total storage amount of the articles;

s202: determining the storage capacity and the volume of each article except the article in each storage position to obtain the occupied volume of all the articles except the article in each storage position, and combining the volume of each storage position to further obtain the residual volume of each storage position after the occupied volume is removed;

s203: obtaining the bearing capacity of each storage position on the articles according to the residual volume and the volume of the articles;

s204: if the maximum bearing capacity is larger than or equal to the total storage capacity, extracting a storage position corresponding to the maximum bearing capacity, and taking the extracted storage position as a target storage position for transferring the article;

s205: if the maximum bearing capacity is smaller than the total storage capacity, sequencing the obtained bearing capacities from large to small, and accumulating the bearing capacities step by step according to the sequencing;

s206: and if the accumulated bearing capacity is larger than or equal to the total storage capacity, extracting a storage bit corresponding to the accumulated bearing capacity, and taking the extracted storage bit as a target storage bit for transferring the article.

In the above embodiment, for the steps S201 to S204, reference may be made to the descriptions of the steps S101 to S103 shown in fig. 1, and details are not repeated here.

In the above embodiment, in step S205, when the maximum bearing capacity is greater than or equal to the total storage capacity, the same article in the remaining storage positions may be transferred to the storage position corresponding to the maximum bearing capacity.

However, in actual operation, there may be a case where the maximum carrying capacity is smaller than the total storage capacity, and at this time, the carrying capacity of each storage position for the article is smaller than the total storage capacity, and compared with the method shown in fig. 1, a plurality of storage positions are required to store the article.

Also taking the apple as an example, if the bearing capacity of the storage positions 1-3 for the apple is:

TABLE 2 storage and bearing capacity of each storage bit to apple

Storage position	Storage capacity for apples	Calculated load capacity
			Storage position 1	20	60
Storage position 2	30	90
			Storage position 3	50	50

It is known that each load bearing capacity is less than 100% of the total storage capacity of the apples in the warehouse. Considering that the number of the storage positions for storing the apples is as small as possible, the comparison needs to be accumulated one by one from the maximum bearing capacity. Sorting the bearing capacity according to the sequence from big to small to obtain a storage bit list BL corresponding to the apple_apple＝[b₍₁₎,b₍₂₎,b₍₃₎](ii) a Wherein, b_(k)For relabeling the bin after sorting, e.g. bin 2 in Table 2 corresponds to b₍₁₎。

In step S206, the carrying capacity is accumulated step by step according to the order of the storage list, and the accumulated carrying capacity is compared with the total storage capacity until the accumulated carrying capacity is greater than or equal to the total storage capacity. See table 3 for an indication:

TABLE 3 sequential accumulation of carrying capacity from big to little

Finally, the storage bit 1 and the storage bit 2 are used as target storage bits for storing apples, and the apples in the storage bit 3 need to be stored into the storage bit 1 and the storage bit 2:

1) in order to store the apples in the same storage position as much as possible, 10 apples can be extracted from the storage position 2, 50 apples can be extracted from the storage position 3 and transferred to the storage position 1, and only 10 apples are reserved in the storage position 2;

2) apple dumping is performed randomly/averagely, for example, storage bit 3 stores 25 apples into storage bit 1 and storage bit 2, respectively.

In addition, under the condition that the bearing capacity is smaller than the total storage capacity of the articles, although the storage positions can be randomly selected to accumulate the bearing capacity of the articles, the obtained result is uncontrollable, and even the condition that the number of the target storage positions is large occurs. For example:

TABLE 4 random accumulation of bearing capacity

The invention selects the sorting according to the bearing capacity to carry out the progressive accumulation, and finally the articles are all stored in the storage position with larger bearing capacity. Specifically, the method comprises the following steps: for the

Are all less than the total storage quantity q of the articles s_sCan be firstly as follows

Sorting from big to small to obtain a storage position list corresponding to the article s

Then according to the list sequence pair

Accumulating until the accumulation result is greater than or equal to q_sSo far:

1) initializing k to 1 and res to 0;

2) order to

Wherein k represents the storage positions ordered as k in the storage position list;

3) if res<q_sIf so, changing k to k +1, and continuing to circulate in the step 2;

4) if res is more than or equal to q_sAnd then the process is ended.

According to the method provided by the embodiment, under the condition that all bearing capacity is smaller than the total storage capacity of the articles, sequential accumulation can be carried out according to the bearing capacity sequence, so that the articles are stored in a plurality of storage positions with larger bearing capacity, the article layout is realized, and the delivery efficiency of the articles is improved; and when the subsequent articles are put in storage, the articles can be directly stored in the storage positions, so that the article storage efficiency is improved.

Referring to fig. 3, a schematic flow chart of another alternative inventory finishing method according to an embodiment of the present invention is shown, including the following steps:

s301: determining storage positions in a warehouse, in which the articles are stored, according to the identifiers of the articles, and acquiring the storage amount of the articles in each storage position to obtain the total storage amount of the articles;

s302: determining the storage capacity and the volume of each article except the article in each storage position to obtain the occupied volume of all the articles except the article in each storage position, and combining the volume of each storage position to further obtain the residual volume of each storage position after the occupied volume is removed;

s303: obtaining the bearing capacity of each storage position on the articles according to the residual volume and the volume of the articles;

s304: if the maximum bearing capacity is larger than or equal to the total storage capacity, extracting a storage position corresponding to the maximum bearing capacity, and taking the extracted storage position as a target storage position for transferring the article;

s305: if the maximum bearing capacity is smaller than the total storage capacity, sequencing the obtained bearing capacities from large to small, and accumulating the bearing capacities step by step according to the sequencing;

s306: if the accumulated bearing capacity is larger than or equal to the total storage capacity, extracting a storage bit corresponding to the accumulated bearing capacity, and taking the extracted storage bit as a target storage bit for transferring the article;

s307: counting the total number of the determined storage bits, determining the difference between the total number and the number of the determined target storage bits, and taking the obtained difference as the number of the storage bits of the article to be transferred;

s308: obtaining the storage space utilization rate of all storage spaces for storing the articles according to the storage space of each article in each storage space, the volume of each article and the volume of each storage space;

s309: if first articles with the same quantity as the storage positions of the articles exist, comparing the storage position utilization rate of the articles with the storage position utilization rate of the first articles, and taking the articles with the smaller storage position utilization rate or the first articles as articles which are sorted preferentially;

s310: and if a second article equal to the storage space utilization rate of the article exists, comparing the storage space quantity of the article with the storage space quantity of the second article, and taking the article with larger storage space quantity or the second article as the article with priority arrangement.

In the above embodiment, for steps S301 to S304, reference may be made to the description of steps S101 to S103 shown in fig. 1, and for steps S305 and S306, reference may be made to the description of steps S205 and S206 shown in fig. 2, which are not described again here.

In the above embodiment, in step S307, taking the article S as an example, the number of target storage bits required to be used for unloading the article is set to k, and there is no need to use the article S as the target storage bit numberThe number of storage positions (i.e. storage positions to be transferred or storage positions for storing the articles to be reduced) used is d_S＝|B_sAnd l-k. For example, if the number of bits currently storing an apple in table 3 is 3, and the calculated target number of bits is 2, the number of bits to be dumped into an apple is 3-2 ═ 1.

Number of storage positions d_SReflecting reserve bit set B_SThe storage quantity of the stored articles s can be reduced. When d is_SWhen the goods are higher, the storage positions for storing the goods s are more, but the storage is more disordered, some storage positions are unnecessary to store, and the urgency of tallying is increased; otherwise, the urgency of tallying is low.

Thus, for items with a higher bin number and not below a certain threshold (i.e., the first predetermined number threshold), a prioritized item may be identified. E.g. d_S≥2。

For step S308, in order to improve the accuracy of determining the prioritized articles, the bin utilization rate of the corresponding bin of the stored articles needs to be considered.

For the articles s, calculating a storage position set B according to the storage quantity and volume of each article in each storage position and the volume of each storage position_SStorage utilization beta in_SThe method comprises the following steps:

storage utilization ratio beta_SReflecting reserve bit set B_SAverage utilization of each storage position in the system. When beta is_SWhen the goods sorting urgency is low, the goods sorting urgency is high, and the goods sorting urgency is high; when beta is_SAnd when the storage space is higher, the utilization rate of each storage space is higher, and the urgency of tallying is lower.

For steps S309 and S310, sorting the articles whose number of bins that can be reduced for storage is greater than or equal to the first predetermined number threshold, and determining the manner in which the articles are prioritized may be configured with:

1) according to the number of storage positions d_SSorting from large to small if d_SEqual, then according to beta_SSorting from big to small;

taking article s as an example, if present and d_SEqual articles f, then compare β of articles s_SAnd beta of the object f_fAnd taking the articles s or f with low storage space utilization rate as articles to be sorted preferentially.

2) According to the bit utilization rate beta_SSorting from large to small if beta_SAre equal, then according to d_SSorting from big to small;

taking article s as an example, if present with beta_SEqual articles h, d of article s are compared_SAnd d of the article h_hAnd the articles s or h with the smaller number of storage positions can be used as articles to be sorted preferentially.

The priority of the articles in the warehouse is compared in the above way, and the article list SL is obtained through sorting. Each article in the list corresponds to the calculated storage position number d_SAnd bit utilization beta_SAnd finally, the data are pushed to a warehouse manager, so that the warehouse manager can conveniently select the articles to be sorted.

The method provided by the embodiment can be used for screening the articles in the warehouse and sorting the tally priority by comparing the storage space utilization rate of each article and reducing the number of the stored storage spaces, thereby determining the articles with higher tally urgency and providing a basis for subsequent warehouse managers to purposefully sort the articles in the warehouse.

Referring to fig. 4, a schematic flow chart of an alternative inventory finishing method according to an embodiment of the present invention is shown, including the following steps:

s401: according to the identification of the article, determining storage positions in a warehouse, in which the article is stored, and acquiring the storage amount of the article in each storage position;

s402: sequencing the obtained storage amounts from large to small, extracting a first storage amount with the first sequencing, and determining a first storage position corresponding to the article and the first storage amount;

s403: according to the storage amount of each article in the first storage position, the volume of each article and the volume of the first storage position, obtaining a first residual volume of the first storage position after the volume occupied by all articles is removed;

s404: obtaining a first storable amount of the first storage location for the item in the first remaining volume from the first remaining volume and the volume of the item;

s405: if the second storage amount of the last-but-one ordering is less than or equal to the first storage amount, extracting the articles with the second storage amount from a second storage position to be transferred and stored into the first storage position;

s406: determining the difference between the first storage amount and the second storage amount to obtain the remaining storage amount of the first storage position to the article;

s407: if the third storage amount of the last but one of the orders is less than or equal to the remaining storage amount, extracting the items of the third storage amount from a third storage position to dump to the first storage position;

s408: if the third storage amount is larger than the remaining storable amount, extracting the articles with the remaining storable amount from the third storage position to be transferred and stored into the first storage position;

s409: if the second storage amount is larger than the first storable amount, extracting the first storable amount of the article from the second storage position to be stored in the first storage position in a transferring way;

s410: determining the difference between the second storage amount and the first storage amount to obtain the remaining transfer storage amount of the second storage position to the article;

s411: extracting a fourth storage amount of the second sorting, and according to the storage amount of each article in a fourth storage position, the volume of each article and the volume of the fourth storage position, obtaining a second residual volume of the fourth storage position after the volume occupied by all articles is removed;

s412: obtaining a second storable amount of the fourth reservoir for the item in the second remaining volume from the second remaining volume and the volume of the item;

s413: if the residual inventory transferring amount is less than or equal to the second storage amount, extracting the articles of the residual inventory transferring amount from the second storage position to transfer into the fourth storage position;

s414: if the residual inventory is larger than the second storable amount, the second storable amount of the articles are extracted from the second storage position to be dumped into the fourth storage position.

In the above embodiment, for step S401, reference may be made to the description of step S101 shown in fig. 1, and details are not repeated here.

In the above embodiment, in steps S402 to S404, different warehouse managers receive a tally product list

May be different. WMS traverses the items in SL', and for item s, the item s is respectively determined to be in the storage position set B_SThe storage capacity q of each storage position_isAnd to q_isSorting from big to small to obtain a storage position list

In order to reduce the transportation cost, the articles s in other storage positions are stored in the storage position with the largest storage amount as much as possible. Thus creating a tally plan for the item s_sPreviously, the first storage space was first ordered with regard to the storage volume, and at most the number of items s that can be stored in the currently unoccupied volume (i.e. the first remaining volume):

suppose k₁1, the first memory location is ordered for memory space

In which the quantity q of articles s is stored_1sBy the number of individual articles (including articles s) in the first storage location

Volume v of each article_jAnd volume v of the item s_sVolume of storage

Calculating the first storage location

The number of articles s that can be stored at present

I.e. the first storable amount:

for example, the storage position stores three articles of apples, bananas and pears. Wherein, 3 apples are provided, and each apple occupies 10 volumes; 4 bananas occupy 12 volumes each; there are 2 pears, each occupying a volume of 15. Assuming that the volume of the reservoir is 200, the number that can still be stored for apples (rounded down) is:

for steps S405 to S408, let k₁＝1、k₂＝N_sAnd an

(initial value is null).

Determining the second reservoir of the last-but-one order in the list BL

Obtaining a storage location

Second storage capacity of medium items s

If it is

Will store the bit

All the articles in the storage position

In, and

referring to Table 5, a set of bins B is shown_appleThe storage capacity of each storage position to the apple is as follows:

TABLE 5 storage of each bit for apple

Storage position	Storage capacity for apples
		Storage position A	20
Storage position B	50
		Storage position C	30
Storage position D	10

The memory space is sorted according to the sequence from big to small to generate a memory space list BL 'corresponding to the apple'_apple＝[a₍₁₎,a₍₂₎,a₍₃₎,a₍₄₎](ii) a Wherein, a₍₁₎、a₍₂₎、a₍₃₎、a₍₄₎Respectively corresponding to the storage position B, the storage position C, the storage position A and the storage position D.

DeterminingFor the storage position B (i.e. a) with the largest storage amount of the apples₍₁₎) And obtaining the number of the storage positions B which can be stored for the apples according to the volume and the number of the articles in the storage positions B and the volume of the storage positions, if the obtained number is 15.

Reservoir D (i.e. a)₍₄₎) The storage capacity of the apple is minimum, because 10<15, so that the apples in bit D need to be completely transferred to bit B, where pi ═ pi & { apples, 10, a &₍₄₎，a₍₁₎}。

Further, due to

Although the reserve position is already stored

All the articles in the container are transferred to the storage position

Middle, but storage position

Can still store a certain amount of articles s (i.e. the remaining storage amount), at this time, the articles s need to be taken from the penultimate storage position and stored into the storage position

In (1).

Let II_s＝Π_s∪π、

k₂＝k₂-1，

If k₁≥k₂Then the loop is ended (because k is₁Corresponding to the top ranked bin, k, in the queue₂Corresponding to the storage position at the back of the sequence, and the invention only transfers the articles s in the storage position at the back of the sequence to the storage position at the front of the sequence);

if k₁＜k₂Repeating the above steps to transfer the articles s in the rear storage position to the rowIn the front-in-order bin, specifically:

and continues the loop.

Also with reference to the above example, after all apples in bit D are transferred to bit B, the number of apples that can also be stored in the first ordered bit B is 15-10 to 5 (i.e. the remaining amount that can be stored). Considering the second last bin a, since 20>5, bin a only stores 5 apples into bin B, and all or part of the remaining 15 apples is stored into the second bin C.

For steps S409 to S414, the above steps only correspond to the storage amount of the item S in the last storage position being less than or equal to the number that can be stored in the first storage position, and there may be a case that the storage amount is greater than the storage amount in actual operation. If it is

Then the slave storage position

In only unloading

Article s to storage location

In, and

also taking table 5 as an example, assume that the calculated storage location B can store 3 apples. The storage capacity of the apples in the last storage position D is 10>3, only 3 apples are extracted from the storage bit D to be stored in the storage bit B, wherein pi ═ pi & { apple, 3, a-₍₄₎，a₍₁₎}。

Further, due to

For the bin with the last to last order

Part of the articles s are still to be stored (i.e. the residual storage amount), and the residual articles s need to be stored to the second third storage position

(and ordering the third fourth bin

) In (1).

Specifically, let k₁＝k₁+1：

If k₁≥k₂If yes, ending the circulation;

if k₁＜k₂Let us order

And continues the loop.

Also referring to the above example, after 3 apples in storage site D are transferred to storage site B, 7 apples remain in storage site D to be transferred. Considering the bin C sorted the second, the number of apples that can still be stored in the bin C is calculated with reference to steps S403 and S404, if it is 8. Since 8>7, this means that the remaining 7 apples in the storage bit D can be all transferred to the storage bit C.

However, if the number of the apples that can be stored in the storage position C is less than 7 (i.e. the second storage amount), the above steps are repeated until the remaining apples in the storage position D are transferred to other storage positions that are ranked in front of the storage position D.

In the above, the situation that the storage positions in the front of the sorting position can completely store the articles in the storage positions in the back of the sorting position is considered, but in actual operation, the number of the storage positions for storing the apples is small or the storage positions in the front of the sorting position cannot completely store the articles in the storage positions in the back of the sorting position, for example, only the storage position B and the storage position D exist, then the storage positions for storing the apples are still the storage position B and the storage position D, 3 apples in the storage position D are transferred to the storage position B, and the rest 7 apples exist.

In the way described aboveObtained by calculation

II will be_sThe task of (2) is added into the carrying pool to be executed so as to be used for subsequent carrying personnel to carry out the article carrying operation according to the carrying scheme.

According to the method provided by the embodiment, the articles are transferred from the storage positions with smaller storage amount to the storage positions with larger storage amount, so that the carrying cost is reduced, and the article sorting efficiency is improved.

Referring to fig. 5, a schematic flow chart of an alternative inventory finishing method according to an embodiment of the present invention is shown, including the following steps:

s501: monitoring the use state of each storage position in the warehouse, determining an empty storage position and a non-empty storage position, counting the number of the empty storage positions, and further obtaining the proportion of the number of the empty storage positions in the total number of the storage positions;

s502: determining the storage capacity of each article in each non-empty storage position, and combining the volume of each article and the volume of each non-empty storage position to obtain the utilization rate of all non-empty storage positions in the warehouse;

s503: obtaining the health degree of the warehouse inventory according to the proportion and the utilization rate; wherein the health degree is a quantitative index for measuring the health degree of the warehouse;

s504: and if the health degree is lower than a preset health degree threshold value, triggering the reminding and sorting operation of the stored articles in the warehouse.

In the above embodiment, for step S501, the warehouse management system WMS monitors the use status of each storage location in the warehouse in real time. And determining the storage positions in which the articles are stored as non-empty storage positions and determining the storage positions in which the articles are not stored as empty storage positions by traversing the storage position-article comparison table.

Further, there may be situations where a bin is available or unavailable. Therefore, before determining the empty storage position and the non-empty storage position, the WMS needs to reject the unavailable storage position, so as to avoid the situation that the unavailable storage position is classified into the empty storage position subsequently, which results in an article storage error.

The available storage space set in the warehouse is B, the total number of storage spaces isB | is a set of non-empty storage bits_non-emptyThe empty storage bit set is B_emptyAnd B is_non-empty∪B_empty＝B、

Calculating the proportion of the number of the empty storage bits in the total number of the storage bits in the current warehouse, specifically:

ρ₁＝|B_empty|/|B|

for step S502, set bin i (i ∈ B)_non-empty) Has a volume of V_i.maxIf the sum of the volumes of all the non-empty storage positions in the warehouse is equal to

Furthermore, as a certain space needs to be reserved in the storage position to be convenient for taking the articles, the V shape_i.maxThe available space of the reservoir may also be, for example, length, width, height. Where the percentage may be an empirical value, for example 70%, meaning that up to 70% of the space in the reservoir is occupied.

Determining a set S of items stored in a storage location i_iAccording to item j (j epsilon S)_i) Storage quantity q_ijAnd volume v_jVolume V of storage location i_i.maxAnd obtaining the utilization rate of all non-empty storage positions in the warehouse:

in addition to the above, V may be calculated separately for different types (e.g., available volumes) of reservoirs_i.maxThen weighting is carried out through the proportion of the non-empty storage digits of the type to obtain the utilization rate rho₂。

For step S503, it is apparent that ρ₁∈[0,1]，ρ₂∈[0,1]. When rho₁When the size of the storage space is larger, the number of the empty storage spaces in the warehouse is larger, and the selectivity of the empty storage spaces when new goods are put in the warehouse is larger, so that the tally demand can be less urgent. When rho₂When larger, indicating the utilization of non-empty storage bits in the warehouseThe rate is high and the tally needs may not be as urgent as well.

The method mainly aims at the situation that the number of the current empty storage positions in the warehouse is small or the utilization rate of the non-empty storage positions is low, and specifically evaluates the health degree of the warehouse inventory; wherein, the health degree is a quantitative index for measuring the health degree of the warehouse:

wherein, T₁And T₂Presetting thresholds for the system, e.g. let T₁＝0.9、T₂0.9, when rho is guaranteed₁≥T₁Or rho₂≥T₂When the Score is more than or equal to 1.

The inventory health Score may be updated at the same time as the comparison table is updated every time an item is loaded or unloaded, or may be recalculated at a fixed time, for example, once a day.

For step S504, the health threshold Score may be pre-configured_TWhen Score < Score_TAnd carrying out early warning to remind workers to carry out tally. Score can be defaulted in actual operation_T1. But when the Score is more than or equal to the Score_TAnd the time is that the layout of the articles in the library is controllable, and the articles can not be rearranged at the time.

In the method provided by the embodiment, the system monitors the use state of the storage positions, evaluates the health degree of the warehouse according to the proportion of the number of the empty storage positions in the warehouse and the utilization rate of the non-empty storage positions, and triggers the arrangement reminding of the articles in the warehouse when the health degree is lower.

According to the method provided by the embodiment of the invention, when the number of the empty storage bits in the warehouse is small and the utilization rate of the non-empty storage bits is low, aiming at the condition that the same article is stored in a plurality of storage bits in a scattered manner, the article in the rest storage bits can be stored into the storage bit with the maximum bearing capacity, and the article with low storage capacity can be transferred to the storage bit with high storage capacity, so that the merging operation of the articles in the storage bits is realized.

Referring to fig. 6, a schematic diagram of main modules of an inventory sorting apparatus 600 according to an embodiment of the present invention is shown, including:

a storage amount obtaining module 601, configured to determine, according to an identifier of an article, storage locations in a warehouse where the article is stored, obtain storage amounts of the article in the storage locations, and obtain a total storage amount of the article;

a remaining volume determining module 602, configured to determine storage volumes and volumes of the other articles except the article in each storage space, to obtain occupied volumes of all the articles except the article in each storage space, and obtain a remaining volume of each storage space after the occupied volumes are removed by combining the volumes of the storage spaces;

and a destination storage bit determining module 603, configured to obtain, according to each remaining volume and the volume of the article, a bearing capacity of each storage bit for the article, and if the maximum bearing capacity is greater than or equal to the total storage amount, extract a storage bit corresponding to the maximum bearing capacity, and use the extracted storage bit as a destination storage bit for unloading the article.

In the device for implementing the present invention, the destination storage position determining module 603 is further configured to:

and if the accumulated bearing capacity is larger than or equal to the total storage capacity, extracting a storage bit corresponding to the accumulated bearing capacity, and taking the extracted storage bit as a target storage bit for transferring the article.

The apparatus of the present invention further comprises a prioritized article determination module 604 (not shown) configured to:

and if the number of the storage positions is larger than or equal to a first preset number threshold value, determining the articles as articles prioritized for sorting.

In the device for implementing the present invention, the prioritized article determining module 604 is further configured to:

obtaining the storage space utilization rate of all storage spaces for storing the articles according to the storage space of each article in each storage space, the volume of each article and the volume of each storage space;

if first articles with the same quantity as the storage positions of the articles exist, comparing the storage position utilization rate of the articles with the storage position utilization rate of the first articles, and taking the articles with the smaller storage position utilization rate or the first articles as articles which are sorted preferentially; or

And if a second article equal to the storage space utilization rate of the article exists, comparing the storage space quantity of the article with the storage space quantity of the second article, and taking the article with larger storage space quantity or the second article as the article with priority arrangement.

The apparatus for implementing the present invention further includes a storage amount determining module 605 (not shown in the figure) for:

if the second storage amount of the last-but-one ordering is less than or equal to the first storage amount, extracting the articles with the second storage amount from a second storage position to be transferred and stored into the first storage position; or

If the second storage amount is larger than the first storage amount, the first storage amount of the articles is extracted from the second storage position to be stored in the first storage position.

In the device for implementing the present invention, the storage amount determining module 605 is further configured to:

if the third storage amount of the last but one of the orders is less than or equal to the remaining storage amount, extracting the items of the third storage amount from a third storage position to dump to the first storage position; or

If the third storage amount is larger than the remaining storable amount, the articles with the remaining storable amount are extracted from the third storage position to be stored in the first storage position.

determining the difference between the second storage amount and the first storage amount to obtain the remaining transfer storage amount of the second storage position to the article;

obtaining a second storable amount of the fourth reservoir for the item in the second remaining volume from the second remaining volume and the volume of the item;

if the residual inventory transferring amount is less than or equal to the second storage amount, extracting the articles of the residual inventory transferring amount from the second storage position to transfer into the fourth storage position; or

If the residual inventory is larger than the second storable amount, the second storable amount of the articles are extracted from the second storage position to be dumped into the fourth storage position.

The apparatus further includes an inventory health monitoring module 606 (not shown) for:

In addition, the detailed implementation of the device in the embodiment of the present invention has been described in detail in the above method, so that the repeated description is not repeated here.

FIG. 7 illustrates an exemplary system architecture 700 to which embodiments of the invention may be applied.

As shown in fig. 7, the system architecture 700 may include

terminal devices

701, 702, 703, a network 704 and a server 705 (by way of example only). The network 704 serves to provide a medium for communication links between the

terminal devices

701, 702, 703 and the server 705. Network 704 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

A user may use the

terminal devices

701, 702, 703 to interact with a server 705 over a network 704, to receive or send messages or the like. Various communication client applications may be installed on the

terminal devices

701, 702, 703.

The

terminal devices

701, 702, 703 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 705 may be a server providing various services, such as a background management server (for example only) providing support for shopping websites browsed by users using the

terminal devices

701, 702, 703. The backend management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (for example, target push information, product information — just an example) to the terminal device.

It should be noted that the inventory sorting method provided by the embodiment of the present invention is generally executed by the server 705, and accordingly, the inventory sorting apparatus is generally disposed in the server 705.

It should be understood that the number of terminal devices, networks, and servers in fig. 7 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

Referring now to FIG. 8, shown is a block diagram of a computer system 800 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 8 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 8, the computer system 800 includes a Central Processing Unit (CPU)801 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. In the RAM 803, various programs and data necessary for the operation of the system 800 are also stored. The CPU 801, ROM 802, and RAM 803 are connected to each other via a bus 804. An input/output (I/O) interface 805 is also connected to bus 804.

The following components are connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a signal such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the I/O interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.

In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811. The computer program executes the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 801.

It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor comprises a storage capacity acquisition module, a residual volume determination module and a target storage capacity determination module. The names of these modules do not in some cases constitute a limitation on the module itself, for example, the destination storage location determination module may also be described as a "destination storage location module for determining the dumped goods".

As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise:

determining storage positions in a warehouse, in which the articles are stored, according to the identifiers of the articles, and acquiring the storage amount of the articles in each storage position to obtain the total storage amount of the articles;

and obtaining the bearing capacity of each storage position on the article according to each residual volume and the volume of the article, if the maximum bearing capacity is greater than or equal to the total storage capacity, extracting the storage position corresponding to the maximum bearing capacity, and taking the extracted storage position as a target storage position for transferring the article.

According to the technical scheme of the embodiment of the invention, when the number of the empty storage positions in the warehouse is less and the utilization rate of the non-empty storage positions is lower, aiming at the condition that the same article is stored in a plurality of storage positions in a scattered manner, the article in the rest storage positions can be stored into the storage position with the maximum bearing capacity, and the article with lower storage capacity can be transferred to the storage position with higher storage capacity, so that the merging operation of the articles in the storage positions is realized.

The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. An inventory arrangement method is characterized by comprising the following steps:

2. The method of claim 1, further comprising, after said obtaining the loading of each bin with the items,:

3. The method according to claim 1 or 2, further comprising, after said taking the extracted storage location as a destination storage location for unloading the item:

4. The method of claim 3, wherein the determining the item as a prioritized item further comprises:

5. The method of claim 1, further comprising, after said obtaining the amount of storage for the item in each bin:

6. The method of claim 5, further comprising, after extracting the item of the second amount of storage from a second storage location for dumping into the first storage location:

7. The method of claim 5, further comprising, after extracting the first storable amount of the item from the second storage location for transfer into the first storage location:

8. The method of claim 1, further comprising, prior to said determining a bin within a warehouse where the item is stored based on the identity of the item:

9. An inventory arrangement device, comprising:

the storage quantity acquisition module is used for determining storage positions in a warehouse, in which the articles are stored, according to the identifiers of the articles, and acquiring the storage quantity of the articles in each storage position to obtain the total storage quantity of the articles; wherein, the storage position is also stored with a first article;

the residual volume determining module is used for determining the storage volume and the volume of each article except the article in each storage position, obtaining the occupied volume of all articles except the article in each storage position, and combining the volume of each storage position to further obtain the residual volume of each storage position after the occupied volume is removed;

and the target storage position determining module is used for obtaining the bearing capacity of each storage position on the article according to each residual volume and the volume of the article, extracting the storage position corresponding to the maximum bearing capacity if the maximum bearing capacity is greater than or equal to the total storage capacity, and taking the extracted storage position as the target storage position for transferring the article.

10. An electronic device, comprising:

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-8.

11. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-8.