CN113780916A - Warehouse-out method and device - Google Patents

Warehouse-out method and device Download PDF

Info

Publication number
CN113780916A
CN113780916A CN202011357684.2A CN202011357684A CN113780916A CN 113780916 A CN113780916 A CN 113780916A CN 202011357684 A CN202011357684 A CN 202011357684A CN 113780916 A CN113780916 A CN 113780916A
Authority
CN
China
Prior art keywords
storage
warehouse
equipment
storage equipment
task
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
CN202011357684.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
Beijing Jingdong Qianshi 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 Beijing Jingdong Qianshi Technology Co Ltd filed Critical Beijing Jingdong Qianshi Technology Co Ltd
Priority to CN202011357684.2A priority Critical patent/CN113780916A/en
Publication of CN113780916A publication Critical patent/CN113780916A/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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group

Landscapes

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

Abstract

The invention discloses a warehouse-out method and device, and relates to the technical field of computers. The specific implementation mode of the method comprises the steps of receiving a warehouse-out task, and obtaining the type and the warehouse-out amount of the articles to be warehoused; according to the current position of the article access equipment and the current existing lane included by the same-wave-time or earlier-wave-time ex-warehouse task, if the total article storage amount stored by the storage equipment corresponding to the types of the articles to be ex-warehouse in the lane is more than or equal to the ex-warehouse amount; judging whether a storage device combination with the storage capacity just equal to the ex-warehouse capacity exists or not based on a preset verification method, and if so, ex-warehouse the corresponding storage device; and if not, calculating the storage bit cost of the storage equipment and sequencing, generating a set formed by the storage quantities of the storage equipment after sequencing, and further sequentially accumulating the storage quantities in the set until the storage quantities meet the storage quantity to deliver the corresponding storage equipment out of the warehouse. Therefore, the method and the device can solve the problem that the existing warehouse-out efficiency is low and the equipment loss is large.

Description

Warehouse-out method and device
Technical Field
The invention relates to the technical field of computers, in particular to a warehouse-out method and device.
Background
The tunnel type stacker is a main device of an automatic stereoscopic warehouse, is also an important component developed more mature in a modern warehouse logistics system, and forms an automatic warehouse logistics system after being in online configuration with an upper computer. The tunnel type stacker is evolved from a forklift and a bridge type stacker, and is mainly used for reciprocating in a tunnel between high-rise goods shelves to store goods at a tunnel crossing into a goods grid or take out goods in the goods grid to convey the goods to the tunnel crossing.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
the tunnel type stacker has the advantages of complex equipment structure, high construction cost, difficulty in construction and use for enterprises with limited budget and longer cost recovery time after construction. In order to reduce the overall construction cost, the tunnel stacker replacing technology can be adopted. Different from a traditional tunnel type stacker warehouse in which each tunnel is attached with one stacker, one or more stackers are only attached in one warehouse area of the tunnel-changing stacker warehouse, and the stackers move among different tunnels through replacing rails. The current warehouse-out storage position and storage equipment (such as a tray) selection of the lane changing stacker still adopts the mode of the traditional stacker warehouse, and the lane changing stacker can frequently change lanes by the mode, so that the warehouse-out efficiency is low, and the equipment loss is large.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for delivering a warehouse, which can solve the problems that the existing article storing and taking device frequently changes the lane, and the warehouse-out efficiency is low and the device loss is large.
In order to achieve the above object, according to an aspect of the embodiments of the present invention, there is provided a method for delivering goods, including receiving a task of delivering goods, and obtaining a type and a quantity of goods to be delivered; according to the current position of the article access equipment and the current existing tunnel included by the same-wave-time or earlier-wave-time delivery task, if the total article storage quantity stored by the storage equipment corresponding to the article types to be delivered from the tunnel is larger than or equal to the delivery quantity; judging whether a storage device combination with storage capacity exactly equal to the ex-warehouse capacity exists or not based on a preset verification method, and if so, ex-warehouse the corresponding storage device; and if not, calculating the storage bit cost of the storage equipment, sequencing, generating a set formed by the storage quantities of the storage equipment after sequencing, and sequentially accumulating the storage quantities in the set until the storage quantities meet the storage quantity to deliver the corresponding storage equipment out of the warehouse.
Optionally, the step of unloading the corresponding storage device until the unloading amount is satisfied includes:
and sequentially accumulating the storage quantity according to the storage cost sequence to meet the storage equipment delivery quantity, marking the storage equipment accumulated at last as a zero-picking storage equipment, or marking the storage equipment with the storage quantity larger than the difference value of the storage quantity and the storage equipment accumulated storage quantity in the storage equipment as a zero-picking storage equipment to be selected.
Optionally, the method further comprises:
if the total storage quantity of the articles stored in the storage device corresponding to the types of the articles to be delivered out of the lane is smaller than the delivery quantity, reducing the delivery quantity, and judging whether the lanes meeting the delivery quantity after reduction exist in other lanes; if so, selecting a lane with the lowest lane replacement cost of the article access equipment, and carrying out article delivery according to the delivery quantity after deduction; and if not, sequentially selecting the roadways according to the sequence of the storage amount from large to small to carry out the warehouse-out of the articles until the warehouse-out amount after deduction is met.
Optionally, based on the preset verification method, if there is no storage device combination whose storage amount is exactly equal to the ex-warehouse amount, the method further includes:
if the roadway comprises a two-depth storage position roadway, selecting storage equipment which is stored with two storage positions on the inner side and the outer side of the same goods grid in the two-depth roadway and storage equipment which is stored with the storage position on the inner side without a block, and judging whether the storage quantity of the storage equipment which is provided with the type of the goods to be delivered meets the delivery quantity;
if yes, calculating the total storage capacity of each goods grid, and sequencing the storage devices according to the total storage capacity of the goods grids, wherein the storage devices in the same goods grid are sequenced in the front and back directions according to the outer sides; sequentially delivering the storage equipment out of the warehouse based on the sorting until the delivery quantity is met;
if not, the selected storage equipment is taken out of the warehouse and the warehouse-out amount is deducted, and the storage equipment stored in the storage positions outside the two-depth roadway and the storage equipment stored in the single-depth roadway are determined in the unselected storage equipment so as to meet the deducted warehouse-out amount; and calculating and sequencing the storage bit cost of the determined storage equipment, generating a set consisting of the storage quantities of the sequenced storage equipment, and sequentially accumulating the storage quantities in the set until the storage quantity of the storage equipment is met so as to determine the storage equipment for ex-warehouse.
Optionally, the unloading the corresponding storage device further includes:
acquiring position information of storage equipment for ex-warehouse, and if the position information is an inner storage position of a two-depth roadway and the outer side of the storage equipment is blocked by the storage equipment, performing derivative warehouse moving on the storage equipment for ex-warehouse;
and when the derivative warehouse moving is executed, acquiring the storage position coordinates where the storage equipment is located and the storage position coordinates which can be put into the roadway, calculating the warehouse moving cost of each storage position which can be put into the roadway based on a preset warehouse moving cost model, and further moving the storage equipment at the outer side to the storage position which can be put into and has the minimum warehouse moving cost.
Optionally, comprising:
receiving an ex-warehouse carrying task comprising at least one ex-warehouse task, and acquiring position information of article access equipment to determine a roadway where the article access equipment is located; if the state of the article access equipment is that the lane is being changed, acquiring the position information of a destination lane;
refreshing the information of the ex-warehouse storage equipment of each ex-warehouse task, acquiring the storage equipment needing ex-warehouse of the current wave number and the earlier wave number of the roadway, calculating the storage cost of the storage equipment, sequencing, and sequentially carrying through the article access equipment.
Optionally, the method further comprises:
when the ex-warehouse carrying task is executed, a warehouse returning task or a warehouse entering task is received;
and pausing the ex-warehouse conveying task, executing the ex-warehouse conveying task or the in-warehouse conveying task, restarting the ex-warehouse conveying task based on the roadway where the article access equipment is located after the execution is finished, and refreshing the sequence of the conveyed out-warehouse storage equipment.
In addition, the invention also provides a warehouse-out device, which comprises a receiving module, a storage module and a storage module, wherein the receiving module is used for receiving the warehouse-out task and acquiring the types and the warehouse-out amount of the articles to be warehoused; the processing module is used for judging whether the total storage quantity of the articles stored by the storage equipment corresponding to the types of the articles to be delivered from the lane is larger than or equal to the delivery quantity according to the lane where the article access equipment is located currently and the current existing same-wave-time or earlier-wave-time delivery task; judging whether a storage device combination with the storage capacity just equal to the ex-warehouse capacity exists or not based on a preset verification method, and if so, ex-warehouse the corresponding storage device; and if not, calculating the storage bit cost of the storage equipment and sequencing, generating a set formed by the storage quantities of the storage equipment after sequencing, and further sequentially accumulating the storage quantities in the set until the storage quantities meet the storage quantity to deliver the corresponding storage equipment out of the warehouse.
One embodiment of the above invention has the following advantages or benefits: the invention obtains the type and the delivery amount of the articles to be delivered by receiving the delivery task; according to the current position of the article access equipment and the current existing lane included by the same-wave-time or earlier-wave-time ex-warehouse task, if the total article storage amount stored by the storage equipment corresponding to the types of articles to be ex-warehouse in the lane is more than or equal to the ex-warehouse amount; judging whether a storage device combination with the storage capacity just equal to the ex-warehouse capacity exists or not based on a preset verification method, and if so, ex-warehouse the corresponding storage device; and if not, calculating the storage bit cost of the storage equipment and sequencing, generating a set consisting of the storage quantities of the sequenced storage equipment, and further sequentially accumulating the storage quantities in the set until the storage quantities in the set meet the technical means of delivering the corresponding storage equipment out of the warehouse, so that the delivery positioning of few-lane changing and few-zero picking is realized, and the technical effect of remarkably improving the operating efficiency of warehouse delivery operation is achieved.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with specific 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 view of a main flow of a ex-warehouse method according to a first embodiment of the present invention;
FIG. 2 is a schematic representation of a two-dimensional coordinate of a pick point location for each bin marker in accordance with the present invention;
FIG. 3 is a schematic diagram of a main flow of a ex-warehouse method according to a second embodiment of the invention;
FIG. 4 is a schematic diagram of a main flow of a ex-warehouse method according to a third embodiment of the invention;
FIG. 5 is a schematic diagram of the main modules of a ex-warehouse device according to an embodiment of the invention;
FIG. 6 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 7 is a schematic block diagram of a computer system suitable for use with a terminal device or server implementing an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered exemplary only. 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 a main flow of a ex-warehouse method according to a first embodiment of the present invention, as shown in fig. 1, the ex-warehouse method includes:
and S101, receiving the ex-warehouse task, and acquiring the type and the ex-warehouse quantity of the articles to be ex-warehouse.
In some embodiments, when a storage device (e.g., a tray) is taken out of a warehouse, the warehouse-out requirement can be set to better realize the warehouse-out of the storage device, for example, the lane-changing stacker changes less lanes and selects the zero-pick storage device flexibly. Specifically, the outbound requirements (which may also be considered as an outbound requirement function) include:
receiving issued ex-warehouse tasks, namely, specifying the types and the number of SKUs (unique identifiers of a type of article) needing to be ex-warehouse in each warehouse area, setting the minimum units of the ex-warehouse tasks (such as standard boxes or sacks, namely, N boxes or sacks are needed for a certain SKU generated by a production end), and recommending the storage equipment with the proper number to be out-warehouse by the system according to the inventory information. Setting storage device selection priority: the first priority is first-in first-out (the warehouse-out time is calculated according to the warehouse-out date), the second priority is prior to emptying the storage equipment when the warehouse is not greatly promoted, and the number of the warehouse-out equipment when the warehouse is greatly promoted is the least.
The threshold value of the number of storage devices which can be simultaneously subjected to zero picking in a single storage area is set to be 3, for example, the zero picking storage device number is not subjected to zero picking operation after reaching the upper limit, but the whole storage device can be subjected to ex-warehouse operation, the zero picking storage devices need to be picked in a limited time and return to the warehouse, if the time limit is exceeded, all ex-warehouse tasks are stopped, and the ex-warehouse tasks can be continued after the zero picking completion system confirms that the storage devices return to the warehouse.
The warehouse-out requirement is set to firstly execute the warehouse-out task of one lane in a centralized manner, the tasks are executed and then other lanes are executed, and when the warehouse-out task of one lane is executed, the whole support is preferentially taken out and then the zero picking is carried out. The ex-warehouse coordination needs to be considered, in addition, ex-warehouse tasks have order intercepting time, and the tasks in the same order intercepting time are in the same wave number.
And S102, according to the current position of the article access equipment and the current existing lane included by the same-wave-time or earlier-wave-time delivery task, if the total article storage amount stored by the storage equipment corresponding to the article types to be delivered from the lane is more than or equal to the delivery amount.
In some embodiments, if the total storage amount of the articles stored in the storage device corresponding to the types of the articles to be delivered is less than the delivery amount, the delivery amount is deducted, whether a lane meeting the delivery amount after deduction exists in other lanes is judged, if so, the lane with the lowest cost for replacing the lane by the article access device is selected, and the articles are delivered according to the delivery amount after deduction; if not, the laneways are sequentially selected according to the sequence of the storage amount from large to small to carry out the warehouse-out of the articles until the warehouse-out amount after deduction is met.
It should be noted that the processing of the lanes in the present invention is based on the lane where the article access device is currently located and the current lane which has been involved in the same-wave-time or earlier-wave-time ex-warehouse task.
Step S103, judging whether a storage device combination with the storage capacity exactly equal to the ex-warehouse quantity exists or not based on a preset verification method, and if so, ex-warehouse the corresponding storage device; and if not, calculating the storage bit cost of the storage equipment and sequencing, generating a set consisting of the storage quantities of the storage equipment after sequencing, and further sequentially accumulating the storage quantities in the set until the storage quantities meet the storage quantity so as to take the corresponding storage equipment out of the warehouse.
In an embodiment, the preset verification method may use a subset and problem algorithm, that is, a subset and problem algorithm is called (the order of the storage devices may be scrambled before calling) to determine whether there is a storage device combination with storage capacity exactly equal to the ex-warehouse capacity. Generating s by a subset and problem algorithm if there is a combination of storage devices with storage exactly equal to the ex-warehouse quantityaOne solution (e.g., 100 to 500) is less than SaAnd finding all solutions, evaluating all solutions by using an objective function to select the best solution (the promotion value and the non-promotion value are different functions, the smaller the promotion value is, the better the non-promotion value is, the larger the non-promotion value is, the better the non-promotion value is), and ex-warehousing the corresponding storage equipment. The objective function may be the ex-warehouse demand in step S101, that is, different ex-warehouse demand functions are formulated according to different scenarios.
The scores of the solutions are calculated according to the following functions when the non-promotion scene or the non-promotion scene (namely the first scene) is preferentially emptied from the storage device, and the solution with the maximum score is found out:
Figure BDA0002803042940000071
according to the promotion scenario, when the storage device is omitted for the promotion scenario (namely, the second scenario), the score of each solution is calculated by using the following function, and the solution with the minimum score is found out:
Figure RE-GDA0002927589780000072
wherein: i belongs to T, T is a storage device set, l belongs to way, way is a roadway set without a warehouse-out task and a stacker at present, and int is a set formed by storage devices which are positioned at an inner storage position but are blocked by other storage devices which can not be used for the warehouse-out task at this time and are not positioned by other warehouse-out tasks at the same time or earlier times. x is the number ofi1 if the ith storage device is finished out, or 0 if not. y isiIs 1 if the ith storage device has a zero pick, otherwise is 0. z is a radical ofi，j＝max(xi+yi-xj-yj0), if (i, j) belongs to same, otherwise 0; if (i, j) belongs to the same place, it indicates that the storage devices i and j are in the same place, i stores in the inner place, and j stores in the outer place. w is al1, if ∑i∈way(l)(xi+yi) Not less than 1, otherwise 0; wherein way (l) is the set of storage devices contained in lane l. Lambda [ alpha ]1The priority is given to the penalty parameter which measures the priority of clearing the most storage devices, with higher priority given by higher values. Lambda [ alpha ]2For the penalty parameter, which measures the priority degree of changing the lane less, the parameter value should be larger when the lane changing cost is higher. Lambda [ alpha ]3To penalize the parameter, which measures the priority of few derived move pools, the higher the derived move pool cost the larger this parameter value should be. Lambda [ alpha ]4To penalize the priority of a parameter with zero less picks, the higher the cost of a zero pick the larger the value of this parameter should be.
If the total number of solutions to the problem exceeds S1Then continue to search down S2A solution (e.g., 100 to 200) if S2If there is a better solution than the best solution found currently, the best solution found is replaced and the search continues downwards until no better solution is found in a search or the number of solutions found reaches an upper limit S3(e.g., 500 to 1000), after the search is completed, the storage device is located according to the found best solution (in which case the storage devices are all rounded up), and the location is completed.
In some embodiments, the step of unloading the corresponding storage device until the unloading amount is satisfied comprises:
acquiring scene information in the ex-warehouse task, determining that accumulated storage equipment is ex-warehouse if the scene information is a non-promotion scene, and marking the last accumulated storage equipment as zero-order storage equipment; and if the scene information is a promotion scene, determining that the accumulated storage devices are delivered out of the warehouse, and marking the storage devices with the storage quantity larger than the difference value between the delivery quantity and the accumulated storage quantity of the storage devices as the zero-picking storage devices to be selected.
As an embodiment, it is determined that there is no storage device combination whose storage amount is exactly equal to the ex-warehouse amount based on a preset verification method, the storage cost is sorted from small to large according to the storage amount (non-promotion scene or non-promotion scene, i.e., first scene) or from large to small (promotion scene or promotion scene, i.e., second scene), and the set of the storage device storage amounts after sorting is set as { a }1，a2，…，anA is calculated1To anUntil the minimum m is found to satisfy the ex-warehouse quantity
Figure BDA0002803042940000081
At the moment, the first m storage devices are determined to be delivered out of the warehouse, the mth storage device is selected as a zero-order storage device when the storage capacity of the current SKU and all the storage devices of the batch is determined to be larger than the residual quantity when the storage capacity of the current SKU and the batch is not greatly increased
Figure BDA0002803042940000082
The storage devices are marked as zero-sorting storage devices to be selected, and positioning is completed.
As another embodiment, based on a preset verification method, if there is no storage device combination with storage capacity exactly equal to the delivery capacity, it may be determined whether there is a two-deep storage lane, and if there is a two-deep storage lane included in the current lane, a storage device with two storage locations inside and outside the same cargo space in the two deep lanes and a storage device with an unobstructed storage location in the inside are selected (i.e., the storage device is not stored in the storage location outside the cargo space or the storage device is already delivered by the same-round or earlier-round task), and it is determined whether the storage capacity of the storage device holding the item satisfies the delivery capacity. Wherein, single deep tunnel only has one storage position for in each goods check of side goods shelves about the tunnel, and every storage position can bear a storage device who places the goods. The two deep storage positions are lengthened plates of the single deep storage position in the depth direction, and each goods grid of the goods shelf on the left side and the right side of the roadway is provided with two storage positions (namely, the storage positions are divided into an outer side and an inner side) which are arranged in parallel from front to back and can bear two storage devices for placing goods.
According to the judgment result, if yes, the total storage capacity of each goods grid is calculated, the storage capacity sorting storage devices of the goods are stored according to the sorting mode corresponding to the scene information in the ex-warehouse task, and the storage devices in the same goods grid are sorted according to the front side, the inner side and the rear side of the outer side; and sequentially delivering the storage equipment out of the warehouse based on the sequence until the warehouse delivery amount is met.
In a preferred embodiment, the total storage capacity of each goods grid is obtained, the storage devices are sorted from small to large according to the total storage capacity of the belonging goods grids in a non-promotion scene or a non-promotion scene (namely, a first scene), if one goods grid has two storage devices, the storage devices are sorted from large to small according to the storage capacity of the goods grid in the front-inner side-rear direction, in a promotion scene or a promotion scene (namely, a second scene), the storage devices are sorted from small to large according to the storage cost of the storage space when the storage capacity of the goods grid is the same, and if one goods grid has two storage devices, the storage devices are sorted from small to large according to the storage capacity of the outside-front-inner side-rear direction. For example:
Figure BDA0002803042940000091
the storage device ordering in the non-promotional scenario or non-promotional (i.e., first scenario) is: 9,15,12,10,14,16,23,12,
in a big or promotion scenario (i.e., the second scenario), the storage devices are ordered as: 23,12,14,16,12,10,15, 9;
after the storage devices are ordered according to the above rule, the set formed by the storage quantity of the storage devices is set as { a1，a2，…，anA is calculated1To anUntil the minimum m is found to satisfy the ex-warehouse quantity
Figure BDA0002803042940000092
At the moment, the first m storage devices are determined to be delivered out of the warehouse, the mth storage device is selected as a zero-order storage device when the storage capacity of the current SKU and all the storage devices of the batch is determined to be larger than the residual quantity when the storage capacity of the current SKU and the batch is not greatly increased
Figure BDA0002803042940000093
The storage devices are marked as zero-sorting storage devices to be selected, and positioning is completed.
According to the judgment result, if not, the selected storage equipment is taken out of the warehouse and the warehouse-out quantity is deducted, and the storage equipment stored in the storage positions at the outer sides of the two-depth roadway and the storage equipment stored in the single-depth roadway are determined in the unselected storage equipment so as to meet the deducted warehouse-out quantity; calculating and determining the storage bit cost of the storage equipment, sequencing, generating a set formed by the storage quantity of the storage equipment after sequencing, and further sequentially accumulating the storage quantity in the set until the storage quantity meets the requirement of ex-warehouse quantity so as to determine the ex-warehouse storage equipment.
In a preferred embodiment, if the storage device is not located, the storage devices stored in the storage positions outside the two-depth roadway and the storage device stored in the single-depth roadway are selected from the remaining storage devices which are not located, if the storage quantity does not meet the requirement, the storage devices are determined to be delivered, the delivery quantity is reduced, the storage devices (the storage devices which are located in the storage positions inside but outside the storage devices are blocked by the storage devices which are not used for the delivery task and are not blocked by the storage devices located by other delivery tasks of the same wave number or earlier wave number) stored in the two-depth roadway are selected, the storage cost is sorted from small to large (non-large promotion scene) or from large to small (large promotion scene) according to the storage quantity, and the set consisting of the sorted storage device storage quantities is set as { a } a1，a2，…，anA is calculated1To anUntil the minimum m is found to satisfy the ex-warehouse quantity
Figure BDA0002803042940000094
At the moment, the first m storage devices are determined to be delivered from the warehouse, the mth storage device is selected as a zero-order storage device when the storage capacity of the storage devices of the current SKU and the batch is not greatly promoted, and the storage capacity of all the storage devices of the current SKU and the batch is determined to be larger than the residual quantity when the storage capacity of the storage devices of the batch is greatly promoted
Figure BDA0002803042940000101
The storage devices are marked as zero-order to-be-selected storage devices, and positioning is completed.
If the storage quantity meets the requirement, the storage cost is increased from low to high according to the storage quantity from low to high (non-large scene) or from high to low (large scene)Sorting, wherein a set formed by the storage quantity of the storage equipment after sorting is set as { a1，a2，…，anA is calculated1To anUntil the minimum m is found to satisfy the ex-warehouse quantity
Figure BDA0002803042940000102
At the moment, the first m storage devices are determined to be delivered out of the warehouse, the mth storage device is selected as a zero-order storage device when the storage capacity of the current SKU and all the batches are determined to be greater than the residual quantity when the storage capacity of the storage devices is not greatly promoted
Figure BDA0002803042940000103
The storage device marks as the zero-picking storage device to be selected, and positioning is completed.
In the embodiment of the invention, after the storage equipment needing to be delivered is positioned and selected, the storage equipment (such as a stacker) needing to be reasonably scheduled is also required, the task batch execution of the same roadway is realized under the condition of ensuring the task priority, the zero-picking storage equipment can be flexibly selected, and the like, so that the overall operation efficiency is improved. The storage devices to be selected in the zero-order picking mode are determined in the positioning process, if the storage devices to be selected in the zero-order picking mode are not recorded as the storage devices to be selected in the zero-order picking mode, the storage devices to be selected in the zero-order picking mode or the storage devices to be selected in the zero-order picking mode are determined to be in the whole warehouse picking mode, each SKU in each task cannot have the storage devices to be selected in the zero-order picking mode or the storage devices to be selected in the zero-order picking mode at the same time, the storage devices to be selected in the zero-order picking mode are unique, zero-order picking is determined to be needed, and only any one storage device is selected to be subjected to the zero-order picking.
It should be noted that, the position information of the ex-warehouse storage device is obtained, and if the position information is the inner storage position of the two-depth roadway and the outer storage device is blocked (that is, the outer storage device is not blocked by other storage devices which can not be used for the ex-warehouse task at this time and are not positioned by other ex-warehouse tasks at the same time or earlier time), the derived ex-warehouse storage device is executed. And when the derived warehouse transfer is executed, acquiring the storage position coordinates of the storage equipment and the storage position coordinates which can be placed in the roadway, calculating the warehouse transfer cost of each storage position which can be placed in based on a preset warehouse transfer cost model, and further transferring the storage equipment at the outer side to the storage position which can be placed in and has the minimum warehouse transfer cost. The specific implementation process of the derivative library shifting execution comprises the following steps:
establishing a coordinate system as shown in fig. 2, obtaining coordinates of a storage location where the storage device is located as (x)0，y0) Acquiring a storage position which can be placed in the roadway (when the inner side of a certain storage position is not occupied, the outer side of the storage position cannot be placed in the storage device), setting the coordinate of the certain available storage position as (x, y), and calculating the storage position cost by using the following method:
Figure BDA0002803042940000111
wherein c is1，c2，c3Is a parameter 1emptyIndicating whether the bit is an empty bit (i.e. a bit whose inner side is not occupied, and no bit is occupied, 1 is occupied, and 0 is occupied), 1sameIndicating whether the same kind of goods are placed in the storage position (1 is placed and 0 is not placed), 1selectIndicating whether the storage equipment inside the storage position is positioned by being taken out of the warehouse;
and then selecting the placeable storage position with the minimum cost for derivative library shifting, and moving the blocking storage device to the storage position.
As still another embodiment of the present invention, when performing the ex-warehouse transportation task, if the order intercepting time of the tasks is different, the tasks in the same order intercepting time are the same order, the task with the order before is preferentially produced during production, specifically, when performing the ex-warehouse transportation task, the storage device positioned by each task is refreshed, the stacker position is obtained (in which lane, the destination lane is obtained when the lane is changed), the storage device required to be ex-warehouse for the task with the order before and the task with the order earlier is obtained, the storage cost is increased from small to large according to the non-blocking situation (the storage devices on the inner side and the outer side of the same cargo grid are both ex-warehouse, and the storage devices on the inner side and the outer side of the same cargo grid are also regarded as non-blocking situation), and the storage device is sorted from the front to the rear.
That is, the present invention can receive the outbound transportation task including at least one outbound task, and obtain the position information of the article access device to determine the lane. And if the article access equipment is in the lane changing state, acquiring the position information of the destination lane. Refreshing the information of the ex-warehouse storage equipment of each ex-warehouse task, acquiring the storage equipment needing ex-warehouse of the current wave number and the earlier wave number of the roadway, calculating the storage cost of the storage equipment, sequencing, and sequentially carrying through the article access equipment.
Preferably, the following steps are repeatedly executed on the sorted storage device until the condition is satisfied, and the storage device is transferred to other lanes or interrupted by other tasks, wherein the storage device is prevented from being ex-warehouse and the warehouse transfer is required to be derived:
if the current zero-picking area has a null bit, the storage device with the top rank is found:
and a, if the storage device is delivered from the warehouse in a whole order (not marked as zero picking or to be selected), directly delivering the storage device from the warehouse.
b, if the storage device is the zero-picking storage device to be selected, the storage device goes out of the warehouse for zero-picking, and cancels the zero-picking mark of other storage devices to be selected in the task and the SKU of the storage device to be selected, and if the task and the SKU of the storage device to be selected have no other storage devices to be selected which are not going out of the warehouse, the storage device is marked as the zero-picking storage device, and goes out of the warehouse for zero-picking.
And c, if the storage device is a zero-picking storage device, the storage device goes out of the warehouse and picks the zero-picking storage device.
If the current zero-pick zone has no empty space, then find the top-ranked storage device without a mark pause:
and a, if the whole storage device is delivered out of the warehouse, directly delivering the storage device out of the warehouse.
And b, if the storage device to be selected is the zero-picking storage device, if the task and the SKU which the storage device belongs to still have other storage devices to be selected which are not delivered from the warehouse, canceling the storage device zero-picking mark to be selected and delivering the storage device out of the warehouse.
And c, if the storage device is a zero-order storage device, marking a pause mark on the storage device, and if the storage device arranged behind the storage device and the storage device are in the same cargo space of the two-depth roadway (the storage device behind is in a storage position on the inner side of the cargo space), marking the pause mark on the following storage device.
If the current zero-picking area has no vacancy and the rest of the storage devices which are not delivered from the warehouse are marked with pause marks, the storage devices which are not marked with zero-picking are examined, if the tasks or SKUs of the storage devices are different from the storage devices marked with zero-picking, the storage devices are selected and the following steps are carried out according to the original sequence:
and a, if the whole storage device is delivered out of the warehouse, directly delivering the storage device out of the warehouse.
And b, if the storage device to be selected is the zero-picking storage device, if the task and the SKU which the storage device belongs to still have other storage devices to be selected which are not delivered from the warehouse, canceling the storage device zero-picking mark and completely delivering the storage device out of the warehouse, and if the task and the SKU which the storage device belongs to do not have other storage devices to be selected which are not delivered from the warehouse, marking the storage device to be selected as the zero-picking storage device (at the moment, the storage device cannot be delivered from the warehouse and the zero-picking storage device can not be delivered from the warehouse).
It should be noted that if all storage devices are out of the warehouse or the current zero-pick zone has no empty position and all the remaining storage devices are the suspended storage devices and the suspended storage devices, then the item access device (such as a stacker) is shifted to the lane with the largest number of current-and earlier-order warehouse-ready tasks (including the storage devices not marked as zero-pick and the more than two zero-pick storage devices remaining in the same task and SKU).
It should be noted that, when the ex-warehouse transportation task is executed, if a ex-warehouse or in-warehouse task is inserted, the ex-warehouse transportation task is stopped, that is, when the ex-warehouse transportation task is executed, the ex-warehouse task or the in-warehouse task is received; and pausing the ex-warehouse transportation task, executing the ex-warehouse task or the in-warehouse task, restarting the ex-warehouse transportation task based on the roadway where the article access equipment is located after the execution is finished, and refreshing the sequence of the ex-warehouse transportation storage equipment.
Preferably, the warehouse-out and conveying task is suspended, and the warehouse-back task can be executed through the following processes:
the zero-picking warehouse returning and warehouse-in warehouse-out can be executed alternately, when the warehouse returning task needs to be executed, the warehouse returning storage device SKU warehouse-in date is determined, and the following steps are executed:
checking the not-full roadway of the SKU storage device stored with the date (the not-full roadway is that the storage occupancy rate does not reach the preset threshold), and if the not-full roadway exists, executing according to the following two conditions:
and a, if the roadway meeting the condition comprises the current roadway of the stacker, putting the SKU into the current roadway to select a storage position, wherein if the current roadway is a single-depth roadway, the storage position with the lowest cost is directly searched.
And b, if not, selecting the lane which meets the condition and stores the date and has the maximum number of the SKU storage devices to be placed into the SKU.
If the roadway is not full, the roadway of the SKU storage device at the date is stored, the roadway of the SKU storage device at the closest storage date (a threshold value can be set) is searched for and stored, and if the roadway is executed according to the following two conditions:
and c, if the roadway meeting the condition comprises the current roadway of the stacker, placing the SKU into the current roadway.
And d, if not, selecting the lane which meets the condition and has the most storage equipment number to be stored into the SKU.
And if the conditions of a, b, c and d are not met (namely the condition laneway is not met), returning to the warehouse by adopting a normal warehouse-in strategy.
In summary, the present invention provides a new lane change less zero picking warehouse positioning method and a new stacker scheduling method capable of positioning and determining the sorting of the ex-warehouse tasks, which are applicable to different service scenarios and requirements. On the premise of meeting the requirements of various scenes and businesses, the invention selects an optimized storage position combination for the ex-warehouse tasks, can realize less lane changing, less zero picking, less derivative moving and flexible selection of zero picking storage equipment, has higher calculation efficiency, can be matched with a subsequent ex-warehouse task sorting algorithm, and can also realize batch execution of tasks in the same lane and flexible selection of zero picking storage equipment, thereby obviously improving the operation efficiency of ex-warehouse operation.
Fig. 3 is a schematic diagram of a main flow of a ex-warehouse method according to a second embodiment of the invention, which may include:
step S301, receiving the ex-warehouse task, and acquiring the type and the ex-warehouse quantity of the articles to be ex-warehouse.
Step S302, according to the current position of the article access device and the current existing lane included by the same-wave-time or earlier-wave-time ex-warehouse task, determining that the total article storage quantity stored by the storage device corresponding to the type of the article to be ex-warehouse in the lane meets the ex-warehouse quantity.
Step S303, based on a preset verification method, determining whether there is a storage device combination whose storage amount is exactly equal to the ex-warehouse amount, if so, performing step S304, otherwise, performing step S305.
And step S304, the corresponding storage device is taken out of the warehouse, and the process is exited.
Step S305, calculating the storage bit cost of the storage devices, sorting, generating a set formed by the storage amounts of the sorted storage devices, sequentially accumulating the storage amounts in the set until the storage amount is met, and executing step S306.
Step S306, scene information in the ex-warehouse task is obtained, if the scene information is a non-promotion scene, the accumulated storage devices are determined to be out of the warehouse, and the storage devices accumulated at last are marked as zero-order storage devices; and if the scene information is a promotion scene, determining that the accumulated storage devices are delivered out of the warehouse, and marking the storage devices with the storage quantity larger than the difference value between the delivery quantity and the accumulated storage quantity of the storage devices in the storage devices as zero-order storage devices to be selected.
Fig. 4 is a schematic diagram of a main flow of a ex-warehouse method according to a third embodiment of the invention, which may include:
step S401, receiving the warehouse-out task, and acquiring the type and the warehouse-out amount of the articles to be warehoused.
Step S402, judging whether the total storage quantity of the articles stored by the storage device corresponding to the current article type in the roadway where the article access device is located and the current existing same-wave-time or earlier-wave-time ex-warehouse task meets the ex-warehouse quantity, if so, performing step S403, and if not, performing step S410.
Step S403, based on a preset verification method, determining whether there is a storage device combination whose storage amount is exactly equal to the ex-warehouse amount, if so, performing step S404, and if not, performing step S405.
And S404, discharging the corresponding storage device.
Step S405, judging whether the current roadway comprises a two-depth storage position roadway, if so, performing step S406, and if not, performing step S409.
Step S406, selecting storage devices of the inner side storage position and the outer side storage position with the same goods grid and storage devices of the non-blocking inner side storage position in the two depth roadways, judging whether the storage quantity of the storage devices, which is provided with the types of the articles to be delivered, meets the delivery quantity, if so, performing step S407, and otherwise, performing step S408.
Step S407, calculating the total storage capacity of each cargo grid, and sorting the storage devices according to the total storage capacity of the cargo grids according to the sorting mode corresponding to the scene information in the ex-warehouse task, wherein the storage devices in the same cargo grid are sorted according to the front side, the inner side and the rear side of the outer side; and sequentially delivering the storage equipment out of the warehouse based on the sequence until the delivery quantity is met.
Step S408, the selected storage devices are taken out of the warehouse, the warehouse-out quantity is deducted, and the storage devices stored in the storage positions outside the two-depth roadway and the storage devices in the single-depth roadway are determined in the unselected storage devices so as to meet the deducted warehouse-out quantity; calculating and determining the storage bit cost of the storage equipment, sequencing, generating a set formed by the storage quantity of the storage equipment after sequencing, and further sequentially accumulating the storage quantity in the set until the storage quantity meets the requirement of ex-warehouse quantity so as to determine the ex-warehouse storage equipment.
And step S409, calculating the storage bit cost of the storage equipment, sequencing, generating a set formed by the storage quantity of the storage equipment after sequencing, and sequentially accumulating the storage quantity in the set until the storage quantity meets the storage quantity to determine the storage equipment for ex-warehouse.
And S410, deducting the warehouse-out quantity, judging whether the other roadways have the roadway meeting the warehouse-out quantity after deduction, if so, selecting the roadway with the lowest roadway replacement cost, and otherwise, sequentially selecting the roadways according to the sequence of the storage quantity from large to small until the warehouse-out quantity after deduction is met so as to determine the storage equipment for warehouse-out.
Fig. 5 is a schematic diagram of main modules of a warehouse-out device according to an embodiment of the present invention, and as shown in fig. 5, the warehouse-out device 500 includes a receiving module 501 and a processing module 502. The receiving module 501 receives the delivery task, and obtains the type and the delivery amount of the articles to be delivered; the processing module 502 determines that the total storage amount of the articles stored in the storage device corresponding to the type of the articles to be delivered from the lane is greater than or equal to the delivery amount according to the lane where the article access device is currently located and the current existing same-wave-time or earlier-wave-time delivery task; judging whether a storage device combination with storage capacity just equal to ex-warehouse capacity exists or not based on a preset verification method, and if so, ex-warehouse the corresponding storage device; and if not, calculating the storage bit cost of the storage equipment and sequencing, generating a set formed by the storage quantities of the storage equipment after sequencing, and further sequentially accumulating the storage quantities in the set until the storage quantities meet the storage quantity to deliver the corresponding storage equipment out of the warehouse.
In some embodiments, processing module 502 until the destage amount is satisfied to destage the corresponding storage device includes:
and sequentially accumulating the storage quantity according to the storage cost sequence to meet the storage equipment delivery quantity, marking the storage equipment accumulated at last as a zero-picking storage equipment, or marking the storage equipment with the storage quantity larger than the difference value of the storage quantity and the storage equipment accumulated storage quantity in the storage equipment as a zero-picking storage equipment to be selected.
In some embodiments, the processing module 502 is further configured to:
if the total storage quantity of the articles stored in the storage device corresponding to the types of the articles to be delivered out of the lane is smaller than the delivery quantity, reducing the delivery quantity, and judging whether the lanes meeting the delivery quantity after reduction exist in other lanes; if so, selecting a lane with the lowest lane replacement cost of the article access equipment, and carrying out article delivery according to the delivery quantity after deduction; and if not, sequentially selecting the roadways according to the sequence of the storage amount from large to small to carry out the warehouse-out of the articles until the warehouse-out amount after deduction is met.
In some embodiments, the processing module 502 further includes, based on the preset verification method, if there is no storage device combination with storage amount exactly equal to the ex-warehouse amount:
if the roadway comprises a two-depth storage position roadway, selecting storage equipment which is stored with two storage positions on the inner side and the outer side of the same goods grid in the two-depth roadway and storage equipment which is stored with the storage position on the inner side without a block, and judging whether the storage quantity of the storage equipment which is provided with the type of the goods to be delivered meets the delivery quantity;
if yes, calculating the total storage capacity of each goods grid, and sequencing the storage devices according to the total storage capacity of the goods grids, wherein the storage devices in the same goods grid are sequenced in the front and back directions according to the outer sides; sequentially delivering the storage equipment out of the warehouse based on the sorting until the delivery quantity is met;
if not, the selected storage equipment is taken out of the warehouse and the warehouse-out amount is deducted, and the storage equipment stored in the storage positions outside the two-depth roadway and the storage equipment stored in the single-depth roadway are determined in the unselected storage equipment so as to meet the deducted warehouse-out amount; and calculating and sequencing the storage bit cost of the determined storage equipment, generating a set consisting of the storage quantities of the sequenced storage equipment, and sequentially accumulating the storage quantities in the set until the storage quantity of the storage equipment is met so as to determine the storage equipment for ex-warehouse.
In some embodiments, the processing module 502 exports the corresponding storage device, further comprising: acquiring position information of storage equipment for ex-warehouse, and if the position information is an inner side storage position of a two-depth roadway and the outer side of the storage equipment is blocked by the storage equipment, performing derivative warehouse moving on the storage equipment for ex-warehouse;
and when the derivative warehouse moving is executed, acquiring the storage position coordinates where the storage equipment is located and the storage position coordinates which can be put into the roadway, calculating the warehouse moving cost of each storage position which can be put into the roadway based on a preset warehouse moving cost model, and further moving the storage equipment at the outer side to the storage position which can be put into and has the minimum warehouse moving cost.
In some embodiments, the processing module 502 is further configured to:
receiving an ex-warehouse carrying task comprising at least one ex-warehouse task, and acquiring position information of article access equipment to determine a roadway where the article access equipment is located; if the state of the article access equipment is that the lane is being changed, acquiring the position information of a destination lane;
refreshing the information of the ex-warehouse storage equipment of each ex-warehouse task, acquiring the storage equipment needing ex-warehouse of the current wave number and the earlier wave number of the roadway, calculating the storage cost of the storage equipment, sequencing, and sequentially carrying through the article access equipment.
In some embodiments, the processing module 502 receives a warehouse-back task or a warehouse-in task when executing a warehouse-out handling task;
and pausing the ex-warehouse conveying task, executing the ex-warehouse conveying task or the in-warehouse conveying task, restarting the ex-warehouse conveying task based on the roadway where the article access equipment is located after the execution is finished, and refreshing the sequence of the conveyed out-warehouse storage equipment.
It should be noted that the ex-warehouse method and the ex-warehouse device of the present invention have corresponding relationship in specific implementation content, so repeated content is not described again.
Fig. 6 illustrates an exemplary system architecture 600 to which the ex-warehouse method or the ex-warehouse apparatus of the embodiments of the invention may be applied.
As shown in fig. 6, the system architecture 600 may include terminal devices 601, 602, 603, a network 604, and a server 605. Network 604 is used to provide a medium for communication links between terminal devices 601, 602, 603 and server 605. Network 604 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 601, 602, 603 to interact with the server 605 via the network 604 to receive or send messages or the like. Various communication client applications can be installed on the terminal devices 601, 602, 603.
The terminal devices 601, 602, 603 may be various electronic devices having an outbound screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
It should be noted that the ex-warehouse method provided by the embodiment of the present invention is generally executed by the server 605, and accordingly, the computing device is generally disposed in the server 605.
It should be understood that the number of terminal devices, networks, and servers in fig. 6 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 7, shown is a block diagram of a computer system 700 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 7 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. 7, the computer system 700 includes a Central Processing Unit (CPU)701, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM703, various programs and data required for the operation of the computer system 700 are also stored. The CPU701, the ROM702, and the RAM703 are connected to each other via a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a Cathode Ray Tube (CRT), a Liquid Crystal Dispenser (LCD), and the like, a speaker, and the like; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as an internet. A drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 701.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes an acquisition module and a processing module. Where the names of these modules do not in some way constitute a limitation on the modules themselves.
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs, and when the one or more programs are executed by the equipment, the equipment comprises a receiving and ex-warehouse task, and the type and the ex-warehouse quantity of the goods to be ex-warehouse are acquired; according to the current position of the article access equipment and the current existing lane included by the same-wave-time or earlier-wave-time ex-warehouse task, if the total article storage amount stored by the storage equipment corresponding to the article types to be ex-warehouse in the lane is more than or equal to the ex-warehouse amount; judging whether a storage device combination with storage capacity just equal to the ex-warehouse capacity exists or not based on a preset verification method, and if so, ex-warehouse the corresponding storage device; and if not, calculating the storage bit cost of the storage equipment and sequencing, generating a set consisting of the storage quantities of the storage equipment after sequencing, and further sequentially accumulating the storage quantities in the set until the storage quantities meet the storage quantity so as to take the corresponding storage equipment out of the warehouse.
According to the technical scheme of the embodiment of the invention, the problems that the existing article storing and taking equipment frequently changes a roadway, the warehouse-out efficiency is low, and the equipment loss is large can be solved.
The above-described embodiments should not be construed as limiting the scope of the invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations, and substitutions may 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 (10)

1. A method of ex-warehouse, comprising:
receiving a warehouse-out task, and acquiring the types and the warehouse-out amount of the articles to be warehoused;
according to the current position of the article access equipment and the current existing lane included by the same-wave-time or earlier-wave-time ex-warehouse task, if the total article storage amount stored by the storage equipment corresponding to the types of the articles to be ex-warehouse in the lane is more than or equal to the ex-warehouse amount;
judging whether a storage device combination with the storage capacity just equal to the ex-warehouse capacity exists or not based on a preset verification method, and if so, ex-warehouse the corresponding storage device; and if not, calculating the storage bit cost of the storage equipment and sequencing, generating a set formed by the storage quantities of the storage equipment after sequencing, and further sequentially accumulating the storage quantities in the set until the storage quantities meet the storage quantity to deliver the corresponding storage equipment out of the warehouse.
2. The method of claim 1, wherein the step of ex-warehousing the corresponding storage device until the ex-warehouse volume is satisfied comprises:
and sequentially accumulating the storage quantity according to the storage cost sequence to meet the storage equipment delivery quantity, marking the storage equipment accumulated at last as a zero-picking storage equipment, or marking the storage equipment with the storage quantity larger than the difference value of the storage quantity accumulated by the storage equipment and the delivery quantity in the storage equipment as a zero-picking storage equipment to be selected.
3. The method of claim 1, further comprising:
if the total storage amount of the articles stored in the storage device corresponding to the types of the articles to be delivered out of the lane is smaller than the delivery amount, deducting the delivery amount, and judging whether the lane meeting the delivery amount after deduction exists in other lanes;
if so, selecting the lane with the lowest lane replacement cost of the article access equipment, and carrying out article delivery according to the delivery quantity after deduction; and if not, sequentially selecting the roadways according to the sequence of the storage amount from large to small to carry out the warehouse-out of the articles until the warehouse-out amount after deduction is met.
4. The method of claim 1, wherein if there is no storage device combination with storage capacity exactly equal to the ex-warehouse capacity based on a preset verification method, further comprising:
if the roadway comprises a two-depth storage position roadway, selecting storage equipment which is stored with two storage positions on the inner side and the outer side with the same goods grid in the two-depth roadway and storage equipment which is stored with the storage position on the inner side without a block, and judging whether the storage quantity of the storage equipment which is reserved with the type of the goods to be delivered meets the delivery quantity;
if yes, calculating the total storage capacity of each goods grid, sorting the storage devices according to the total storage capacity of the goods grids, and sorting the storage devices in the same goods grid according to the front-inner-rear sorting of the outer side; sequentially delivering the storage equipment out of the warehouse based on the sorting until the delivery quantity is met;
if not, the selected storage equipment is taken out of the warehouse and the warehouse-out quantity is deducted, and the storage equipment stored in the storage positions outside the two-depth roadway and the storage equipment stored in the single-depth roadway are determined in the unselected storage equipment so as to meet the deducted warehouse-out quantity; and calculating and sequencing the storage bit cost of the determined storage equipment, generating a set consisting of the storage quantities of the sequenced storage equipment, and sequentially accumulating the storage quantities in the set until the storage quantity of the storage equipment is met so as to determine the storage equipment for ex-warehouse.
5. The method of claim 1, wherein the corresponding storage device is ex-warehouse, further comprising:
acquiring position information of storage equipment for ex-warehouse, and if the position information is an inner storage position of a two-depth roadway and the outer side of the storage equipment is blocked by the storage equipment, performing derivative warehouse moving on the storage equipment for ex-warehouse;
and calculating the warehouse moving cost of each warehouse moving position which can be put in based on a preset warehouse moving cost model, and further moving the storage equipment at the outer side to the warehouse moving position which can be put in and has the minimum warehouse moving cost.
6. The method according to any one of claims 1 to 5, comprising:
receiving an ex-warehouse carrying task comprising at least one ex-warehouse task, and acquiring position information of article access equipment to determine a roadway where the article access equipment is located; if the state of the article access equipment is that the lane is being changed, acquiring the position information of a destination lane;
refreshing the information of the ex-warehouse storage equipment of each ex-warehouse task, acquiring the storage equipment needing ex-warehouse of the current wave number and the earlier wave number of the roadway, calculating the storage cost of the storage equipment, sequencing, and sequentially carrying through the article access equipment.
7. The method of claim 6, further comprising:
when the ex-warehouse carrying task is executed, a warehouse returning task or a warehouse entering task is received;
and pausing the ex-warehouse conveying task, executing the ex-warehouse conveying task or the in-warehouse task, restarting the ex-warehouse conveying task based on the roadway where the article access equipment is located and refreshing the sequence of the conveyed ex-warehouse storage equipment after the execution is finished.
8. An ex-warehouse device, comprising:
the receiving module is used for receiving the ex-warehouse tasks and acquiring the types and the ex-warehouse quantity of the articles to be ex-warehouse;
the processing module is used for judging whether the total storage quantity of the articles stored in the storage equipment corresponding to the types of the articles to be delivered from the roadway is larger than or equal to the delivery quantity according to the roadway where the article access equipment is located currently and the roadway which is contained in the currently existing same-wave-time or earlier-wave-time delivery tasks; judging whether a storage device combination with the storage capacity just equal to the ex-warehouse capacity exists or not based on a preset verification method, and if so, ex-warehouse the corresponding storage device; and if not, calculating the storage bit cost of the storage equipment and sequencing, generating a set formed by the storage quantities of the storage equipment after sequencing, and further sequentially accumulating the storage quantities in the set until the storage quantities meet the storage quantity to deliver the corresponding storage equipment out of the warehouse.
9. 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-7.
10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-7.
CN202011357684.2A 2020-11-27 2020-11-27 Warehouse-out method and device Pending CN113780916A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011357684.2A CN113780916A (en) 2020-11-27 2020-11-27 Warehouse-out method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011357684.2A CN113780916A (en) 2020-11-27 2020-11-27 Warehouse-out method and device

Publications (1)

Publication Number Publication Date
CN113780916A true CN113780916A (en) 2021-12-10

Family

ID=78835230

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011357684.2A Pending CN113780916A (en) 2020-11-27 2020-11-27 Warehouse-out method and device

Country Status (1)

Country Link
CN (1) CN113780916A (en)

Citations (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0558405A (en) * 1991-09-02 1993-03-09 Toshiba Corp Carrying-in and-out control device for automated warehouse
JPH0619937A (en) * 1992-06-30 1994-01-28 Taiyo Yuden Co Ltd Shipment managing device
US6799671B1 (en) * 1998-09-21 2004-10-05 Gines Sanchez Gomez Automatic warehouse
JP2005078562A (en) * 2003-09-03 2005-03-24 Seiko Epson Corp Order receiving device, commodity delivery device, ordered commodity delivery system, method therefor, and program
JP2008105827A (en) * 2006-10-27 2008-05-08 Aisin Seiki Co Ltd Automatic warehouse system
JP2009143668A (en) * 2007-12-13 2009-07-02 Itoki Corp Automated warehouse
CN201946033U (en) * 2011-01-07 2011-08-24 深圳市今天国际物流技术股份有限公司 Warehouse management system
CN104008475A (en) * 2014-06-20 2014-08-27 北京京东尚科信息技术有限公司 Commodity ex-warehouse method
JP2014205524A (en) * 2013-04-10 2014-10-30 株式会社ダイフク Article conveyance facility
CN107235276A (en) * 2017-06-05 2017-10-10 北京京东尚科信息技术有限公司 Goods method for carrying and device
CN108122082A (en) * 2016-11-29 2018-06-05 杭州海康机器人技术有限公司 A kind of warehouse-out method and device
CN108341204A (en) * 2018-01-08 2018-07-31 北京邮电大学 A kind of intelligent robot cargo that serving storehouse management goes out to be put in storage method and system
CN108502435A (en) * 2018-03-29 2018-09-07 南京极智嘉机器人有限公司 A kind of outbound distribution method and outbound distributor
CN109775219A (en) * 2019-03-11 2019-05-21 广东赛斐迩物流科技有限公司 A kind of tunnel blocking is automatic to move library method and the shifting library system using this method
CN109993470A (en) * 2017-12-29 2019-07-09 北京京东尚科信息技术有限公司 A kind of inventory's dispatching method and device
CN110197350A (en) * 2018-02-26 2019-09-03 北京京东尚科信息技术有限公司 A kind of article warehouse-out method and device
CN110223011A (en) * 2019-05-22 2019-09-10 杭州海仓科技有限公司 Intelligent storage equipment scheduling method, system, storage medium and electronic equipment
CN110615226A (en) * 2018-06-19 2019-12-27 北京京东振世信息技术有限公司 Storage bit allocation method, device and computer readable storage medium
US20200231382A1 (en) * 2019-01-22 2020-07-23 Everseen Limited Warehouse management system
CN111747008A (en) * 2019-03-28 2020-10-09 北京京东尚科信息技术有限公司 Warehouse-out positioning method, device and system
CN111860919A (en) * 2019-04-26 2020-10-30 北京京东尚科信息技术有限公司 Method, device, medium and electronic equipment for determining storage strategy of library shelf
CN111932163A (en) * 2019-05-13 2020-11-13 北京京东尚科信息技术有限公司 Method and device for warehouse-out positioning of multi-depth warehouse

Patent Citations (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0558405A (en) * 1991-09-02 1993-03-09 Toshiba Corp Carrying-in and-out control device for automated warehouse
JPH0619937A (en) * 1992-06-30 1994-01-28 Taiyo Yuden Co Ltd Shipment managing device
US6799671B1 (en) * 1998-09-21 2004-10-05 Gines Sanchez Gomez Automatic warehouse
JP2005078562A (en) * 2003-09-03 2005-03-24 Seiko Epson Corp Order receiving device, commodity delivery device, ordered commodity delivery system, method therefor, and program
JP2008105827A (en) * 2006-10-27 2008-05-08 Aisin Seiki Co Ltd Automatic warehouse system
JP2009143668A (en) * 2007-12-13 2009-07-02 Itoki Corp Automated warehouse
CN201946033U (en) * 2011-01-07 2011-08-24 深圳市今天国际物流技术股份有限公司 Warehouse management system
JP2014205524A (en) * 2013-04-10 2014-10-30 株式会社ダイフク Article conveyance facility
CN104008475A (en) * 2014-06-20 2014-08-27 北京京东尚科信息技术有限公司 Commodity ex-warehouse method
CN108122082A (en) * 2016-11-29 2018-06-05 杭州海康机器人技术有限公司 A kind of warehouse-out method and device
CN107235276A (en) * 2017-06-05 2017-10-10 北京京东尚科信息技术有限公司 Goods method for carrying and device
CN109993470A (en) * 2017-12-29 2019-07-09 北京京东尚科信息技术有限公司 A kind of inventory's dispatching method and device
CN108341204A (en) * 2018-01-08 2018-07-31 北京邮电大学 A kind of intelligent robot cargo that serving storehouse management goes out to be put in storage method and system
CN110197350A (en) * 2018-02-26 2019-09-03 北京京东尚科信息技术有限公司 A kind of article warehouse-out method and device
CN108502435A (en) * 2018-03-29 2018-09-07 南京极智嘉机器人有限公司 A kind of outbound distribution method and outbound distributor
CN110615226A (en) * 2018-06-19 2019-12-27 北京京东振世信息技术有限公司 Storage bit allocation method, device and computer readable storage medium
US20200231382A1 (en) * 2019-01-22 2020-07-23 Everseen Limited Warehouse management system
CN109775219A (en) * 2019-03-11 2019-05-21 广东赛斐迩物流科技有限公司 A kind of tunnel blocking is automatic to move library method and the shifting library system using this method
CN111747008A (en) * 2019-03-28 2020-10-09 北京京东尚科信息技术有限公司 Warehouse-out positioning method, device and system
CN111860919A (en) * 2019-04-26 2020-10-30 北京京东尚科信息技术有限公司 Method, device, medium and electronic equipment for determining storage strategy of library shelf
CN111932163A (en) * 2019-05-13 2020-11-13 北京京东尚科信息技术有限公司 Method and device for warehouse-out positioning of multi-depth warehouse
CN110223011A (en) * 2019-05-22 2019-09-10 杭州海仓科技有限公司 Intelligent storage equipment scheduling method, system, storage medium and electronic equipment

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
顾平;: "自动化立体仓库的优化研究", 科技展望, no. 06 *

Similar Documents

Publication Publication Date Title
US11544645B2 (en) Inventory scheduling method and device and non-transitory computer readable storage medium
CN109544054B (en) Inventory scheduling method, inventory scheduling device and computer-readable storage medium
CN110197350B (en) Article delivery method and device
CN109934520B (en) Shelf scheduling method and device
CN109118137A (en) A kind of order processing method, apparatus, server and storage medium
CN109840729B (en) Method and system for positioning bin, storage medium and electronic equipment
CN111589730B (en) Goods picking method, device, equipment and storage medium
CN114620387B (en) Empty unit container handling method and apparatus
CN109902975A (en) Dispatching method, system, device and computer readable storage medium
CN110826945A (en) Order combining method and device for automatic warehouse
CN111985860A (en) Task processing method and device
CN112232726A (en) Goods picking method, device, server and storage medium
CN113387102B (en) Cargo scheduling method, device, equipment, warehousing system and storage medium
CN111754152A (en) Goods shelf scheduling method and device for goods-to-person warehouse, electronic equipment and medium
CN113650997B (en) Article warehouse-out positioning method and device
CN112101831A (en) Goods delivery method, device, medium and electronic equipment
CN110689293A (en) Method and device for processing articles out of warehouse
CN111652407B (en) Task processing method, device, medium, electronic equipment and system in warehouse
CN110414879A (en) The method, apparatus and computer readable storage medium of multidomain treat-ment order
CN113159467B (en) Method and device for processing dispatch list
CN113759890A (en) Control method and device for transport device
CN112734316A (en) Inventory arrangement method and device
CN113780916A (en) Warehouse-out method and device
CN110826752A (en) Collection list distribution method and device
CN110378635A (en) A kind of schedule management method and device of transporting equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination