CN110348650B - Order converging method and device - Google Patents
Order converging method and device Download PDFInfo
- Publication number
- CN110348650B CN110348650B CN201810281954.2A CN201810281954A CN110348650B CN 110348650 B CN110348650 B CN 110348650B CN 201810281954 A CN201810281954 A CN 201810281954A CN 110348650 B CN110348650 B CN 110348650B
- Authority
- CN
- China
- Prior art keywords
- rechecking
- station
- collection
- warehouse
- list
- 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.)
- Active
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/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
-
- 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/083—Shipping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
Abstract
The invention discloses an order converging method and device, and relates to the technical field of computers. One embodiment of the method comprises: determining a set list set corresponding to the rechecking station according to the rechecking station identifier and the number of the turnover boxes to be allocated by the rechecking station, and determining a turnover box set corresponding to the rechecking station according to the set list set; issuing a warehouse task for each turnover box in the turnover box set; and conveying the turnover box to a rechecking table according to the ex-warehouse task so as to complete order confluence. The implementation mode can reduce the idle time of the rechecking table as much as possible, avoid the rechecking table from being in an idle state, and improve the order converging efficiency.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a method and a device for order confluence.
Background
With the explosive development of the logistics industry, the storage area requirement is gradually increased. Taking the e-commerce industry as an example, the development gradually goes from an early comprehensive product class bin to a single product class bin. The order picking personnel in the comprehensive goods class bin can solve the order distribution problem in a full-field picking mode. When the area of a single product bin is more than 10000 square meters, the picking efficiency is greatly reduced if cross-region orders are still solved by a whole-field picking mode. Therefore, an operation mode of performing order merging after sorting in a subarea is established. If the orders do not converge, the order splitting mode is selected, that is, the same order is split into a plurality of packages, so that the customer may sign for the packages in different time periods, and the customer experience is reduced. Therefore, order confluence after sorting in different areas is the best method for solving the current problems. Therefore, selecting a proper order converging technology has become one of the key points of warehousing operation.
At present, for order distribution in large warehouses, sorting is generally performed in each sorting subarea by taking a turnover box as a container, the turnover box is conveyed to a confluence area after sorting is completed, and after confluence is completed, review and packaging of a plurality of orders are performed, wherein the orders are generally sorted as an aggregate order to save sorting time. The confluence area may be generally divided into a temporary storage area for temporarily storing the sorted circulation boxes, and a conveying area generally provided with conveying equipment for conveying the sorted collection sheets to a review area for reviewing and packaging of multiple orders. In the prior art, when order confluence is performed, an integrated collection sheet is generally directly conveyed to a rechecking table through conveying equipment, and when the rechecking table is idle, one collection sheet is randomly acquired from the conveying equipment for rechecking and packaging.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
the existing order converging mode only allocates one collection sheet for each rechecking station every time, and new tasks are allocated after the rechecking station finishes processing, so that the time resources of the rechecking station cannot be fully utilized, and the efficiency is low.
Disclosure of Invention
In view of this, embodiments of the present invention provide an order converging method and apparatus, which can reduce idle time of a review station as much as possible, avoid that the review station is in an idle state, and improve order converging efficiency.
To achieve the above object, according to an aspect of an embodiment of the present invention, a method of order merging is provided.
A method of order aggregation, comprising: determining a set list set corresponding to the rechecking station according to the rechecking station identifier and the number of the turnover boxes to be allocated by the rechecking station, and determining a turnover box set corresponding to the rechecking station according to the set list set; issuing a warehouse task for each turnover box in the turnover box set; and conveying the turnover box to the rechecking table according to the ex-warehouse task so as to complete order confluence.
Optionally, before issuing a library task for each container in the container set, the method further includes: and determining that the outbound tasks which are the same as the rechecking stations corresponding to the turnover boxes but have different collection lists do not exist in the issued outbound tasks.
Optionally, the data corresponding to the ex-warehouse task is saved in a form of a queue, wherein after the warehouse task is sent, a turnover box identifier, a rechecking station identifier and a collection list identifier are mutually associated and added to the queue as a piece of data; and deleting the data from the queue after the turnover box arrives at the conveying equipment.
Optionally, it is detected whether a tote has arrived at the conveyor by mounting a registration sensor on the conveyor.
Optionally, determining, according to the review station identifier and the number of the totes to be allocated by the review station, a collection list set corresponding to the review station includes: searching whether the collection list which is not completely delivered out of the warehouse exists in the collection lists which are processed by the rechecking station according to the identification of the rechecking station; if the collection list does not completely go out of the warehouse, determining the collection list which is not completely gone out of the warehouse as the collection list corresponding to the review station, otherwise, determining one collection list as the collection list corresponding to the review station from the collection list which is not completely gone out of the warehouse; adding the determined collection list into a collection list set corresponding to the rechecking station and updating the number of the turnover boxes to be distributed by the rechecking station; judging whether the rechecking table is in a full load state, wherein the full load state is that the number of the turnover boxes of the rechecking table is larger than the lower limit value of the number of the turnover boxes which can be cached by the rechecking table; if the rechecking station is not in a full load state, the steps are repeatedly executed until the rechecking station reaches the full load state, and the collection list set when the rechecking station is in the full load state is used as the collection list set corresponding to the rechecking station.
Optionally, determining, from the collection sheets that are not completely ex-warehouse, that one collection sheet is the collection sheet corresponding to the review station includes: and calculating the cost value of each collection sheet which is not exported at all, and determining the collection sheet with the minimum cost value as the collection sheet corresponding to the review station.
Optionally, the updating the number of the circulation boxes to be allocated by the review station includes: determining the number of the distributable turnover boxes in the determined collection list according to the number of the turnover boxes to be distributed of the rechecking station and the number of the turnover boxes in the determined collection list; and updating the number of the circulation boxes to be distributed of the rechecking station according to the number of the distributable circulation boxes.
According to another aspect of the embodiments of the present invention, an apparatus for order merging is provided.
An apparatus for order aggregation, comprising: the data determining module is used for determining a set list set corresponding to the rechecking station according to the rechecking station identifier and the number of the turnover boxes to be allocated by the rechecking station, and determining a turnover box set corresponding to the rechecking station according to the set list set; the task issuing module is used for issuing a library task for each turnover box in the turnover box set; and the task execution module is used for conveying the turnover box to the rechecking table according to the ex-warehouse task so as to complete order confluence.
Optionally, the system further comprises a task anticipation module, configured to: before issuing a warehouse task for each turnover box in the turnover box set, determining that the issued warehouse task does not have the warehouse task which is the same as the rechecking platform corresponding to the turnover box but different from the set list.
Optionally, the data corresponding to the ex-warehouse task is saved in a form of a queue, wherein after the warehouse task is sent, a turnover box identifier, a rechecking station identifier and a collection list identifier are mutually associated and added to the queue as a piece of data; and deleting the data from the queue after the turnover box arrives at the conveying equipment.
Optionally, it is detected whether a tote has arrived at the conveyor by mounting a registration sensor on the conveyor.
Optionally, the data determination module is further configured to: searching whether the collection list which is not completely delivered out of the warehouse exists in the collection lists which are processed by the rechecking station according to the identification of the rechecking station; if the collection list does not completely go out of the warehouse, determining the collection list which is not completely gone out of the warehouse as the collection list corresponding to the review station, otherwise, determining one collection list as the collection list corresponding to the review station from the collection list which is not completely gone out of the warehouse; adding the determined collection list into a collection list set corresponding to the rechecking station and updating the number of the turnover boxes to be distributed by the rechecking station; judging whether the rechecking table is in a full load state, wherein the full load state is that the number of the turnover boxes of the rechecking table is larger than the lower limit value of the number of the turnover boxes which can be cached by the rechecking table; if the rechecking station is not in a full load state, the steps are repeatedly executed until the rechecking station reaches the full load state, and the collection list set when the rechecking station is in the full load state is used as the collection list set corresponding to the rechecking station.
Optionally, the data determination module is further configured to: when one collection sheet is determined to be the collection sheet corresponding to the review station from the collection sheets which are not completely exported, calculating the cost value of each collection sheet which is not completely exported, and determining the collection sheet with the minimum cost value as the collection sheet corresponding to the review station.
Optionally, the data determination module is further configured to: when the number of the circulation boxes to be distributed by the rechecking station is updated, determining the number of the distributable circulation boxes in the determined collection list according to the number of the circulation boxes to be distributed by the rechecking station and the number of the circulation boxes in the determined collection list; and updating the number of the circulation boxes to be distributed of the rechecking station according to the number of the distributable circulation boxes.
According to another aspect of the embodiment of the invention, an electronic device for order confluence is provided.
An electronic device for order aggregation, comprising: one or more processors; a storage device, configured to store one or more programs, which when executed by the one or more processors, cause the one or more processors to implement the method for order aggregation provided by the embodiments of the present invention.
According to yet another aspect of embodiments of the present invention, a computer-readable medium is provided.
A computer readable medium having stored thereon a computer program which, when executed by a processor, implements a method of order aggregation as provided by embodiments of the present invention.
One embodiment of the above invention has the following advantages or benefits: the method comprises the steps that a collection sheet set and a turnover box set corresponding to a rechecking station are determined according to rechecking station identifiers and the number of turnover boxes to be allocated by the rechecking station, then, warehouse-out tasks are issued for the determined turnover boxes and the turnover boxes are conveyed to the rechecking station, and the optimal collection sheets and the optimal turnover boxes can be allocated for the rechecking station according to the number of the turnover boxes required by the rechecking station, so that the idle time of the rechecking station can be reduced as much as possible, the rechecking station is prevented from being in an idle state, and the order converging efficiency is improved; before issuing the ex-warehouse tasks for the turnover box, the fact that the ex-warehouse tasks which are the same as the rechecking tables corresponding to the turnover box but have different collection lists do not exist in the issued ex-warehouse tasks is determined in advance, and therefore the situation that the collection lists which are conveyed to the same rechecking tables do not exist in each time can be guaranteed; the data corresponding to the ex-warehouse tasks are stored in the form of the queue, when the ex-warehouse tasks are issued, the data are added into the queue, when the ex-warehouse tasks are finished, the data are deleted from the queue, and the ordered conveying of the turnover boxes can be realized by utilizing the first-in first-out characteristic of the queue; the time that the turnover box arrives at the transportation equipment is detected in real time by adding the positioning sensor, so that whether the ex-warehouse tasks of the turnover boxes with different collection lists of the same purpose rechecking table can be better judged, a plurality of collection lists can be distributed to the rechecking table, and the situation that the different collection lists cannot be interspersed before arriving at the rechecking table is ensured.
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 a main flow of a method of order aggregation according to an embodiment of the invention;
FIG. 2 is a flow diagram of a method of order aggregation according to one embodiment of the invention;
FIG. 3 is a schematic diagram of the main modules of an order aggregation apparatus according to an embodiment of the present invention;
FIG. 4 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 5 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
In order to solve the defects in the prior art, the invention provides an order converging method which can accurately realize multi-channel operation and single-channel sorting and conveying, so that goods can reach a rechecking table as quickly as possible, the success of converging is ensured, and the efficiency of order converging is greatly improved.
In order to improve the efficiency of order confluence, the time of each review station can be fully utilized to reduce or avoid idle states of the review stations as much as possible. Therefore, a buffer area can be set for each review station to buffer the circulation boxes, the upper limit and the lower limit of the number of the circulation boxes can be set for the buffer area of the review station, and when the number of the circulation boxes reaches or is smaller than the lower limit, the request is triggered to distribute the collection list and the circulation boxes.
After receiving the request sent by the reviewing platform, the order converging system comprehensively considers multiple dimensions such as the number of the turnover boxes which can be distributed by the reviewing platform, the priority of the collection list, the number of the turnover boxes included in the collection list, the collection list collecting time and the like, selects the optimal collection list to be delivered out of the warehouse, and reduces the converging time as much as possible while ensuring the converging success rate.
After the collection sheets are collected in the temporary storage warehouse, all turnover boxes of the same collection sheet are conveyed to a rechecking table, in order to better realize order confluence and improve the efficiency of order confluence, different collection sheets distributed by the same rechecking table cannot be interspersed, and after one collection sheet is processed, the rechecking table processes another collection sheet. Therefore, the warehouse-out tasks of the turnover boxes corresponding to the collection lists can be queued, the warehouse-out task information of the turnover boxes is stored through the queues, the first-in first-out characteristic of the queues is utilized, the turnover boxes are orderly when entering the conveying equipment, and therefore the situation that different collection lists are interspersed can be avoided.
Along with the requirement of warehouse management system confluence, more and more confluence modes are generated. The invention utilizes a warehouse mainly composed of a multi-layer goods shelf, a shuttle and a front-end lifter as a temporary storage warehouse before order confluence, and the turnover boxes needing confluence after sorting are collected to a conveying line and enter the temporary storage warehouse. The turnover box can be temporarily stored in storage positions corresponding to multiple layers and multiple roadways in a conveying line shunting mode after entering the temporary storage warehouse. And after the turnover boxes of the collection list are collected, the turnover boxes are taken out from the storage positions, and finally the turnover boxes are conveyed to a rechecking area by taking a conveying main line as conveying equipment to complete order confluence. Before the turnover box is taken out of the warehouse from the storage position and placed on conveying equipment (a conveying main line), the turnover box can be conveyed to the conveying equipment by a shuttle and a lifting machine, and the turnover box can also be conveyed to the conveying equipment by conveying lines corresponding to each layer and each roadway of the temporary storage warehouse.
The following describes an implementation process of the order merging method according to the present invention with reference to a specific embodiment.
Fig. 1 is a schematic diagram of a main flow of a method of order confluence according to an embodiment of the present invention. As shown in fig. 1, the order merging method of the present invention mainly includes steps S101 to S103 as follows.
Step S101: and determining a set list set corresponding to the rechecking station according to the rechecking station identifier and the number of the turnover boxes to be allocated by the rechecking station, and determining a turnover box set corresponding to the rechecking station according to the set list set.
Each review station corresponds to a cache region (e.g., cache way), and there are multiple cache locations in the cache region for caching the turnaround. And when the number of the turnover boxes in the cache area reaches or is smaller than the lower limit value of the number of the turnover boxes capable of being cached, an order converging request is sent to the order converging system, so that the order converging system distributes the collection list and the turnover boxes for the review station. Therefore, the aim of reducing the idle time of the rechecking table as much as possible can be achieved, and the efficiency of order confluence is improved. In the introduction of the present invention, it is defined that the review station is in a full load state when the number of totes in the review station is greater than the lower limit value of the number of totes cacheable by the review station. Then, that is, when the review station does not reach the full load state, an order merge request is sent to the order merge system.
After receiving the order merge request from each review station, the order merge system determines the collection list and the circulation box to be allocated to the review station according to a predetermined rule. The order confluence request sent by the review station includes the identification of the review station (for example, the number of the review station) and the information such as the number of the turnover boxes to be allocated by the review station. Then, the order converging system determines a collection list set corresponding to the review station according to the review station identifier and the number of the turnover boxes to be allocated by the review station, and the specific process comprises the following steps:
searching whether the collection list which is not completely delivered out of the warehouse exists in the collection list which is processed by the rechecking station according to the identification of the rechecking station;
if the collection list exists, determining the collection list which is not completely delivered out of the warehouse as the collection list corresponding to the rechecking station, otherwise, determining one collection list from the collection lists which are not completely delivered out of the warehouse as the collection list corresponding to the rechecking station; adding the determined collection list into a collection list set corresponding to the rechecking station and updating the number of the turnover boxes to be distributed by the rechecking station;
judging whether the rechecking table is in a full load state, wherein the full load state means that the number of the turnover boxes of the rechecking table is greater than the lower limit value of the number of the turnover boxes which can be cached by the rechecking table;
if the rechecking station is not in a full load state, the steps are repeatedly executed until the rechecking station reaches the full load state, and the collection list set when the rechecking station is in the full load state is used as the collection list set corresponding to the rechecking station.
Wherein, determining one collection sheet from the collection sheets which are not delivered from the warehouse at all as the collection sheet corresponding to the review station comprises: and calculating the cost value of each collection sheet which is not exported at all, and determining the collection sheet with the minimum cost value as the collection sheet corresponding to the review station.
According to the embodiment of the present invention, updating the number of the circulation boxes to be allocated by the review station may specifically include:
determining the number of the distributable turnover boxes in the determined collection list according to the number of the turnover boxes to be distributed of the rechecking station and the number of the turnover boxes in the determined collection list;
and updating the number of the circulation boxes to be distributed of the rechecking station according to the number of the distributable circulation boxes.
Specifically, for each review station, the set list set to be assigned to that review station may be determined according to the following steps:
step S1: acquiring the number g of the circulation boxes to be allocated by the rechecking platform, wherein the number g of the circulation boxes to be allocated by the rechecking platform is the difference between the upper limit value of the number of the circulation boxes which can be cached by the rechecking platform and the number of the existing circulation boxes currently by the rechecking platform;
step S2: for the review station, the collection sheet to be allocated is determined according to the following rules:
1. if the collection sheets processed by the rechecking station have collection sheets which are not completely delivered, preferentially selecting the collection sheets which are not completely delivered to be allocated to the rechecking station, and then updating the number of the turnover boxes to be allocated according to the number g of the turnover boxes to be allocated by the rechecking station and the number h of the turnover boxes included in the collection sheets which are not completely delivered. If g is smaller than h, selecting the first g turnover boxes closest to the position of the rechecking table from the turnover boxes of the collection sheets which are not completely converged, distributing the turnover boxes to the rechecking table, and updating the number of the turnover boxes to be distributed of the rechecking table to be 0; otherwise, if g is greater than or equal to h, all the turnover boxes of the collection sheet which is not completely merged are allocated to the review station, and the number of the turnover boxes to be allocated of the review station is updated to (g-h), at this time, no collection sheet which is not completely ex-warehouse exists in the collection sheets processed by the review station, and the collection sheet to be allocated can be determined according to the rule in the following 2;
2. if there is no collection list that is not completely ex-warehouse in the collection lists processed by the review station, the collection list that meets the requirement can be selected by calculating the cost value of each collection list that is not completely ex-warehouse. Specifically, for each aggregated completely unsalted booklet (e.g., booklet J), its cost value is calculated by:
1) calculating the difference C between the number of the turnover boxes included in the collection list J and the number of the turnover boxes to be distributed by the rechecking table1：
C1＝λ1*|NUM(H)-NUM(J)|；
Wherein, NUM (H) is the number of the turnover boxes to be allocated by the rechecking platform, NUM (J) is the number of the turnover boxes included in the collection list J, and lambda1The weight is preset weight and is positive number, and flexible setting can be performed according to the requirement;
2) calculating the cross cost C of the collection sheet J and the selected collection sheet S2：
Wherein S belongs to D, D is a selected set list set, KJSRepresents the intersection of the Collection sheet J and the Collection sheet S, calculated by the number of bins, lambda2Is a preset weight and is a positive number, and can be flexibly set according to needs. Because the devices for transporting the turnover boxes such as shuttle cars and the like of each layer or each lane in the temporary storage warehouse of the sorted collection lists are limited, in order to improve the efficiency of order confluence, when the turnover boxes are output from the temporary storage warehouse, the turnover boxes which are output from the warehouse are positioned in different layers or different lanes as much as possible, so the intersection cost of the collection list J and the selected collection list S is considered;
3) calculating the time cost C of the Collection sheet J3：
C3＝λ3Time(J)，Time(J)＝dt-ds；
Where time (J) is the time cost factor of the Collection sheet J, dtRepresenting the difference between the time of taking the order (order cutoff time) and the current time, dsRepresents the difference between the current time and the collective time of the collective list J (i.e., the time for all the containers of the collective list J to reach the temporary storage), λ3The weight is preset weight and is positive number, and flexible setting can be performed according to the requirement;
4) calculate the total cost C of the aggregated sheet J:
C＝C1+C2+C3；
calculating the cost value of the collection sheet J according to the steps, and then selecting a collection sheet meeting the requirements, such as: the list of sets with the smallest cost value is selected. When selecting the aggregation sheets that satisfy the requirement, if the cost values of the multiple aggregation sheets are the same, one aggregation sheet may be arbitrarily selected, or the selection of the aggregation sheets may be performed according to a set rule, for example: if the cost of the collection list is the same, selecting the collection list with early list interception time; if the order cutting time is the same, selecting the collection order closest to the number of the turnover boxes requested by the rechecking station; if the number of the turnover boxes is the same, selecting the collection sheet with the earliest collection time; if the integration time is the same, a collection sheet is randomly selected, and the like. And then, adding the selected collection sheet into the collection sheet set D, and updating the number of the circulation boxes to be allocated by the review station. Then, after the collection sheet is allocated, whether the number of the circulation boxes in the cache area of the review station (i.e. the difference between the upper limit value of the number of the circulation boxes cacheable in the cache area of the review station and the number of the circulation boxes to be allocated by the review station) is greater than the lower limit value of the number of the circulation boxes cacheable by the review station is judged, if so, the review station is already in a full load state, the collection sheet allocation of the review station is completed, otherwise, the process in the above 2 is repeatedly executed until the review station reaches the full load state, and the collection sheet set D when the review station is in the full load state is used as the collection sheet set corresponding to the review station.
According to the content described in step S2, the present invention can allocate the collection sheet to the review station by comprehensively considering a plurality of factors such as the sheet cutting time, the number of turnover boxes, and the collecting time for each collection sheet. According to different use scenes, a user can flexibly set the weight values corresponding to all the factors.
After the set list set corresponding to the review station is determined, the turnover box set corresponding to the review station is also determined. If all the turnover boxes included in the determined collection list can be taken out of the warehouse, the turnover boxes corresponding to the rechecking platform are all the turnover boxes included in the determined collection list; and if all the turnover boxes included in the determined collection list cannot be taken out of the warehouse, the turnover boxes with the shorter distance are preferably taken out of the warehouse according to the distance between the position of each turnover box in the temporary storage warehouse and the conveying equipment.
In addition, when the invention is specifically executed, after receiving the order merging request sent by each review station, the order merging system may also sort the review stations, and then determine the collection list and the turnover box to be allocated to each review station according to a predetermined rule. When the review stations are sorted, the emergency degree of the order can be used as a first priority, the time of receiving the request is used as a second priority, the number of the review stations is used as a third priority, and the like, so that the review stations are sorted, and the collection list and the turnover box are distributed to the review stations in sequence.
Step S102: and issuing library tasks for each turnover box in the turnover box set. And after the collection list and the turnover box corresponding to the rechecking platform are determined, the ex-warehouse task of the turnover box can be issued. Thereafter, step S103 may be performed.
Step S103: and conveying the turnover box to a rechecking table according to the ex-warehouse task so as to complete order confluence.
Before issuing the ex-warehouse tasks for each turnover box, it is further required to determine that the ex-warehouse tasks which are the same as the rechecking station corresponding to the turnover box but have different collection lists do not exist in the issued ex-warehouse tasks. When the issued ex-warehouse tasks include ex-warehouse tasks which are the same as the rechecking table corresponding to the turnover box but different from the collection list, the fact that the rechecking table corresponding to the turnover box has other collection lists which do not reach the conveying equipment is indicated. If the ex-warehouse task of the turnover box is issued at this time, the situation that different sets are interspersed in the same rechecking station may occur.
In the embodiment of the invention, data corresponding to the warehouse-out task is stored in a queue form, wherein after the warehouse task is sent out, a turnover box identifier, a rechecking station identifier and a collection list identifier are mutually associated and added into the queue as a piece of data; when the tote arrives at the transport facility, the data is removed from the queue.
Specifically, the delivery process of issuing the warehouse tasks and transporting the containers may be as follows:
(1) initializing a queue A for storing data corresponding to issued but unfinished ex-warehouse tasks;
(2) after the collection list and the turnover box which are delivered out of the warehouse are determined, whether data with the number i of the rechecking station exist in the task queue A or not is judged according to the collection list number j where the turnover box c is located and the rechecking station number i to which the turnover box arrives, if the data do not exist, the turnover box which is not conveyed to the rechecking station i does not exist, and the delivery task of the turnover box c can be directly issued; if the circulation box exists, the circulation box to be conveyed to the rechecking table i exists, at the moment, whether a collection list number of the circulation box is j needs to be judged, if so, whether the ex-warehouse task of another circulation box d with the collection list number of j and the to-be-arrived rechecking table number of i exists in the task queue A is judged, at the moment, the ex-warehouse task of the circulation box c can be directly issued, otherwise, the circulation box of the last collection list to be arrived at the rechecking table i does not arrive at the conveying equipment completely, at the moment, the ex-warehouse task of the circulation box c cannot be issued, whether the issuing condition is met or not is judged again after a period of time (such as 1 second or 2 seconds, and the specific time length can be flexibly set according to requirements) is set, and the circulation box is issued after the issuing condition is met;
(3) when a turnover box warehouse-out task is issued, a set single number j, a rechecking station number i and a turnover box number c are associated to be used as a piece of data and added into a queue A, and the added data is key value pair data in a (key: i, value: j, c) form;
(4) after the container c arrives at the positioning sensor of the conveyor, the key value pair data (key: i, value: j, c) is deleted from queue A. According to the invention, the positioning sensor is arranged on the conveying equipment to detect whether the turnover box reaches the conveying equipment, and the mounting position of the positioning sensor is generally the inlet of the conveying equipment, so that whether the turnover box reaches the conveying equipment can be detected as early as possible;
(5) and conveying the turnover box to a rechecking table by the conveying equipment, and finishing the ex-warehouse task.
According to an embodiment of the present invention, the positioning sensor is, for example, a Barcode scan recognizer bcr (Barcode reader), and the origin and walking position of the apparatus can be determined by reading Barcode Data. Similarly, any other positioning sensor that can detect the position information of the object may be used. According to the technical scheme of the invention, the positioning sensor is arranged at the inlet of the conveying equipment, so that the time of the turnover boxes reaching the positioning sensor is transmitted back in real time, and after all the turnover boxes of one collection list pass through the scanning points of the positioning sensor, the warehouse-out tasks of other collection lists are issued, so that the sequence of the same collection list reaching the rechecking table can be ensured, and other collection lists cannot be inserted into the same collection list. Therefore, a plurality of collection lists can be distributed for one review station at the same time, and different collection lists cannot be interspersed before reaching the review station, so that the confluence efficiency is improved, and meanwhile, the success of confluence is ensured.
The flow of order aggregation according to an embodiment of the present invention is described below with reference to fig. 2. FIG. 2 is a flow diagram of a method of order aggregation in accordance with one embodiment of the present invention. As shown in fig. 2, after receiving an order confluence request sent by a review station, first, determining whether there is an incomplete ex-warehouse collection list in the collection lists processed by the review station according to the identifier of the review station; if yes, the unfinished aggregation list is preferentially distributed to the rechecking station; otherwise, according to the number of the circulation boxes to be allocated by the rechecking station, selecting a collection sheet from the collection sheets which are not taken out of the warehouse completely to allocate the collection sheet to the rechecking station. After the collection list is distributed to the review stations, the circulation boxes corresponding to the review stations are determined according to the collection list so as to issue library tasks for the circulation boxes. Before issuing an ex-warehouse task for a certain turnover box, firstly judging whether data corresponding to the ex-warehouse task which has the same rechecking platform and different collection sheet numbers with the turnover box exist in a queue, if so, not issuing the ex-warehouse task of the turnover box, and after a period of time (such as 1 second or 2 seconds), judging whether an issuing condition is met again; otherwise, directly issuing the ex-warehouse task of the turnover box, adding the data corresponding to the ex-warehouse task into the queue, deleting the data corresponding to the ex-warehouse task from the queue after the positioning sensor detects that the turnover box reaches the conveying equipment, and ending the ex-warehouse task.
Fig. 3 is a schematic diagram of main blocks of an order merge apparatus according to an embodiment of the present invention. As shown in fig. 3, the order converging apparatus 300 according to the embodiment of the present invention mainly includes a data determining module 301, a task issuing module 302, and a task executing module 303.
The data determining module 301 is configured to determine a set list set corresponding to the review station according to the review station identifier and the number of the turnover boxes to be allocated by the review station, and determine a turnover box set corresponding to the review station according to the set list set;
the task issuing module 302 is configured to issue a library task for each turnover box in the turnover box set;
the task execution module 303 is configured to convey the turnover box to the review station according to the ex-warehouse task to complete order confluence.
According to an embodiment of the present invention, the order confluence apparatus 300 may further include a task anticipation module (not shown in the figure) for:
before issuing the warehouse tasks for each turnover box in the turnover box set, determining that the issued warehouse tasks do not have the warehouse tasks which are the same as the rechecking platform corresponding to the turnover box but different from the set list.
In the invention, data corresponding to the warehouse-out task is stored in a queue form, wherein after the warehouse task is sent out, a turnover box identifier, a rechecking station identifier and a collection list identifier are mutually associated and added into the queue as a piece of data; when the tote arrives at the transport facility, the data is removed from the queue.
According to the technical scheme of the invention, whether the turnover box reaches the conveying equipment can be detected by installing the positioning sensor on the conveying equipment.
In addition, the data determination module 301 may be further configured to:
searching whether the collection list which is not completely delivered out of the warehouse exists in the collection list which is processed by the rechecking station according to the identification of the rechecking station;
if the collection list exists, determining the collection list which is not completely delivered out of the warehouse as the collection list corresponding to the rechecking station, otherwise, determining one collection list from the collection lists which are not completely delivered out of the warehouse as the collection list corresponding to the rechecking station; adding the determined collection list into a collection list set corresponding to the rechecking station and updating the number of the turnover boxes to be distributed by the rechecking station;
judging whether the rechecking platform is in a full load state, wherein the full load state is that the number of the turnover boxes of the rechecking platform is greater than the lower limit value of the number of the turnover boxes which can be cached by the rechecking platform;
if the rechecking station is not in a full load state, the steps are repeatedly executed until the rechecking station reaches the full load state, and the collection list set when the rechecking station is in the full load state is used as the collection list set corresponding to the rechecking station.
Specifically, the data determination module 301 may be further configured to: when one collection list is determined to be the collection list corresponding to the checking platform from the collection lists which are not completely exported, the cost value of each collection list which is not completely exported is calculated, and the collection list with the minimum cost value is determined to be the collection list corresponding to the checking platform.
Specifically, the data determination module 301 may be further configured to: when the number of the circulation boxes to be distributed by the rechecking station is updated, determining the number of the distributable circulation boxes in the determined collection list according to the number of the circulation boxes to be distributed by the rechecking station and the number of the circulation boxes in the determined collection list; and updating the number of the circulation boxes to be distributed of the rechecking station according to the number of the distributable circulation boxes.
According to the technical scheme of the embodiment of the invention, the collection sheet set and the turnover box set corresponding to the rechecking station are determined according to the rechecking station identifier and the number of the turnover boxes to be allocated by the rechecking station, then, the library tasks are issued for the determined turnover boxes and the turnover boxes are conveyed to the rechecking station, so that the optimal collection sheet and the optimal turnover boxes can be allocated for the rechecking station according to the number of the turnover boxes required by the rechecking station, the idle time of the rechecking station can be reduced as much as possible, the rechecking station is prevented from being in an idle state, and the order converging efficiency is improved; before issuing the ex-warehouse tasks for the turnover box, the fact that the ex-warehouse tasks which are the same as the rechecking tables corresponding to the turnover box but have different collection lists do not exist in the issued ex-warehouse tasks is determined in advance, and therefore the situation that the collection lists which are conveyed to the same rechecking tables do not exist in each time can be guaranteed; the data corresponding to the ex-warehouse tasks are stored in the form of the queue, when the ex-warehouse tasks are issued, the data are added into the queue, when the ex-warehouse tasks are finished, the data are deleted from the queue, and the ordered conveying of the turnover boxes can be realized by utilizing the first-in first-out characteristic of the queue; the time that the turnover box arrives at the transportation equipment is detected in real time by adding the positioning sensor, so that whether the ex-warehouse tasks of the turnover boxes with different collection lists of the same purpose rechecking table can be better judged, a plurality of collection lists can be distributed to the rechecking table, and the situation that the different collection lists cannot be interspersed before arriving at the rechecking table is ensured.
FIG. 4 illustrates an exemplary system architecture 400 of a method or apparatus for order aggregation to which embodiments of the present invention may be applied.
As shown in fig. 4, the system architecture 400 may include terminal devices 401, 402, 403, a network 404, and a server 405. The network 404 serves as a medium for providing communication links between the terminal devices 401, 402, 403 and the server 405. Network 404 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use terminal devices 401, 402, 403 to interact with a server 405 over a network 404 to receive or send messages or the like. The terminal devices 401, 402, 403 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The terminal devices 401, 402, 403 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 405 may be a server providing various services, such as a background management server (for example only) providing support for shopping websites browsed by users using the terminal devices 401, 402, 403. The backend management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (for example, target push information, product information — just an example) to the terminal device.
It should be noted that the method for order aggregation provided in the embodiment of the present invention is generally executed by the server 405, and accordingly, the apparatus for order aggregation is generally disposed in the server 405.
It should be understood that the number of terminal devices, networks, and servers in fig. 4 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 5, a block diagram of a computer system 500 suitable for use with a terminal device or server implementing an embodiment of the invention is shown. The terminal device or the server shown in fig. 5 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. 5, the computer system 500 includes a Central Processing Unit (CPU)501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data necessary for the operation of the system 500 are also stored. The CPU 501, ROM 502, and RAM 503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 501.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present invention may be implemented by software, or may be implemented by hardware. The described units or modules may also be provided in a processor, and may be described as: a processor comprises a data determining module, a task issuing module and a task executing module. For example, the data determining module may be further described as "a module configured to determine a collection list set corresponding to the review station according to the review station identifier and the number of the totes to be allocated to the review station, and determine a tote set corresponding to the review station according to the collection list set".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: determining a set list set corresponding to the rechecking station according to the rechecking station identifier and the number of the turnover boxes to be allocated by the rechecking station, and determining a turnover box set corresponding to the rechecking station according to the set list set; issuing a warehouse task for each turnover box in the turnover box set; and conveying the turnover box to the rechecking table according to the ex-warehouse task so as to complete order confluence.
According to the technical scheme of the embodiment of the invention, the collection sheet set and the turnover box set corresponding to the rechecking station are determined according to the rechecking station identifier and the number of the turnover boxes to be allocated by the rechecking station, then, the library tasks are issued for the determined turnover boxes and the turnover boxes are conveyed to the rechecking station, so that the optimal collection sheet and the optimal turnover boxes can be allocated for the rechecking station according to the number of the turnover boxes required by the rechecking station, the idle time of the rechecking station can be reduced as much as possible, the rechecking station is prevented from being in an idle state, and the order converging efficiency is improved; before issuing the ex-warehouse tasks for the turnover box, the fact that the ex-warehouse tasks which are the same as the rechecking tables corresponding to the turnover box but have different collection lists do not exist in the issued ex-warehouse tasks is determined in advance, and therefore the situation that the collection lists which are conveyed to the same rechecking tables do not exist in each time can be guaranteed; the data corresponding to the ex-warehouse tasks are stored in the form of the queue, when the ex-warehouse tasks are issued, the data are added into the queue, when the ex-warehouse tasks are finished, the data are deleted from the queue, and the ordered conveying of the turnover boxes can be realized by utilizing the first-in first-out characteristic of the queue; the time that the turnover box arrives at the transportation equipment is detected in real time by adding the positioning sensor, so that whether the ex-warehouse tasks of the turnover boxes with different collection lists of the same purpose rechecking table can be better judged, a plurality of collection lists can be distributed to the rechecking table, and the situation that the different collection lists cannot be interspersed before arriving at the rechecking table is ensured.
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 (16)
1. A method of order aggregation, comprising:
determining a set list set corresponding to the rechecking station according to the rechecking station identifier and the number of the turnover boxes to be allocated by the rechecking station, and determining a turnover box set corresponding to the rechecking station according to the set list set;
issuing a warehouse task for each turnover box in the turnover box set;
conveying the turnover box to the rechecking table according to the ex-warehouse task to complete order confluence;
determining a set list set corresponding to the review station according to the review station identifier and the number of the turnover boxes to be allocated by the review station comprises: searching whether the collection list which is not completely delivered out of the warehouse exists in the collection lists which are processed by the rechecking station according to the identification of the rechecking station; if the collection list does not completely go out of the warehouse, determining the collection list which is not completely gone out of the warehouse as the collection list corresponding to the review station, otherwise, determining one collection list as the collection list corresponding to the review station from the collection list which is not completely gone out of the warehouse.
2. The method of claim 1, further comprising, prior to issuing a library task for each tote in the set of totes:
and determining that the outbound tasks which are the same as the rechecking stations corresponding to the turnover boxes but have different collection lists do not exist in the issued outbound tasks.
3. The method of claim 1, wherein the data corresponding to the outbound task is maintained in the form of a queue,
after the warehouse-out task is issued, the turnover box identifier, the rechecking station identifier and the collection list identifier are mutually associated and added into a queue as a piece of data;
and deleting the data from the queue after the turnover box arrives at the conveying equipment.
4. A method according to claim 3, characterized in that it is detected whether a container has reached the conveyor by mounting a positioning sensor on the conveyor.
5. The method according to claim 1, wherein determining the set list set corresponding to the review station according to the review station identifier and the number of the totes to be allocated by the review station further comprises:
adding the determined collection list into a collection list set corresponding to the rechecking station and updating the number of the turnover boxes to be distributed by the rechecking station;
judging whether the rechecking table is in a full load state, wherein the full load state is that the number of the turnover boxes of the rechecking table is larger than the lower limit value of the number of the turnover boxes which can be cached by the rechecking table;
if the rechecking station is not in a full load state, the steps are repeatedly executed until the rechecking station reaches the full load state, and the collection list set when the rechecking station is in the full load state is used as the collection list set corresponding to the rechecking station.
6. The method of claim 5, wherein determining one of the lists that is not completely ex-warehouse as the list corresponding to the review station comprises:
and calculating the cost value of each collection sheet which is not exported at all, and determining the collection sheet with the minimum cost value as the collection sheet corresponding to the review station.
7. The method of claim 5, wherein updating the number of turnaround cases to be allocated by the review station comprises:
determining the number of the distributable turnover boxes in the determined collection list according to the number of the turnover boxes to be distributed of the rechecking station and the number of the turnover boxes in the determined collection list;
and updating the number of the circulation boxes to be distributed of the rechecking station according to the number of the distributable circulation boxes.
8. An apparatus for merging orders, comprising:
the data determining module is used for determining a set list set corresponding to the rechecking station according to the rechecking station identifier and the number of the turnover boxes to be allocated by the rechecking station, and determining a turnover box set corresponding to the rechecking station according to the set list set;
the task issuing module is used for issuing a library task for each turnover box in the turnover box set;
the task execution module is used for conveying the turnover box to the rechecking table according to the ex-warehouse task so as to complete order confluence;
the data determination module is further to: determining a set list set corresponding to the review station according to the review station identifier and the number of the turnover boxes to be allocated by the review station comprises: searching whether the collection list which is not completely delivered out of the warehouse exists in the collection lists which are processed by the rechecking station according to the identification of the rechecking station; if the collection list does not completely go out of the warehouse, determining the collection list which is not completely gone out of the warehouse as the collection list corresponding to the review station, otherwise, determining one collection list as the collection list corresponding to the review station from the collection list which is not completely gone out of the warehouse.
9. The apparatus of claim 8, further comprising a task anticipation module to:
before issuing a warehouse task for each turnover box in the turnover box set, determining that the issued warehouse task does not have the warehouse task which is the same as the rechecking platform corresponding to the turnover box but different from the set list.
10. The apparatus of claim 8, wherein the data corresponding to the outbound task is stored in a queue, wherein,
after the warehouse-out task is issued, the turnover box identifier, the rechecking station identifier and the collection list identifier are mutually associated and added into a queue as a piece of data;
and deleting the data from the queue after the turnover box arrives at the conveying equipment.
11. The apparatus according to claim 10, characterized in that it detects whether a container has reached the conveyor by mounting a positioning sensor on the conveyor.
12. The apparatus of claim 8, wherein the data determination module is further configured to:
adding the determined collection list into a collection list set corresponding to the rechecking station and updating the number of the turnover boxes to be distributed by the rechecking station;
judging whether the rechecking table is in a full load state, wherein the full load state is that the number of the turnover boxes of the rechecking table is larger than the lower limit value of the number of the turnover boxes which can be cached by the rechecking table;
if the rechecking station is not in a full load state, the steps are repeatedly executed until the rechecking station reaches the full load state, and the collection list set when the rechecking station is in the full load state is used as the collection list set corresponding to the rechecking station.
13. The apparatus of claim 12, wherein the data determination module is further configured to:
when one collection sheet is determined to be the collection sheet corresponding to the review station from the collection sheets which are not completely exported, calculating the cost value of each collection sheet which is not completely exported, and determining the collection sheet with the minimum cost value as the collection sheet corresponding to the review station.
14. The apparatus of claim 12, wherein the data determination module is further configured to:
when the number of the circulation boxes to be distributed by the rechecking station is updated, determining the number of the distributable circulation boxes in the determined collection list according to the number of the circulation boxes to be distributed by the rechecking station and the number of the circulation boxes in the determined collection list;
and updating the number of the circulation boxes to be distributed of the rechecking station according to the number of the distributable circulation boxes.
15. An electronic device for order aggregation, 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.
16. 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.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810281954.2A CN110348650B (en) | 2018-04-02 | 2018-04-02 | Order converging method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810281954.2A CN110348650B (en) | 2018-04-02 | 2018-04-02 | Order converging method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110348650A CN110348650A (en) | 2019-10-18 |
| CN110348650B true CN110348650B (en) | 2022-04-26 |
Family
ID=68172505
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810281954.2A Active CN110348650B (en) | 2018-04-02 | 2018-04-02 | Order converging method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110348650B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111762483A (en) * | 2019-10-22 | 2020-10-13 | 北京沃东天骏信息技术有限公司 | Confluence method and device for goods picking container |
| CN112950105A (en) * | 2019-12-11 | 2021-06-11 | 北京京东乾石科技有限公司 | Confluence production method and system, unmanned storehouse and computer readable storage medium |
| CN113762853B (en) * | 2020-11-17 | 2024-05-24 | 北京京东振世信息技术有限公司 | Method, device and system for distributing articles, electronic equipment and storage medium |
| CN113762856B (en) * | 2020-11-24 | 2024-06-18 | 北京京东乾石科技有限公司 | Exit management method and device |
| CN113083695B (en) * | 2021-04-06 | 2022-12-02 | 北京京东振世信息技术有限公司 | Goods information rechecking method, device, equipment and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012171826A2 (en) * | 2011-06-15 | 2012-12-20 | SSI Schäfer PEEM GmbH | Distribution warehouse and method for arranging different articles in an order-oriented manner by means of a reduced buffer |
| CN102999830A (en) * | 2012-11-28 | 2013-03-27 | 北京京东世纪贸易有限公司 | Confluence method and confluence device in warehousing operation |
| CN104574011A (en) * | 2014-12-22 | 2015-04-29 | 北京京东尚科信息技术有限公司 | Order producing method and device as well as warehouse management system |
| EP3182348A1 (en) * | 2015-12-17 | 2017-06-21 | Dematic Systems GmbH | Method of order fulfilling by making storage units available from a storage facility in a desired sequence at a picking station |
| CN106934748A (en) * | 2015-12-29 | 2017-07-07 | 天士力制药集团股份有限公司 | A kind of automatic medicine-dispensing allocator |
| CN106934580A (en) * | 2017-03-21 | 2017-07-07 | 北京京东尚科信息技术有限公司 | Method for inventory control and device |
| CN106980949A (en) * | 2017-03-22 | 2017-07-25 | 湖北九州通达科技开发有限公司 | The scattered commodity of Medical Logistics check sorting method and system |
-
2018
- 2018-04-02 CN CN201810281954.2A patent/CN110348650B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012171826A2 (en) * | 2011-06-15 | 2012-12-20 | SSI Schäfer PEEM GmbH | Distribution warehouse and method for arranging different articles in an order-oriented manner by means of a reduced buffer |
| CN102999830A (en) * | 2012-11-28 | 2013-03-27 | 北京京东世纪贸易有限公司 | Confluence method and confluence device in warehousing operation |
| CN104574011A (en) * | 2014-12-22 | 2015-04-29 | 北京京东尚科信息技术有限公司 | Order producing method and device as well as warehouse management system |
| EP3182348A1 (en) * | 2015-12-17 | 2017-06-21 | Dematic Systems GmbH | Method of order fulfilling by making storage units available from a storage facility in a desired sequence at a picking station |
| CN106934748A (en) * | 2015-12-29 | 2017-07-07 | 天士力制药集团股份有限公司 | A kind of automatic medicine-dispensing allocator |
| CN106934580A (en) * | 2017-03-21 | 2017-07-07 | 北京京东尚科信息技术有限公司 | Method for inventory control and device |
| CN106980949A (en) * | 2017-03-22 | 2017-07-25 | 湖北九州通达科技开发有限公司 | The scattered commodity of Medical Logistics check sorting method and system |
Non-Patent Citations (3)
| Title |
|---|
| Item assignment optimiza-tion for automated sortation system with double picking zones;ZHANG等;《Chinese Journal of Mechanical Engineering》;20091231;全文 * |
| 自动分拣系统并行分区拣选优化策略;卢少平等;《深圳大学学报(理工版)》;20100131;全文 * |
| 配送中心分拣订单合批策略的研究;王艳艳等;《山东大学学报(工学版)》;20100416;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110348650A (en) | 2019-10-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110348650B (en) | Order converging method and device | |
| CN107235276B (en) | Cargo method for carrying and device | |
| CN110866709B (en) | Method and device for merging orders | |
| CN110533353B (en) | Method and device for handling shelves | |
| CN110371548B (en) | Goods warehousing method and device | |
| CN111553548B (en) | Goods picking method and device | |
| CN110348771B (en) | Method and device for order grouping of orders | |
| CN110182530B (en) | Warehouse management method and device | |
| CN111507651A (en) | Order data processing method and device applied to man-machine mixed warehouse | |
| CN110304385B (en) | Warehouse racking method and device | |
| CN111260240A (en) | Task allocation method and device | |
| CN110807612A (en) | Method and device for determining residual capacity | |
| CN110871980B (en) | Storage classification method and device | |
| CN113393193A (en) | Warehouse-out method and device | |
| CN111832980A (en) | Method and device for allocating storage positions of multi-layer warehouse | |
| CN110689293A (en) | Method and device for processing articles out of warehouse | |
| CN113759890A (en) | Control method and device for transport device | |
| CN110555642A (en) | Method and device for determining route starting point | |
| CN110826752A (en) | Collection list distribution method and device | |
| CN112801569B (en) | Article sorting method and device | |
| CN113650997B (en) | Article warehouse-out positioning method and device | |
| CN112441364B (en) | Container warehouse-in or warehouse-back method and device for automatic warehouse | |
| CN113391899B (en) | Method and device for allocating cache ways | |
| CN112446565A (en) | Method and device for matching vehicles for orders | |
| CN112520282B (en) | Dispatching method and device for goods to be transported |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |