CN112785025B

CN112785025B - Warehouse layout method and device

Info

Publication number: CN112785025B
Application number: CN201911094859.2A
Authority: CN
Inventors: 蔡爽
Original assignee: Beijing Jingbangda Trade Co Ltd; Beijing Jingdong Zhenshi Information Technology Co Ltd
Current assignee: Beijing Jingbangda Trade Co Ltd; Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority date: 2019-11-11
Filing date: 2019-11-11
Publication date: 2024-01-16
Anticipated expiration: 2039-11-11
Also published as: CN112785025A

Abstract

The invention discloses a warehouse layout method and device, and relates to the technical field of computers. One embodiment of the method comprises the following steps: acquiring a reference information set, wherein the reference information set comprises reference information of an article to be stored and reference information of resources to be allocated; determining a scheduling solution of a warehouse according to the reference information of the articles to be stored, wherein the scheduling solution indicates the storage quantity of the articles to be stored corresponding to at least one functional area in the warehouse; and determining a resource allocation index meeting the preset cost limiting condition according to the scheduling solution and the reference information of the resources to be allocated so as to allocate the warehouse according to the resource allocation index. This embodiment enables rationalizing the warehouse layout.

Description

Warehouse layout method and device

Technical Field

The invention relates to the technical field of computers, in particular to a warehouse layout method and device.

Background

With the increase of the timeliness requirement of users on online shopping and the increase of logistics scale, in order to meet the requirement of storing articles, a new warehouse is often needed or is planned again on the basis of the existing warehouse. Whether a new warehouse is built or re-planned on the basis of an existing warehouse, the warehouse layout such as allocation of areas of various functional areas, allocation of resources (shelves, forklifts, pickers and the like) and the like directly influences the warehouse construction and operation and maintenance costs.

Currently, warehouse layout is mainly done manually. I.e. the planner typically plans the layout of the warehouse according to personal experience.

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

due to limitations in manual computing power and experience, the layout of the warehouse is manually planned without being based on information about a large number of items in the warehouse. Often resulting in an inadequate warehouse layout.

Disclosure of Invention

In view of the above, the embodiment of the invention provides a warehouse layout method and device, which solve the problem of unreasonable warehouse layout.

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

acquiring a reference information set, wherein the reference information set comprises reference information of an article to be stored and reference information of resources to be allocated;

determining a scheduling solution of a warehouse according to the reference information of the articles to be stored, wherein the scheduling solution indicates the storage quantity of the articles to be stored corresponding to at least one functional area in the warehouse;

and determining a resource allocation index meeting a preset cost limiting condition according to the scheduling solution and the reference information of the resources to be allocated so as to allocate the warehouse according to the resource allocation index.

Preferably, determining a scheduling solution for a warehouse comprises:

dividing the articles to be stored into at least two preset grade queues according to the delivery quantity of each article in the reference information of the articles to be stored, wherein the grade queues are used for indicating the delivery grade of the divided articles;

generating at least one group of digital combinations for at least two grade queues, wherein each group of digital combinations comprises the safety stock days of each grade queue;

and determining a dispatching solution of the warehouse according to the preset warehouse storage quantity, the ex-warehouse quantity of each article and at least one group of digital combinations in the reference information of the articles to be stored.

Preferably, dividing the articles to be stored into at least two preset level queues according to the delivery amount of each article in the reference information of the articles to be stored, including:

sorting the delivery of all the articles to be stored;

circularly executing the following steps until all the articles in the articles to be stored are distributed to at least two grade queues;

accumulating the delivery quantity of the articles according to the order of the delivery quantity from high to low;

and when the accumulated result reaches a preset grade threshold, distributing the unassigned articles corresponding to the accumulated result to a grade queue corresponding to the grade threshold.

Preferably, determining the resource allocation indicator satisfying the preset cost constraint condition includes:

selecting a preset storage rack configuration mode for each functional area;

and according to the storage rack configuration mode selected by each functional area, configuring the storage rack types meeting the preset cost limiting conditions and the required number of the storage racks for each functional area.

Preferably, the storage rack configuration mode includes:

determining the storage quantity of each article in a functional area from a dispatching solution of a warehouse;

selecting a corresponding storage rack type for each article according to the storage amount of each article in the functional area and at least one storage rack type included in the reference information of the resources to be allocated, and calculating the number of first storage racks required to be occupied by each article;

and counting the number of the required storage racks corresponding to the selected storage rack type according to the number of the first storage racks required to be occupied by each article and the number of the second storage racks of the selected storage rack type.

Preferably, the method comprises the steps of,

determining the storage amount of each grade queue in a functional area from the scheduling solution of the warehouse;

selecting a corresponding storage rack type for each grade queue according to the storage amount of each grade queue in a functional area and at least one storage rack type included in the reference information of the resources to be allocated, and calculating the number of third storage racks required to be occupied by each grade queue;

And counting the number of the required storage racks corresponding to the selected storage rack type according to the number of the third storage racks required to be occupied by each grade queue and the number of the fourth storage racks of the selected storage rack type.

Preferably, determining the resource allocation index meeting the preset cost limiting condition according to the scheduling solution and the reference information of the resources to be allocated further comprises:

when the at least one functional area includes a holding area and a picking area,

calculating a replenishment quantity according to a reference delivery quantity included in the reference information of the articles to be stored, wherein the replenishment quantity indicates the quantity of the articles replenished by the storage area for the picking area;

the number of vehicles and the number of carriers that need to be allocated to the warehouse are calculated based on the carrier parameters and the carrier's operating parameters included in the replenishment amount and the reference information for the resource to be allocated.

determining the cost of the warehouse according to the counted number of required storage racks, the calculated number of carrying tools and the calculated number of carrying personnel;

judging whether the cost of the warehouse meets the preset cost limiting condition,

If yes, determining the number of required storage racks, the number of vehicles and the number of carriers as resource allocation indexes;

otherwise, updating the scheduling solution, and updating the number of required storage racks, the number of vehicles and the number of carriers according to the updated scheduling solution so as to determine the resource allocation index meeting the preset cost limiting condition.

Preferably, the warehouse layout method further comprises:

for each functional area, performing:

and calculating the area of the functional area according to the counted number of the required storage racks, the occupied area corresponding to the storage rack type in the reference information of the resources to be allocated and the preset projection coefficient.

In a second aspect, an embodiment of the present invention provides a warehouse layout device, including: an acquisition unit, a scheduling solution calculation unit and a layout simulation unit, wherein,

the acquisition unit is used for acquiring a reference information set, wherein the reference information set comprises reference information of an article to be stored and reference information of resources to be allocated;

the scheduling solution calculating unit is used for determining a scheduling solution of the warehouse according to the reference information of the articles to be stored, which is acquired by the acquiring unit, and the scheduling solution indicates the storage quantity of the articles to be stored, which corresponds to at least one functional area in the warehouse;

And the layout simulation unit is used for determining resource allocation indexes meeting preset cost limiting conditions according to the scheduling solution determined by the scheduling solution calculation unit and the reference information of the resources to be allocated so as to allocate the warehouse according to the resource allocation indexes.

Preferably, the scheduling solution calculating unit is configured to:

One embodiment of the above invention has the following advantages or benefits: determining a scheduling solution of the warehouse through the reference information of the articles to be stored, wherein the scheduling solution indicates the storage quantity of the articles to be stored corresponding to at least one functional area in the warehouse, so that the storage quantity of the articles to be stored is related to the information of the articles to be stored, and determining the resource allocation index meeting the preset cost limiting condition through the storage quantity of the articles to be stored and the reference information of the resources to be allocated, namely, determining the resource allocation index for the warehouse based on the articles to be stored and the resources to be allocated, and further meeting the requirements of the articles to be stored, thereby rationalizing the warehouse layout.

Further effects of the above-described non-conventional alternatives are 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 flow of a warehouse layout method according to an embodiment of the present invention;

FIG. 2 is a schematic diagram of the main flow of ranking queues for SKUs according to an embodiment of the present invention;

FIG. 3 is a schematic diagram of the main flow involved in a storage rack configuration mode according to an embodiment of the present invention;

FIG. 4 is a schematic diagram of the main flow involved in another storage rack configuration mode according to an embodiment of the present invention;

FIG. 5 is a schematic diagram of a main flow of determining a resource allocation indicator according to an embodiment of the present invention;

FIG. 6 is a schematic diagram of the main units of a warehouse layout 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 applied;

fig. 8 is a schematic diagram of a computer system suitable for use in implementing an embodiment of the invention.

Detailed Description

Exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which various details of the embodiments of the present invention are included to facilitate understanding, and are to be considered 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 embodiments of the present invention and the technical features in the embodiments may be combined with each other without collision.

For e-commerce enterprises and logistics enterprises, because of business development needs, it is inevitable to build new warehouses or re-plan warehouses.

The nature of a warehouse is a warehouse used to store items. It will be appreciated that some information about the items stored in the warehouse will directly affect the layout of the warehouse, such as the historical daily inventory of items (which may be historical daily inventory of items for e-commerce), the type of items stored in the warehouse, the amount of items stored in each functional area in the warehouse, the resources allocated to the items, such as the type and number of forklifts, the number of pickers, etc., will all affect the cost of construction or operation of the warehouse.

Therefore, the storage amount of the articles in each functional area in the warehouse is optimized based on the reference information of the articles to be stored and the reference information of the resources to be allocated, the corresponding resources are optimally allocated for the storage amount, and the information of each functional area such as the area of the functional area is optimized according to the allocated resources. The information or data related to the warehouse layout takes the articles to be stored in the warehouse as the starting point, and does not depend on the experience of a planner.

As shown in fig. 1, an embodiment of the present invention provides a warehouse layout method, which may include the steps of:

step S101: acquiring a reference information set, wherein the reference information set comprises reference information of an article to be stored and reference information of resources to be allocated;

step S102: determining a scheduling solution of a warehouse according to the reference information of the articles to be stored, wherein the scheduling solution indicates the storage quantity of the articles to be stored corresponding to at least one functional area in the warehouse;

step S103: and determining a resource allocation index meeting the preset cost limiting condition according to the scheduling solution and the reference information of the resources to be allocated so as to allocate the warehouse according to the resource allocation index.

The reference information set can be some reference data of other similar warehouses, such as basic attributes of the articles to be stored, in-and-out warehouse data, historical order data of electronic commerce and the like, which are included in the reference information of the articles to be stored; the reference information of the resources to be allocated comprises reference picking efficiency, goods shelf basic attribute, transport tray basic attribute, reference replenishment efficiency, reference picking efficiency, replenishment personnel efficiency cost, personnel effective working time, replenishment forklift type, upper limit of the number of pickers, upper limit of areas of each functional area, upper limit of forklift drivers, warehouse height, upper limit of safety stock days, rent and the like. The in-out database data or the historical order data of the electronic commerce can comprise information of basic attributes of the articles to be stored, such as the length, width, height and weight of the articles, code goods principles such as shortest side stand, longest side stand and next longest side stand, daily sales (data of a few months can be recently) and average stock quantity. The goods shelf type can comprise information such as the length, width, height, layer number, number of goods in each layer, upper limit of the number of articles to be stored in each goods grid and the like; the shipping pallet type may include information about the length, width, height, etc. of the pallet. And the warehouse is planned by combining the information, so that the utilization rate of the warehouse, the construction cost of the warehouse and the operation cost can be effectively regulated and controlled.

The reference information of the article to be stored and the reference information of the resource to be allocated can be captured from an excel form with the reference information submitted by the user, or can be directly input by the user.

The resource allocation indexes include, but are not limited to, the number of goods stored in each functional area, the actual area of each functional area, the area ratio of each functional area, the warehouse area, the type of goods shelves selected for each functional area, the number of goods shelves, the number of pickers provided for a certain functional area, the type of forklift selected for a certain functional area, the number of forklifts, the type of transporting trays, the number of transporting trays, etc.

For the warehouse of e-commerce, the functional areas which directly influence the warehouse cost and the warehouse operation and maintenance are mainly a storage area and a goods picking area, wherein the storage area mainly adopts a relatively large goods shelf to store goods, and the goods picking area mainly adopts a goods shelf which is relatively convenient for the goods picking personnel to pick goods to temporarily store the goods. Generally, a warehouse is used in a manner that a storage area can store a large amount of goods, and the goods in the storage area are transported to a picking area by a forklift and a pallet so that a picker can pick the goods according to orders.

It should be noted that, in order to facilitate management of items in a warehouse, each item has its own unique identification code (SKU), and in the following description, SKU will be referred to as item/cargo.

In a specific embodiment of the step S102, the articles to be stored are divided into at least two preset level queues according to the delivery amount of each article in the reference information of the articles to be stored, and the level queues are used for indicating the delivery level of the divided articles; generating at least one group of digital combinations for at least two grade queues, wherein each group of digital combinations comprises the safety stock days of each grade queue; and determining a dispatching solution of the warehouse according to the preset warehouse storage quantity, the ex-warehouse quantity of each article and at least one group of digital combinations in the reference information of the articles to be stored.

The delivery amount of each of the above-described articles may be a daily delivery amount of the articles in one functional area or a daily sales amount of the goods, which can be obtained with reference to order data of several months.

Since the types of SKUs stored in the warehouse are tens of thousands, on one hand, the calculation load is greatly increased when the number of days of safety inventory, the storage amount of functional areas and the like are determined for each SKU, and on the other hand, the simulation comparison finds that the SKUs are classified according to daily average delivery amount/daily average sales amount, and the difference between the SKU layout according to the classified grades and the SKU layout according to each SKU is not great. Therefore, in the embodiment of the invention, the safety stock days of the SKU are determined by dividing the SKU into different grades according to the grade of the SKU, and the storage quantity of the SKU in a functional area is calculated according to the safety stock days and the daily average sales quantity/daily average delivery quantity of the SKU.

The number of days of the safety stock corresponding to each grade exists in a digital combination mode, namely grades bandA, bandB, bandC, bandD, bandE and bandF from high to low are divided, wherein the grades from high to low are determined according to the delivery amount of SKUs contained in the grades, and the more the delivery amount of SKUs contained in the grades is, the higher the grade is. The number combination is (number of safety stock days corresponding to the bandA, number of safety stock days corresponding to the bandB, number of safety stock days corresponding to the bandC, number of safety stock days corresponding to the bandD, number of safety stock days corresponding to the bandE, number of safety stock days corresponding to the bandF). The initial values for the number of days of safety stock in the digital combination may be user entered or randomly generated. Generally, the higher the level, the greater the number of days of safety stock, and therefore, the digital combination must satisfy that the number of days of safety stock corresponding to bandA is greater than or equal to bandB, the number of days of safety stock corresponding to bandC is greater than or equal to bandC, the number of days of safety stock corresponding to bandE is greater than or equal to bandF, for example, the initial value of the digital combination may be (0, 0), the at least one digital combination may be increased according to step 1, and the multiple sets of digital combinations obtained according to step 1 may be as shown in Table 1 below.

TABLE 1

The calculation formula (1) of the storage amount of one SKU corresponding to one functional area is:

wherein,characterizing stock quantity corresponding to the ith SKU in a functional area,/-stock quantity corresponding to the ith SKU in a functional area>Representing the daily average delivery quantity/daily average sales quantity corresponding to the ith SKU in one functional area; t (T) _band Characterizing the number of days in the safety inventory corresponding to the band on which the ith SKU is located in a set of digital combinations.

For a warehouse mainly composed of a storage area and a picking area, the process of dividing the articles to be stored into at least two preset grade queues and generating at least one group of digital combinations for the at least two grade queues is mainly performed for the picking area, and after the storage amount of each SKU in the picking area is determined, the storage amount of each SKU in the storage area can be obtained by subtracting the storage amount of the corresponding SKU in the picking area from the total storage amount of each SKU.

I.e., for a warehouse consisting essentially of a holding area and a picking area, the schedule is solved by the storage amount of each SKU in the picking area and the storage amount of each SKU in the holding area.

It will be appreciated that the scheduling solutions are combined in a one-to-one correspondence with the numbers.

I.e. each of the levels is assigned a corresponding number of days of safety stock according to the divided level,

In an embodiment of the present invention, the dividing the to-be-stored items into at least two preset rank queues according to the delivery amount of each item in the reference information of the to-be-stored items may include:

sorting the delivery of all the articles to be stored;

The ranking threshold may be associated with a daily total sales/daily total sales, such as 20% ts, 40% ts, 60% ts, 80% ts, 100% ts, and 0 for the ranking queue bandA, bandB, bandC, bandD, bandE and bandF, respectively.

The specific implementation process of classifying SKUs into at least two preset rank queues according to the delivery amount of each SKU is described in detail below by taking the example that all SKUs in the articles to be stored corresponding to the picking area in the e-commerce warehouse are allocated to the rank queues bandA, bandB, bandC, bandD, bandE and the bandF. As shown in FIG. 2, the implementation of the queue for classifying SKUs may include the steps of:

S201: sorting the daily average delivery quantity or daily average sales quantity of all SKUs corresponding to the picking area;

all SKUs corresponding to the pick zone refer to all kinds of items to be deposited into the pick zone.

S202: dividing SKUs with daily average delivery quantity or daily average sales quantity of 0 into the same grade queue;

such as a SKU of 0 for daily delivery or daily sales into the bandF.

There is no strict sequence between S201 and S202. That is, step 202 may precede step 201, such that the ordering of step 202 may be ordered only for SKUs with a daily output or daily sales of not 0.

S203: accumulating the delivery amount of the SKUs according to the order of the delivery amount from high to low;

such as: the ordered result is: SKU1, SKU2, SKU3, SKU4, SKU5, SKU6, SKU7, SKU8, …, then the accumulation may be to calculate sku1+sku2 first, then, after step 204, to accumulate SKU3 on the basis of sku1+sku2, and so on.

S204: judging whether the current accumulated result reaches a preset level threshold, if so, executing S205; otherwise, executing S203;

s205: assigning the unassigned articles corresponding to the accumulated results to a rank queue corresponding to a rank threshold;

For example, the rank queue bandA, bandB, bandC, bandD, bandE and the bundle may have rank thresholds of 20%, 40%, 60%, 80%, 100% and 0 respectively, where in step S203, sku1+sku2+ … +sku (K) > 20% ts is obtained, and sku1+sku2+ … +sku (K-1) <20% ts, where the first K SKUs in the rank are classified into bundle a, sku1+sku2+ … +sku (M) > 40% ts, and sku1+sku2+ … +sku (M-1) <40% ts, and the remaining M-K SKUs except the first K SKUs are classified into bundle b, so that all SKUs are assigned rank queues, and each SKU is further ensured to belong to only one rank queue.

S206: judging whether all SKUs are assigned rank queues, if so, executing S207; otherwise, S203 is performed;

s207: ending the current flow.

The type of shelves, the number of shelves, and the number of stored goods in each functional area in the resource allocation index that has been set forth above will affect the actual area of each functional area, the area ratio of each functional area, the warehouse area, the number of pickers equipped for a certain functional area, etc. Thus, the number of goods stored in each functional area, the type of shelves selected for each functional area and the number of shelves are the basis for warehouse planning. The calculation method of the quantity of goods stored in each functional area has been given by determining the dispatching solution of the warehouse, and the manner of selecting the goods shelf type and the goods shelf quantity will be explained below.

In one embodiment of the present invention, a plurality of storage rack configuration modes are preconfigured, and a user can select one storage rack configuration mode according to his own needs to perform storage rack configuration, namely: the specific embodiment of step S103 may include: selecting a preset storage rack configuration mode for each functional area; and according to the storage rack configuration mode selected by each functional area, configuring the storage rack types meeting the preset cost limiting conditions and the required number of the storage racks for each functional area. The storage rack is the goods shelf.

The preset cost limiting condition may be that after a limited number of optimizations, a configuration corresponding to the lowest cost of warehouse construction or operation and maintenance is selected.

The storage rack configuration modes can be two types:

the specific steps for implementing the first storage rack configuration mode may be as shown in fig. 3, including:

s301: determining the storage quantity of each article in a functional area from a dispatching solution of a warehouse;

taking the picking area of the e-commerce warehouse as an example, the storage amount of each SKU in the picking area is calculated by the calculation formula (1).

S302: selecting a corresponding storage rack type for each article according to the storage amount of each article in the functional area and at least one storage rack type included in the reference information of the resources to be allocated, and calculating the number of first storage racks required to be occupied by each article;

In this step, a specific procedure of selecting a corresponding storage rack type for each article:

for each SKU of all SKUs and each storage rack type included in the reference information of the resource to be allocated, performing:

calculating the number of goods lattices occupied by the SKU under the storage rack type by using the storage quantity of the SKU in the goods sorting area and the number of the SKU which can be stored in one goods lattice corresponding to the storage rack type;

the number of SKUs that can be stored in the one bin is obtained by: calculated by the following calculation formula (2), when the result obtained by the calculation formula (2) is 0, it is obtained by using the calculation formula (3).

Wherein,the characterization grid can store the number of ith SKU; l (L) _g Representing the length of the goods lattice; />Characterizing the length of the ith SKU; d, d _g Representing the width of the goods lattice; />Characterizing the width of the ith SKU; h is a _g Representing the height of the goods lattice; />The height of the ith SKU is characterized.

Wherein V is _g Characterizing the available volume of the cargo compartment;the volume of the ith SKU is characterized.

If the result of calculation in equation (3) is also 0, the storage rack type is discarded for the ith SKU.

And calculating the number of the goods lattices required to be occupied by the ith SKU according to the calculated number of the SKUs stored in one goods lattice by using the following calculation formula (4).

Wherein n is _f Characterizing the number of cargo cells of the type f of the storage rack required to be occupied by the ith SKU;characterizing the storage amount of the ith SKU in the pick zone; />The cargo compartment representing storage rack type f can store the number of ith SKUs.

Calculating the occupied area of the storage rack according to the number of goods lattice occupied by each SKU under the storage rack type, the area of the storage rack and a preset mapping coefficient corresponding to the storage rack type;

the calculation of the occupied area of the storage rack can be performed by the following calculation formula (6).

Wherein S is _f Characterizing the occupied area of the storage rack type f; s is S _f ^’ Characterizing the self area of the f-type storage rack; u represents the number of goods lattice of the storage rack; alpha represents a mapping coefficient corresponding to a preset f-type storage rack, and the alpha is generally not less than 1.

And after the occupied areas corresponding to all the storage rack types are calculated, selecting the storage rack type with the smallest occupied area.

S303: and counting the number of the required storage racks corresponding to the selected storage rack type according to the number of the first storage racks required to be occupied by each article and the number of the second storage racks of the selected storage rack type.

It will be appreciated that the first number of storage compartments required to be occupied by each item refers to the number of storage compartments required to be occupied when the item is stored in the storage rack of the type of storage rack selected for that item in step 302 above.

The specific implementation process of this step S303 may include:

for each storage rack type, a list of the required grid numbers is obtained, which can be seen in table 2 below. The items SKU1, SKU2, SKU3, SKU4, etc. for which the same storage rack type is selected are shown in example form in reference numeral 2, and the required number of bins for SKU1, SKU2, SKU3, SKU4 are shown.

TABLE 2

The number of required trays given in table 2 above can be calculated according to a stacking method such as one of the shortest side, longest side, next longest side or volumetric method. The desired number of bins in the desired bin number list may not be an integer.

The number of required storage racks is calculated using the following calculation formula (7) by using the required number of racks in the required number list.

Wherein P is _f Characterizing the number of required f-type storage racks; z represents the total number of goods lattice needed by the articles of the f-type storage rack; u represents the number of goods lattice of one storage rack;

the total number of goods required by the articles of the f-type storage rack can be obtained by summing up and rounding up every M1 numbers in the required goods list, and summing up a plurality of results obtained by summing up and rounding up again.

Taking the required bin number list given in table 2 as an example, assuming m1=2, the required bin numbers corresponding to SKU1 and SKU2 are summed up and rounded up first, the required bin numbers corresponding to SKU3 and SKU4 are summed up and rounded up, and then the results of the two summations and rounding up are summed up again to obtain the total bin number.

The second storage rack configuration mode may be as shown in fig. 4, and specifically includes:

s401: determining the storage amount of each grade queue in a functional area from the scheduling solution of the warehouse;

the scheduling solution comprises the storage amount of each of the functional areas, and after the types of the articles contained in the grade queues are determined, the storage amount of the grade queues in one functional area can be determined in a mode of adding the storage amounts of the various articles.

S402: selecting a corresponding storage rack type for each grade queue according to the storage amount of each grade queue in a functional area and at least one storage rack type included in the reference information of the resources to be allocated, and calculating the number of third storage racks required to be occupied by each grade queue;

s403: and counting the number of the required storage racks corresponding to the selected storage rack type according to the number of the third storage racks required to be occupied by each grade queue and the number of the fourth storage racks of the selected storage rack type.

In S402 and S403, the calculation process of selecting the corresponding storage rack type for each rank queue, calculating the number of third storage racks required to occupy each rank queue, and counting the number of storage racks required for each selected storage rack type is similar to the selection of the corresponding storage rack type for each SKU, the calculation of the number of storage racks required to occupy each SKU, and the counting of the number of storage racks required for the selected storage rack type given in fig. 3, but in the embodiment given in fig. 4, the number of storage racks required to occupy each rank queue is one whole, and in the embodiment given in fig. 3, the number of storage racks required to occupy each SKU is one whole. Therefore, the specific implementation process of S402 and S403 is not described in detail.

It should be noted that, for the management area and the picking area included in the warehouse of the electronic commerce, the picking area generally selects the first storage rack configuration mode shown in fig. 3, and the management area generally selects the second storage rack configuration mode shown in fig. 4, so that the planning result can be more reasonable while the calculation efficiency and the planning efficiency are ensured.

The storage amount of the articles in each functional area, the types of the storage racks in each functional area and the number of the storage racks in each functional area in the resource allocation index are given.

The configuration of other to-be-allocated resources in the resource allocation index, such as the configuration of carriers of a forklift, a tray and the like and the configuration of carriers of a forklift driver, a pickers and the like, will be determined based on the storage amount of the objects in each functional area, the types of the storage racks in each functional area and the number of the storage racks in each functional area.

In one embodiment of the invention, the functional area comprises a storage area and a picking area, and the replenishment amount is calculated according to the reference delivery amount included in the reference information of the articles to be stored, and the replenishment amount indicates the quantity of the articles replenished by the storage area for the picking area; the number of vehicles and the number of carriers that need to be allocated to the warehouse are calculated based on the carrier parameters and the carrier's operating parameters included in the replenishment amount and the reference information for the resource to be allocated.

The reference delivery amount generally refers to a daily delivery amount or a daily sales amount, and the replenishment amount generally refers to a daily replenishment amount.

The replenishment amount may be obtained by summing the replenishment amounts corresponding to each SKU.

Supplementary amounts for each SKU:

when the daily average delivery volume or daily average sales volume is larger than the number of the SKUs in the picking area, the supplementing volume is the difference between the daily average delivery volume/daily average sales volume and the residual number of the SKUs in the picking area; otherwise the make-up amount is 0. When the difference between the daily average inventory/daily average sales and the remaining quantity of SKUs in the pick zone is greater than the quantity of SKUs stored in the holding zone, the replenishment quantity is the quantity of SKUs stored in the holding zone.

The number of restocking trays per SKU can be calculated by dividing the amount of restocking of the SKU obtained above by the number of trays that can hold the SKU at most. The number of trays that can hold the SKU at most can also be calculated using the code method.

The quantity of pickers can be calculated by the following calculation formula (8) according to the daily average delivery/daily average sales of all SKUs.

Wherein R represents the quantity of pickers; w represents the daily average delivery/daily average sales of all SKUs; beta characterizes the average pick efficiency of the pickers; h characterizes the number of hours of daily operation of the pickers.

Accordingly, the cost of the pickers may be derived from the payroll of the pickers and the number of pickers.

The forklift is mainly used for transporting articles from a storage area to a picking area, so that the type and the number of the forklifts can be selected through the supplementing quantity, the loading capacity of each forklift and the cost of the forklifts. Namely, the type and the quantity of the forklifts with the lowest cost can be selected through the cost difference caused by the type and the quantity of the forklifts for transporting the SKUs with the same supplementing quantity.

In one embodiment of the present invention, for each functional area, execution is performed: and calculating the area of the functional area according to the counted number of the required storage racks, the occupied area corresponding to the storage rack type in the reference information of the resources to be allocated and the preset projection coefficient.

There are two ways to determine the resource allocation indicator that meets the preset cost constraint:

the first way to determine the resource allocation indicator meeting the preset cost constraint condition is:

and listing a plurality of groups of digital combinations, determining a corresponding scheduling solution for each group of digital combinations, and aiming at the scheduling solution corresponding to each group of digital combinations, obtaining the number of required storage racks, the number of vehicles, the number of carriers and the like so as to determine the cost of the warehouse, and selecting the scheduling solution corresponding to the lowest cost, the number of required storage racks, the number of vehicles, the number of carriers and the like from the scheduling solutions as resource configuration indexes.

The second way of determining the resource allocation indicator satisfying the preset cost constraint condition may be as shown in fig. 5, and specifically includes:

s501: determining the cost of the warehouse according to the number of required storage racks, the number of vehicles and the number of carrying personnel corresponding to the counted scheduling solution;

s502: judging whether the cost of the warehouse meets the preset cost limiting condition, and if so, executing S503; otherwise, S504 is performed;

the preset cost limiting condition may be a threshold value, or may be the lowest cost after N times of optimization.

S503: determining the number of required storage racks, the number of carriers and the number of carriers as resource allocation indexes, and ending the current flow;

s504: the scheduling solution is updated and S501 is performed.

The process of updating the scheduling solution may be to add a stride to the digital combination corresponding to the scheduling solution of S501, and generate a new scheduling solution by using the digital combination after adding the stride.

The second mode optimizes the number of required storage racks, the number of vehicles and the number of carrying personnel by gradually optimizing the dispatching solution, so that the calculated amount can be effectively reduced.

It should be noted that, when the resource allocation index is obtained, the resource allocation index may be output in various display forms, such as a cost curve, a duty ratio diagram of each functional area, etc., for a user to view.

As shown in fig. 6, an embodiment of the present invention provides a warehouse layout device 600, the warehouse layout device 600 including: an acquisition unit 601, a scheduling solution calculation unit 602, and a layout simulation unit 603, wherein,

an obtaining unit 601, configured to obtain a reference information set, where the reference information set includes reference information of an article to be stored and reference information of a resource to be allocated;

a scheduling solution calculating unit 602, configured to determine a scheduling solution of the warehouse according to the reference information of the to-be-stored items acquired by the acquiring unit 601, where the scheduling solution indicates a storage amount of the to-be-stored items corresponding to at least one functional area in the warehouse;

the layout simulation unit 603 is configured to determine a resource allocation index that meets a preset cost constraint condition according to the scheduling solution determined by the scheduling solution calculation unit 602 and the reference information of the resource to be allocated, so as to allocate the warehouse according to the resource allocation index.

In one embodiment of the present invention, the scheduling solution calculating unit 602 is configured to divide the to-be-stored items into at least two preset level queues according to the delivery amount of each item in the reference information of the to-be-stored items, where the level queues are used to indicate delivery levels of the divided items; generating at least one group of digital combinations for at least two grade queues, wherein each group of digital combinations comprises the safety stock days of each grade queue; and determining a dispatching solution of the warehouse according to the preset warehouse storage quantity, the ex-warehouse quantity of each article and at least one group of digital combinations in the reference information of the articles to be stored.

In one embodiment of the present invention, the scheduling solution calculating unit 602 is configured to:

sorting the delivery of all the articles to be stored; and circularly executing the following steps until all the articles in the articles to be stored are distributed to at least two grade queues;

In one embodiment of the present invention, the layout simulation unit 603 is configured to select a preset storage rack configuration mode for each functional area; and according to the storage rack configuration mode selected by each functional area, configuring storage rack types meeting preset cost limiting conditions and the required number of storage racks for each functional area.

In one embodiment of the present invention, the storage rack configuration modes included in the layout simulation unit 603 include: determining the storage quantity of each article in a functional area from a dispatching solution of a warehouse; selecting a corresponding storage rack type for each article according to the storage amount of each article in the functional area and at least one storage rack type included in the reference information of the resources to be allocated, and calculating the number of first storage racks required to be occupied by each article; and counting the number of the required storage racks corresponding to the selected storage rack type according to the number of the first storage racks required to be occupied by each article and the number of the second storage racks of the selected storage rack type.

In one embodiment of the present invention, the storage rack configuration modes included in the layout simulation unit 603 include: determining the storage amount of each grade queue in a functional area from the scheduling solution of the warehouse; selecting a corresponding storage rack type for each grade queue according to the storage amount of each grade queue in a functional area and at least one storage rack type included in the reference information of the resources to be allocated, and calculating the number of third storage racks required to be occupied by each grade queue; and counting the number of the required storage racks corresponding to the selected storage rack type according to the number of the third storage racks required to be occupied by each grade queue and the number of the fourth storage racks of the selected storage rack type.

In one embodiment of the present invention, the layout simulation unit 603 is further configured to, when at least one functional area includes a storage area and a picking area, calculate a replenishment amount according to a reference shipment amount included in reference information of the articles to be stored, the replenishment amount indicating an amount of replenishment articles for the picking area by the storage area; the number of vehicles and the number of carriers that need to be allocated to the warehouse are calculated based on the carrier parameters and the carrier's operating parameters included in the replenishment amount and the reference information for the resource to be allocated.

In one embodiment of the present invention, the layout simulation unit 603 is further configured to determine a cost of the warehouse according to the counted number of required storage racks, the calculated number of vehicles and the number of carriers; judging whether the cost of the warehouse meets the preset cost limiting condition, if so, determining the number of required storage racks, the number of carriers and the number of carriers as resource allocation indexes; otherwise, updating the scheduling solution, and updating the number of required storage racks, the number of vehicles and the number of carriers according to the updated scheduling solution so as to determine the resource allocation index meeting the preset cost limiting condition.

In one embodiment of the present invention, the layout emulation unit 603 is further configured to perform, for each of the functional areas: and calculating the area of the functional area according to the counted number of the required storage racks, the occupied area corresponding to the storage rack type in the reference information of the resources to be allocated and the preset projection coefficient.

Fig. 7 illustrates an exemplary system architecture 700 to which the product demand management method or product demand management apparatus of embodiments of the present invention may be applied.

As shown in fig. 7, a system architecture 700 may include terminal devices 701, 702, 703, a network 704, and a server 705. The network 704 is the medium used to provide communication links between the terminal devices 701, 702, 703 and the server 705. The network 704 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.

A user may interact with the server 705 via the network 704 using the terminal devices 701, 702, 703 to receive or send messages or the like. Various communication client applications such as shopping class applications, web browser applications, search class applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only) 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 smartphones, tablets, laptop and desktop computers, and the like.

The server 705 may be a server providing various services, such as a background management server (by way of example only) providing support for websites/interfaces browsed by users using the terminal devices 701, 702, 703. The background management server may perform analysis and other processes on the received reference information set, and feed back the processing result (such as scheduling solution, cost determination resource allocation index—only an example) to the terminal device.

It should be noted that, the warehouse layout method provided in the embodiment of the present invention is generally executed by the server 705, and accordingly, the warehouse layout device 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, there is illustrated a schematic diagram of a computer system 800 suitable for use in implementing an embodiment of the present invention. The terminal device shown in fig. 8 is only an example, and should not impose any limitation on the functions and the scope of use of the embodiment 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 according to 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 required for the operation of the system 800 are also stored. The CPU 801, ROM 802, and RAM 803 are connected to each other by a bus 804. An input/output (I/O) interface 805 is also connected to the bus 804.

The following components are connected to the I/O interface 805: an input portion 806 including a keyboard, mouse, etc.; an output portion 807 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and a speaker; a storage section 808 including a hard disk or 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. The drive 810 is also connected to the I/O interface 805 as needed. 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 needed so that a computer program read out therefrom is mounted into the storage section 808 as needed.

In particular, according to embodiments of the present disclosure, the processes described above with reference to 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 shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication section 809, and/or installed from the removable media 811. The above-described functions defined in the system of the present invention are performed when the computer program is executed by a Central Processing Unit (CPU) 801.

The computer readable medium shown in the present invention may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any 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 context of this document, 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, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. 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 flowcharts 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 involved in the embodiments of the present invention may be implemented in software or in hardware. The described units may also be provided in a processor, for example, described as: a processor includes an interaction unit and a processing unit. Where the names of these units do not constitute a limitation of the unit itself in some cases, for example, an interactive unit may also be described as "a unit that sends and receives information to a connected client".

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 present alone without being fitted into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to include: providing an information interaction interface, wherein the information interaction interface comprises a plurality of information items; acquiring an information set of product requirements of an input information interaction interface, and storing the information set, wherein the information set indicates an information set for inputting a plurality of information items; according to the received change operation for the information item, adding the change item for the information item, and writing the change information corresponding to the change operation into the change item.

According to the technical scheme of the embodiment of the invention, through providing the information interaction interface comprising a plurality of information items, an initiator can input information of product requirements according to the standardization of the information items, so that information in the information set corresponding to the stored product requirements has the standardization, in addition, when the change is involved, the change item is additionally arranged for the information items, and the change information also has the management standardization by writing the change information into the change item. Compared with the existing manual table making management product requirement information, the scheme provided by the embodiment of the invention can be used for carrying out standard management on the product requirement information.

In addition, according to the technical scheme of the embodiment of the invention, the change item is added to the information item, and the change information corresponding to the change operation is written into the change item. Not only can the information of the changed product demand be managed, but also the original information of the product demand can be managed, so that an initiator or a participant can accurately trace the information change process of the product demand and the change range of each change. Different versions of the information of the product requirements can be tracked well. But also trace back to the initial entry of the product demand after modification. In addition, the information omission of the product requirement can be supplemented through changing operation, comments and reviews can be given to participants, and the omission of the information of the product requirement can be avoided to a large extent. The participants can timely learn and process the product requirements. The method also realizes the iterative record of the information version of each product requirement, the management of the information version of each product requirement formed by iteration and the management of the information of the product requirement corresponding to frequent iteration products, and can effectively improve the working efficiency.

The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives can occur depending upon design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.

Claims

1. A warehouse layout method, comprising:

determining a scheduling solution of the warehouse according to the reference information of the articles to be stored, wherein the scheduling solution indicates the storage quantity of the articles to be stored corresponding to at least one functional area in the warehouse;

determining a resource allocation index meeting a preset cost limiting condition according to the scheduling solution and the reference information of the resources to be allocated so as to allocate the warehouse according to the resource allocation index;

the determining a scheduling solution of the warehouse according to the reference information of the articles to be stored comprises the following steps:

dividing the articles to be stored into grades according to the delivery quantity of each article in the reference information of the articles to be stored, and determining the safety inventory days of the articles to be stored according to the grades;

determining a scheduling solution of the warehouse according to the warehouse storage quantity preset in the reference information of the articles to be stored, the warehouse output quantity of each article and the safety stock days of the articles to be stored;

the determining the resource allocation index meeting the preset cost limiting condition comprises the following steps:

Determining the cost of the warehouse according to the counted number of required storage racks, the number of vehicles and the number of carrying personnel corresponding to the scheduling solution;

and determining the number of required storage racks, the number of vehicles and the number of carriers corresponding to the lowest cost or the cost meeting the preset cost limiting condition as resource allocation indexes.

2. The warehouse layout method as claimed in claim 1, wherein,

the grading of the articles to be stored comprises the following steps: dividing the articles to be stored into at least two preset grade queues according to the delivery quantity of each article in the reference information of the articles to be stored, wherein the grade queues are used for indicating the delivery grade of the divided articles;

the step of determining the safety stock days of the articles to be stored according to the grades comprises the following steps: generating at least one group of digital combinations for the at least two grade queues, wherein each group of digital combinations comprises the safety stock days of each grade queue;

the determining a scheduling solution of the warehouse according to the warehouse storage amount preset in the reference information of the articles to be stored, the warehouse output amount of each article and the safety stock days of the articles to be stored, includes: and determining a scheduling solution of the warehouse according to the warehouse storage quantity preset in the reference information of the articles to be stored, the warehouse output quantity of each article and the at least one group of digital combinations.

3. The warehouse layout method as claimed in claim 2, wherein the dividing the articles to be stored into at least two preset rank queues according to the delivery amount of each article in the reference information of the articles to be stored comprises:

sorting the delivery amount of all the articles to be stored;

circularly executing the following steps until all the articles in the articles to be stored are distributed to the at least two grade queues;

4. A warehouse layout method as claimed in any one of claims 2 or 3, wherein the determining a resource allocation indicator meeting a predetermined cost constraint comprises:

selecting a preset storage rack configuration mode for each functional area;

and according to the storage rack configuration mode selected by each functional area, configuring the types of the storage racks meeting the preset cost limiting condition and the required number of the storage racks for each functional area.

5. The warehouse layout method as claimed in claim 4, wherein the rack configuration mode includes:

determining the storage amount of each article in one functional area from the dispatching solution of the warehouse;

selecting a corresponding storage rack type for each article according to the storage amount of each article in the functional area and at least one storage rack type included in the reference information of the resources to be allocated, and calculating the first storage grid number required to be occupied by each article;

counting the number of required storage racks corresponding to the selected storage rack type according to the number of first storage racks required to be occupied by each article and the number of second storage racks of the selected storage rack type;

and/or the number of the groups of groups,

determining the storage amount of each grade queue in one functional area from the scheduling solution of the warehouse;

selecting a corresponding storage rack type for each grade queue according to the storage amount of each grade queue in one functional area and at least one storage rack type included in the reference information of the resources to be allocated, and calculating the third storage grid number required to be occupied by each grade queue;

6. The warehouse layout method as claimed in claim 4, wherein the determining a resource allocation indicator satisfying a preset cost constraint according to the scheduling solution and the reference information of the resources to be allocated further comprises:

and calculating the number of vehicles and the number of carriers required to be equipped for the warehouse according to the vehicle parameters and the working parameters of the carriers included in the supplementing quantity and the reference information of the resources to be equipped.

7. The warehouse layout method as claimed in claim 6, wherein the determining a resource allocation indicator satisfying a preset cost constraint according to the scheduling solution and the reference information of the resources to be allocated further comprises:

Determining whether the cost of the warehouse meets the preset cost limiting condition,

if yes, determining the number of required storage racks, the number of vehicles and the number of carriers as the resource allocation index;

otherwise, updating the scheduling solution, and updating the number of required storage racks, the number of vehicles and the number of carriers according to the updated scheduling solution so as to determine a resource allocation index meeting a preset cost limiting condition.

8. The warehouse layout method as claimed in claim 4, further comprising:

for each of the functional areas, performing:

and calculating the area of the functional area according to the counted number of the required storage racks, the occupied area corresponding to the storage rack type in the reference information of the resources to be allocated and a preset projection coefficient.

9. A warehouse layout apparatus, comprising: an acquisition unit, a scheduling solution calculation unit and a layout simulation unit, wherein,

The scheduling solution calculating unit is used for determining a scheduling solution of the warehouse according to the reference information of the articles to be stored, which is acquired by the acquiring unit, wherein the scheduling solution indicates the storage quantity of the articles to be stored, which corresponds to at least one functional area in the warehouse;

the layout simulation unit is used for determining resource allocation indexes meeting preset cost limiting conditions according to the scheduling solution and the reference information of the resources to be allocated determined by the scheduling solution calculation unit so as to allocate the warehouse according to the resource allocation indexes;

the scheduling solution calculating unit is further used for classifying the articles to be stored according to the delivery amount of each article in the reference information of the articles to be stored, and determining the safety stock days of the articles to be stored according to the classification; determining a scheduling solution of the warehouse according to the warehouse storage quantity preset in the reference information of the articles to be stored, the warehouse output quantity of each article and the safety stock days of the articles to be stored;

the layout simulation unit is further used for determining the cost of the warehouse according to the counted number of required storage racks, the counted number of carrying tools and the counted number of carrying personnel corresponding to one scheduling solution; and determining the number of required storage racks, the number of vehicles and the number of carriers corresponding to the lowest cost or the cost meeting the preset cost limiting condition as resource allocation indexes.

10. The warehouse layout device as claimed in claim 9, wherein the scheduling solution computing unit is configured to:

generating at least one group of digital combinations for the at least two grade queues, wherein each group of digital combinations comprises the safety stock days of each grade queue;

and determining a scheduling solution of the warehouse according to the warehouse storage quantity preset in the reference information of the articles to be stored, the warehouse output quantity of each article and the at least one group of digital combinations.

11. A warehouse layout apparatus, comprising:

one or more processors;

storage means for storing one or more programs,

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

12. A computer readable medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any of claims 1-8.