CN111832980A - Method and device for allocating storage positions of multi-layer warehouse - Google Patents
Method and device for allocating storage positions of multi-layer warehouse Download PDFInfo
- Publication number
- CN111832980A CN111832980A CN201910300259.0A CN201910300259A CN111832980A CN 111832980 A CN111832980 A CN 111832980A CN 201910300259 A CN201910300259 A CN 201910300259A CN 111832980 A CN111832980 A CN 111832980A
- Authority
- CN
- China
- Prior art keywords
- storage
- storage layer
- channel
- articles
- warehoused
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 238000012163 sequencing technique Methods 0.000 claims description 45
- 238000012545 processing Methods 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 9
- 238000010586 diagram Methods 0.000 description 13
- 239000002699 waste material Substances 0.000 description 9
- 238000004891 communication Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 230000008569 process Effects 0.000 description 6
- 238000012546 transfer Methods 0.000 description 6
- 238000007726 management method Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
Landscapes
- Business, Economics & Management (AREA)
- Economics (AREA)
- Engineering & Computer Science (AREA)
- Marketing (AREA)
- Quality & Reliability (AREA)
- Finance (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Accounting & Taxation (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Warehouses Or Storage Devices (AREA)
Abstract
The invention discloses a method and a device for allocating storage positions of a multi-layer warehouse, and relates to the technical field of computers. One embodiment of the method comprises: acquiring a storage position set of the same kind of articles in a warehouse according to the identification of the articles to be warehoused, and acquiring storage layer information and channel information according to the storage positions; sorting each storage layer in the storage position set according to the weight and the vacancy degree of the storage layer, and sorting the channel of each storage layer according to the residual storage bit number of the channel; and allocating storage positions for the articles to be put in storage by taking the storage layer as a first sorting factor and the channel as a second sorting factor. This embodiment can rationally plan the storage position, and it is extravagant few to store up the position, and storage utilization is high, and can reduce unnecessary warehouse removal, can also improve simultaneously and put in storage and the efficiency of leaving warehouse.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a method and a device for allocating storage positions of a multi-layer warehouse.
Background
At present, the application of the multi-layer stereoscopic warehouse is more and more extensive, and the storage capacity and the efficiency improvement are all key points of competition. The most common multi-story warehouses are, for example, double-depth shuttling (shuttle) warehouses, multi-depth four-way vehicle shuttling warehouses, and the like.
Compared with a double-depth shuttling warehouse, the multi-depth four-way vehicle shuttling warehouse can store more articles, has higher storage capacity, has the same depth (corresponding to a row of tray storage positions in a fixed area in the shuttling warehouse) of 4 trays (used for bearing articles and convenient to take and place) and is suitable for the commodities stored by the trays of medium and large articles.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
because each channel of the multi-depth shuttle library can be provided with a plurality of trays for bearing articles, how to plan the storage positions of the multi-layer multi-depth shuttle library can realize reasonable utilization of the storage positions and more efficient execution of the in-out operation, which is a problem to be solved urgently at present.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for allocating storage locations of a multi-story warehouse, which can reasonably plan storage locations, reduce storage location waste, increase storage utilization, reduce unnecessary warehouse movement, and improve warehouse entry and warehouse exit efficiency.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method of multi-story warehouse bin allocation.
A method of multi-level warehouse bin allocation, comprising: acquiring a storage position set of the same kind of articles in a warehouse according to the identification of the articles to be warehoused, and acquiring storage layer information and channel information according to the storage positions; sorting each storage layer in the storage position set according to the weight and the vacancy degree of the storage layer, and sorting the channel of each storage layer according to the residual storage bit number of the channel; and allocating storage positions for the articles to be warehoused by taking the storage layer as a first sorting factor and the channel as a second sorting factor.
Optionally, sorting each storage tier in the storage location set according to the weight and the idleness of the storage tier comprises: acquiring the weight and the vacancy degree corresponding to each storage layer in the storage position set, wherein the vacancy degree is obtained according to the ratio of the number of warehouse entry and exit tasks of the storage layer to the number of conveying equipment; performing first ordering on each storage layer in the storage position set according to the weight of the storage layers from large to small; and sequentially judging whether the vacancy degree of the current storage layer exceeds a set vacancy degree threshold value or not for the first sorted storage layer, and if so, exchanging the sorted positions of the current storage layer and the storage layer with the highest vacancy degree.
Optionally, the sorting the channels of each storage layer according to the remaining storage bits of the channels includes: for each storage layer, acquiring the residual storage bit number of each channel of the storage layer; and sequencing the channels from less to more according to the residual storage bit number, wherein if the residual storage bit numbers of the channels are the same, sequencing the channels from less to more according to the distance cost of the channels.
Optionally, with a storage layer as a first ordering factor and a channel as a second ordering factor, allocating storage locations for the to-be-warehoused items includes: processing each storage layer in sequence according to the sequencing result of the storage layers to determine a channel; for each determined channel, sequentially determining storage positions according to the principle of interior and exterior to allocate the storage positions for the articles to be warehoused; wherein, each storage layer is processed as follows: acquiring the residual storage bit number of each channel of the storage layer; if the storage layer has no residual storage positions, selecting a next storage layer and determining a channel, wherein if the storage layer is the last storage layer, a new empty channel is allocated to the article to be warehoused; otherwise, if the number of the remaining storage positions of the storage layer is not less than the number of the articles to be stored in the storage layer, sequencing the channels from small to large according to the number of the remaining storage positions, and determining the channels in sequence; and if the number of the residual storage positions of the storage layer is less than the number of the articles to be warehoused, all the channels of the storage layer are determined channels, and the next storage layer is selected to continue determining the channels.
Optionally, the allocating a new empty channel for the to-be-warehoused item includes: acquiring value parameters of the articles to be warehoused; determining a matched channel, a storage layer where the channel is located and storage digits included in the channel according to the value parameters; sorting each determined storage layer according to the weight and the vacancy degree of the storage layer, and sorting the channel of each storage layer according to the storage bit number included by the channel; and allocating a new empty channel for the articles to be warehoused according to the planned warehousing quantity of each storage layer by taking the storage layer as a first sequencing factor and the channel as a second sequencing factor.
Optionally, the method further comprises: and if the storage positions of the same type of articles in the warehouse cannot be acquired according to the identifiers of the articles to be warehoused, directly allocating a new empty channel for the articles to be warehoused.
According to another aspect of embodiments of the present invention, an apparatus for multi-level warehouse bin allocation is provided.
An apparatus for multi-tiered warehouse bin allocation, comprising: the position acquisition module is used for acquiring a storage position set of the same kind of articles in the warehouse according to the identification of the articles to be warehoused and acquiring storage layer information and channel information according to the storage positions; the sorting module is used for sorting each storage layer in the storage position set according to the weight and the vacancy degree of the storage layer and sorting the channel of each storage layer according to the residual storage bit number of the channel; and the storage position distribution module is used for distributing storage positions for the articles to be warehoused by taking the storage layer as a first sorting factor and the channel as a second sorting factor.
Optionally, the sorting module is further configured to: acquiring the weight and the vacancy degree corresponding to each storage layer in the storage position set, wherein the vacancy degree is obtained according to the ratio of the number of warehouse entry and exit tasks of the storage layer to the number of conveying equipment; performing first ordering on each storage layer in the storage position set according to the weight of the storage layers from large to small; and sequentially judging whether the vacancy degree of the current storage layer exceeds a set vacancy degree threshold value or not for the first sorted storage layer, and if so, exchanging the sorted positions of the current storage layer and the storage layer with the highest vacancy degree.
Optionally, the sorting module is further configured to: for each storage layer, acquiring the residual storage bit number of each channel of the storage layer; and sequencing the channels from less to more according to the residual storage bit number, wherein if the residual storage bit numbers of the channels are the same, sequencing the channels from less to more according to the distance cost of the channels.
Optionally, the storage allocation module is further configured to: processing each storage layer in sequence according to the sequencing result of the storage layers to determine a channel; for each determined channel, sequentially determining storage positions according to the principle of interior and exterior to allocate the storage positions for the articles to be warehoused; wherein, each storage layer is processed as follows: acquiring the residual storage bit number of each channel of the storage layer; if the storage layer has no residual storage positions, selecting a next storage layer and determining a channel, wherein if the storage layer is the last storage layer, a new empty channel is allocated to the article to be warehoused; otherwise, if the number of the remaining storage positions of the storage layer is not less than the number of the articles to be stored in the storage layer, sequencing the channels from small to large according to the number of the remaining storage positions, and determining the channels in sequence; and if the number of the residual storage positions of the storage layer is less than the number of the articles to be warehoused, all the channels of the storage layer are determined channels, and the next storage layer is selected to continue determining the channels.
Optionally, the storage allocation module is further configured to: acquiring value parameters of the articles to be warehoused; determining a matched channel, a storage layer where the channel is located and storage digits included in the channel according to the value parameters; sorting each determined storage layer according to the weight and the vacancy degree of the storage layer, and sorting the channel of each storage layer according to the storage bit number included by the channel; and allocating a new empty channel for the articles to be warehoused according to the planned warehousing quantity of each storage layer by taking the storage layer as a first sequencing factor and the channel as a second sequencing factor.
Optionally, the system further comprises an empty channel allocation module, configured to: and if the storage positions of the same type of articles in the warehouse cannot be acquired according to the identifiers of the articles to be warehoused, directly allocating a new empty channel for the articles to be warehoused.
According to yet another aspect of an embodiment of the present invention, an electronic device for multi-tiered warehouse bin allocation is provided.
An electronic device for multi-tiered warehouse bin allocation, comprising: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors implement the method for allocating the storage location of the multi-level warehouse provided by the embodiment of the invention.
According to yet another aspect of embodiments of the present invention, a computer-readable medium is provided.
A computer readable medium, on which a computer program is stored, which when executed by a processor implements a method of multi-tiered warehouse bin allocation provided by embodiments of the present invention.
One embodiment of the above invention has the following advantages or benefits: acquiring a storage position set of the same kind of articles in a warehouse according to the identification of the articles to be warehoused, and acquiring storage layer information and channel information according to the storage positions; then, sorting each storage layer in the storage position set according to the weight and the vacancy degree of the storage layer, and sorting the channel of each storage layer according to the residual storage bit number of the channel; finally, the storage layer is used as a first sorting factor, the channel is used as a second sorting factor, and storage positions are allocated to the articles to be warehoused, so that the storage position allocation of a multi-layer multi-depth warehouse is realized, the storage positions can be reasonably planned, the storage position waste is less, and the storage utilization rate is high; the same kind of articles are stored in the same channel, so that unnecessary transfer can be reduced, and time and machine loss waste caused by transfer can be reduced; meanwhile, the storage layers and the channels are sequenced, and the articles to be warehoused are stored in a layered mode, so that warehousing and ex-warehouse efficiency 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 diagram of the main steps of a method of multi-level warehouse bin allocation according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a deployment structure of a multi-tiered warehouse, according to one embodiment of the invention;
FIG. 3 is a flow chart illustrating an implementation of a method for multi-tiered warehouse bin allocation according to one embodiment of the present invention;
FIG. 4 is a schematic block diagram of an apparatus for multi-level warehouse bin allocation according to an embodiment of the present invention;
FIG. 5 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 6 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of 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.
In order to solve the problems in the prior art, the invention provides a method and a device for distributing storage positions of a multi-layer warehouse, which can reasonably plan the storage positions, have less storage position waste and high storage utilization rate, reduce unnecessary warehouse moving and improve the warehouse entering and warehouse exiting efficiency.
Fig. 1 is a schematic diagram of the main steps of a method of multi-level warehouse bin allocation according to an embodiment of the present invention. As shown in fig. 1, the method for allocating storage locations in a multi-story warehouse according to the embodiment of the present invention mainly includes the following steps S101 to S103.
Step S101: acquiring a storage position set of the same kind of articles in a warehouse according to the identification of the articles to be warehoused, and acquiring storage layer information and channel information according to the storage positions;
step S102: sorting each storage layer in the storage position set according to the weight and the vacancy degree of the storage layer, and sorting the channel of each storage layer according to the residual storage bit number of the channel;
step S103: and allocating storage positions for the articles to be put in storage by taking the storage layer as a first sorting factor and the channel as a second sorting factor.
In order to facilitate the management of the articles and the warehousing and delivery operations, the articles are generally required to be placed in trays, one article is placed in each tray, and the same article is placed in the trays of a plurality of storage positions of each channel.
Fig. 2 is a schematic diagram of a deployment structure of a multi-tiered warehouse, according to an embodiment of the present invention. The deployment structure of the aisles and bays for each level of the multi-level warehouse is shown in fig. 2. As shown in fig. 2, each channel may include a plurality of bins, and each channel and bin may have a corresponding identifier, such as a code, for convenience of management. When a four-way vehicle (a shuttle vehicle for carrying articles, which can run in 4 directions of the longitudinal direction and the transverse direction) does not carry articles, the vehicle can run below the storage position; when the four-way vehicle carries an article, the vehicle can travel on a predetermined transport route outside the aisle.
When a warehouse receives a warehousing request of an article, a storage space distribution system firstly acquires an identifier of the article to be warehoused, then searches whether the article exists in the warehouse or not from the warehouse according to the identifier of the article to be warehoused, and acquires a storage position set of the article in the warehouse if the article exists so as to store the article to be warehoused and the same article together and facilitate warehousing and warehousing operations.
If the storage positions of the same type of articles in the warehouse cannot be acquired according to the marks of the articles to be warehoused, the fact that the articles identical to the articles to be warehoused are not stored in the warehouse is indicated, at the moment, a new empty channel needs to be directly allocated to the articles to be warehoused, and the storage positions are sequentially allocated according to the principle of inside before outside. The process of allocating a new empty channel for the article to be warehoused will be described in detail later.
After the storage position set is obtained, the storage layer information and the channel information of the same kind of articles as the articles to be warehoused can be obtained according to the storage positions. In general, the storage location information includes storage layer information, channel information, and storage location information stored in the article, for example: the storage positions are 1-3-02', wherein 1 corresponds to 1 layer, 3 corresponds to 3 rd channel, and 02 corresponds to 02 storage positions.
Thereafter, step S102 is executed: and sequencing each storage layer in the storage position set according to the weight and the vacancy degree of the storage layer, and sequencing the channel of each storage layer according to the residual storage bit number of the channel.
Specifically, according to an embodiment of the present invention, when sorting each storage tier in the storage location set, the following steps may be performed:
step S1021: acquiring the weight and the vacancy degree corresponding to each storage layer in the storage position set, wherein the vacancy degree is obtained according to the ratio of the number of warehouse entry and exit tasks of the storage layers to the number of conveying equipment;
step S1022: performing first sequencing on each storage layer in the storage position set according to the weight of the storage layers from large to small;
step S1023: and sequentially judging whether the vacancy degree of the current storage layer exceeds a set vacancy degree threshold value or not for the storage layer after the first sequencing, and if so, exchanging the sequencing positions of the current storage layer and the storage layer with the highest vacancy degree.
Wherein, each storage layer can preset a weight according to the convenience degree and efficiency of warehouse entry and warehouse exit, for example: layer 1 can be taken out of the warehouse without hoisting transportation equipment (such as a stacker), so that the weight of the layer 1 is larger than that of other layers, and the like. And each storage layer can obtain the corresponding vacancy according to the ratio of the number of the warehouse entry and exit tasks to be executed to the number of the conveying equipment, and the larger the vacancy is, the less waiting time is needed for warehousing, and the warehousing efficiency is higher. In one embodiment of the invention, the vacancy is equal to the ratio of the number of warehouse entry and exit tasks to the number of handling equipment in the storage floor.
When the storage layers are sorted, the weight of each storage layer is preferably considered, so that the warehousing and ex-warehousing efficiency can be guaranteed as much as possible. However, considering only the weight of the storage layer has a problem that all the entries and exits are considered to be accumulated in the layer with a large weight, and therefore, after the first sorting of the storage layers is performed according to the weight, the result of the first sorting needs to be optimized according to the idle condition of the storage layers. Specifically, in the embodiment of the present invention, an idle threshold is preset, for example, 1.5 or 2, and the like, and can be flexibly adjusted according to the idle degree of the warehouse. If the vacancy degree of a certain storage layer exceeds the set vacancy degree threshold value, the storage layer is busy, and in order to finish warehousing more quickly, a layer with a high vacancy degree is preferably selected to finish warehousing.
According to another embodiment of the present invention, when sorting the channels of each storage layer according to the remaining storage bit number of the channels, the following steps may be specifically performed:
step S1024: for each storage layer, acquiring the residual storage bit number of each channel of the storage layer;
step S1025: and sequencing the channels from less to more according to the residual storage bit number, wherein if the residual storage bit numbers of the channels are the same, sequencing the channels from less to more according to the distance cost of the channels.
Wherein the distance cost of the shaft is determined according to the distance from the outermost storage position of the shaft to the conveyor line or the elevator. The closer the channel is to the conveyor line or elevator, the smaller the distance cost is correspondingly, and the higher the convenience of the channel in and out of the warehouse is.
When channels are sorted, the channels are sorted according to the number of the remaining storage positions from small to large, and articles to be warehoused are stored in the channels with the small number of the remaining storage positions preferentially, so that the channels can be filled as much as possible, the storage position waste is less, the storage utilization rate is high, the calculation amount can be reduced when storage position distribution is carried out subsequently, and the calculation efficiency of the storage position distribution is improved.
After the storage layers and the channels of each storage layer are sequenced, storage positions can be allocated for the articles to be put in storage. Specifically, according to another embodiment of the present invention, the process of allocating storage locations for the items to be warehoused may specifically include the following steps:
step S1031: processing each storage layer in sequence according to the sequencing result of the storage layers to determine a channel;
step S1032: for each determined channel, sequentially determining storage positions according to the principle of interior and exterior to allocate the storage positions for the articles to be warehoused;
wherein, each storage layer is processed as follows:
acquiring the residual storage bit number of each channel of the storage layer;
if the storage layer has no residual storage positions, selecting the next storage layer and determining a channel, wherein if the storage layer is the last storage layer, a new empty channel is allocated for the article to be warehoused;
otherwise, if the residual storage bit number of the storage layer is not less than the number of the articles to be warehoused, sequencing the channels from small to large according to the residual storage bit number, and determining the channels in sequence; and if the number of the residual storage positions of the storage layer is less than the number of the articles to be warehoused, all the channels of the storage layer are determined channels, and the next storage layer is selected to continue determining the channels.
According to another embodiment of the present invention, when a new empty channel needs to be allocated to an article to be warehoused, the method can be implemented according to the following steps:
acquiring value parameters of articles to be warehoused;
determining a matched channel, a storage layer where the channel is located and storage bits included in the channel according to the value parameters;
sequencing each determined storage layer according to the weight and the vacancy degree of the storage layer, and sequencing the channel of each storage layer according to the number of storage bits included in the channel;
and allocating a new empty channel for the articles to be warehoused according to the planned warehousing quantity of each storage layer by taking the storage layer as a first sorting factor and the channel as a second sorting factor.
The value parameter of the article can be determined according to the frequency or popularity of the article, for example, the value parameter can be obtained by analyzing historical data, and the process of determining the value parameter is, for example: the statistics of the order amount or sales amount of the previous month or week are performed, and then the statistics are analyzed, wherein the specific analysis algorithm may be various, and the present invention is not limited thereto.
In the embodiment of the invention, the corresponding relation between the value parameters of the articles and the distance cost of the channel is preset, so that the matched channel can be determined according to the value parameters of the articles to be warehoused. Specifically, when setting the correspondence between the value parameter of the article and the distance cost of the channel, for example, the value parameter of the article and the distance cost of the channel may be segmented, and then the corresponding segments are associated correspondingly; alternatively, the calculated value of the item may be equal to or proportional to the distance cost by algorithm adjustment, and so on.
After the channels matched with the value parameters of the articles to be warehoused, the storage layer where the channels are located and the storage bit number included in the channels are determined, the storage layers and the channels can be sequenced according to the method described in the embodiment, and then a new empty channel allocated to the articles to be warehoused is determined. At this time, it should be noted that when new empty channel allocation is performed, allocation is performed in combination with the planned warehousing quantity of each storage layer, where the planned warehousing quantity of each storage layer is the ratio of the number of articles to be warehoused to the number of storage layers. Therefore, the articles to be warehoused can be uniformly distributed to each storage layer as much as possible, and the articles to be warehoused can be stored in a layer-by-layer scattered manner, so that when the warehousing operation is carried out, multiple layers of operations can be carried out simultaneously, and the warehousing efficiency is improved.
Fig. 3 is a flow chart illustrating an implementation of a method for allocation of storage locations of a multi-tiered warehouse according to an embodiment of the present invention. As shown in fig. 3, in an embodiment of the present invention, taking an example of warehousing a certain single SKU (in the field of e-commerce, SKU refers to a money of goods), when a warehouse receives a warehousing request of the SKU, first obtaining an identifier of the SKU to be warehoused, and determining whether the SKU is already stored in the warehouse; and if so, acquiring the storage position set of the SKU, otherwise, warehousing a new SKU and distributing a new empty channel. The storage location information includes the storage layer, channel and storage bit information of the SKU.
After the storage position set where the SKU is located is obtained, the SKU needs to be dispersed according to storage layers, the storage layers are sorted according to the weight and the vacancy of each storage layer, the storage layer with the large weight is preferentially selected, and if the vacancy of the storage layer with the large weight exceeds a set vacancy threshold, the storage layer with the maximum vacancy is preferentially selected; then the following operations are performed for each storage tier in order to perform channel allocation:
firstly, judging whether a channel of the storage layer, which stores the SKU, has an empty storage bit;
if not, selecting the next storage layer to perform channel allocation, and so on until the last storage layer, wherein if the current storage layer is the last storage layer, allocating a new empty channel;
if yes, acquiring the residual storage bit number; if the number of the residual storage positions is not less than the number of the SKUs of the articles to be warehoused, the channel with the minimum number of the residual storage positions is preferentially selected; otherwise, if the number of the remaining storage bits is smaller than the number of the articles sku to be warehoused, all channels of the storage layer need to be allocated, and a next storage layer needs to be selected to continue allocating channels.
And finally, after the channels are determined, allocating the storage positions in the channels to SKUs (stock keeping units) of the articles to be warehoused according to an inside-outside principle.
When a new empty channel recommendation is carried out on an item to be warehoused, firstly, a value parameter of the SKU is obtained, and then a matched channel, a storage layer where the channel is located and storage digits included in the channel are determined, wherein the number of the matched channels, the storage layers and the like is generally multiple, so that the SKU is stored in multiple layers in a scattered manner; then, for the matched storage layers, sorting the storage layers according to the weight and the vacancy degree of each storage layer, and preferentially selecting the storage layer with the large weight, but preferentially selecting the storage layer with the largest vacancy degree if the vacancy degree of the storage layer with the large weight exceeds a set vacancy degree threshold; and sorting the channels of each storage layer according to the storage bit number included by the channels, preferentially selecting the channel with the least storage bit number, and considering the planned storage amount of each storage layer when determining the channels.
For example: the number of the ASKUs to be warehoused of a certain article to be warehoused is 30, channels matched with the value parameters of the ASKU are located in 3 storage layers, so that the ASKU is dispersedly stored in the 3 storage layers, and if the number of storage bits contained in the corresponding channels is respectively 3 storage bits and 6 storage bits, when storage bit recommendation is carried out, firstly, the storage layers are sequenced according to the weight and the vacancy degree of the storage layers, and if the sequencing result is storage layer 2, storage layer 1 and storage layer 3; secondly, channel allocation is performed on each storage layer in sequence by combining the planned warehousing quantity 10 (the ratio of the quantity 30 to be warehoused to the number 3 of the storage layers to be allocated) of each layer, and specific examples include:
assuming that two channels with the least number of storage bits in the matched channels included in the storage layer 2 respectively include 6 storage bits and 6 storage bits, the storage layer 2 allocates two channels and stores the two channels into a storage 12 in consideration of occupying the channels as much as possible to increase the utilization rate of the storage bits in combination with the planned storage amount 10; assuming that two channels with the least number of storage bits in the matched channels included in the storage layer 1 respectively include 3 storage bits and 6 storage bits, the storage layer 3 allocates two channels and stores the two channels into a storage 9 in consideration of fully occupying the channels as much as possible to improve the utilization rate of the storage bits in combination with the planned storage amount 10; assuming that three channels with the least number of storage bits in the matched channels included in the storage layer 3 respectively include 3 storage bits, and 6 storage bits, the storage layer 3 allocates two channels in consideration of combining the planned warehousing quantity 10 and the remaining warehousing quantity 9(30-12-9 ═ 9) of the ask, and taking into account that the channels are occupied as much as possible to improve the utilization rate of the storage bits, wherein one channel includes 3 storage bits, and the other channel includes 6 storage bits, and warehouses 9 the ask completely.
And finally, after the storage position sequence is determined according to the principle of interior and exterior, the four-way vehicle carries the articles ASKU to be warehoused to the recommended storage position to finish warehousing.
Fig. 4 is a schematic block diagram of an apparatus for multi-story warehouse bin allocation according to an embodiment of the present invention. As shown in fig. 4, the apparatus 400 for allocating storage space in a multi-story warehouse according to an embodiment of the present invention mainly includes a location obtaining module 401, a sorting module 402, and a storage space allocating module 403.
The position acquisition module 401 is configured to acquire a storage position set of the same type of articles in the warehouse according to the identifier of the article to be warehoused, and acquire storage layer information and channel information according to the storage position;
an ordering module 402, configured to order each storage layer in the storage location set according to the weight and the vacancy of the storage layer, and order the channel of each storage layer according to the remaining number of storage bits of the channel;
and a storage location allocation module 403, configured to allocate storage locations for the items to be warehoused, with the storage layer as a first ordering factor and the channels as a second ordering factor.
According to an embodiment of the present invention, the sorting module 402 may further be configured to:
acquiring the weight and the vacancy degree corresponding to each storage layer in the storage position set, wherein the vacancy degree is obtained according to the ratio of the number of warehouse entry and exit tasks of the storage layers to the number of conveying equipment;
performing first sequencing on each storage layer in the storage position set according to the weight of the storage layers from large to small;
and sequentially judging whether the vacancy degree of the current storage layer exceeds a set vacancy degree threshold value or not for the storage layer after the first sequencing, and if so, exchanging the sequencing positions of the current storage layer and the storage layer with the highest vacancy degree.
According to another embodiment of the present invention, the sorting module 402 may further be configured to:
for each storage layer, acquiring the residual storage bit number of each channel of the storage layer;
and sequencing the channels from less to more according to the residual storage bit number, wherein if the residual storage bit numbers of the channels are the same, sequencing the channels from less to more according to the distance cost of the channels.
According to another embodiment of the present invention, the bin allocation module 403 may be further configured to:
processing each storage layer in sequence according to the sequencing result of the storage layers to determine a channel;
for each determined channel, sequentially determining storage positions according to the principle of interior and exterior to allocate the storage positions for the articles to be warehoused;
wherein, each storage layer is processed as follows:
acquiring the residual storage bit number of each channel of the storage layer;
if the storage layer has no residual storage positions, selecting the next storage layer and determining a channel, wherein if the storage layer is the last storage layer, a new empty channel is allocated for the article to be warehoused;
otherwise, if the residual storage bit number of the storage layer is not less than the number of the articles to be warehoused, sequencing the channels from small to large according to the residual storage bit number, and determining the channels in sequence; and if the number of the residual storage positions of the storage layer is less than the number of the articles to be warehoused, all the channels of the storage layer are determined channels, and the next storage layer is selected to continue determining the channels.
According to another embodiment of the present invention, the bin allocation module 403 may be further configured to:
acquiring value parameters of articles to be warehoused;
determining a matched channel, a storage layer where the channel is located and storage bits included in the channel according to the value parameters;
sequencing each determined storage layer according to the weight and the vacancy degree of the storage layer, and sequencing the channel of each storage layer according to the number of storage bits included in the channel;
and allocating a new empty channel for the articles to be warehoused according to the planned warehousing quantity of each storage layer by taking the storage layer as a first sorting factor and the channel as a second sorting factor.
According to yet another embodiment of the present invention, the apparatus 400 for multi-level warehouse bin allocation may further include an empty lane allocation module (not shown in the figures) for:
and if the storage positions of the same kind of articles in the warehouse cannot be acquired according to the identifiers of the articles to be warehoused, directly allocating a new empty channel for the articles to be warehoused.
According to the technical scheme of the embodiment of the invention, a storage position set of the same kind of articles in a warehouse is obtained according to the identification of the article to be warehoused, and storage layer information and channel information are obtained according to the storage position; then, sorting each storage layer in the storage position set according to the weight and the vacancy degree of the storage layer, and sorting the channel of each storage layer according to the residual storage bit number of the channel; finally, the storage layer is used as a first sorting factor, the channel is used as a second sorting factor, and storage positions are allocated to the articles to be warehoused, so that the storage position allocation of a multi-layer multi-depth warehouse is realized, the storage positions can be reasonably planned, the storage position waste is less, and the storage utilization rate is high; the same kind of articles are stored in the same channel, so that unnecessary transfer can be reduced, and time and machine loss waste caused by transfer can be reduced; meanwhile, the storage layers and the channels are sequenced, and the articles to be warehoused are stored in a layered mode, so that warehousing and ex-warehouse efficiency is improved.
Fig. 5 illustrates an exemplary system architecture 500 of a method of multi-tiered warehouse bay allocation or an apparatus of multi-tiered warehouse bay allocation to which embodiments of the present invention may be applied.
As shown in fig. 5, the system architecture 500 may include terminal devices 501, 502, 503, a network 504, and a server 505. The network 504 serves to provide a medium for communication links between the terminal devices 501, 502, 503 and the server 505. Network 504 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use the terminal devices 501, 502, 503 to interact with a server 505 over a network 504 to receive or send messages or the like. The terminal devices 501, 502, 503 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The terminal devices 501, 502, 503 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 505 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 501, 502, 503. 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 method for allocating multi-tiered warehouse storage space provided by the embodiment of the present invention is generally executed by the server 505, and accordingly, the apparatus for allocating multi-tiered warehouse storage space is generally disposed in the server 505.
It should be understood that the number of terminal devices, networks, and servers in fig. 5 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 6, a block diagram of a computer system 600 suitable for use with a terminal device or server implementing an embodiment of the invention is shown. The terminal device or the server shown in fig. 6 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. 6, the computer system 600 includes a Central Processing Unit (CPU)601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 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 may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 601.
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 units or modules described in the embodiments of the present invention may be implemented by software, or may be implemented by hardware. The described units or modules may also be provided in a processor, and may be described as: a processor includes a position acquisition module, a sorting module, and a bin allocation module. The names of the units or modules do not form a limitation on the units or modules, for example, the location acquiring module may also be described as a "module for acquiring a storage location set of the same type of articles in a warehouse according to the identification of the articles to be warehoused, and acquiring storage tier information and channel information according to the storage locations".
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: acquiring a storage position set of the same kind of articles in a warehouse according to the identification of the articles to be warehoused, and acquiring storage layer information and channel information according to the storage positions; sorting each storage layer in the storage position set according to the weight and the vacancy degree of the storage layer, and sorting the channel of each storage layer according to the residual storage bit number of the channel; and allocating storage positions for the articles to be warehoused by taking the storage layer as a first sorting factor and the channel as a second sorting factor.
According to the technical scheme of the embodiment of the invention, a storage position set of the same kind of articles in a warehouse is obtained according to the identification of the article to be warehoused, and storage layer information and channel information are obtained according to the storage position; then, sorting each storage layer in the storage position set according to the weight and the vacancy degree of the storage layer, and sorting the channel of each storage layer according to the residual storage bit number of the channel; finally, the storage layer is used as a first sorting factor, the channel is used as a second sorting factor, and storage positions are allocated to the articles to be warehoused, so that the storage position allocation of a multi-layer multi-depth warehouse is realized, the storage positions can be reasonably planned, the storage position waste is less, and the storage utilization rate is high; the same kind of articles are stored in the same channel, so that unnecessary transfer can be reduced, and time and machine loss waste caused by transfer can be reduced; meanwhile, the storage layers and the channels are sequenced, and the articles to be warehoused are stored in a layered mode, so that warehousing and ex-warehouse efficiency is improved.
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 (14)
1. A method of multi-level warehouse bin allocation, comprising:
acquiring a storage position set of the same kind of articles in a warehouse according to the identification of the articles to be warehoused, and acquiring storage layer information and channel information according to the storage positions;
sorting each storage layer in the storage position set according to the weight and the vacancy degree of the storage layer, and sorting the channel of each storage layer according to the residual storage bit number of the channel;
and allocating storage positions for the articles to be warehoused by taking the storage layer as a first sorting factor and the channel as a second sorting factor.
2. The method of claim 1, wherein ordering each storage tier in the set of storage locations according to a weight of the storage tier and a idleness comprises:
acquiring the weight and the vacancy degree corresponding to each storage layer in the storage position set, wherein the vacancy degree is obtained according to the ratio of the number of warehouse entry and exit tasks of the storage layer to the number of conveying equipment;
performing first ordering on each storage layer in the storage position set according to the weight of the storage layers from large to small;
and sequentially judging whether the vacancy degree of the current storage layer exceeds a set vacancy degree threshold value or not for the first sorted storage layer, and if so, exchanging the sorted positions of the current storage layer and the storage layer with the highest vacancy degree.
3. The method of claim 1, wherein ordering the channels of each storage tier according to their remaining number of storage bits comprises:
for each storage layer, acquiring the residual storage bit number of each channel of the storage layer;
and sequencing the channels from less to more according to the residual storage bit number, wherein if the residual storage bit numbers of the channels are the same, sequencing the channels from less to more according to the distance cost of the channels.
4. The method of claim 1, wherein the allocating storage locations for the to-be-warehoused items by taking a storage layer as a first ordering factor and a channel as a second ordering factor comprises:
processing each storage layer in sequence according to the sequencing result of the storage layers to determine a channel;
for each determined channel, sequentially determining storage positions according to the principle of interior and exterior to allocate the storage positions for the articles to be warehoused;
wherein, each storage layer is processed as follows:
acquiring the residual storage bit number of each channel of the storage layer;
if the storage layer has no residual storage positions, selecting a next storage layer and determining a channel, wherein if the storage layer is the last storage layer, a new empty channel is allocated to the article to be warehoused;
otherwise, if the number of the remaining storage positions of the storage layer is not less than the number of the articles to be stored in the storage layer, sequencing the channels from small to large according to the number of the remaining storage positions, and determining the channels in sequence; and if the number of the residual storage positions of the storage layer is less than the number of the articles to be warehoused, all the channels of the storage layer are determined channels, and the next storage layer is selected to continue determining the channels.
5. The method of claim 4, wherein allocating a new empty channel for the item to be warehoused comprises:
acquiring value parameters of the articles to be warehoused;
determining a matched channel, a storage layer where the channel is located and storage digits included in the channel according to the value parameters;
sorting each determined storage layer according to the weight and the vacancy degree of the storage layer, and sorting the channel of each storage layer according to the storage bit number included by the channel;
and allocating a new empty channel for the articles to be warehoused according to the planned warehousing quantity of each storage layer by taking the storage layer as a first sequencing factor and the channel as a second sequencing factor.
6. The method of claim 1, further comprising:
and if the storage positions of the same type of articles in the warehouse cannot be acquired according to the identifiers of the articles to be warehoused, directly allocating a new empty channel for the articles to be warehoused.
7. An apparatus for multi-level warehouse bin allocation, comprising:
the position acquisition module is used for acquiring a storage position set of the same kind of articles in the warehouse according to the identification of the articles to be warehoused and acquiring storage layer information and channel information according to the storage positions;
the sorting module is used for sorting each storage layer in the storage position set according to the weight and the vacancy degree of the storage layer and sorting the channel of each storage layer according to the residual storage bit number of the channel;
and the storage position distribution module is used for distributing storage positions for the articles to be warehoused by taking the storage layer as a first sorting factor and the channel as a second sorting factor.
8. The apparatus of claim 7, wherein the ordering module is further configured to:
acquiring the weight and the vacancy degree corresponding to each storage layer in the storage position set, wherein the vacancy degree is obtained according to the ratio of the number of warehouse entry and exit tasks of the storage layer to the number of conveying equipment;
performing first ordering on each storage layer in the storage position set according to the weight of the storage layers from large to small;
and sequentially judging whether the vacancy degree of the current storage layer exceeds a set vacancy degree threshold value or not for the first sorted storage layer, and if so, exchanging the sorted positions of the current storage layer and the storage layer with the highest vacancy degree.
9. The apparatus of claim 7, wherein the ordering module is further configured to:
for each storage layer, acquiring the residual storage bit number of each channel of the storage layer;
and sequencing the channels from less to more according to the residual storage bit number, wherein if the residual storage bit numbers of the channels are the same, sequencing the channels from less to more according to the distance cost of the channels.
10. The apparatus of claim 7, wherein the bin allocation module is further configured to:
processing each storage layer in sequence according to the sequencing result of the storage layers to determine a channel;
for each determined channel, sequentially determining storage positions according to the principle of interior and exterior to allocate the storage positions for the articles to be warehoused;
wherein, each storage layer is processed as follows:
acquiring the residual storage bit number of each channel of the storage layer;
if the storage layer has no residual storage positions, selecting a next storage layer and determining a channel, wherein if the storage layer is the last storage layer, a new empty channel is allocated to the article to be warehoused;
otherwise, if the number of the remaining storage positions of the storage layer is not less than the number of the articles to be stored in the storage layer, sequencing the channels from small to large according to the number of the remaining storage positions, and determining the channels in sequence; and if the number of the residual storage positions of the storage layer is less than the number of the articles to be warehoused, all the channels of the storage layer are determined channels, and the next storage layer is selected to continue determining the channels.
11. The apparatus of claim 10, wherein the bin allocation module is further configured to:
acquiring value parameters of the articles to be warehoused;
determining a matched channel, a storage layer where the channel is located and storage digits included in the channel according to the value parameters;
sorting each determined storage layer according to the weight and the vacancy degree of the storage layer, and sorting the channel of each storage layer according to the storage bit number included by the channel;
and allocating a new empty channel for the articles to be warehoused according to the planned warehousing quantity of each storage layer by taking the storage layer as a first sequencing factor and the channel as a second sequencing factor.
12. The apparatus of claim 7, further comprising an empty channel assignment module to: and if the storage positions of the same type of articles in the warehouse cannot be acquired according to the identifiers of the articles to be warehoused, directly allocating a new empty channel for the articles to be warehoused.
13. An electronic device for multi-tiered warehouse bin allocation, 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-6.
14. 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-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910300259.0A CN111832980B (en) | 2019-04-15 | 2019-04-15 | Method and device for distributing storage positions of multi-layer warehouse |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910300259.0A CN111832980B (en) | 2019-04-15 | 2019-04-15 | Method and device for distributing storage positions of multi-layer warehouse |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111832980A true CN111832980A (en) | 2020-10-27 |
| CN111832980B CN111832980B (en) | 2024-07-19 |
Family
ID=72914209
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910300259.0A Active CN111832980B (en) | 2019-04-15 | 2019-04-15 | Method and device for distributing storage positions of multi-layer warehouse |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111832980B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114118889A (en) * | 2021-01-28 | 2022-03-01 | 北京京东乾石科技有限公司 | Storage rack arrangement method, device, equipment, medium and program product |
| CN116729877A (en) * | 2023-08-11 | 2023-09-12 | 安徽擎天智能科技有限公司 | Unstacking method, unstacking device, unstacking equipment and storage medium |
| CN117436674A (en) * | 2023-12-20 | 2024-01-23 | 国网浙江省电力有限公司金华供电公司 | Processing method and equipment based on multi-mode detection of electric power supplies |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09267904A (en) * | 1996-03-29 | 1997-10-14 | Mitsubishi Heavy Ind Ltd | Search method of storage and delivery rack address |
| JP2004126746A (en) * | 2002-09-30 | 2004-04-22 | Daiwa House Ind Co Ltd | Storage simulation system, storage simulation device, storage simulation method and storage simulation program |
| CN105701631A (en) * | 2016-01-06 | 2016-06-22 | 北京京东尚科信息技术有限公司 | Commodity warehousing method and warehouse management system |
| CA3002917A1 (en) * | 2015-10-22 | 2017-04-27 | Greyorange Pte Ltd. | Method of managing resources in a warehouse |
| CN106966100A (en) * | 2017-05-15 | 2017-07-21 | 北京京东尚科信息技术有限公司 | Goods warehousing method and system |
| WO2018171638A1 (en) * | 2017-03-24 | 2018-09-27 | 电信科学技术研究院有限公司 | Resource allocation method and apparatus |
-
2019
- 2019-04-15 CN CN201910300259.0A patent/CN111832980B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09267904A (en) * | 1996-03-29 | 1997-10-14 | Mitsubishi Heavy Ind Ltd | Search method of storage and delivery rack address |
| JP2004126746A (en) * | 2002-09-30 | 2004-04-22 | Daiwa House Ind Co Ltd | Storage simulation system, storage simulation device, storage simulation method and storage simulation program |
| CA3002917A1 (en) * | 2015-10-22 | 2017-04-27 | Greyorange Pte Ltd. | Method of managing resources in a warehouse |
| CN105701631A (en) * | 2016-01-06 | 2016-06-22 | 北京京东尚科信息技术有限公司 | Commodity warehousing method and warehouse management system |
| WO2018171638A1 (en) * | 2017-03-24 | 2018-09-27 | 电信科学技术研究院有限公司 | Resource allocation method and apparatus |
| CN106966100A (en) * | 2017-05-15 | 2017-07-21 | 北京京东尚科信息技术有限公司 | Goods warehousing method and system |
Non-Patent Citations (1)
| Title |
|---|
| 付晓锋;张波;王卫青;: "多模式自动化存取系统存储货位分配算法研究", 工业仪表与自动化装置, no. 03, pages 56 - 59 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114118889A (en) * | 2021-01-28 | 2022-03-01 | 北京京东乾石科技有限公司 | Storage rack arrangement method, device, equipment, medium and program product |
| CN116729877A (en) * | 2023-08-11 | 2023-09-12 | 安徽擎天智能科技有限公司 | Unstacking method, unstacking device, unstacking equipment and storage medium |
| CN116729877B (en) * | 2023-08-11 | 2023-11-07 | 安徽擎天智能科技有限公司 | Unstacking method, unstacking device, unstacking equipment and storage medium |
| CN117436674A (en) * | 2023-12-20 | 2024-01-23 | 国网浙江省电力有限公司金华供电公司 | Processing method and equipment based on multi-mode detection of electric power supplies |
| CN117436674B (en) * | 2023-12-20 | 2024-03-01 | 国网浙江省电力有限公司金华供电公司 | Processing method and equipment based on multi-mode detection of electric power supplies |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111832980B (en) | 2024-07-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111415122B (en) | Goods picking method and goods picking system | |
| CN109767151B (en) | Storage management method, device, medium and electronic equipment | |
| CN110111033B (en) | Order diversion method and device | |
| CN110390499B (en) | Order distribution method and device | |
| JP2021507859A (en) | Inventory scheduling methods and devices as well as non-temporary computer-readable storage media | |
| CN110348771B (en) | Method and device for order grouping of orders | |
| CN110059993B (en) | Warehouse management method and device | |
| CN110390498B (en) | Order distribution method and device | |
| CN110889656B (en) | Warehouse rule configuration method and device | |
| CN111832980B (en) | Method and device for distributing storage positions of multi-layer warehouse | |
| CN111507651A (en) | Order data processing method and device applied to man-machine mixed warehouse | |
| CN111260240B (en) | Task allocation method and device | |
| CN110348650B (en) | Order converging method and device | |
| CN109993470B (en) | Inventory scheduling method and device | |
| CN110304385A (en) | A kind of warehouse restocking method and apparatus | |
| CN113759890A (en) | Control method and device for transport device | |
| CN113650997B (en) | Article warehouse-out positioning method and device | |
| CN112966992B (en) | Order production method and device | |
| CN112150051B (en) | Method and device for loading articles | |
| CN110826752B (en) | Method and device for distributing collection list | |
| CN112520284A (en) | Shelf storage position adjusting method and system | |
| CN110378635A (en) | A kind of schedule management method and device of transporting equipment | |
| CN112801569B (en) | Article sorting method and device | |
| CN111792248B (en) | Method and device for adjusting storage position of material box | |
| CN113762856B (en) | Exit management method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20210305 Address after: Room a1905, 19 / F, building 2, No. 18, Kechuang 11th Street, Daxing District, Beijing, 100176 Applicant after: Beijing Jingdong Qianshi Technology Co.,Ltd. Address before: 101, 1st floor, building 2, yard 20, Suzhou street, Haidian District, Beijing 100080 Applicant before: Beijing Jingbangda Trading Co.,Ltd. Effective date of registration: 20210305 Address after: 101, 1st floor, building 2, yard 20, Suzhou street, Haidian District, Beijing 100080 Applicant after: Beijing Jingbangda Trading Co.,Ltd. Address before: 100086 8th Floor, 76 Zhichun Road, Haidian District, Beijing Applicant before: BEIJING JINGDONG SHANGKE INFORMATION TECHNOLOGY Co.,Ltd. Applicant before: BEIJING JINGDONG CENTURY TRADING Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |