CN110837906A - Method and device for storing commodities - Google Patents

Method and device for storing commodities Download PDF

Info

Publication number
CN110837906A
CN110837906A CN201810940756.2A CN201810940756A CN110837906A CN 110837906 A CN110837906 A CN 110837906A CN 201810940756 A CN201810940756 A CN 201810940756A CN 110837906 A CN110837906 A CN 110837906A
Authority
CN
China
Prior art keywords
commodities
commodity
trays
upper limit
days
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.)
Pending
Application number
CN201810940756.2A
Other languages
Chinese (zh)
Inventor
池志攀
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jingdong Qianshi Technology Co Ltd
Original Assignee
Tianjin Jingdong Shentuo Robot Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Tianjin Jingdong Shentuo Robot Technology Co Ltd filed Critical Tianjin Jingdong Shentuo Robot Technology Co Ltd
Priority to CN201810940756.2A priority Critical patent/CN110837906A/en
Publication of CN110837906A publication Critical patent/CN110837906A/en
Pending legal-status Critical Current

Links

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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0201—Market modelling; Market analysis; Collecting market data
    • G06Q30/0202—Market predictions or forecasting for commercial activities
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Accounting & Taxation (AREA)
  • Development Economics (AREA)
  • Finance (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Game Theory and Decision Science (AREA)
  • Human Resources & Organizations (AREA)
  • Data Mining & Analysis (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)

Abstract

The invention discloses a method and a device for storing commodities, and relates to the technical field of computers. One embodiment of the method comprises: calculating the upper limit P of the tray quantity of the commodity according to the predicted sales amount S of the commodity; determining the quantity of the trays of the target commodity according to the quantity of the current available storage positions and the upper limit of the quantity of the trays of the commodity; and allocating storage positions for the trays of the commodities according to the number of the trays of the commodities. According to the embodiment, the upper limit of the number of the storage trays of each commodity can be calculated according to the predicted sales volume of the determined commodity, the storage position is allocated to each commodity, the commodity replenishment speed and frequency are finally reduced, the storage position allocation condition is optimized, and the goods picking efficiency is improved.

Description

Method and device for storing commodities
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method and an apparatus for storing a commodity, an electronic device, and a computer-readable medium.
Background
Among warehouses of electronic commerce companies, a stereoscopic warehouse is one of the main storage devices. In order to improve the warehouse-out efficiency and space utilization rate, a partial zero-picking area is added to the storage area for picking personnel to pick the goods in the vertical warehouse. The zero picking area is generally provided with a plurality of layers, each layer is provided with a plurality of storage positions, each storage position is provided with a tray for storing picked commodities, and each picking person is responsible for the plurality of layers. The distribution of inventory in the zero pick zone has a large impact on the picking efficiency of the picker. Currently, a more stock distribution strategy is adopted to place hot-sold goods on the same layer. Meanwhile, each commodity is placed as little as possible, so that the categories of commodities in the zero picking area are rich.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
the requirement on the timeliness rate of replenishment is high. The number of the storage positions in the zero picking area is preferred, and in order to increase the number of the commodity types in the zero picking area, the number of trays for each commodity in the zero picking area is reduced as much as possible. If the goods are not supplemented in time, the picking personnel can not pick the needed goods.
The storage space ratio is unreasonable. The turnover speed of hot-sold commodities is high, and the turnover speed of commodities with low sales volume is low. The total number of reserves available for a variety of goods with different sales volumes is limited. At present, partial commodities often occupy more storage positions, but the quantity of the commodities discharged from the warehouse is less, and partial hot-sold commodities occupy less storage positions, so that replenishment and moving operations are frequently carried out.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for storing commodities, which can calculate an upper limit of the number of storage trays for each commodity according to a predicted sales volume of the determined commodity, and allocate a storage space for each commodity, thereby reducing a replenishment speed and frequency of the commodity, optimizing a storage space allocation situation, and improving a picking efficiency.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method of storing goods, including: determining a predicted sales volume for the commodity; calculating the upper limit P of the tray quantity of the commodity according to the predicted sales amount S of the commodity; determining the quantity of the trays of the target commodity according to the quantity of the current available storage positions and the upper limit of the quantity of the trays of the commodity; and allocating storage positions for the trays of the commodities according to the number of the trays of the commodities.
Optionally, determining the predicted sales volume of the good comprises: obtaining historical sales of the commodity within T days, wherein the commodity is sold within the T daysThe historical sales of day i of (1) is siThe predicted sales amount S of the commodity is expressed by the following formula,
Figure BDA0001768998700000021
wherein, wiWeight the historical sales for the i-th day of the good.
Optionally, the weight w of historical sales of the good on the ith day within the T daysiA weight w less than the historical sales of the good on day i +1 within the T daysi+1。
Optionally, the weight w of historical sales of the good on the ith day within the T daysiIs equal to
Figure BDA0001768998700000022
Optionally, calculating the upper limit P of the number of trays of the target commodity according to the predicted sales amount S of the commodity includes:
Figure BDA0001768998700000023
wherein t is the number of safe stock days of the goods, and ms is the upper limit of the number of the goods placed on each tray.
Optionally, before determining the number of trays of the target commodity according to the number of currently available slots and the upper limit of the number of trays of the commodity, the method further includes: the commodities are sorted according to one or more of the predicted sales volume of the commodities, the upper limit of the number of trays of the commodities, the number of commodities associated with the commodities and the click volume of the commodities from high to low, and the upper limit of the number of trays of the sorted commodities is Lmax1,Lmax2,Lmax3,…,LmaxkWherein k is the number of the sorted commodities;
the number of trays L of the sorted goods1,L2,L3,…,LkSatisfy the following relationship
Figure BDA0001768998700000031
Wherein i is 1,2,3, …, k, and N is the number of currently available storage bits.
To achieve the above object, according to another aspect of an embodiment of the present invention, there is provided an apparatus for storing goods, including: a prediction module to determine a predicted sales volume for the commodity; the calculation module is used for calculating the upper limit P of the tray quantity of the commodity according to the predicted sales amount S of the commodity; the counting module is used for determining the number of the trays of the target commodity according to the number of the current available storage positions and the upper limit of the number of the trays of the commodity; and the storage module is used for distributing storage positions for the trays of the commodities according to the number of the trays of the commodities.
Optionally, the prediction module is further configured to obtain a historical sales volume of the commodity in T days, where the historical sales volume of the commodity on the ith day in the T days is siThe predicted sales amount S of the commodity is expressed by the following formula,
Figure BDA0001768998700000032
wherein, wiWeight the historical sales for the i-th day of the good.
Optionally, the weight w of historical sales of the good on the ith day within the T daysiA weight w less than the historical sales of the good on day i +1 within the T daysi+1。
Optionally, the weight w of historical sales of the good on the ith day within the T daysiIs equal to
Figure BDA0001768998700000033
Optionally, the calculation module is further configured to calculate an upper limit P of the number of trays of the target commodity according to the predicted sales S of the commodity by using a formula
Figure BDA0001768998700000034
Wherein t is the number of safe stock days of the goods, and ms is the upper limit of the number of the goods placed on each tray.
12. The apparatus of claim 7, further comprising a constraint module configured to sort the commodities according to one or more of a predicted sales volume of the commodities, an upper tray quantity limit of the commodities, a quantity of the commodities associated with the commodities, and a click volume of the commodities from high to low, wherein the upper tray quantity limits of the sorted commodities are Lmax1,Lmax2,Lmax3,…,LmaxkWherein k is the number of the sorted commodities;
the number of trays L of the sorted goods1,L2,L3,…,LkSatisfy the following relationship
Figure BDA0001768998700000041
Wherein i is 1,2,3, …, k, and N is the number of currently available storage bits.
To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided an electronic apparatus including: one or more processors; a storage device to store one or more programs that, when executed by the one or more processors, cause the one or more processors to implement any of the methods of storing an article of commerce.
To achieve the above object, according to still another aspect of embodiments of the present invention, there is provided a computer-readable medium on which a computer program is stored, the program, when executed by one or more processors, implementing any one of the methods of storing an article of manufacture.
One embodiment of the above invention has the following advantages or benefits: because the technical means of determining the number of the trays and the storage positions according to the predicted sales volume of the commodities is adopted, the technical problem that goods need to be frequently replenished in the traditional method is solved, and the technical effects of improving the goods picking efficiency and optimizing the storage position distribution are achieved.
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 storing goods according to an embodiment of the present invention;
fig. 2 is a schematic view of a main part of an apparatus for storing commodities, according to an embodiment of the present invention;
FIG. 3 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 4 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.
Fig. 1 is a schematic diagram of main steps of a method for storing commodities according to an embodiment of the present invention, as shown in fig. 1:
step S101 represents determining a predicted sales volume of the commodity; the purpose of this step is to configure the bin based on the predicted sales of the good. Wherein determining the predicted sales volume of the good comprises: obtaining the historical sales volume of the commodity in T days, wherein the historical sales volume of the commodity in the ith day in the T days is siThe predicted sales amount S of the commodity is expressed by the following formula,
Figure BDA0001768998700000051
wherein, wiWeight the historical sales for the i-th day of the good. Weight w of historical sales of the good on day i within the T daysiA weight w less than the historical sales of the good on day i +1 within the T daysi+1。
Further, a weight w of historical sales for the i-th day of the goodiIs equal to
Figure BDA0001768998700000061
For example, if the historical sales of the product for 10 days in 8 month 1 to 10 days are obtained, the weight for 8 month 1 is 1/55, and the weight for 8 month 10 is 10/55.
Step S102 represents calculating an upper limit P of the number of pallets of the product from the predicted sales amount S of the product; the purpose of this step is to predict how many trays the goods can be placed on at most.
Calculating the upper limit P of the number of pallets of the commodity according to the predicted sales amount S of the commodity comprises:
wherein t is the number of safe stock days of the goods, and ms is the upper limit of the number of the goods placed on each tray. If P is not an integer, rounding up or down can be performed according to requirements.
Step S103 represents that the tray number of the commodity is determined according to the current available stock position number and the upper limit of the tray number of the commodity; the purpose of this step is to determine how many trays of merchandise the number of currently available bins can meet. Wherein the available storage position refers to a storage position where the tray can be placed. The trays may be placed at an upper limit on the number of trays per item, but the total number cannot exceed the number of available bins.
Before determining the number of trays of the goods according to the number of currently available slots and the upper limit of the number of trays of the goods, the method further comprises: according to the predicted sales volume of the commodity and the quotientSorting the commodities from high to low according to one or more of the upper limit of the number of trays of commodities, the number of commodities associated with the commodities and the click rate of the commodities, wherein the upper limit of the number of trays of the sorted commodities is Lmax1,Lmax2,Lmax3,…,LmaxkWherein k is the number of the sorted commodities;
the number of trays L of the sorted goods1,L2,L3,…,LkSatisfy the following relationship
Figure BDA0001768998700000063
Wherein i is 1,2,3, …, k, and N is the number of currently available storage bits.
The commodity association means that when more than two commodities appear in the same order, the commodities in the order are associated, and the association degree between the commodities can be measured by analyzing a large number of orders and using the association degree, for example, the association degree between the commodities can be calculated by using an FP-Growth method (an algorithm using a data structure of a Frequent Pattern Tree).
For example, the upper limit of the number of trays for the article a is 50, the upper limit of the number of trays for the article B is 40, the upper limit of the number of trays for the article C is 60, the rank according to the click amount of the article is ABC order from high to low, but the number of currently available slots is 80. So that trays of 50 articles a and 30 articles B can be selected to be placed in the available bin, or trays of 30 articles a, 30 articles B and 20 articles C can be selected.
Another embodiment of the present invention is that, according to the sorting result of the commodities, the commodity with the highest sorting is selected, if the upper limit of the number of trays of the commodity is less than the current available stock space number, the relevant commodities having a higher association degree than the preset lowest association degree threshold and a higher sales amount than the preset lowest sales amount threshold are queried, and the relevant commodities are sorted from high to low according to one or more of the predicted sales amount of the relevant commodities, the upper limit of the number of trays of the relevant commodities, the click amount of the relevant commodities, and the like, and then the number of trays of the relevant commodities is determined according to the number of remaining current available stock spaces except the upper limit of the number of trays of the commodity and the upper limit of the number of trays of the relevant commodities.
Step S104 represents allocating a bin to the tray of the product according to the number of trays of the product. After the number of trays of merchandise is determined, a bin may be assigned. Furthermore, a weight value can be preset for the storage position, and the storage position is distributed to the commodity tray according to the weight value. For example, the bin with the highest weight value may be assigned to the tray of the item with the highest sales volume. One embodiment of the present invention allocates one of the levels in the logical area for the tray of the commodity with the highest sales volume, allocates the level of the adjacent level for the redundant tray if the level cannot accommodate all the trays, and allocates the redundant available level for the tray of the commodity with higher association degree with the commodity if the level has redundant available level.
Fig. 2 is a schematic diagram of a main part of an apparatus 200 for storing commodities according to an embodiment of the present invention, as shown in fig. 2:
a prediction module 201 for determining a predicted sales volume of the commodity;
the prediction module 201 is further configured to obtain the historical sales volume of the commodity in the T days, where the historical sales volume of the commodity in the ith day of the T days is siThe predicted sales amount S of the commodity is expressed by the following formula,
wherein, wiWeight the historical sales for the i-th day of the good.
Weight w of historical sales of the good on day i within the T daysiA weight w less than the historical sales of the good on day i +1 within the T daysi+1。
Weight w of historical sales of the good on day i within the T daysiIs equal to
Figure BDA0001768998700000082
A calculating module 202, configured to calculate an upper limit P of the number of pallets of the commodity according to the predicted sales amount S of the commodity;
the calculation module 202 is further configured to calculate an upper limit P of the number of trays of the target commodity according to the predicted sales S of the commodity by using a formula
Figure BDA0001768998700000083
Wherein t is the number of safe stock days of the goods, and ms is the upper limit of the number of the goods placed on each tray. If P is not an integer, rounding up or down can be performed according to requirements.
The counting module 203 is used for determining the number of the trays of the target commodity according to the number of the currently available storage positions and the upper limit of the number of the trays of the commodity;
and the storage module 204 is used for allocating storage positions for the trays of the commodities according to the number of the trays of the commodities. Furthermore, a weight value can be preset for the storage position, and the storage position is distributed to the commodity tray according to the weight value. For example, the bin with the highest weight value may be assigned to the tray of the item with the highest sales volume. One embodiment of the present invention allocates one of the levels in the logical area for the tray of the commodity with the highest sales volume, allocates the level of the adjacent level for the redundant tray if the level cannot accommodate all the trays, and allocates the redundant available level for the tray of the commodity with higher association degree with the commodity if the level has redundant available level.
The apparatus 200 may further include a constraint module configured to sort the commodities according to one or more of a predicted sales volume of the commodities, an upper limit of tray number of the commodities, a number of commodities associated with the commodities, and a click volume of the commodities, where the upper limit of tray number of the sorted commodities is Lmax1,Lmax2,Lmax3,…,LmaxkWherein k is the number of the sorted commodities;
the number of trays L of the sorted goods1,L2,L3,…,LkSatisfy the following relationship
Figure BDA0001768998700000091
Wherein i is 1,2,3, …, k, and N is the number of currently available storage bits.
Fig. 3 illustrates an exemplary system architecture 300 of a method of storing merchandise or an apparatus for storing merchandise to which embodiments of the invention may be applied.
As shown in fig. 3, the system architecture 300 may include terminal devices 301, 302, 303, a network 304, and a server 305. The network 304 serves as a medium for providing communication links between the terminal devices 301, 302, 303 and the server 305. Network 304 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 device 301, 302, 303 to interact with the server 305 via the network 304 to receive or send messages or the like. The terminal devices 301, 302, 303 may have installed thereon various communication client applications, such as a database application, a web browser application, a search-type application, and the like.
The terminal devices 301, 302, 303 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 305 may be a server providing various services, such as a background management server providing support for users using the terminal devices 301, 302, 303. The background management server may analyze and otherwise process the received data such as the commodity sales information inquiry request, and feed back the processing result (e.g., commodity sales) to the terminal device.
It should be noted that, the method for storing commodities provided by the embodiment of the present invention is generally executed by the server 305, and accordingly, an apparatus for storing commodities is generally disposed in the server 305.
It should be understood that the number of terminal devices, networks, and servers in fig. 3 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
FIG. 4 is a block diagram of a computer system 400 suitable for implementing a terminal device of an embodiment of the present invention. The terminal device shown in fig. 4 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. 4, the computer system 400 includes a Central Processing Unit (CPU)401 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. In the RAM 403, various programs and data necessary for the operation of the system 400 are also stored. The CPU 401, ROM 402, and RAM 403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
The following components are connected to the I/O interface 405: an input section 406 including a keyboard, a mouse, and the like; an output section 407 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 408 including a hard disk and the like; and a communication section 409 including a network interface card such as a LAN card, a modem, or the like. The communication section 409 performs communication processing via a network such as the internet. A driver 410 is also connected to the I/O interface 405 as needed. A removable medium 411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 410 as necessary, so that a computer program read out therefrom is mounted into the storage section 408 as necessary.
In particular, the processes described in the above step diagrams may be implemented as computer software programs, according to embodiments of the present disclosure. For example, the disclosed embodiments of the invention 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 step diagrams. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 409, and/or installed from the removable medium 411. The computer program performs the above-described functions defined in the system of the present invention when executed by a Central Processing Unit (CPU) 401.
It should be noted that the computer readable media shown in the present invention include computer readable signal media or computer readable storage media, or any combination of the two. A computer readable storage medium includes, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, semiconductor system, apparatus, or device, or any combination of the foregoing. Computer-readable storage media specifically 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 combination of the foregoing. In the present invention, a computer readable storage medium includes any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device; a computer readable signal medium includes a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave, which may take many forms, including, but not limited to, electromagnetic signals, optical signals, or any 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 (radio frequency), etc., or any combination of the preceding.
The block diagrams or step diagrams in the figures, which illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention, may each represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should 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 step diagrams, and combinations of blocks in the block diagrams or step diagrams, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules or units described in the embodiments of the present invention may be implemented by software, or may be implemented by hardware. The described modules or units may also be provided in a processor, and may be described as: a processor includes a prediction module, a calculation module, a counting module, and a storage module. Where the names of such modules or units do not in some way constitute a limitation on the module or unit itself, for example, a prediction module may also be described as a "module for determining the predicted sales volume for the good".
On the other hand, the embodiment of the present invention also provides a computer-readable medium, which may be included in the apparatus described in the above embodiment; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: determining a predicted sales volume for the commodity; calculating the upper limit P of the tray quantity of the commodity according to the predicted sales amount S of the commodity; determining the quantity of the trays of the target commodity according to the quantity of the current available storage positions and the upper limit of the quantity of the trays of the commodity; and allocating storage positions for the trays of the commodities according to the number of the trays of the commodities.
According to the technical scheme of the embodiment of the invention, the upper limit of the number of the storage trays of each commodity can be calculated according to the predicted sales volume of the determined commodity, the storage position is allocated to each commodity, the commodity replenishment speed and frequency are finally reduced, the storage position allocation condition is optimized, and the goods picking 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 storing merchandise, comprising:
determining a predicted sales volume for the commodity;
calculating the upper limit P of the tray quantity of the commodity according to the predicted sales amount S of the commodity;
determining the quantity of the trays of the target commodity according to the quantity of the current available storage positions and the upper limit of the quantity of the trays of the commodity;
and allocating storage positions for the trays of the commodities according to the number of the trays of the commodities.
2. The method of claim 1, wherein determining the predicted sales volume for the good comprises:
obtaining the historical sales volume of the commodity in T days, wherein the historical sales volume of the commodity in the ith day in the T days is siThe predicted sales amount S of the commodity is expressed by the following formula,
Figure FDA0001768998690000011
wherein, wiWeight the historical sales for the i-th day of the good.
3. The method of claim 2, wherein the weight w of historical sales of the good on day i of the T daysiA weight w less than the historical sales of the good on day i +1 within the T daysi+1。
4. The method of claim 2, wherein the weight w of historical sales of the good on day i of the T daysiIs equal to
Figure FDA0001768998690000012
5. The method according to claim 1, wherein calculating an upper limit P of the number of trays of the target commodity from the predicted sales amount S of the commodity comprises:
wherein t is the number of safe stock days of the goods, and ms is the upper limit of the number of the goods placed on each tray.
6. The method of claim 1, wherein prior to determining the number of trays for the target item based on the number of currently available bins and the upper number of trays for the item, the method further comprises: the commodities are sorted according to one or more of the predicted sales volume of the commodities, the upper limit of the number of trays of the commodities, the number of commodities associated with the commodities and the click volume of the commodities from high to low, and the upper limit of the number of trays of the sorted commodities is Lmax1,Lmax2,Lmax3,…,LmaxkWherein k is the number of the sorted commodities;
the number of trays L of the sorted goods1,L2,L3,…,LkSatisfy the following relationship
Figure FDA0001768998690000021
Wherein i is 1,2,3, …, k, and N is the number of currently available storage bits.
7. An apparatus for storing articles, comprising:
a prediction module to determine a predicted sales volume for the commodity;
the calculation module is used for calculating the upper limit P of the tray quantity of the commodity according to the predicted sales amount S of the commodity;
the counting module is used for determining the number of the trays of the target commodity according to the number of the current available storage positions and the upper limit of the number of the trays of the commodity;
and the storage module is used for distributing storage positions for the trays of the commodities according to the number of the trays of the commodities.
8. The apparatus of claim 7, wherein the prediction module is further configured to obtain historical sales volume of the product within T days, and the historical sales volume of the product on the ith day within the T days is siThe predicted sales amount S of the commodity is expressed by the following formula,
Figure FDA0001768998690000022
wherein, wiWeight the historical sales for the i-th day of the good.
9. The apparatus of claim 8, wherein the weight w of historical sales of the item on day i of the T daysiA weight w less than the historical sales of the good on day i +1 within the T daysi+1。
10. The apparatus of claim 8, wherein the weight w of historical sales of the item on day i of the T daysiIs equal to
Figure FDA0001768998690000031
11. The apparatus of claim 7, wherein the calculation module is further configured to calculate an upper limit number of trays Pusage formula for the target product according to the predicted sales quantity S of the product
Figure FDA0001768998690000032
Wherein t is the number of safe stock days of the goods, and ms is the upper limit of the number of the goods placed on each tray.
12. The apparatus of claim 7, further comprising a constraint module configured to sort the commodities according to one or more of a predicted sales volume of the commodities, an upper tray quantity limit of the commodities, a quantity of the commodities associated with the commodities, and a click volume of the commodities from high to low, wherein the upper tray quantity limits of the sorted commodities are Lmax1,Lmax2,Lmax3,…,LmaxkWherein k is the number of the sorted commodities;
the number of trays L of the sorted goods1,L2,L3,…,LkSatisfy the following relationship
Figure FDA0001768998690000033
Wherein i is 1,2,3, …, k, and N is the number of currently available storage bits.
13. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-6.
14. A computer-readable medium, on which a computer program is stored, which, when being executed by one or more processors, carries out the method according to any one of claims 1-6.
CN201810940756.2A 2018-08-17 2018-08-17 Method and device for storing commodities Pending CN110837906A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810940756.2A CN110837906A (en) 2018-08-17 2018-08-17 Method and device for storing commodities

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810940756.2A CN110837906A (en) 2018-08-17 2018-08-17 Method and device for storing commodities

Publications (1)

Publication Number Publication Date
CN110837906A true CN110837906A (en) 2020-02-25

Family

ID=69573652

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810940756.2A Pending CN110837906A (en) 2018-08-17 2018-08-17 Method and device for storing commodities

Country Status (1)

Country Link
CN (1) CN110837906A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2007862A1 (en) * 1989-01-27 1990-07-27 Joseph L. Levasseur Vend space allocation monitor means and method
CN102567896A (en) * 2010-12-30 2012-07-11 国际商业机器公司 Method and system for assigning commodity locations in supermarket
US20150348172A1 (en) * 2014-05-30 2015-12-03 Wal-Mart Stores, Inc. Smart Order Management And Database Sharding
CN106892233A (en) * 2017-02-23 2017-06-27 北京京东尚科信息技术有限公司 Method, device, electronic equipment and storage medium for commodity layout for storekeeping
CN106971249A (en) * 2017-05-05 2017-07-21 北京挖玖电子商务有限公司 A kind of Method for Sales Forecast and replenishing method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2007862A1 (en) * 1989-01-27 1990-07-27 Joseph L. Levasseur Vend space allocation monitor means and method
CN102567896A (en) * 2010-12-30 2012-07-11 国际商业机器公司 Method and system for assigning commodity locations in supermarket
US20150348172A1 (en) * 2014-05-30 2015-12-03 Wal-Mart Stores, Inc. Smart Order Management And Database Sharding
CN106892233A (en) * 2017-02-23 2017-06-27 北京京东尚科信息技术有限公司 Method, device, electronic equipment and storage medium for commodity layout for storekeeping
CN106971249A (en) * 2017-05-05 2017-07-21 北京挖玖电子商务有限公司 A kind of Method for Sales Forecast and replenishing method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
周方圆;李珍萍;: "基于"货到人"拣选模式的储位分配模型与算法", 物流技术, no. 09, pages 252 - 256 *

Similar Documents

Publication Publication Date Title
CN106980955B (en) Method and apparatus for outputting information
Pan et al. Order batching in a pick-and-pass warehousing system with group genetic algorithm
CN110751497A (en) Commodity replenishment method and device
CN110348771B (en) Method and device for order grouping of orders
CN110472899B (en) Method and device for distributing articles out of warehouse
CN114118888A (en) Order ex-warehouse method and device
CN111507651A (en) Order data processing method and device applied to man-machine mixed warehouse
CN110689159A (en) Commodity replenishment method and device
CN110689157A (en) Method and device for determining call relation
CN110889656A (en) Warehouse rule configuration method and device
CN113256193B (en) Warehouse commodity layout method and device
CN110834858B (en) Method and device for storing goods in warehouse
CN113128821A (en) Method and device for determining task
CN113650997B (en) Article warehouse-out positioning method and device
CN111832980A (en) Method and device for allocating storage positions of multi-layer warehouse
CN111950830A (en) Task allocation method and device
CN112785025B (en) Warehouse layout method and device
CN112784212B (en) Inventory optimization method and device
CN111210074A (en) Order processing method, device, medium, electronic equipment and system in warehouse
CN112966992A (en) Order production method and device
CN113222490A (en) Inventory allocation method and device
CN112520284A (en) Shelf storage position adjusting method and system
CN111768133A (en) Method and device for warehousing articles
CN110689291A (en) Method and device for determining warehousing and boxing amount
CN110837906A (en) Method and device for storing commodities

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20200601

Address after: Room A1905, 19th floor, No. 2 Building, 18 Kechuang 11th Street, Beijing Daxing District, Beijing

Applicant after: Beijing Jingdong Qianshi Technology Co.,Ltd.

Address before: 300 457 days Tianjin Binhai New Area, Tianjin Economic and Technological Development Zone, No. 10 Fourth Avenue, Phase 2, First Floor

Applicant before: Tianjin Jingdong Shentuo Robot Technology Co.,Ltd.

SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination