CN113222203A - Collection list generation method and device, computer system and readable storage medium - Google Patents

Collection list generation method and device, computer system and readable storage medium Download PDF

Info

Publication number
CN113222203A
CN113222203A CN202010080438.0A CN202010080438A CN113222203A CN 113222203 A CN113222203 A CN 113222203A CN 202010080438 A CN202010080438 A CN 202010080438A CN 113222203 A CN113222203 A CN 113222203A
Authority
CN
China
Prior art keywords
order
orders
positioning information
added
information set
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
CN202010080438.0A
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 Zhenshi Information Technology Co Ltd
Original Assignee
Beijing Jingdong Zhenshi Information 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 Zhenshi Information Technology Co Ltd filed Critical Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority to CN202010080438.0A priority Critical patent/CN113222203A/en
Publication of CN113222203A publication Critical patent/CN113222203A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • 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)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Marketing (AREA)
  • Tourism & Hospitality (AREA)
  • Development Economics (AREA)
  • Theoretical Computer Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Game Theory and Decision Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The present disclosure provides a method of generating a collection sheet performed by an electronic device, including: acquiring a positioning information set of each order in a plurality of orders, wherein the positioning information set of each order comprises positioning information of commodities in the order in a warehouse; determining a target order from the plurality of orders as a first order in the collection list; according to the positioning information set of the target order and the positioning information sets of other orders except the target order in the plurality of orders, determining orders which are the same as or similar to the positioning information of the target order from the other orders; and adding orders which are the same as or similar to the positioning information of the target orders into the collection list. The present disclosure also provides an aggregation sheet generation apparatus executed by an electronic device, a computer system, and a computer-readable storage medium.

Description

Collection list generation method and device, computer system and readable storage medium
Technical Field
The present disclosure relates to the field of warehouse logistics, and more particularly, to a method for generating an aggregate sheet executed by an electronic device, an apparatus for generating an aggregate sheet executed by an electronic device, a computer system, and a computer-readable storage medium.
Background
Order picking operations are one of the major workflow processes in logistics centers, requiring the order to be reasonably batched before customer orders are picked. Order batching generally requires the combination of orders into a collection sheet, and current group collection strategies typically include random or identical types of orders for the items. Or, the similar commodities are manually placed in the collection sheet as much as possible, the saturation of the collection sheet obtained by the method is low, and the overall picking difficulty is increased.
In implementing the disclosed concept, the inventors found that there are at least the following problems in the related art: the order processing efficiency cannot be improved well by adopting a random order combination or a mode of combining orders with the same commodity type to obtain a collection list, and the phenomenon of repeatedly searching for storage positions can be more generated.
Disclosure of Invention
In view of the above, the present disclosure provides a method of generating a receipt performed by an electronic device, an apparatus of generating a receipt performed by an electronic device, a computer system, and a computer-readable storage medium.
One aspect of the present disclosure provides a method of generating a collection sheet performed by an electronic device, including: acquiring a positioning information set of each order in a plurality of orders, wherein the positioning information set of each order comprises positioning information of commodities in the order in a warehouse; determining a target order from the plurality of orders as a first order in a collection; according to the positioning information set of the target order and the positioning information sets of other orders except the target order in the plurality of orders, determining orders which are the same as or similar to the positioning information of the target order from the other orders; and adding the order which is the same as or similar to the positioning information of the target order into the collection list.
According to an embodiment of the present disclosure, determining the target order from the plurality of orders as a first order of the aggregated list comprises: determining the number of the storage areas involved in each order; sorting the number of the storage areas related to each order to obtain a sorting result; and determining the order with the largest reserve quantity or the smallest reserve quantity as the target order according to the sorting result.
According to an embodiment of the present disclosure, the determining, from the other orders, the orders that are the same as or similar to the location information of the target order includes: determining whether the storage information sets of the other orders are contained in the storage information set of the target order; determining the order of which the storage area information set is contained in the storage area information set of the target order as the order which is the same as or similar to the positioning information of the target order under the condition that the storage area information sets of the other orders are contained in the storage area information set of the target order; or determining whether the lane information set of the other order is contained in the lane information set of the target order; and under the condition that the tunnel information sets of other orders are contained in the tunnel information set of the target order, determining the order of which the tunnel information set is contained in the tunnel information set of the target order as the order which is the same as or similar to the positioning information of the target order.
According to an embodiment of the present disclosure, the method further comprises: before adding the order which is the same as or similar to the positioning information of the target order into the collection sheet, judging whether the sum of the number of the orders which are the same as or similar to the positioning information of the target order and the number of the target order is larger than a preset number upper limit of the orders in the collection sheet; and adding the order which is the same as or similar to the positioning information of the target order into the collection sheet under the condition that the order is less than or equal to the preset number upper limit of the orders in the collection sheet.
According to an embodiment of the present disclosure, the method further comprises: after the orders which are the same as or similar to the positioning information of the target orders are added into the collection list, determining the rest orders which are not added into the collection list in the plurality of orders; determining current positioning information of the collection list, wherein the current positioning information of the collection list comprises a current storage area information set and a roadway information set; according to the positioning information of each order in the remaining orders and the current positioning information of the collection list, calculating the number of newly added storage areas or the number of newly added roadways required by the current collection list for adding each order in the remaining orders into the current collection list; and adding the order which is not added and has the minimum quantity of newly-increased storage areas or roadways required by the current collection list into the current collection list.
According to an embodiment of the present disclosure, the method further comprises: before adding the non-added orders into the current collection list, judging whether the quantity in the current collection list is greater than the preset quantity upper limit or not after the non-added orders are added into the current collection list; adding the non-added order into the current collection list under the condition that the quantity in the current collection list is less than or equal to the preset quantity upper limit after the non-added order is added into the current collection list; determining a newly added storage area combination or roadway combination required by the current collection sheet under the condition that the quantity in the current collection sheet is greater than the preset quantity upper limit after the non-added order is added into the current collection sheet; determining the number of orders which are not added into the orders and contain the same newly added storage area combination or roadway combination required by the current collection list; determining the picking difficulty increment of the collection list after the newly added storage area combination or the roadway combination of the current collection list is determined; calculating the ratio of the quantity of the orders which are not added and contain the same newly added storage area combination or roadway combination required by the current collection sheet to the picking difficulty increment of the collection sheet; and adding the orders which are not added into the orders and correspond to the ratio into the current collection list according to the sequence from large to small of the ratio until the number of the orders in the current collection list reaches the preset number upper limit.
According to an embodiment of the present disclosure, the method further comprises: calculating the picking difficulty increment of the aggregated sheet after each order which is the same as or similar to the positioning information of the target order is added into the aggregated sheet under the condition that the picking difficulty increment is larger than the preset quantity upper limit of the orders in the aggregated sheet; sorting the picking difficulty increment of the collection sheet; and adding corresponding orders into the collection sheet according to the sorting of the picking difficulty increment of the collection sheet from small to large until the number of the orders in the collection sheet reaches the preset number upper limit.
Another aspect of the present disclosure provides an apparatus for generating a collection sheet executed by an electronic device, including: the system comprises an acquisition module, a storage module and a processing module, wherein the acquisition module is used for acquiring a positioning information set of each order in a plurality of orders, and the positioning information set of each order comprises positioning information of commodities in the order in a warehouse; the first determining module is used for determining a target order from the orders as a first order in the collection list; a second determining module, configured to determine, according to the positioning information set of the target order and the positioning information sets of other orders in the plurality of orders except the target order, an order that is the same as or similar to the positioning information of the target order from the other orders; and the adding module is used for adding the orders which are the same as or similar to the positioning information of the target orders into the collection sheet.
According to an embodiment of the disclosure, the first determining module is configured to: determining the number of the storage areas involved in each order; sorting the number of the storage areas related to each order to obtain a sorting result; and determining the order with the largest reserve quantity or the smallest reserve quantity as the target order according to the sorting result.
According to an embodiment of the present disclosure, the positioning information set includes at least a storage area information set and a roadway information set, and the second determining module is configured to: determining whether the storage information sets of the other orders are contained in the storage information set of the target order; determining the order of which the storage area information set is contained in the storage area information set of the target order as the order which is the same as or similar to the positioning information of the target order under the condition that the storage area information sets of the other orders are contained in the storage area information set of the target order; or determining whether the lane information set of the other order is contained in the lane information set of the target order; and under the condition that the tunnel information sets of other orders are contained in the tunnel information set of the target order, determining the order of which the tunnel information set is contained in the tunnel information set of the target order as the order which is the same as or similar to the positioning information of the target order.
According to an embodiment of the present disclosure, the apparatus further comprises: a judging module, configured to judge whether the sum of the number of the orders that are the same as or similar to the location information of the target order and the number of the target order is greater than a predetermined upper limit of the number of the orders in the aggregate before adding the order that is the same as or similar to the location information of the target order into the aggregate; and the adding module is used for adding the order which is the same as or similar to the positioning information of the target order into the collection sheet under the condition that the order is less than or equal to the preset quantity upper limit of the orders in the collection sheet.
According to an embodiment of the present disclosure, the apparatus further comprises: a third determining module, configured to determine, after the order that is the same as or similar to the location information of the target order is added to the aggregate, remaining orders that are not added to the aggregate among the multiple orders; a fourth determining module, configured to determine current location information of the collection sheet, where the current location information of the collection sheet includes a current storage area information set and a roadway information set; the first calculation module is used for calculating the number of newly added storage areas or the number of newly added roadways required by the current collection list by adding each order in the remaining orders into the current collection list according to the positioning information of each order in the remaining orders and the current positioning information of the collection list; the adding module is used for adding the order which is not added and has the minimum quantity of newly added storage areas or roadways required by the current collection list into the current collection list.
According to an embodiment of the present disclosure, the apparatus further comprises: the judging module is further configured to, before adding the unaddressed order to the current aggregate, judge whether the number in the current aggregate is greater than the predetermined number upper limit after assuming that the unaddressed order is added to the current aggregate; the adding module is further configured to add the non-added order to the current aggregate sheet when the number in the current aggregate sheet is less than or equal to the predetermined number upper limit after the non-added order is added to the current aggregate sheet; the fifth determining module is configured to determine, after it is determined that the order which is not added is added to the current aggregate sheet, a newly added storage area combination or roadway combination required by the current aggregate sheet under the condition that the number in the current aggregate sheet is greater than the predetermined number upper limit; the sixth determining module is configured to determine the number of orders, which include the same newly added storage area combination or tunnel combination required by the current aggregate order, in the unaddressed orders; the seventh determining module is used for determining the picking difficulty increment of the collection list after the current collection list increases the storage area combination or the roadway combination; the first calculation module is used for calculating the ratio of the quantity of the orders which are not added into the orders and contain the same newly added storage area combination or roadway combination required by the current collection sheet to the picking difficulty increment of the collection sheet; and the adding module is further configured to add the order corresponding to the ratio in the orders that are not added to the current aggregate list according to the sequence from large to small of the ratio until the number of orders in the current aggregate list reaches the predetermined number upper limit.
According to an embodiment of the present disclosure, the apparatus further comprises: the second calculation module is used for calculating the picking difficulty increment of the aggregated sheet after each order which is the same as or similar to the positioning information of the target order is added into the aggregated sheet under the condition that the picking difficulty increment is larger than the preset quantity upper limit of the orders in the aggregated sheet; the sorting module is used for sorting the picking difficulty increment of the collection sheet; and the adding module is used for adding the corresponding orders into the collection sheet according to the sorting of the order picking difficulty increment of the collection sheet from small to large until the order quantity in the collection sheet reaches the preset quantity upper limit.
Another aspect of the present disclosure provides a computer system comprising: one or more processors; memory for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method as described above.
Another aspect of the present disclosure provides a computer-readable storage medium storing computer-executable instructions for implementing the method as described above when executed.
Another aspect of the disclosure provides a computer program comprising computer executable instructions for implementing the method as described above when executed.
According to the embodiment of the disclosure, the positioning information of the commodities in the orders in the warehouse can be determined by obtaining the positioning information set of each order, before the collection sheet is grouped, the target order is determined as the first order in the collection sheet, and then a proper order is determined from other orders and added into the collection sheet according to the positioning information set of the target order and the positioning information sets of other orders. Therefore, on one hand, a proper target order is determined as the first order in the collection list, rather than randomly determining the first order, so that the efficiency of the subsequent group collection list can be improved; on the other hand, the same or similar orders added into the collective order are determined by concentrating the same or similar positioning information according to the positioning information of different orders, so that the technical problem of low order processing efficiency caused by more repeated searching of storage positions in the related technology is at least partially solved, and the technical effects of better improving the order processing efficiency and reducing the repeated searching of the storage positions are further achieved.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:
FIG. 1 schematically illustrates an exemplary system architecture to which the method and apparatus for aggregate sheet generation may be applied, according to an embodiment of the present disclosure;
FIG. 2 schematically illustrates a flow chart of a collection sheet generation method performed by an electronic device, in accordance with an embodiment of the present disclosure;
FIG. 3 schematically illustrates a schematic diagram of a warehouse distribution, according to an embodiment of the present disclosure;
FIG. 4 schematically illustrates a flow chart for determining an order from other orders that is the same as or similar to the location information of the target order, according to an embodiment of the present disclosure;
FIG. 5 schematically illustrates a flow diagram for adding orders to a collection sheet, according to an embodiment of the disclosure;
FIG. 6 schematically illustrates a flow diagram for adding orders to a collection sheet according to another embodiment of the present disclosure;
FIG. 7 schematically illustrates a block diagram of an aggregated sheet generation apparatus performed by an electronic device, in accordance with an embodiment of the present disclosure; and
FIG. 8 schematically illustrates a block diagram of a computer system suitable for implementing the above-described method, according to an embodiment of the present disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). Where a convention analogous to "A, B or at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B or C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
Order picking operation is one of main operation processes of the logistics center, picking operation cost occupies most of operation cost of the logistics center, and improving picking efficiency is one of effective ways for reducing picking cost of the logistics center. Before customer orders are picked, the orders need to be reasonably batched, each batch of orders form an aggregate order and are simultaneously finished in one picking process, so that the picking time can be remarkably saved, the goods picking efficiency is improved, and the goods picking cost of a logistics center is reduced.
The order collection is to collect a plurality of orders into a batch to carry out batch sorting operation, and the purpose is to shorten the distance and time of average walking and carrying when a picker sorts orders. If the same commodity type in each batch of orders is collected and picked, then the commodities are classified to each customer order to form batch picking, so that the average walking and carrying distance during picking is shortened, the time for repeatedly searching for the storage position is shortened, and the picking efficiency can be improved.
Technical terms and explanations related to the present disclosure according to the embodiments of the present disclosure are as follows.
Collection list: the order collection of picking is generated according to a certain order quantity, the order picker starts to pick the order after taking the order collection, and the order picker sends the orders to a packing place to be packed after picking the orders.
A channel: the goods picking device is characterized in that a walking channel is arranged between one row of storage positions and the other row of storage positions, and a goods picker picks goods through the walking channel.
Storing the position: refers to a location on a shelf in a warehouse where goods are stored.
Storing a cabinet: the storage rack is a vertical storage rack and generally has a plurality of layers, and each layer is a storage position.
Reservoir path: the optimal path of a plurality of storage areas is referred, and the optimal path can be input in advance due to the small number of the storage areas.
Roadway path: the optimal path of a plurality of roadways in the same storage area is usually the optimal path in an order from small to large according to the length of the path.
A bit storage path: refers to a plurality of storage bit paths of the same roadway in the same storage area.
Covering: means that an order is said to be overwritten if all the storage areas of the order are contained in a collection of storage areas of the order.
An embodiment of the present disclosure provides a method for generating a collection sheet performed by an electronic device, including: acquiring a positioning information set of each order in a plurality of orders, wherein the positioning information set of each order comprises positioning information of commodities in the order in a warehouse; determining a target order from the plurality of orders as a first order in the collection list; according to the positioning information set of the target order and the positioning information sets of other orders except the target order in the plurality of orders, determining orders which are the same as or similar to the positioning information of the target order from the other orders; and adding orders which are the same as or similar to the positioning information of the target orders into the collection list. The present disclosure also provides an aggregation sheet generation apparatus executed by an electronic device, a computer system, and a computer-readable storage medium.
Fig. 1 schematically illustrates an exemplary system architecture to which the method and apparatus for generating a collection sheet may be applied, according to an embodiment of the present disclosure. It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.
As shown in fig. 1, the system architecture 100 according to this embodiment may include terminal devices 101, 102, 103, a network 104 and a server 105. The network 104 serves as a medium for providing communication links between the terminal devices 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired and/or wireless communication links, and so forth.
The user may use the terminal devices 101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. The terminal devices 101, 102, 103 may have installed thereon various communication client applications, such as a shopping-like application, a web browser application, a search-like application, an instant messaging tool, a mailbox client, and/or social platform software, etc. (by way of example only).
The terminal devices 101, 102, 103 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.
According to the embodiment of the disclosure, after the user places an order in the shopping application through the terminal devices 101, 102, 103, the order is generated, and then the shopping application can feed back the order information to the server 105. A large number of orders may be included in the server 105.
The server 105 may be a server providing various services, such as a background management server (for example only) providing support for websites browsed by users using the terminal devices 101, 102, 103. The background management server may analyze and perform other processing on the received data such as the user request, and feed back a processing result (e.g., a webpage, information, or data obtained or generated according to the user request) to the terminal device.
The number of servers 105 is not limited, and may include a plurality of servers, and the method provided by the present disclosure is performed in a server cluster manner.
It should be noted that the method for generating the collection sheet provided by the embodiment of the present disclosure may be generally executed by the server 105. Accordingly, the collection list generating apparatus provided by the embodiment of the present disclosure may be generally disposed in the server 105. The method for generating the collection list provided by the embodiment of the present disclosure may also be performed by a server or a server cluster different from the server 105 and capable of communicating with the terminal devices 101, 102, 103 and/or the server 105. Accordingly, the collection list generating apparatus provided by the embodiment of the present disclosure may also be disposed in a server or a server cluster different from the server 105 and capable of communicating with the terminal devices 101, 102, 103 and/or the server 105. Alternatively, the method for generating the aggregated sheet provided by the embodiment of the present disclosure may also be executed by the terminal device 101, 102, or 103, or may also be executed by another terminal device different from the terminal device 101, 102, or 103. Accordingly, the aggregate sheet generation apparatus provided by the embodiment of the present disclosure may also be disposed in the terminal device 101, 102, or 103, or in another terminal device different from the terminal device 101, 102, or 103.
For example, the plurality of orders to be combined may originally be stored in any one of the terminal apparatuses 101, 102, or 103 (e.g., the terminal apparatus 101, but not limited thereto), or may be stored on an external storage apparatus and may be imported into the terminal apparatus 101. Then, the terminal device 101 may locally execute the aggregate sheet generation method provided by the embodiment of the present disclosure, or send the multiple orders to be combined to another terminal device, server, or server cluster, and execute the aggregate sheet generation method provided by the embodiment of the present disclosure by another terminal device, server, or server cluster that receives the multiple orders to be combined.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Fig. 2 schematically shows a flow chart of a collection sheet generation method performed by an electronic device according to an embodiment of the present disclosure.
As shown in fig. 2, the method includes operations S210 to S240.
In operation S210, a positioning information set of each order in a plurality of orders is obtained, wherein the positioning information set of each order includes positioning information of a commodity in the order in a warehouse.
According to the embodiment of the disclosure, the positioning information of the goods in the warehouse may include, for example, information of a storage area, a roadway, a storage position, and the like. One order may include one or more items.
According to embodiments of the present disclosure, the positioning information set for each order may include a storage area information set, a roadway information set, and a storage location information set. The storage area information set comprises storage areas where all commodities in the same order are located; the roadway information set comprises roadways where all commodities in the same order are located; the storage position information set comprises storage positions of all commodities in the same order.
Fig. 3 schematically illustrates a schematic diagram of a warehouse distribution according to an embodiment of the disclosure.
As shown in figure 3, the warehouse comprises a storage area A and a storage area B, wherein the storage area A comprises roadways 1-4, and the storage area B comprises roadways 5-8. Two sides of each roadway can comprise two rows of goods shelves, and the goods shelves are provided with storage positions for storing goods. It should be noted that the number of the storage areas, the lanes, and the storage locations in the warehouse is only illustrative, and the number of the storage areas, the lanes, and the storage locations in the warehouse is not limited.
In operation S220, a target order is determined from the plurality of orders as a first order in the aggregated list.
According to an embodiment of the present disclosure, the order with the largest or smallest number of reserves may be determined as the target order. For example, in order 1-10, where all items in order 1 are in storage A and the remaining orders include more than 2 orders, then one storage may be involved as the first order in the aggregate. According to the embodiment of the present disclosure, orders that are identical to the storage area or the tunnel may also be determined as target orders.
According to the embodiment of the disclosure, the number of storage areas involved by each order can be determined first, then the number of storage areas involved by each order is ranked to obtain a ranking result, and the order with the largest number of storage areas or the smallest number of storage areas is determined as the target order according to the ranking result.
In operation S230, an order that is the same as or similar to the location information of the target order is determined from the other orders according to the location information set of the target order and the location information sets of the other orders of the plurality of orders except the target order.
According to an embodiment of the present disclosure, for example, the set of location information for the target order includes storage a, lane a1, and lane a 2; the positioning information set of one order in the other orders comprises a storage area A, a lane A1 and a lane A3; the location information set for another order includes storage a, lane a 1. Since the orders both include storage area a and lane a1, the two orders can be considered similar to the target order.
In operation S240, an order identical or similar to the location information of the target order is added to the collection sheet.
Fig. 4 schematically illustrates a flowchart for determining an order from other orders that is the same as or similar to the location information of the target order according to an embodiment of the present disclosure.
As shown in fig. 4, the method includes operations S231 to S232.
In operation S231, it is determined whether the storage information sets of other orders are included in the storage information set of the target order.
In operation S232, in a case where the storage area information sets of other orders are included in the storage area information set of the target order, the order whose storage area information set is included in the storage area information set of the target order is determined as the order identical or similar to the location information of the target order.
According to the embodiment of the disclosure, alternatively, it may also be determined whether the lane information set of another order is included in the lane information set of the target order, and in a case that the lane information set of another order is included in the lane information set of the target order, the order in which the lane information set is included in the lane information set of the target order is determined to be the order that is the same as or similar to the location information of the target order.
According to the embodiment of the disclosure, the positioning information of the commodities in the orders in the warehouse can be determined by obtaining the positioning information set of each order, before the collection sheet is grouped, the target order is determined as the first order in the collection sheet, and then a proper order is determined from other orders and added into the collection sheet according to the positioning information set of the target order and the positioning information sets of other orders. Therefore, on one hand, a proper target order is determined as the first order in the collection list, rather than randomly determining the first order, so that the efficiency of the subsequent group collection list can be improved; on the other hand, the same or similar orders added into the collection list can be determined by concentrating the same or similar positioning information according to the positioning information of different orders, so that the technical problem of low order processing efficiency caused by more repeated searching for storage positions in the related technology is at least partially solved, and the technical effects of better improving the order processing efficiency and reducing the repeated searching for storage positions are further achieved.
According to the embodiment of the disclosure, before adding the order which is the same as or similar to the positioning information of the target order into the collection sheet, it may be determined whether the number of orders which is the same as or similar to the positioning information of the target order plus the number of the target order is greater than the upper limit of the predetermined number of orders in the collection sheet, and in the case of being less than or equal to the upper limit of the predetermined number of orders in the collection sheet, the order which is the same as or similar to the positioning information of the target order is added into the collection sheet.
According to an embodiment of the present disclosure, for example, there are currently 100 orders for the group aggregate, the number of storage areas involved in each order is sorted, and the order with the smallest number of storage areas is determined as the target order. If the number of orders that are the same as or similar to the location information of the target order is 15, and the predetermined number upper limit is set to 17 when the predetermined number upper limit of orders in the aggregated sheet is set, then 15+1 is 16 less than the predetermined number upper limit 17, and the 16 orders may be added to the aggregated sheet. If the number of orders that are the same as or similar to the location information of the target order is 20, and the predetermined number upper limit is set to 17 when the predetermined number upper limit of orders in the aggregated sheet is set, then 20+1 is greater than the predetermined number upper limit 17, and the 20 orders cannot be directly added to the aggregated sheet. If the number of orders that are the same or similar to the location information of the target order plus the number of target orders is greater than the predetermined number upper limit for orders in the aggregate order, the processing method will be further explained in other embodiments of the present disclosure.
The method shown in fig. 2 is further described with reference to fig. 5-6 in conjunction with specific embodiments.
FIG. 5 schematically illustrates a flow diagram for adding orders to a collection sheet according to an embodiment of the disclosure.
As shown in fig. 5, the method includes operations S510 to S530.
In operation S510, if the order quantity equal to or similar to the location information of the target order plus the quantity of the target order is greater than the predetermined quantity upper limit of the orders in the aggregated sheet, the picking difficulty increase amount of the aggregated sheet after adding each order equal to or similar to the location information of the target order to the aggregated sheet is calculated.
According to the embodiment of the disclosure, after each order is added into the collection sheet, the picking difficulty of the collection sheet after one order is added is calculated, and the picking difficulty increment of the collection sheet can be obtained by subtracting the original picking difficulty of the collection sheet from the picking difficulty of the collection sheet after one order is added.
According to the embodiment of the disclosure, after each order is added into the collection sheet, the picking difficulty increment of the corresponding collection sheet can be respectively calculated.
In operation S520, the picking difficulty increase amounts of the collection orders are sorted.
In operation S530, the corresponding orders are added to the aggregated sheets according to the sorting difficulty increment of the aggregated sheets from small to large, until the number of orders in the aggregated sheets reaches the upper limit of the predetermined number.
According to the embodiment of the disclosure, orders with small picking difficulty increment can be added into the collection sheet firstly, and for orders with large picking difficulty increment, the orders are not added into the collection sheet when the number of the orders in the collection sheet reaches the upper limit of the preset number. Thereby reducing the picking difficulty of the collection sheet and improving the picking efficiency.
In order to clearly illustrate the process of calculating the picking difficulty and the picking difficulty increment according to the embodiment of the present disclosure, the parameters related to the present disclosure will be defined below.
N: the number of orders; n isj: the quantity of the item in order j.
Aj: a pool set of orders j; SAi: storage area of collection list iAnd (4) collecting.
Bj，k: collecting the order j in the roadway of the storage area k; SB (bus bar)i，k: and (4) collecting the single i in the lane collection of the storage area k.
Cj，k，q: a storage position set of the order j in a roadway q of the storage area k; SC (Single chip computer)i，k，q: and the set unit i is a storage bit set of the lane q of the storage area k.
Si: the order collection of the collection sheet i has m collection sheets, and each collection sheet has at most r orders and u commodities.
w1，W2，w3: the storage area difficulty coefficient, the roadway difficulty coefficient and the storage position difficulty coefficient are respectively.
For the storage area information set, the roadway information set and the storage position information set of the collection list, the storage area information set of the collection list is defined as the storage area covered by all orders in the collection list, namely SAi＝∑j∈iAjAll the storage areas of the collection list i are represented and are a union of the storage areas of all the orders of the collection list i; in the same way, SBi，k＝∑j∈iBj，k，SCi，k，q＝∑j∈iCj，k，qThe sum number here indicates the meaning of the summation.
For a collection of orders, the total picking difficulty for all collections is:
Figure BDA0002379864520000151
wherein the absolute value number represents the length of the shortest path.
And (3) constraint: for each composed collection sheet SiThen the upper bound is:
Figure BDA0002379864520000152
the picking difficulty for each collection order, according to the preceding notation, for any one collection order i, the picking difficulty for collection order i is defined as:
Figure BDA0002379864520000153
the picking difficulty for each order, as represented by the preceding notation, for any one order j, the picking difficulty for order j is defined as:
Figure BDA0002379864520000154
FIG. 6 schematically illustrates a flow diagram for adding orders to a collection sheet according to another embodiment of the disclosure.
As shown in fig. 6, the method includes operations S610 to S640.
In operation S610, after adding orders that are the same as or similar to the location information of the target order to the aggregated sheet, remaining orders of the plurality of orders that are not added to the aggregated sheet are determined.
For example, the orders are orders 1-10, the order collection includes target order 4, the orders 1-3 are the same as or similar to the target order 4, the orders 1-3 are added to the order collection, and the remaining orders not added to the order collection are orders 5-10.
In operation S620, current location information of the collection list is determined, wherein the current location information of the collection list includes a current storage area information set and a lane information set.
According to the embodiment of the disclosure, the current positioning information of the collection list comprises positioning information of orders 1-4. For example, the storage information set and the roadway information set of the orders 1-4.
In operation S630, the number of newly added storage areas or the number of lanes required to add each of the remaining orders to the current aggregate order is calculated according to the location information of each of the remaining orders and the current location information of the aggregate order.
In operation S640, the order that is not added and needs the newly increased number of storage areas or the number of lanes is added to the current aggregate.
According to an embodiment of the present disclosure, before adding an order not added to the current aggregate, it is determined whether the number in the current aggregate is greater than a predetermined number upper limit assuming that the order not added is added to the current aggregate.
And adding the non-added orders into the current collection sheet under the condition that the quantity in the current collection sheet is less than or equal to the preset quantity upper limit after the non-added orders are added into the current collection sheet.
According to the embodiment of the disclosure, under the condition that the number in the current aggregate order is greater than the upper limit of the preset number after the assumption that the order which is not added is added into the current aggregate order is judged, the newly added storage area combination or roadway combination required by the current aggregate order is determined.
For example, if the order 1 is not added to the pool of storage areas a and B, the order 2 is not added to the pool of storage areas a, B, and C, the order 3 is not added to the pool of storage areas a and E, and the current aggregate list is only related to the pool of storage areas a, then the newly added storage areas required for the current aggregate list are combined into the pool of storage areas B and C.
And determining the number of the orders which are not added and contain the newly added storage area combination or roadway combination required by the same current collection list.
For example, the newly added storage area combination required by the current collection list is storage area B, the orders not added to the order and including storage area B are order 1 and order 2, and the number is 2.
And determining the picking difficulty increment of the collection list after the newly added storage area combination or the roadway combination of the current collection list is determined.
And calculating the ratio of the quantity of the orders which are not added into the orders and contain the same newly added storage area combination or roadway combination required by the current collection sheet to the picking difficulty increment of the collection sheet.
And adding orders which are not added into the orders and correspond to the ratio into the current collection list according to the sequence from large to small of the ratio until the number of the orders in the current collection list reaches a preset number upper limit.
The method for generating the collection sheet provided by the present disclosure will be further described with reference to examples.
The first step is as follows: let i be 1, and Q be an unassigned order list, initialized to the resulting sorted order list.
The second step is that: initializing the ith order as the first order Q [1 ] in the ordered order list]I.e. Si＝[Q[1]]The order is deleted from Q.
The third step: and calculating a storage area information set of the ith collection list, a roadway information set of each storage area and the storage bit number of each roadway under each storage area.
The fourth step: let k equal to 1, candidate set
Figure BDA0002379864520000171
The fifth step: for the kth order of Q [ k ]]If the order Q [ k ]]All the storage areas are in the collection sheet SiIn the reservoir of (2), then Q [ k ] is set]Added to the candidate set Cal. Let k be k + 1.
And a sixth step: and repeating the step five until the Q is traversed.
The seventh step: for the candidate set Cal, if all additions are less than the upper limit of the collection list, all additions are added to the collection list SiIn the step (1), updating Q and entering the tenth step; otherwise, entering the eighth step.
Eighth step: and calculating the difficulty increment of the collection sheet after each order in the candidate set Cal is added into the collection sheet (the difficulty increment is equal to the picking difficulty obtained after the order is added into the collection sheet minus the picking difficulty of the original collection sheet or minus the picking difficulty of the order), and sorting the orders from small to large.
The ninth step: and adding the orders of each ordered candidate set one by one, updating Q until the requirement of the upper limit of the set list is not met, and entering a tenth step.
The tenth step: and calculating the number of the added storage areas required by each order added into the Q, and recording the minimum number of the storage areas as x.
The eleventh step: and for each storage area combination Y with the increased storage area number of x, calculating the ratio of the number of the remaining orders which can be covered after each combination Y is added to the picking difficulty increase amount after the combination Y is increased.
The twelfth step: and adding the storage area combination with the maximum ratio of the number of covered residual orders to the picking difficulty increasing amount into the storage area of the collection list, and entering the fifth step.
The thirteenth step: i is i + 1; go to the second step until Q is empty.
The method for generating the collection sheet provided by the present disclosure will be further described with reference to 10 orders and their location information in table 1.
TABLE 1
Order 1 SKU1 Reservoir A Roadway A1 Reservoir A101 Number 3
Order 1 SKU2 Reservoir B Roadway B3 Bit B311 Number 1
Order 2 SKU3 Reservoir A Roadway A1 Reservoir A103 Number 2
Order 2 SKU4 Reservoir A Roadway A3 Reservoir A301 Number 3
Order 3 SKU5 Reservoir A Roadway A1 Reservoir A104 Number 3
Order 4 SKU6 Reservoir C Laneway C2 Reservoir C202 Number 3
Order 5 SKU7 Reservoir B Roadway B4 Storage bit B431 Number 1
Order 6 SKU1 Reservoir A Roadway A1 Reservoir A101 Number 2
Order 7 SKU2 Reservoir B Roadway B3 Reservoir A311 Number 3
Order 8 SKU3 Reservoir A Roadway A1 Reservoir A103 Number 3
Order 9 SKU1 Reservoir A Roadway A1 Reservoir A101 Number 3
Order 10 SKU1 Reservoir A Roadway A1 Reservoir A101 Number 3
According to the formula, a storage area information set of each order, a roadway information set of each storage area and a storage position information set of each roadway can be obtained. The upper limit of the collection list is that the order number is not more than 3, and the commodity number is not more than 12.
All orders are first sorted, for example, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, noted as Q.
First, the first order of Q is taken out as a new collection list, and the storage area set of the collection list is { A, B }. And a roadway set under each storage area and a storage position set of each roadway can also be obtained. In this case, Q is [2, 3, 4, 5, 6, 7, 8, 9, 10 ].
And traversing Q, judging whether the storage area set of each order is contained in { A, B }, and if so, adding a candidate set cal to obtain a new candidate set cal. It can be seen that cal is [2, 3, 4, 5, 6, 7, 8, 9, 10 ].
And calculating the picking difficulty increased after the orders of each candidate set are added into the collection sheet because all candidate sets are added to exceed the upper limit. The picking difficulty is ranked from small to large, for example, after the picking difficulty is ranked from small to large, the ranking result is cal ═ 2, 3, 4, 5, 6, 7, 8, 9, 10.
At this point cal is added to the aggregate sheets one by one until the upper limit requirement is not met. The upper limit is reached here after only 2 and 3 have been added.
At this time, the next new collection list may be created as [4], and the storage area set of the collection list is { C }. Q order list [5, 6, 7, 8, 9, 10 ]. Since the pool set for the Q order is not contained in { C }, adding each order adds a pool. The number of added reserves after each order is added is calculated, and x is 1.
By adding the storage area combination { A }, the number of orders covered at the time can be calculated to be 4, the increased storage area difficulty is w1 | { A, C } | -w1 | { C } |, and the ratio can be calculated by dividing the number of orders by the increased storage area difficulty.
And adding the reservoir combination { B }, and obtaining the ratio in the same way.
Assuming that the combination of { A } in the ratios is larger. The bin { A } may be added to the bin of the aggregate sheet, i.e., the bin set of the aggregate sheet is updated to { A, C }. The same can get the candidate set {6, 8, 9, 10}, and so on until reaching the upper limit of the collection list.
Through the embodiment of the disclosure, the collection sheet is generated by adopting the mode, the processing efficiency of the collection sheet can be improved, the picking path is shortened, and the beneficial effects are obvious.
According to the embodiment of the disclosure, before the positioning information set of each order in a plurality of orders is acquired, whether the data contained in the order meets the algorithm format requirement can be judged. For example, each item in the order has information on the quantity, storage area, lane, storage location, etc. According to embodiments of the present disclosure, orders that have been processed (which are used after the orders are grouped) may be deleted from the database.
According to the embodiment of the disclosure, orders which have been formed into the collection list output last time and are used by the user can be pre-screened. This is because in a run, if the algorithm mode is fast output, it is likely that not all orders are in one collection, at which time some of the orders are in a collection and others are not processed. If the output orders are not processed, these unused orders may still be re-assembled the next time the order is processed.
Through the embodiment of the disclosure, the order progress can be flexibly processed, and if the order is already formed and picked, the order can be deleted periodically or automatically by the system. If the order data has problems, the data processing module can be used for automatically processing the order data. The output group collection sheet result can also analyze the information of the storage area number, the picking difficulty, the order number, the commodity number and the like of each collection sheet.
Fig. 7 schematically shows a block diagram of an aggregation sheet generation apparatus performed by an electronic device according to an embodiment of the present disclosure.
As shown in fig. 7, the collection sheet generating apparatus 700 executed by the electronic device includes an obtaining module 710, a first determining module 720, a second determining module 730, and an adding module 740.
The obtaining module 710 is configured to obtain a positioning information set of each order in a plurality of orders, where the positioning information set of each order includes positioning information of a commodity in the order in a warehouse.
The first determining module 720 is configured to determine the target order from the plurality of orders as a first order in the collection.
The second determining module 730 is configured to determine an order that is the same as or similar to the location information of the target order from the other orders according to the location information set of the target order and the location information sets of the other orders of the plurality of orders except the target order.
The adding module 740 is configured to add the order that is the same as or similar to the positioning information of the target order into the aggregate order.
According to an embodiment of the present disclosure, the collection sheet generating apparatus 700 may further include a data processing module, an automatic deleting module, an order filtering module, and a data reading module.
The data processing module is used for judging whether the data of the order meet the algorithm format requirement. For example, each item in the order has information such as quantity, storage area, and roadway storage.
The auto-delete module is responsible for deleting the processed orders (which are used after the group order) out of the database.
The order screening module screens orders which are output and used by the user by forming the aggregated list last time. This is because in a run, if the algorithm mode is fast output, it is likely that not all orders are in one collection, some of the orders are in the collection and others are not. If the output orders are not processed, these unused orders may still be in the group of orders the next time the orders are processed.
The data reading module is responsible for reading data.
According to an embodiment of the present disclosure, the first determining module 720 is configured to: determining the number of the storage areas related to each order; sorting the number of the storage areas related to each order to obtain a sorting result; and determining the order with the largest number of storage areas or the smallest number of storage areas as the target order according to the sorting result.
According to an embodiment of the present disclosure, the positioning information set at least includes a storage area information set and a lane information set, and the second determining module 730 is configured to: determining whether the storage information sets of the other orders are contained in the storage information set of the target order; determining the order in which the storage information set is included in the storage information set of the target order as the order identical or similar to the positioning information of the target order when the storage information set of the other order is included in the storage information set of the target order; or determining whether the lane information set of the other orders is contained in the lane information set of the target order; and when the tunnel information set of the other orders is contained in the tunnel information set of the target order, determining the order of which the tunnel information set is contained in the tunnel information set of the target order as the order which is the same as or similar to the positioning information of the target order.
The collection sheet generating apparatus 700 further includes a determining module, configured to determine whether the sum of the quantity of the orders that are the same as or similar to the location information of the target order and the quantity of the target order is greater than a predetermined quantity upper limit of the orders in the collection sheet before adding the orders that are the same as or similar to the location information of the target order into the collection sheet.
The adding module 740 is configured to add the order that is the same as or similar to the positioning information of the target order into the aggregate sheet if the number of orders in the aggregate sheet is less than or equal to the predetermined upper limit of the number of orders.
According to an embodiment of the present disclosure, the collection sheet generating apparatus 700 further includes a third determining module, a fourth determining module, and a first calculating module.
The third determining module is configured to determine, after the order that is the same as or similar to the location information of the target order is added to the aggregate, the remaining orders that are not added to the aggregate from among the plurality of orders.
The fourth determining module is configured to determine current location information of the aggregate list, where the current location information of the aggregate list includes a current storage area information set and a roadway information set.
And the first calculation module is used for calculating the number of newly added storage areas or the number of newly added roadways required by adding each of the remaining orders into the current collection sheet according to the positioning information of each of the remaining orders and the current positioning information of the collection sheet.
The adding module 740 is configured to add the order that is not added and has the least number of newly added storage areas or lanes to the current aggregate list.
According to an embodiment of the present disclosure, the collection sheet generating apparatus 700 further includes a fifth determining module, a sixth determining module, and a seventh determining module.
The judging module is further configured to judge whether the number in the current aggregate sheet is greater than the predetermined number upper limit after the assumption that the order not added is added to the current aggregate sheet before the order not added is added to the current aggregate sheet.
The adding module 740 is further configured to add the non-added order to the current aggregate sheet when the number of the current aggregate sheet is smaller than or equal to the predetermined number upper limit after the assumption that the non-added order is added to the current aggregate sheet is determined.
A fifth determining module, configured to determine, after the assumption is made that the non-added order is added to the current aggregate listing, a newly added storage area combination or a newly added roadway combination required by the current aggregate listing when the number in the current aggregate listing is greater than the predetermined number upper limit;
and the sixth determining module is used for determining the number of the orders which are not added into the order and contain the newly added storage area combination or the roadway combination required by the same current collection list.
And the seventh determining module is used for determining the picking difficulty increment of the collection list after the newly added storage area combination or the roadway combination of the current collection list is determined.
The first calculating module is used for calculating the ratio of the quantity of the orders which are not added into the orders and contain the same newly added storage area combination or roadway combination required by the current collection list to the picking difficulty increasing amount of the collection list.
The adding module 740 is further configured to add the order corresponding to the ratio in the orders that are not added to the current aggregate list according to the sorting from large to small of the ratio until the number of orders in the current aggregate list reaches the predetermined number upper limit.
According to an embodiment of the present disclosure, the collection sheet generating apparatus 700 further includes a second calculating module and an ordering module. The second calculation module is used for calculating the picking difficulty increment of the collective order after each order which is the same as or similar to the positioning information of the target order is added into the collective order under the condition that the picking difficulty increment is larger than the preset quantity upper limit of the orders in the collective order; the sorting module is used for sorting the order picking difficulty increment of the collection list; the adding module 740 is further configured to add the corresponding orders into the aggregate sheet according to the sorting order from small to large of the picking difficulty increment of the aggregate sheet until the number of orders in the aggregate sheet reaches the predetermined upper limit.
Any number of modules, sub-modules, units, sub-units, or at least part of the functionality of any number thereof according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in any other reasonable manner of hardware or firmware by integrating or packaging a circuit, or in any one of or a suitable combination of software, hardware, and firmware implementations. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.
For example, any plurality of the obtaining module 710, the first determining module 720, the second determining module 730, and the adding module 740 may be combined and implemented in one module/unit/sub-unit, or any one of the modules/units/sub-units may be split into a plurality of modules/units/sub-units. Alternatively, at least part of the functionality of one or more of these modules/units/sub-units may be combined with at least part of the functionality of other modules/units/sub-units and implemented in one module/unit/sub-unit. According to an embodiment of the present disclosure, at least one of the obtaining module 710, the first determining module 720, the second determining module 730, and the adding module 740 may be implemented at least partially as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or may be implemented in any one of three implementations of software, hardware, and firmware, or in a suitable combination of any of them. Alternatively, at least one of the obtaining module 710, the first determining module 720, the second determining module 730, and the adding module 740 may be at least partially implemented as a computer program module that, when executed, may perform a corresponding function.
It should be noted that, in the embodiment of the present disclosure, the collection sheet generation method portion in the embodiment of the collection sheet generation apparatus is corresponding, and the description of the collection sheet generation apparatus portion specifically refers to the collection sheet generation method portion, which is not described herein again.
FIG. 8 schematically illustrates a block diagram of a computer system suitable for implementing the above-described method, according to an embodiment of the present disclosure. The computer system illustrated in FIG. 8 is only one example and should not impose any limitations on the scope of use or functionality of embodiments of the disclosure.
As shown in fig. 8, a computer system 800 according to an embodiment of the present disclosure includes a processor 801 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. The processor 801 may include, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 801 may also include onboard memory for caching purposes. The processor 801 may include a single processing unit or multiple processing units for performing different actions of the method flows according to embodiments of the present disclosure.
In the RAM 803, various programs and data necessary for the operation of the system 800 are stored. The processor 801, the ROM 802, and the RAM 803 are connected to each other by a bus 804. The processor 801 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 802 and/or RAM 803. Note that the programs may also be stored in one or more memories other than the ROM 802 and RAM 803. The processor 801 may also perform various operations of method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.
System 800 may also include an input/output (I/O) interface 805, also connected to bus 804, according to an embodiment of the disclosure. The system 800 may also include one or more of the following components connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a signal such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the I/O interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.
According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure 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 storage medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811. The computer program, when executed by the processor 801, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium. Examples may include, but are not limited to: 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), 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 disclosure, 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.
For example, according to embodiments of the present disclosure, a computer-readable storage medium may include the ROM 802 and/or RAM 803 described above and/or one or more memories other than the ROM 802 and RAM 803.
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 disclosure. 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. Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.

Claims (10)

1. A method of aggregate order generation performed by an electronic device, comprising:
acquiring a positioning information set of each order in a plurality of orders, wherein the positioning information set of each order comprises positioning information of commodities in the order in a warehouse;
determining a target order from the plurality of orders as a first order in a collection;
according to the positioning information set of the target order and the positioning information sets of other orders except the target order in the plurality of orders, determining orders which are the same as or similar to the positioning information of the target order from the other orders; and
and adding the order which is the same as or similar to the positioning information of the target order into the collection list.
2. The method of claim 1, wherein determining the target order from the plurality of orders as the first order in the aggregated list comprises:
determining the number of the storage areas involved in each order;
sorting the number of the storage areas related to each order to obtain a sorting result; and
and determining the order with the largest reserve quantity or the smallest reserve quantity as the target order according to the sorting result.
3. The method of claim 1, wherein the positioning information sets comprise at least a storage area information set and a roadway information set, and determining an order from the other orders that is the same as or similar to the positioning information of the target order based on the positioning information set of the target order and the positioning information sets of the other orders of the plurality of orders other than the target order comprises:
determining whether the storage information sets of the other orders are contained in the storage information set of the target order;
determining the order of which the storage area information set is contained in the storage area information set of the target order as the order which is the same as or similar to the positioning information of the target order under the condition that the storage area information sets of the other orders are contained in the storage area information set of the target order; or
Determining whether the lane information sets of the other orders are contained in the lane information set of the target order;
and under the condition that the tunnel information sets of other orders are contained in the tunnel information set of the target order, determining the order of which the tunnel information set is contained in the tunnel information set of the target order as the order which is the same as or similar to the positioning information of the target order.
4. The method of claim 1, further comprising:
before adding the order which is the same as or similar to the positioning information of the target order into the collection sheet, judging whether the sum of the number of the orders which are the same as or similar to the positioning information of the target order and the number of the target order is larger than a preset number upper limit of the orders in the collection sheet; and
and adding the order which is the same as or similar to the positioning information of the target order into the collection sheet under the condition that the order is less than or equal to the preset quantity upper limit of the orders in the collection sheet.
5. The method of claim 4, further comprising:
after the orders which are the same as or similar to the positioning information of the target orders are added into the collection list, determining the rest orders which are not added into the collection list in the plurality of orders;
determining current positioning information of the collection list, wherein the current positioning information of the collection list comprises a current storage area information set and a roadway information set;
according to the positioning information of each order in the remaining orders and the current positioning information of the collection list, calculating the number of newly added storage areas or the number of newly added roadways required by the current collection list for adding each order in the remaining orders into the current collection list;
and adding the order which is not added and has the minimum quantity of newly-increased storage areas or roadways required by the current collection list into the current collection list.
6. The method of claim 5, further comprising:
before adding the non-added orders into the current collection list, judging whether the quantity in the current collection list is greater than the preset quantity upper limit or not after the non-added orders are added into the current collection list;
adding the non-added order into the current collection list under the condition that the quantity in the current collection list is less than or equal to the preset quantity upper limit after the non-added order is added into the current collection list;
determining a newly added storage area combination or roadway combination required by the current collection sheet under the condition that the quantity in the current collection sheet is greater than the preset quantity upper limit after the non-added order is added into the current collection sheet;
determining the number of orders which are not added into the orders and contain the same newly added storage area combination or roadway combination required by the current collection list;
determining the picking difficulty increment of the collection list after the newly added storage area combination or the roadway combination of the current collection list is determined;
calculating the ratio of the quantity of the orders which are not added and contain the same newly added storage area combination or roadway combination required by the current collection sheet to the picking difficulty increment of the collection sheet; and
and adding the orders which are not added into the orders and correspond to the ratio into the current collection list according to the sequence from large to small of the ratio until the number of the orders in the current collection list reaches the preset number upper limit.
7. The method of claim 4, further comprising:
calculating the picking difficulty increment of the aggregated sheet after each order which is the same as or similar to the positioning information of the target order is added into the aggregated sheet under the condition that the picking difficulty increment is larger than the preset quantity upper limit of the orders in the aggregated sheet;
sorting the picking difficulty increment of the collection sheet; and
and adding corresponding orders into the collection sheet according to the sequence of the picking difficulty increment of the collection sheet from small to large until the number of the orders in the collection sheet reaches the preset number upper limit.
8. An apparatus for generating a collection sheet executed by an electronic device, comprising:
the system comprises an acquisition module, a storage module and a processing module, wherein the acquisition module is used for acquiring a positioning information set of each order in a plurality of orders, and the positioning information set of each order comprises positioning information of commodities in the order in a warehouse;
the first determining module is used for determining a target order from the orders as a first order in the collection list;
a second determining module, configured to determine, according to the positioning information set of the target order and the positioning information sets of other orders in the plurality of orders except the target order, an order that is the same as or similar to the positioning information of the target order from the other orders; and
and the adding module is used for adding the order which is the same as or similar to the positioning information of the target order into the collection list.
9. A computer system, comprising:
one or more processors;
a memory for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of any of claims 1-7.
10. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to carry out the method of any one of claims 1 to 7.
CN202010080438.0A 2020-02-04 2020-02-04 Collection list generation method and device, computer system and readable storage medium Pending CN113222203A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010080438.0A CN113222203A (en) 2020-02-04 2020-02-04 Collection list generation method and device, computer system and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010080438.0A CN113222203A (en) 2020-02-04 2020-02-04 Collection list generation method and device, computer system and readable storage medium

Publications (1)

Publication Number Publication Date
CN113222203A true CN113222203A (en) 2021-08-06

Family

ID=77085614

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010080438.0A Pending CN113222203A (en) 2020-02-04 2020-02-04 Collection list generation method and device, computer system and readable storage medium

Country Status (1)

Country Link
CN (1) CN113222203A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108205739A (en) * 2016-12-20 2018-06-26 北京京东尚科信息技术有限公司 Gather single group construction method and system
WO2018188473A1 (en) * 2017-04-10 2018-10-18 北京京东尚科信息技术有限公司 Order processing method and device, server, and storage medium
CN108694636A (en) * 2017-04-10 2018-10-23 北京京东尚科信息技术有限公司 A kind of method and apparatus of optimization group list
CN110322309A (en) * 2018-03-30 2019-10-11 北京京东尚科信息技术有限公司 Order processing method, apparatus and computer readable storage medium
CN110348771A (en) * 2018-04-02 2019-10-18 北京京东尚科信息技术有限公司 The method and apparatus that a kind of pair of order carries out group list

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108205739A (en) * 2016-12-20 2018-06-26 北京京东尚科信息技术有限公司 Gather single group construction method and system
WO2018188473A1 (en) * 2017-04-10 2018-10-18 北京京东尚科信息技术有限公司 Order processing method and device, server, and storage medium
CN108694636A (en) * 2017-04-10 2018-10-23 北京京东尚科信息技术有限公司 A kind of method and apparatus of optimization group list
CN108694637A (en) * 2017-04-10 2018-10-23 北京京东尚科信息技术有限公司 Order processing method, apparatus, server and storage medium
CN110322309A (en) * 2018-03-30 2019-10-11 北京京东尚科信息技术有限公司 Order processing method, apparatus and computer readable storage medium
CN110348771A (en) * 2018-04-02 2019-10-18 北京京东尚科信息技术有限公司 The method and apparatus that a kind of pair of order carries out group list

Similar Documents

Publication Publication Date Title
CN106980955B (en) Method and apparatus for outputting information
CN110371548B (en) Goods warehousing method and device
CN108734559B (en) Order processing method and device
CN111523977B (en) Method, device, computing equipment and medium for creating wave order set
CN111292030A (en) Bin selection method and device and computer readable storage medium
CN109658018B (en) Method and device for improving warehousing and ex-warehouse efficiency
CN110880057B (en) Grouping method and device
CN110182530B (en) Warehouse management method and device
CN112785215B (en) Method and device for generating picking path
CN110069579A (en) Fence method of partition and device
CN111178810B (en) Method and device for generating information
CN114118888A (en) Order ex-warehouse method and device
CN109934427B (en) Method and device for generating item distribution scheme
CN110304385A (en) A kind of warehouse restocking method and apparatus
CN110871980B (en) Storage classification method and device
CN112966992B (en) Order production method and device
CN111754059B (en) Task combination method and device
CN113222203A (en) Collection list generation method and device, computer system and readable storage medium
CN111768133A (en) Method and device for warehousing articles
CN113627837B (en) Goods collection positioning method and device
CN115099865A (en) Data processing method and device
CN113554380A (en) Method and device for positioning articles in warehouse-out process
CN112785213B (en) Warehouse manifest picking construction method and device
CN111746992B (en) AGV-based automatic warehouse goods storage position determination method and device
CN113650997A (en) Method and device for positioning articles in warehouse-out process

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