WO2023015954A1 - 商品分配方法、装置、电子设备和计算机存储介质 - Google Patents
商品分配方法、装置、电子设备和计算机存储介质 Download PDFInfo
- Publication number
- WO2023015954A1 WO2023015954A1 PCT/CN2022/089420 CN2022089420W WO2023015954A1 WO 2023015954 A1 WO2023015954 A1 WO 2023015954A1 CN 2022089420 W CN2022089420 W CN 2022089420W WO 2023015954 A1 WO2023015954 A1 WO 2023015954A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- sorting station
- commodity
- commodities
- remaining
- fixed storage
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000004891 communication Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000001174 ascending effect Effects 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0836—Recipient pick-ups
-
- 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
- G06Q10/0875—Itemisation or classification of parts, supplies or services, e.g. bill of materials
Definitions
- the present application relates to the field of logistics and warehousing, in particular, to a commodity distribution method, device, electronic equipment and computer storage medium.
- Dismantling and picking is a common operation mode for logistics warehouses in retail industries such as chain supermarkets and pharmacies.
- split picking operators pick at sorting stations where items have been pre-assigned.
- the commodity is distributed to each sorting station mainly according to the characteristics such as the category, variety, and volume of the commodity.
- the purpose of the embodiments of the present application is to provide a commodity distribution method, device, electronic equipment and computer storage medium to solve the problem of low overall operation efficiency caused by unbalanced workload of operators at different sorting stations.
- the present invention provides a commodity distribution method, including: obtaining historical order information and forward-looking order information, the historical order information refers to completed order information, and the forward-looking order information refers to unexecuted order information; According to the historical order line quantity of each commodity in the historical order information, each commodity is evenly distributed to the fixed location of each sorting station; wherein, the historical order line quantity of each commodity indicates that each commodity is in the The number of occurrences in the above-mentioned historical order information; according to the forward-looking order information and the commodity information on the fixed location, determine the number of forward-looking order lines for the commodities on the fixed location of each sorting station; according to each of the The forward order line quantity of the commodity on the fixed storage space of the sorting station determines the commodity allocated to the mobile storage space of each sorting station.
- the goods are evenly distributed to the fixed storage positions of each sorting station, so that the workload of each sorting station can be relatively balanced for a long period of time.
- the commodities on the motorized storage positions of each sorting station are determined to ensure that the workload of each sorting station can be relatively balanced under the forward-looking order information.
- each sorting station includes a plurality of fixed storage positions, and the plurality of fixed storage positions include a first fixed storage position and a plurality of remaining fixed storage positions, and each of the fixed storage positions It is used to store a commodity; said according to the historical order line quantity of each commodity in the historical order information, the balanced distribution of each commodity to the fixed position of each sorting station includes: determining according to the historical order information The number of historical order lines of each commodity, and sort the various commodities according to the number of historical order lines from large to small; according to the order of the historical order lines of various commodities from large to small, order Allocate a commodity to the first fixed storage position of the sorting station; distribute the remaining commodities to the remaining fixed storage positions of each of the sorting stations in a balanced manner.
- Each product is allocated to different sorting stations, and then the remaining various products are evenly distributed to the remaining fixed positions of each sorting station, so that the workload of each sorting station is relatively balanced.
- the balanced distribution of the remaining commodities to the remaining fixed storage positions of each of the sorting stations includes: according to the historical order line quantity of each commodity and the The total quantity of the fixed storage space determines the first average order line quantity q ave , the first average order line quantity q ave is the average order line quantity on each fixed storage space of each sorting station;
- S1 sort the remaining commodities according to the number of historical order lines from small to large;
- S2 sequentially select a commodity and the historical order lines of the commodities currently assigned by the sorting station Add up numbers to get q sum ;
- S3 compare q sum with q ave *(n c +1), if q sum is greater than or equal to q ave *(n c +1), go to S4; if q sum is less than q ave *(n c +1), then enter S2; if all the remaining commodities do not meet the requirement that q sum is greater than or equal to q
- the first average order line quantity q ave of each fixed storage space of each sorting station is considered, thereby ensuring that the The workload is relatively balanced, which improves the overall efficiency of the sorting station in the subsequent sorting of orders.
- the balanced distribution of the remaining commodities to the remaining fixed storage positions of each of the sorting stations includes: according to the historical order line quantity of each commodity and the The total quantity of the fixed storage space determines the first average order line quantity q ave , the first average order line quantity q ave is the average order line quantity on each fixed storage space of each sorting station; Perform the following steps: S1: Sort the remaining commodities according to the number of historical order lines from small to large; S2: Select a commodity in turn and add the historical order lines of the commodities currently assigned to the sorting station to obtain q sum ; S3: compare q sum with q ave *(n c +1), if q sum is greater than or equal to q ave *(n c +1), go to S4; if q sum is less than q ave *(n c +1 ), then enter S2; if all the remaining commodities do not meet the requirement that q sum is greater than or equal to q ave *(n c
- each sorting station includes a plurality of fixed storage positions, and the plurality of fixed storage positions include a first fixed storage position and a plurality of remaining fixed storage positions, and each of the fixed storage positions It is used to store a commodity; said according to the historical order line quantity of each commodity in the historical order information, the balanced distribution of each commodity to the fixed position of each sorting station includes: determining according to the historical order information The number of historical order lines of each commodity, and sort the various commodities according to the number of historical order lines from small to large; according to the order of the historical order lines of various commodities from small to large, order The first fixed storage space of the sorting station is allocated to one commodity; and the remaining commodities are evenly distributed to the remaining fixed storage positions of each sorting station.
- the balanced distribution of the remaining commodities to the remaining fixed storage positions of each of the sorting stations includes: according to the historical order line quantity of each commodity and the The total number of fixed storage positions, determine the first average order line quantity q ave , the first average order line quantity q ave is the average order line quantity on each fixed storage position of each sorting station; For a sorting station, perform the following steps: S1: Sort the remaining commodities according to the number of historical order lines in descending order; S2: Select a commodity and the historical orders of the commodities currently assigned by the sorting station in turn Add the number of rows to get q sum ; S3: compare q sum with q ave *(n c +1), if q sum is less than or equal to q ave *(n c +1), go to S4; if q sum is greater than q ave *(n c +1), enter S2; if all the remaining commodities do not meet the requirement that q sum is less than or equal to q
- the balanced distribution of the remaining commodities to the remaining fixed storage positions of each of the sorting stations includes: according to the historical order line quantity of each commodity and the The total quantity of the fixed storage space determines the first average order line quantity q ave , the first average order line quantity q ave is the average order line quantity on each fixed storage space of each sorting station; Perform the following steps: S1: sort the remaining commodities according to the number of historical order lines from large to small; S2: select one commodity in turn and add the historical order lines of the commodities currently assigned to the sorting station to obtain q sum ; S3: compare q sum with q ave *(n c +1), if q sum is less than or equal to q ave *(n c +1), go to S4; if q sum is greater than q ave *(n c + 1), then go to S2; if all the remaining commodities do not meet the requirement that q sum is less than or equal to q ave *(n c + 1)
- the determining the commodities allocated to the motorized storage positions of each sorting station according to the forward order line quantity of the commodities on the fixed storage positions of each sorting station includes: according to The forward-looking order information sorts each sorting station according to the order line quantity of each sorting station, and determines the second average order line quantity of each sorting station; determines the number of order lines in the first sorting station
- the first commodity is the sorting station with the largest total number of order lines in the sorting station, and the first commodity is the commodity with the largest number of order lines in the first sorting station;
- the first commodity is allocated to the motorized storage space of the second sorting station, and part of the order lines or all the order lines corresponding to the first commodity are allocated to the second sorting station, so that the first The difference between the order line quantity of a sorting station and the second average order line quantity is less than a preset threshold, and the order line quantity of each sorting station is updated, and the second sorting station is the order line quantity of the sorting station
- the commodity with the largest number of order lines in the sorting station with the largest number of order lines is allocated to the motorized storage space of the sorting station with the smallest number of order lines, and the above process is repeated until each sorting station has The difference between the number of order lines and the second average number of order lines is less than the preset threshold, so as to ensure that the workload of each sorting station is relatively balanced, thereby improving the overall work efficiency of split-zero sorting.
- the present invention provides a commodity distribution device, which includes: an acquisition module for acquiring historical order information and forward-looking order information, the historical order information refers to completed order information, and the forward-looking order information Refers to the unexecuted order information; the distribution module is used to evenly distribute each commodity to the fixed storage position of each sorting station according to the historical order line quantity of each commodity in the historical order information; wherein, each The number of historical order lines of the commodity indicates the number of times each commodity appears in the historical order information; according to the forward order information and the commodity information on the fixed location, determine the fixed location of each sorting station According to the forward order line quantity of the commodity on the fixed shelf of each sorting station, determine the commodities allocated to the motorized shelf of each sorting station.
- each sorting station includes a plurality of fixed storage positions, and the plurality of fixed storage positions include a first fixed storage position and a plurality of remaining fixed storage positions, and each of the fixed storage positions
- the allocation module is also used to determine the historical order line quantity of each commodity according to the historical order information, and sort various commodities according to the historical order line quantity from large to small; In descending order of the number of historical order lines of a commodity, assign a commodity to the first fixed storage position of each sorting station in turn; distribute the remaining commodities to the remaining slots of each sorting station on a fixed shelf.
- the allocation module is further configured to determine the first average order line quantity q ave according to the historical order line quantity of each commodity and the total quantity of fixed storage positions of each sorting station , the first average order line quantity q ave is the average order line quantity on each fixed location of each sorting station; for one sorting station, the following steps are performed: S1: the remaining Commodities are sorted according to the number of historical order lines from small to large; S2: Select a commodity in turn and add the historical order lines of the commodities currently assigned to the sorting station to get q sum ; S3: Compare q sum and q ave * (n c +1), if q sum is greater than or equal to q ave* (n c +1), enter S4; if q sum is less than q ave* (n c +1), enter S2; if all remaining If none of the commodities satisfies that q sum is greater than or equal to q ave* (n c +1),
- the allocation module is further configured to determine the first average order line quantity q ave according to the historical order line quantity of each commodity and the total quantity of fixed storage positions of each sorting station , the first average order line quantity q ave is the average order line quantity on each fixed location of each sorting station; perform the following steps: S1: sort the remaining commodities according to the historical order line quantity Sort the quantity from small to large; S2: Select a commodity in turn and add it to the historical order line number of the commodity currently allocated by the sorting station to get q sum ; S3: Compare q sum with q ave *(n c +1 ), if q sum is greater than or equal to q ave *(n c +1), then enter S4; if q sum is less than q ave *(n c +1), then enter S2; if all the remaining commodities do not satisfy q sum greater than or equal to q ave *(n c +1), enter S5; where n c is
- each sorting station includes a plurality of fixed storage positions, and the plurality of fixed storage positions include a first fixed storage position and a plurality of remaining fixed storage positions, and each of the fixed storage positions
- the allocation module is also used to determine the historical order line quantity of each commodity according to the historical order information, and sort various commodities according to the historical order line quantity from small to large; The order of the historical order lines of commodities is from small to large, and a commodity is allocated to the first fixed storage position of each sorting station; bit.
- the allocation module is further configured to determine the first average order line quantity q ave according to the historical order line quantity of each commodity and the total quantity of fixed storage positions of each sorting station , the first average order line quantity q ave is the average order line quantity on each fixed location of each sorting station; for one sorting station, the following steps are performed: S1: the remaining Commodities are sorted according to the number of historical order lines from large to small; S2: Select a commodity in turn and add the historical order lines of the commodities currently assigned to the sorting station to get q sum ; S3: Compare q sum with q ave *(n c +1), if q sum is less than or equal to q ave *(n c +1), enter S4; if q sum is greater than q ave *(n c +1), enter S2; if the remaining If all commodities do not meet the requirement that q sum is less than or equal to q ave *(n c +1), enter S
- the allocation module is further configured to determine the first average order line quantity q ave according to the historical order line quantity of each commodity and the total quantity of fixed storage positions of each sorting station , the first average order line quantity q ave is the average order line quantity on each fixed location of each sorting station; perform the following steps: S1: sort the remaining commodities according to the historical order line quantity Sort the quantity from large to small; S2: Select a product in turn and add the historical order line number of the product currently allocated by the sorting station to get q sum ; S3: Compare q sum with q ave *(n c + 1), if q sum is less than or equal to q ave *(n c +1), then enter S4; if q sum is greater than q ave *(n c +1), then enter S2; if all the remaining products do not satisfy q If sum is less than or equal to q ave *(n c +1), enter S5; among them, n c
- the allocation module is further configured to sort the sorting stations according to the order line quantity of each sorting station according to the forward order information, and determine the number of order lines of each sorting station The second average order line quantity; determine the first commodity in the first sorting station, the first sorting station is the sorting station with the largest total number of order lines in the sorting station, and the first commodity is Commodities with the largest number of order lines in the first sorting station; assign the first commodity to the motorized storage space of the second sorting station, and allocate part of the order lines or all order lines corresponding to the first commodity assigned to the second sorting station, so that the difference between the order line quantity of the first sorting station and the second average order line quantity is less than a preset threshold, and update the order line quantity of each sorting station
- the number of order lines, the second sorting station is the sorting station with the least number of order lines in the sorting stations; and so on, until the order line quantity of each sorting station is equal to the second average order
- the difference in the number of rows is less than
- the present invention provides an electronic device, including: a processor, a memory, and a bus; the processor and the memory communicate with each other through the bus; Executed program instructions, the processor calls the program instructions to be able to execute the method as described in any one of the foregoing implementation manners.
- the present invention provides a computer storage medium, the computer storage medium is provided with computer instructions, and when the computer instructions are executed by a computer, the computer executes the method as described in any one of the foregoing implementation manners.
- FIG. 1 is a flow chart of a method for distributing commodities provided by an embodiment of the present application
- FIG. 2 is a structural block diagram of a commodity distribution device provided in an embodiment of the present application.
- FIG. 3 is a structural block diagram of an electronic device provided by an embodiment of the present application.
- Icons 200-commodity distribution device; 201-acquisition module; 202-distribution module; 300-electronic equipment; 301-processor; 302-communication interface; 303-memory; 304-bus.
- Dismantling and picking is a common operation mode for logistics warehouses in retail industries such as chain supermarkets and pharmacies.
- split picking operators pick at sorting stations where items have been pre-assigned.
- the commodity is distributed to each sorting station mainly according to the characteristics such as the category, variety, and volume of the commodity.
- embodiments of the present application provide a commodity distribution method, device, electronic equipment, and computer storage medium, so as to solve the above-mentioned problems.
- FIG. 1 is a flow chart of a commodity distribution method provided in the embodiment of the present application.
- the commodity distribution method may include the following steps:
- Step S101 Obtain historical order information and forward order information.
- Step S102 According to the historical order line quantity of each commodity in the historical order information, distribute each commodity to the fixed location of each sorting station in a balanced manner.
- Step S103 According to the forward order information and the commodity information on the fixed shelf, determine the quantity of the forward order line of the commodity on the fixed shelf of each sorting station.
- Step S104 According to the number of forward order lines of the commodities on the fixed shelves of each sorting station, determine the commodities allocated to the motorized shelves of each sorting station.
- Step S101 Obtain historical order information and forward order information.
- the historical order information can be the order information of the previous month or the previous week (that is, the order that has been sorted), and the forward order information can be the order information of the next hour or two hours (the order that will be sorted soon) ).
- the time corresponding to the historical order information may also be the previous two days or the previous three days, and the time corresponding to the forward-looking order information may also be the next three hours or one day, which is not specifically limited in this application.
- the historical order information and the forward order information include order line information of all commodities within the corresponding time period of the order.
- one order line corresponds to one commodity in one order. For example, if an order involves 5 kinds of commodities, then the order has 5 order lines.
- Step S102 According to the historical order line quantity of each commodity in the historical order information, distribute each commodity to the fixed location of each sorting station in a balanced manner.
- the number of order lines of the commodity in the historical order information indicates the number of times the commodity appears in the historical order information.
- the order line information of each order in the historical order information the order line quantity of each commodity can be determined.
- the embodiment of the present application proposes two methods of evenly distributing each product to a fixed storage position of each sorting station. The two allocation methods are introduced respectively below.
- step S102 may include the following steps:
- the first step is to determine the order line quantity of each commodity according to the historical order information, and sort the various commodities according to the historical order line quantity from large to small;
- the second step is to assign a commodity to the first fixed location of each sorting station in descending order of the historical order lines of various commodities;
- the third step is to evenly distribute the remaining goods to the remaining fixed storage positions of each sorting station.
- each sorting station is provided with a plurality of fixed storage positions, wherein the fixed storage positions are divided into a first fixed storage position and a plurality of remaining fixed storage positions.
- Each fixed storage space is used to store a commodity.
- the commodities stored on different fixed storage spaces are not the same.
- the number of fixed bays is the same for each sorting station.
- the total number of fixed storage positions of all sorting stations shall not be less than the number of types of goods. For example, if there are 20 kinds of products and 4 sorting stations, each sorting station should have at least 5 fixed storage spaces.
- the number of fixed storage slots in each sorting station can be increased or decreased. Since the size of each sorting station is fixed (that is, the number of storage slots is fixed), according to the type of commodity How many quantity, choose a different number of storage space as a fixed storage space. For example, if there are 20 kinds of commodities in an order information, and there are 4 sorting stations, then 5 fixed slots are designated for each sorting station to store commodities. If there are 24 types of goods in the next order information, and there are 4 sorting stations, it is specified that each sorting station has 6 fixed storage positions for storing goods.
- the order line quantity of each commodity is determined according to historical order information.
- order A there are 3 orders in the historical order information, order A, order B, and order C.
- Item 1 and item 2 are involved in order A, so there are two order lines in order A, corresponding to item 1 and item 2 respectively.
- Item 1, item 2, and item 3 are involved in order C, and there are three order lines in order B, corresponding to item 1, sorted item 2, and item 3 respectively.
- the order line quantity of commodity 1 is 2
- the order line quantity of commodity 2 is 3
- the order line quantity of commodity 3 is 1.
- the first fixed location of the picking station is assigned one of the commodities.
- evenly distributing the remaining commodities to the remaining fixed storage slots of each sorting station may include:
- the order line quantity of each commodity can be expressed as a set: ⁇ q 1 ,q 2 ,q 3 ...q n ⁇ , and the sum of the total quantity of fixed storage positions of each sorting station is M , then the first average order line quantity q ave can be expressed as:
- S1 Sort the remaining commodities according to the number of historical order lines from small to large;
- S3 compare q sum with q ave *(n c +1), if q sum is greater than or equal to q ave *(n c +1), go to S4; if q sum is less than q ave *(n c +1), Then enter S2; if all the remaining commodities do not meet the requirement that q sum is greater than or equal to q ave *(n c +1), then enter S5; where n c is the fixed number of goods allocated in the sorting station;
- S4 Allocate the selected product to one of the remaining fixed storage slots in the current sorting station, and repeat S2 until all the remaining fixed storage slots in the current sorting station are allocated to the product;
- S5 Allocate the product with the largest number of historical order lines among all the remaining products to a remaining fixed storage space of the current sorting station, and repeat S2 until all remaining fixed storage positions in the current sorting station are allocated to the product .
- the number of order lines of the item selected at the beginning is added to the number of order lines of the item currently assigned to the sorting station to get q sum will be less than q ave *(n c +1). If the goods corresponding to q sum less than q ave *(n c +1) are allocated to the sorting station, the workload of the sorting station will be less than the average workload, and in the subsequent allocation, some other The workload at the sorting station is greater than the average workload, resulting in an uneven workload. Therefore, it is necessary to assign commodities corresponding to q sum greater than or equal to q ave *(n c +1) to the distribution station.
- the above method is also used for the next sorting station, and the remaining fixed storage positions of the next sorting station are allocated, and the cycle is repeated until each sorting station All remaining fixed slots are assigned a product to be sorted.
- the first average order line quantity q ave of each fixed location of each sorting station is considered, thus ensuring that each sorting station The workload is relatively balanced, which improves the overall efficiency of the sorting station in the subsequent sorting of orders.
- evenly distributing the remaining commodities to the remaining fixed storage slots of each sorting station may include the following steps:
- S1 Sort the remaining commodities according to the number of historical order lines from small to large;
- S3 compare q sum with q ave *(n c +1), if q sum is greater than or equal to q ave *(n c +1), go to S4; if q sum is less than q ave *(n c +1), Then enter S2; if all the remaining commodities do not meet the requirement that q sum is greater than or equal to q ave *(n c +1), then enter S5; where n c is the fixed number of goods allocated in the sorting station;
- S4 Allocate the selected products to one of the remaining fixed storage slots of a sorting station, switch to the next sorting station, and repeat S2 until all the remaining fixed storage slots in each sorting station are allocated to commodity;
- S5 Allocate the product with the largest number of historical order lines among all the remaining products to a remaining fixed storage space of a sorting station, switch to the next sorting station, and repeat S2 until all the products in each sorting station
- the remaining fixed storage slots are allocated to commodities. It should be noted that the logic of allocating goods for each fixed storage space in this embodiment is the same as that of the previous embodiment. After the allocation is completed, the remaining fixed storage space of the next sorting station is allocated, and the cycle is repeated until each remaining fixed storage space of all sorting stations is allocated. And this embodiment is to distribute one remaining fixed storage position of each sorting station in turn, and then distribute another remaining fixed storage position of each sorting station, and so on, until each sorting station is allocated The remaining fixed storage slots are allocated.
- each sorting station has 3 remaining fixed storage spaces, namely, the first remaining fixed storage space, the second remaining fixed storage space, and the third remaining fixed storage space.
- the first remaining fixed cargo spaces of the four sorting stations are allocated sequentially.
- the second remaining fixed cargo spaces of the four sorting stations are allocated, and finally the four sorting stations
- the third remaining fixed cargo space is allocated, and the allocation is finally completed.
- the distribution of the three remaining storage spaces in one sorting station is completed first, and then the distribution of the three remaining storage locations in the other sorting station is completed, and the cycle is repeated until all four sorting stations are completed. distribute.
- step S102 may include the following steps:
- the first step is to determine the number of historical order lines for each commodity according to the historical order information, and sort the various commodities according to the number of historical order lines from small to large;
- the second step is to assign a commodity to the first fixed location of each sorting station in sequence according to the order of the historical order lines of various commodities from small to large;
- the third step is to evenly distribute the remaining goods to the remaining fixed storage positions of each sorting station.
- the commodities to be sorted that correspond to relatively large workloads are first allocated to different sorting stations, and then the remaining various commodities to be sorted are The picked goods are evenly distributed to the remaining fixed positions of each sorting station.
- the commodities to be sorted with the smallest workload are assigned to the first fixed positions of different sorting stations, and then the remaining commodities to be sorted are evenly distributed to On the remaining fixed positions of each sorting station.
- evenly distributing the remaining commodities to the remaining fixed storage slots of each sorting station may include:
- S1 Sort the remaining commodities according to the number of historical order lines from large to small;
- S3 Compare q sum with q ave *(n c +1), if q sum is less than or equal to q ave *(n c +1), go to S4; if q sum is greater than q ave *(n c +1), Then enter S2; if all the remaining commodities do not meet the requirement that q sum is less than or equal to q ave *(n c +1), then enter S5; where n c is the fixed number of goods allocated in the sorting station;
- S4 Allocate the selected product to one of the remaining fixed storage slots in the current sorting station, and repeat S2 until all the remaining fixed storage slots in the current sorting station are allocated to the product;
- evenly distributing the remaining commodities to the remaining fixed storage slots of each sorting station may include:
- S1 Sort the remaining commodities according to the number of historical order lines from large to small;
- S3 Compare q sum with q ave *(n c +1), if q sum is less than or equal to q ave *(n c +1), go to S4; if q sum is greater than q ave *(n c +1), Then enter S2; if all the remaining commodities do not meet the requirement that q sum is less than or equal to q ave *(n c +1), then enter S5; where n c is the fixed number of goods allocated in the sorting station;
- S4 Allocate the selected products to one of the remaining fixed storage slots of a sorting station, switch to the next sorting station, and repeat S2 until all the remaining fixed storage slots in each sorting station are allocated to commodity;
- the two distribution methods for distributing commodities to the remaining fixed storage spaces correspond to the two distribution methods in the foregoing embodiments. repeat.
- step S103 and step S104 will be introduced together below.
- Step S103 According to the forward order information and the commodity information on the fixed shelf, determine the quantity of the forward order line of the commodity on the fixed shelf of each sorting station.
- Step S104 According to the number of forward order lines of the commodities on the fixed shelves of each sorting station, determine the commodities allocated to the motorized shelves of each sorting station.
- the products are evenly distributed to the fixed storage positions of each sorting station according to the historical order information.
- the historical order information corresponds to the order content of the previous month or the previous week, it includes orders for a long period of time. Therefore, determining the allocation method of commodities in each fixed location based on historical order information can make the workload of each sorting station relatively balanced for a long period of time.
- the frequency of various commodities in the forward order information may be different from the frequency of various commodities in the historical order information, in a short period of time (for example, within one hour or several hours), the workload of each sorting station There will still be some differences.
- motorized cargo spaces will also be set in each sorting station.
- the number of order lines for each sorting station’s commodities under the forward-looking order can be determined according to the forward-looking order information and the current allocation of fixed storage positions at each sorting station. Furthermore, according to the order line quantity of the goods in each sorting station, the goods are allocated to the motorized storage positions on each sorting station, so as to balance the workload of each sorting station.
- step S104 may include the following implementation manners:
- the first step is to sort each sorting station according to the order line quantity of each sorting station according to the forward order information, and determine the second average order line quantity of each sorting station.
- the sorting stations under the forward order information are arranged according to the number of order lines in descending order, and the second average order line quantity of each sorting station is determined according to the forward order information.
- the second average order line quantity is the total number of order lines in the forward order divided by the number of sorting stations.
- the second step is to determine the first commodity in the first sorting station.
- the first sorting station is the sorting station with the largest total number of order lines in the sorting station.
- the first commodity is the largest number of order lines in the first sorting station. Products of.
- the third step is to assign the first product to the motorized storage space of the second sorting station, and assign some or all order lines corresponding to the first product to the second sorting station, so that the first sorting
- the difference between the number of order lines at the station and the second average order line quantity is less than the preset threshold, and the number of order lines at each sorting station is updated, and the second sorting station is the sorting station with the least number of order lines among the sorting stations;
- the first sorting station with the largest number of order lines among the sorting stations and the first product with the largest number of order lines at the first sorting station are determined. Allocate the first product to the motorized position of the second sorting station with the least number of order lines in the sorting station, and allocate part of the order lines corresponding to the first product to the second sorting station, and then update each sorting station The number of order lines for the station.
- the above method is repeated continuously until the difference between the number of order lines at each sorting station and the second average number of order lines is less than a preset threshold. Since the commodities between different fixed storage spaces are different, after the allocation of the flexible storage space, it may not be possible to make the number of order lines at each sorting station exactly the same as the second average order line quantity (that is, the number of order lines at each sorting station The workload is exactly the same). Therefore, a preset threshold is set, and when the difference between the order line quantity of each sorting station and the second average order line quantity is less than the preset threshold, it is considered that the current workload of each sorting station is relatively balanced.
- motorized cargo bays there may be one or more motorized cargo bays, which is not specifically limited in this application and can be selected according to the actual situation of the commodity.
- the goods with the largest number of order lines in the sorting station with the largest number of order lines are allocated to the motorized storage space of the sorting station with the least number of order lines, and the above process is repeated until the order line of each sorting station
- the difference between the quantity and the second average order line quantity is less than the preset threshold, so as to ensure that the workload of each sorting station is relatively balanced, thereby improving the overall work efficiency of zero sorting.
- the embodiment of the present application provides a product allocation method, which distributes the products to the fixed storage positions of each sorting station in a balanced manner according to historical order information, so that the workload of each sorting station can be relatively balanced for a long period of time.
- the commodities on the motorized storage positions of each sorting station are determined to ensure that the workload of each sorting station can be relatively balanced under the forward-looking order information.
- FIG. 2 is a structural block diagram of a commodity distribution device provided in the embodiment of the present application.
- the commodity distribution device 200 includes:
- An acquisition module 201 configured to acquire historical order information and forward-looking order information, wherein the historical order information refers to completed order information, and the forward-looking order information refers to unexecuted order information;
- the allocation module 202 is configured to distribute each commodity to the fixed storage space of each sorting station in a balanced manner according to the historical order line quantity of each commodity in the historical order information; wherein, the historical order line quantity of each commodity represents The number of times each commodity appears in the historical order information; according to the forward order information and the commodity information on the fixed location, determine the forward order line of each commodity on the fixed location of the sorting station Quantity: according to the forward order line quantity of the commodities on the fixed storage positions of each sorting station, determine the commodities allocated to the motorized storage positions of each sorting station.
- each sorting station includes a plurality of fixed storage positions, and the plurality of fixed storage positions include a first fixed storage position and a plurality of remaining fixed storage positions, and each of the fixed storage positions
- the allocation module 202 is also used for determining the historical order line quantity of each commodity according to the historical order information, and sorting various commodities according to the historical order line quantity from large to small ;According to the order of the historical order lines of various commodities from large to small, assign a commodity to the first fixed location of each sorting station in turn; distribute the remaining commodities to each of the sorting stations in a balanced manner Station on the remaining fixed cargo space.
- the allocation module 202 is further configured to determine the first average order line quantity q according to the historical order line quantity of each commodity and the total quantity of fixed storage positions of each sorting station ave , the first average order line quantity q ave is the average order line quantity on each fixed location of each sorting station; for one sorting station, the following steps are performed: S1: the The remaining commodities are sorted according to the number of historical order lines from small to large; S2: Select a commodity in turn and add the historical order lines of the commodities currently assigned to the sorting station to get q sum ; S3: Compare q sum with q ave* (n c +1), if q sum is greater than or equal to q ave* (n c +1), enter S4; if q sum is less than q ave* (n c +1), enter S2; if the remaining If all commodities do not meet the requirement that q sum is greater than or equal to q ave* (n c +1), enter
- the allocation module 202 is further configured to determine the first average order line quantity q according to the historical order line quantity of each commodity and the total quantity of fixed storage positions of each sorting station ave , the first average order line quantity q ave is the average order line quantity on each fixed location of each sorting station; perform the following steps: S1: sort the remaining commodities according to the historical order The number of lines is sorted from small to large; S2: Select a product in turn and add the historical order line number of the product currently allocated by the sorting station to get q sum ; S3: Compare q sum with q ave *(n c + 1), if q sum is greater than or equal to q ave *(n c +1), enter S4; if q sum is less than q ave *(n c +1), enter S2; if all the remaining products do not satisfy q If sum is greater than or equal to q ave *(n c +1), enter S5; among them, n
- each sorting station includes a plurality of fixed storage positions, and the plurality of fixed storage positions include a first fixed storage position and a plurality of remaining fixed storage positions, and each of the fixed storage positions
- the allocation module 202 is also used to determine the historical order line quantity of each commodity according to the historical order information, and sort various commodities according to the historical order line quantity from small to large; According to the order of the number of historical order lines of a commodity in ascending order, a commodity is allocated to the first fixed position of each sorting station; the remaining commodities are evenly distributed to the remaining fixed positions of each sorting station. on the shelf.
- the allocation module 202 is further configured to determine the first average order line quantity q according to the historical order line quantity of each commodity and the total quantity of fixed storage positions of each sorting station ave , the first average order line quantity q ave is the average order line quantity on each fixed location of each sorting station; for one sorting station, the following steps are performed: S1: the The remaining commodities are sorted from the largest to the smallest according to the number of historical order lines; S2: Select a commodity in turn and add it to the historical order number of the commodity currently allocated by the sorting station to get q sum ; S3: Compare q sum with q ave *(n c +1), if q sum is less than or equal to q ave *(n c +1), enter S4; if q sum is greater than q ave *(n c +1), enter S2; if the remaining All the commodities in q sum do not satisfy q ave *(n c +1), then enter S5
- the allocation module 202 is further configured to determine the first average order line quantity q according to the historical order line quantity of each commodity and the total quantity of fixed storage positions of each sorting station ave , the first average order line quantity q ave is the average order line quantity on each fixed location of each sorting station; perform the following steps: S1: sort the remaining commodities according to the historical order The number of lines is sorted from large to small; S2: Select a product in turn and add the historical order line number of the product currently allocated by the sorting station to get q sum ; S3: Compare q sum with q ave *(n c +1), if q sum is less than or equal to q ave *(n c +1), then enter S4; if q sum is greater than q ave *(n c +1), then enter S2; if all the remaining commodities are not satisfied q sum is less than or equal to q ave *(n c +1), then enter S5; where n
- the allocation module 202 is further configured to sort the sorting stations according to the order line quantity of each sorting station according to the forward order information, and determine the The second average order line quantity of the station; determine the first commodity in the first sorting station, the first sorting station is the sorting station with the largest total number of order lines in the sorting station, and the first commodity It is the product with the largest number of order lines in the first sorting station; the first product is allocated to the motorized storage space of the second sorting station, and part of the order lines or all orders corresponding to the first product are Lines are allocated to the second sorting station, so that the difference between the order line quantity of the first sorting station and the second average order line quantity is less than a preset threshold, and each of the sorting stations is updated The number of order lines, the second sorting station is the sorting station with the least number of order lines among the sorting stations; and so on, until the order line quantity of each sorting station is equal to the second average The difference in order line quantities is less than a preset threshold
- FIG. 3 is a schematic structural diagram of an electronic device 300 according to an embodiment of the present application.
- the electronic device 300 includes: at least one processor 301 , at least one communication interface 302 , at least one memory 303 and at least one bus 304 .
- the bus 304 is used to realize the direct connection and communication of these components
- the communication interface 302 is used to communicate signaling or data with other node devices
- the memory 303 stores machine-readable instructions executable by the processor 301 .
- the processor 301 communicates with the memory 303 through the bus 304 , and when the machine-readable instructions are invoked by the processor 301 , the above-mentioned occupancy grid map construction method is executed.
- the processor 301 may be an integrated circuit chip with signal processing capabilities.
- processor 301 can be general-purpose processor, comprises central processing unit (Central Processing Unit, CPU), network processor (Network Processor, NP) etc.; Can also be digital signal processor (Digital Signal Processing, DSP), dedicated integration Circuit (Application Specific Integrated Circuit, ASIC), off-the-shelf programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. It can realize or execute various methods, steps and logic block diagrams disclosed in the embodiments of the present application.
- a general-purpose processor may be a microprocessor, or the processor may be any conventional processor, or the like.
- Memory 303 can include but not limited to random access memory (Random Access Memory, RAM), read-only memory (Read Only Memory, ROM), programmable read-only memory (Programmable Read-Only Memory, PROM), erasable read-only memory Memory (Erasable Programmable Read-Only Memory, EPROM), Electric Erasable Programmable Read-Only Memory (EEPROM), etc.
- RAM Random Access Memory
- ROM read-only memory
- PROM programmable read-only memory
- PROM Programmable Read-Only Memory
- EPROM Erasable Programmable Read-Only Memory
- EEPROM Electric Erasable Programmable Read-Only Memory
- the structure shown in FIG. 3 is only for illustration, and the electronic device 300 may also include more or less components than those shown in FIG. 3 , or have a configuration different from that shown in FIG. 3 .
- Each component shown in FIG. 3 may be implemented by hardware, software or a combination thereof.
- the electronic device 300 may be, but not limited to, physical devices such as desktop computers, notebook computers, smart phones, smart wearable devices, and vehicle-mounted devices, or virtual devices such as virtual machines.
- the electronic device 300 is not necessarily a single device, but may also be a combination of multiple devices, such as a server cluster, and so on.
- an embodiment of the present application also provides a computer storage medium, on which a computer program is stored.
- a computer program is stored.
- the steps of the method for constructing an occupancy grid map as in the above-mentioned embodiments are executed.
- the disclosed devices and methods may be implemented in other ways.
- the device embodiments described above are only illustrative.
- the division of the units is only a logical function division.
- multiple units or components can be combined or May be integrated into another system, or some features may be ignored, or not implemented.
- the mutual coupling or direct coupling or communication connection shown or discussed may be through some communication interfaces, and the indirect coupling or communication connection of devices or units may be in electrical, mechanical or other forms.
- a unit described as a separate component may or may not be physically separated, and a component displayed as a unit may or may not be a physical unit, that is, it may be located in one place, or may be distributed to multiple network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.
- each functional module in each embodiment of the present application may be integrated to form an independent part, each module may exist independently, or two or more modules may be integrated to form an independent part.
- the functions are realized in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium.
- the technical solution of the present application is essentially or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present application.
- the aforementioned storage medium includes: various media that can store program codes such as U disk, mobile hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disk.
Abstract
本申请提供一种商品分配方法、装置、电子设备和计算机存储介质，方法包括：获取历史订单信息和前瞻订单信息，历史订单信息是指已完成的订单信息，前瞻订单信息是指未执行的订单信息；根据历史订单信息中的各商品的历史订单行数量，将各商品均衡分配到各个分拣站的固定货位上；其中，各商品的历史订单行数量表示各商品在历史订单信息中出现的次数；根据前瞻订单信息和固定货位上的商品信息，确定各个分拣站的固定货位上的商品的前瞻订单行数量；根据各个分拣站的固定货位上的商品的前瞻订单行数量，确定分配到各个分拣站的机动货位上的商品，从而解决不同分拣站的作业员的作业量不均衡而导致整体作业效率低下的问题。
Description
本申请涉及物流仓储领域，具体而言，涉及一种商品分配方法、装置、电子设备和计算机存储介质。
拆零拣货是连锁超市、药店等零售行业物流仓库常见的作业模式。在进行拆零拣货时，作业员在预先分配好商品的分拣站中进行拣货。现有的商品分配方式中，主要根据商品的类别、品种、体积等特性将商品分配到各个分拣站中。
但是，由于需求订单中商品的品种和数量存在波动性，不同分拣站的作业员的作业量往往存在较大差距，同一时刻，有的分拣站中的作业员空闲，有的分拣站中的作业员十分忙碌，不同分拣站的作业员的作业量不均衡导致整体作业效率低下。
发明内容
本申请实施例的目的在于提供一种商品分配方法、装置、电子设备和计算机存储介质，用以解决不同分拣站的作业员的作业量不均衡而导致整体作业效率低下的问题。
第一方面，本发明提供一种商品分配方法，包括：获取历史订单信息和前瞻订单信息，所述历史订单信息是指已完成的订单信息，所述前瞻订单信息是指未执行的订单信息；根据所述历史订单信息中的各商品的历史订单行数量，将各商品均衡分配到各个分拣站的固定货位上；其中，所述各商品的历史订单行数量表示所述各商品在所述历史订单信息中出现的次数；根据所述前瞻订单信息和所述固定货位上的商品信息，确定各个所述分拣站的固定货位上的商品的前瞻订单行数量；根据各个所述分拣站的固定货位上的商品的前瞻订单行数量，确定分配到各个所述分拣站的机动货位上的商品。
本申请实施例中，根据历史订单信息将商品均衡分配到各个分拣站的固定货位上，实现在较长一段时间内，各个分拣站的作业量能较为均衡。根据前瞻订单信息确定各个分拣站的机动货位上的商品，保证在前瞻订单信息下各个分拣站的作业量能较为均衡。通过对固定货位和机动货位的分配，使得各个分拣站的作业量较为均衡，从而提高所有分拣站的整体工作效率。
在可选的实施方式中，每个所述分拣站包括多个固定货位，所述多个固定货位包括第一固定货位和多个剩余固定货位，每个所述固定货位用于存放一种商品；所述根据所述历史订单信息中的各商品的历史订单行数量，将各商品均衡分配到各个分拣站的固定货位上，包括：根据所述历史订单信息确定每种商品的历史订单行数量，并将各种商品按照所述历史订单行数量从大到小排序；按照各种商品的所述历史订单行数量从大到小的顺序，依次为每个所述分拣站的第一固定货位分配一种商品；将剩余商品均衡分配到各个所述分拣站的剩余固定货位上。
本申请实施例中，订单行越多，说明该种商品需要分拣的次数越多，作业员分拣该种商品的作业量也越大，因此，先将商品中对应作业量较大的几个商品分配到不同的分拣 站中，然后将剩余的各种商品均衡分配到各个分拣站的剩余固定货位上，从而使得各个分拣站的作业量相对均衡。
在可选的实施方式中，所述将剩余商品均衡分配到各个所述分拣站的剩余固定货位上，包括：根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q
ave，所述第一平均订单行数量q
ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；针对一个分拣站，执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从小到大排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；S3：比较q
sum与q
ave*(n
c+1)，若q
sum大于或等于q
ave*(n
c+1)，则进入S4；若q
sum小于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum大于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到当前分拣站的一个所述剩余固定货位中，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；S5：将剩余的所有商品中，历史订单行数量最多的商品分配到当前分拣站的一个所述剩余固定货位，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；切换至下一个分拣站，重复S1-S5，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
本申请实施例中，在对每个剩余固定货位分配商品时，由于考虑了每个分拣站的每个固定货位的第一平均订单行数量q
ave，从而保证每个分拣站的作业量较均衡，提高了分拣站的在后续对订单进行分拣时的整体效率。
在可选的实施方式中，所述将剩余商品均衡分配到各个所述分拣站的剩余固定货位上，包括：根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q
ave，所述第一平均订单行数量q
ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从小到大排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；S3：比较q
sum与q
ave*(n
c+1)，若q
sum大于或等于q
ave*(n
c+1)，则进入S4；若q
sum小于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum大于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到一个分拣站的一个所述剩余固定货位中，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品；S5：将剩余的所有商品中，历史订单行数量最多的商品分配到一个分拣站的一个所述剩余固定货位，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
在可选的实施方式中，每个所述分拣站包括多个固定货位，所述多个固定货位包括第一固定货位和多个剩余固定货位，每个所述固定货位用于存放一种商品；所述根据所述历史订单信息中的各商品的历史订单行数量，将各商品均衡分配到各个分拣站的固定货位上，包括：根据所述历史订单信息确定每种商品的历史订单行数量，并将各种商品按照所述历史订单行数量从小到大排序；按照各种商品的所述历史订单行数量从小到大的顺序，依次为每个所述分拣站的第一固定货位分配一种商品；将剩余商品均衡分配到各个所述分拣站的剩余固定货位上。
在可选的实施方式中，所述将剩余商品均衡分配到各个所述分拣站的剩余固定货位上，包括：根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量， 确定第一平均订单行数量q
ave，所述第一平均订单行数量q
ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；针对一个分拣站，执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从大到小排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；S3：比较q
sum与q
ave*(n
c+1)，若q
sum小于或等于q
ave*(n
c+1)，则进入S4；若q
sum大于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum小于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到当前分拣站的一个所述剩余固定货位中，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；S5：将剩余的所有商品中，历史订单行数量最少的商品分配到当前分拣站的一个所述剩余固定货位，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；切换至下一个分拣站，重复S1-S5，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
在可选的实施方式中，所述将剩余商品均衡分配到各个所述分拣站的剩余固定货位上，包括：根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q
ave，所述第一平均订单行数量q
ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从大到小排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；S3：比较q
sum与q
ave*(n
c+1)，若q
sum小于或等于q
ave*(n
c+1)，则进入S4；若q
sum大于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum小于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到一个分拣站的一个所述剩余固定货位中，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品；S5：将剩余的所有商品中，历史订单行数量最少的商品分配到一个分拣站的一个所述剩余固定货位，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
在可选的实施方式中，所述根据各个所述分拣站的固定货位上的商品的前瞻订单行数量，确定分配到各个所述分拣站的机动货位上的商品，包括：根据所述前瞻订单信息将各个所述分拣站按照各个分拣站的订单行数量大小进行排序，并确定每个所述分拣站的第二平均订单行数量；确定第一分拣站中的第一商品，所述第一分拣站为所述分拣站中订单行总数量最多的分拣站，所述第一商品为所述第一分拣站中订单行数量最多的商品；将所述第一商品分配到第二分拣站的机动货位上，并将所述第一商品对应的部分订单行或全部订单行分配到所述第二分拣站中，以使所述第一分拣站的订单行数量与所述第二平均订单行数量的差值小于预设阈值，并更新各个所述分拣站的订单行数，所述第二分拣站为所述分拣站中订单行数量最少的分拣站；以此类推，直至每一个所述分拣站的订单行数量与所述第二平均订单行数量的差值小于预设阈值。
本申请实施例中，将订单行数最多的分拣站中订单行数最多的商品分配到订单行数最少的分拣站的机动货位上，并重复上述过程，直至每个分拣站的订单行数量与第二平均订单行数量的差值小于预设阈值，从而保证各个分拣站的作业量较为均衡，从而提高拆零分拣的整体工作效率。
第二方面，本发明提供一种商品分配装置，所述装置包括：获取模块，用于获取历史订单信息和前瞻订单信息，所述历史订单信息是指已完成的订单信息，所述前瞻订单信 息是指未执行的订单信息；分配模块，用于根据所述历史订单信息中的各商品的历史订单行数量，将各商品均衡分配到各个分拣站的固定货位上；其中，所述各商品的历史订单行数量表示所述各商品在所述历史订单信息中出现的次数；根据所述前瞻订单信息和所述固定货位上的商品信息，确定各个所述分拣站的固定货位上的商品的前瞻订单行数量；根据各个所述分拣站的固定货位上的商品的前瞻订单行数量，确定分配到各个所述分拣站的机动货位上的商品。
在可选的实施方式中，每个所述分拣站包括多个固定货位，所述多个固定货位包括第一固定货位和多个剩余固定货位，每个所述固定货位用于存放一种商品，所述分配模块还用于根据所述历史订单信息确定每种商品的历史订单行数量，并将各种商品按照所述历史订单行数量从大到小排序；按照各种商品的所述历史订单行数量从大到小的顺序，依次为每个所述分拣站的第一固定货位分配一种商品；将剩余商品均衡分配到各个所述分拣站的剩余固定货位上。
在可选的实施方式中，所述分配模块还用于根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q
ave，所述第一平均订单行数量q
ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；针对一个分拣站，执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从小到大排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；S3：比较q
sum与q
ave*(n
c+1)，若q
sum大于或等于q
ave*(n
c+1)，则进入S4；若q
sum小于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum大于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到当前分拣站的一个所述剩余固定货位中，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；S5：将剩余的所有商品中，历史订单行数量最多的商品分配到当前分拣站的一个所述剩余固定货位，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；切换至下一个分拣站，重复S1-S5，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
在可选的实施方式中，所述分配模块还用于根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q
ave，所述第一平均订单行数量q
ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从小到大排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；S3：比较q
sum与q
ave*(n
c+1)，若q
sum大于或等于q
ave*(n
c+1)，则进入S4；若q
sum小于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum大于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到一个分拣站的一个所述剩余固定货位中，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品；S5：将剩余的所有商品中，历史订单行数量最多的商品分配到一个分拣站的一个所述剩余固定货位，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
在可选的实施方式中，每个所述分拣站包括多个固定货位，所述多个固定货位包括第一固定货位和多个剩余固定货位，每个所述固定货位用于存放一种商品，所述分配模块还用于根据所述历史订单信息确定每种商品的历史订单行数量，并将各种商品按照所述 历史订单行数量从小到大排序；按照各种商品的所述历史订单行数量从小到大的顺序，依次为每个所述分拣站的第一固定货位分配一种商品；将剩余商品均衡分配到各个所述分拣站的剩余固定货位上。
在可选的实施方式中，所述分配模块还用于根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q
ave，所述第一平均订单行数量q
ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；针对一个分拣站，执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从大到小排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；S3：比较q
sum与q
ave*(n
c+1)，若q
sum小于或等于q
ave*(n
c+1)，则进入S4；若q
sum大于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum小于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到当前分拣站的一个所述剩余固定货位中，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；S5：将剩余的所有商品中，历史订单行数量最少的商品分配到当前分拣站的一个所述剩余固定货位，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；切换至下一个分拣站，重复S1-S5，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
在可选的实施方式中，所述分配模块还用于根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q
ave，所述第一平均订单行数量q
ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从大到小排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；S3：比较q
sum与q
ave*(n
c+1)，若q
sum小于或等于q
ave*(n
c+1)，则进入S4；若q
sum大于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum小于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到一个分拣站的一个所述剩余固定货位中，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品；S5：将剩余的所有商品中，历史订单行数量最少的商品分配到一个分拣站的一个所述剩余固定货位，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
在可选的实施方式中，所述分配模块还用于根据所述前瞻订单信息将各个所述分拣站按照各个分拣站的订单行数量大小进行排序，并确定每个所述分拣站的第二平均订单行数量；确定第一分拣站中的第一商品，所述第一分拣站为所述分拣站中订单行总数量最多的分拣站，所述第一商品为所述第一分拣站中订单行数量最多的商品；将所述第一商品分配到第二分拣站的机动货位上，并将所述第一商品对应的部分订单行或全部订单行分配到所述第二分拣站中，以使所述第一分拣站的订单行数量与所述第二平均订单行数量的差值小于预设阈值，并更新各个所述分拣站的订单行数，所述第二分拣站为所述分拣站中订单行数量最少的分拣站；以此类推，直至每一个所述分拣站的订单行数量与所述第二平均订单行数量的差值小于预设阈值。
第三方面，本发明提供一种电子设备，包括：处理器、存储器和总线；所述处理器和所述存储器通过所述总线完成相互间的通信；所述存储器存储有可被所述处理器执行的程序指令，所述处理器调用所述程序指令能够执行如前述实施方式任一项所述的方法。
第四方面，本发明提供一种计算机存储介质，所述计算机存储介质设有计算机指令，所述计算机指令被计算机运行时，所述计算机执行如前述实施方式中任一项所述的方法。
为了更清楚地说明本申请实施例的技术方案，下面将对本申请实施例中所需要使用的附图作简单地介绍，应当理解，以下附图仅示出了本申请的某些实施例，因此不应被看作是对范围的限定，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他相关的附图。
图1为本申请实施例提供的一种商品分配方法流程图；
图2为本申请实施例提供的一种商品分配装置的结构框图；
图3为本申请实施例提供的一种电子设备的结构框图。
图标：200-商品分配装置；201-获取模块；202-分配模块；300-电子设备；301-处理器；302-通信接口；303-存储器；304-总线。
下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行描述。
拆零拣货是连锁超市、药店等零售行业物流仓库常见的作业模式。在进行拆零拣货时，作业员在预先分配好商品的分拣站中进行拣货。现有的商品分配方式中，主要根据商品的类别、品种、体积等特性将商品分配到各个分拣站中。
但是，由于需求订单中商品的品种和数量存在波动性，不同分拣站的作业员的作业量往往存在较大差距，同一时刻，有的分拣站中的作业员空闲，有的分拣站中的作业员十分忙碌，不同分拣站的作业员的作业量不均衡导致整体作业效率低下。
基于此，本申请实施例提供一种商品分配方法、装置、电子设备和计算机存储介质，用于解决上述问题。
以下对本申请实施例进行详细介绍。
请参阅图1，图1为本申请实施例提供的一种商品分配方法流程图，该商品分配方法可以包括如下步骤：
步骤S101：获取历史订单信息和前瞻订单信息。
步骤S102：根据历史订单信息中的各商品的历史订单行数量，将各商品均衡分配到各个分拣站的固定货位上。
步骤S103：根据前瞻订单信息和固定货位上的商品信息，确定各个分拣站的固定货位上的商品的前瞻订单行数量。
步骤S104：根据各个分拣站的固定货位上的商品的前瞻订单行数量，确定分配到各个分拣站的机动货位上的商品。
下面将对上述流程进行详细说明。
步骤S101：获取历史订单信息和前瞻订单信息。
本申请实施例中，为了能平衡各个分拣站中作业员的作业量，需要根据历史订单信息和前瞻订单信息将商品分配到各个分拣站中。其中，历史订单信息可以为上一个月或 上一周的订单信息(即已经分拣过的订单)，前瞻订单信息可以为接下来一个小时或者二个小时的订单信息(即将要进行分拣的订单)。需要说明的是，历史订单信息对应的时间也可以是前两日或是前三日，前瞻订单信息对应的时间也可以是接下来三小时或者一天，本申请对此不作具体限定。
具体地，历史订单信息和前瞻订单信息包括订单对应时间内所有商品的订单行信息。其中，一个订单行对应一个订单中的一种商品。举例来说，一个订单中，涉及了5种商品，则该订单有5个订单行。
步骤S102：根据历史订单信息中的各商品的历史订单行数量，将各商品均衡分配到各个分拣站的固定货位上。
本申请实施例中，历史订单信息中的商品的订单行数量表示商品在历史订单信息中出现的次数。根据历史订单信息中的每个订单的订单行信息，可以确定每种商品的订单行数量。本申请实施例提出两种将各商品均衡分配到各个分拣站的固定货位上的方式。以下分别对这两种分配方式进行介绍。
作为一种可选的实施方式，步骤S102可以包括如下步骤：
第一步，根据历史订单信息确定每种商品的订单行数量，并将各种商品按照历史订单行数量从大到小排序；
第二步，按照各种商品的历史订单行数量从大到小的顺序，依次为每个分拣站的第一固定货位分配一种商品；
第三步，将剩余商品均衡分配到各个分拣站的剩余固定货位上。
本申请实施例中，每个分拣站上设置有多个固定货位，其中，固定货位分为第一固定货位和多个剩余固定货位。每个固定货位用于存放一种商品。不同的固定货位上存放的商品均不相同。每个分拣站的固定货位的数量相同。所有分拣站的固定货位的数量总和不少于商品的种类数量。举例来说，假如商品有20种，分拣站有4个，则每个分拣站至少设置有5个固定货位。
根据商品种类的数量多少，可以增加或减少每个分拣站的固定货位的数量，由于每一个分拣站的大小是固定的(即货位的数量是固定的)，因此，根据商品种类的数量多少，选择不同数量的货位作为固定货位。举例来说，例如，若在一次订单信息中，商品有20种，分拣站有4个，则指定每个分拣站用于存放商品的固定货位为5个。若下一次订单信息种，商品有24种，分拣站有4个，指定则每个分拣站用于存放商品的固定货位为6个。
需要说明的是，上述第一固定货位和多个剩余固定货位本质上是相同的，只是为了便于后续描述进行不同的命名。
具体地，首先根据历史订单信息确定每种商品的订单行数量。
举例来说，历史订单信息中有3个订单，订单A、订单B、订单C。
订单A中涉及了商品1、商品2，则订单A中有2个订单行，分别对应商品1和商品2。
订单B中涉及了商品2，则订单B中有1个订单行，对应商品2。
订单C中涉及了商品1、商品2、商品3，则订单B中有3个订单行，分别对应商品1、分拣商品2和商品3。
在该历史订单信息中，商品1的订单行数量为2，商品2的订单行数量为3，商品3的订单行数量为1。
在确定每种商品的订单行数量后，将多种商品按照各自订单行数量从大到小的顺序排序，然后按照多种商品各自的订单行数量从大到小的顺序，依次为每个分拣站的第一固定货位分配一种所述商品。
订单行越多，说明该种商品需要分拣的次数越多，作业员分拣该种商品的作业量也越大，因此，通过上述分配方法，先将商品中对应作业量最大的几个商品分配到不同的分拣站的第一固定货位上，然后将剩余的各种商品均衡分配到各个分拣站的剩余固定货位上，从而使得各个分拣站的作业量相对均衡。
将每个分拣站的第一固定货位分配完成后，将剩余商品均衡分配到各个分拣站的剩余固定货位上。分拣剩余固定货位的方式有多种，以下以2个具体实施方式进行介绍。
可选地，将剩余商品均衡分配到各个分拣站的剩余固定货位可以包括：
根据每种商品的历史订单行数量和各个分拣站的固定货位的总数量，确定第一平均订单行数量q
ave，第一平均订单行数量q
ave为平均到每个分拣站的每个固定货位上的平均订单行数量。
具体地，历史订单信息中，每种商品的订单行数量可以用集合表示为：{q
1,q
2,q
3……q
n}，各个分拣站的固定货位的总数量和为M，则第一平均订单行数量q
ave可以表示为：
针对一个分拣站，执行以下步骤：
S1：将剩余商品中按照历史订单行数量从小到大排序；
S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；
S3：比较q
sum与q
ave*(n
c+1)，若q
sum大于或等于q
ave*(n
c+1)，则进入S4；若q
sum小于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum大于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；
S4：将选出的商品分配到当前分拣站的一个剩余固定货位中，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；
S5：将剩余的所有商品中，历史订单行数量最多的商品分配到当前分拣站的一个剩余固定货位，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品。
具体地，选择一个分拣站，然后按照商品订单行数量从小到大的顺序，依次选出一种商品，将该中商品的订单行数量与该分拣站当前已分配的商品的订单行数相加得到q
sum。将q
sum与q
ave*(n
c+1)继续比较。
由于是按照商品订单行数量从小到大的顺序依次选取的商品，刚开始选择出的商品的订单行数量与该分拣站当前已分配的商品的订单行数相加得到q
sum会小于q
ave*(n
c+1)。若将q
sum小于q
ave*(n
c+1)对应的商品分配到该分拣站中，会使得该分拣站的作业量小于平均作业量，则在后续分配中，会导致其他某些分拣站的作业量大于平均作业量，进而导致作业量不均衡。因此，需要将q
sum大于或等于q
ave*(n
c+1)对应的商品分配到该分配站中。需要说明的是，从小到大的顺序选取商品的过程中，会从某一种商品开始，之后的所有商品确定的q
sum均会大于或等于q
ave*(n
c+1)。为了能使各个分拣站的作业量均衡，将第一个能满足q
sum大于等于q
ave*(n
c+1)的商品分配到该分拣站的固定货位上。
通过循环上述方式，将该分拣站的剩余固定货位均分配一种待分拣商品，从而完成对该分拣站的待分拣商品的分配。
切换至下一个分拣站，重复S1-S5，直至每个分拣站中所有的剩余固定货位上均分配到商品。
具体地，在完成一个分拣站的分配后，对下一个分拣站同样采用上述方式，对下个一个分拣站的剩余固定货位进行分配，如此循环，直至每个分拣站中的所有剩余固定货位上均分配有一种待分拣商品。
通过上述分拣方式，在对每个剩余固定货位分配商品时，由于考虑了每个分拣站的每个固定货位的第一平均订单行数量q
ave，从而保证每个分拣站的作业量较均衡，提高了分拣站的在后续对订单进行分拣时的整体效率。
可选地，将剩余商品均衡分配到各个分拣站的剩余固定货位可以包括以下步骤：
S1：将剩余商品中按照历史订单行数量从小到大排序；
S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；
S3：比较q
sum与q
ave*(n
c+1)，若q
sum大于或等于q
ave*(n
c+1)，则进入S4；若q
sum小于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum大于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；
S4：将选出的商品分配到一个分拣站的一个剩余固定货位中，切换至下一个分拣站，重复进入S2，直至每个分拣站中所有的剩余固定货位上均分配到商品；
S5：将剩余的所有商品中，历史订单行数量最多的商品分配到一个分拣站的一个剩余固定货位，切换至下一个分拣站，重复进入S2，直至每个分拣站中所有的剩余固定货位上均分配到商品。需要说明的是，本实施方式跟上一个实施方式在为每一个固定货位分配商品的逻辑是相同的，不同之处在于，上一个实施方式是先将一个分拣站的所有剩余固定货位分配完成后，再对下一个分拣站的剩余固定货位进行分配，如此循环，直到对所有分拣站的每个剩余固定货位进行分配。而本实施方式是依次对每一个分拣站的一个剩余固定货位进行分配，然后再对每个分拣站的另一个剩余固定货位进行分配，如此循环，直到对所有分拣站的每个剩余固定货位进行分配。
举例来说，有4个分拣站，每个分拣站中有3个剩余固定货位，第一剩余固定货位、第二剩余固定货位、第三剩余固定货位。本实施方式是先依次对4个分拣站的第一剩余固定货位进行分配，分配完成后，对4个分拣站的第二剩余固定货位进行分配，最后再对4个分拣站的第三剩余固定货位进行分配，最终完成分配。上一个实施方式是先对一个分拣站中的三个剩余货位完成分配，然后在对另一个分拣站中的三个剩余货位完成分配，如此循环，直至4个分拣站均完成分配。
作为另一种可选的实施方式，步骤S102可以包括如下步骤：
第一步，根据历史订单信息确定每种商品的历史订单行数量，并将各种商品按照历史订单行数量从小到大排序；
第二步，按照各种商品的历史订单行数量从小到大的顺序，依次为每个分拣站的第一固定货位分配一种商品；
第三步，将剩余商品均衡分配到各个分拣站的剩余固定货位上。
需要说明的是，上一种实施方式在分配固定货位时，先将商品中对应作业量较大的几个待分拣商品分配到不同的分拣站中，然后将剩余的各种待分拣商品均衡分配到各个分拣站的剩余固定货位上。而本实施方式则相反，先将商品中对应作业量最小的几个待分拣商品分配到不同的分拣站的第一固定货位上，然后将剩余的各种待分拣商品均衡分配到各个分拣站的剩余固定货位上。将第一固定货位分配完成后，与前述实施方式相同，在将商品分配到剩余固定货位上时，也存在两种实施方式，即：先将一个分拣站的所有剩余固定货位分配完成后，再对下一个分拣站的剩余固定货位进行分配，如此循环，直到对所有分拣站的每个剩余固定货位进行分配；或是依次对每一个分拣站的一个剩余固定货位进行分配，然后再对每个分拣站的另一个剩余固定货位进行分配，如此循环，直到对所有分拣站的每个剩余固定货位进行分配。
针对这两种剩余固定货位的分配方式，具体过程如下：
作为第一种实施方式，将剩余商品均衡分配到各个分拣站的剩余固定货位可以包括：
针对一个分拣站，执行以下步骤：
S1：将剩余商品中按照历史订单行数量从大到小排序；
S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；
S3：比较q
sum与q
ave*(n
c+1)，若q
sum小于或等于q
ave*(n
c+1)，则进入S4；若q
sum大于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum小于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；
S4：将选出的商品分配到当前分拣站的一个剩余固定货位中，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；
S5：将剩余的所有商品中，历史订单行数量最少的商品分配到当前分拣站的一个所述剩余固定货位，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；
切换至下一个分拣站，重复S1-S5，直至每个分拣站中所有的剩余固定货位上均分配到商品。
作为第二种实施方式，将剩余商品均衡分配到各个分拣站的剩余固定货位可以包括：
S1：将剩余商品中按照历史订单行数量从大到小排序；
S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；
S3：比较q
sum与q
ave*(n
c+1)，若q
sum小于或等于q
ave*(n
c+1)，则进入S4；若q
sum大于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum小于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；
S4：将选出的商品分配到一个分拣站的一个剩余固定货位中，切换至下一个分拣站，重复进入S2，直至每个分拣站中所有的剩余固定货位上均分配到商品；
S5：将剩余的所有商品中，历史订单行数量最少的商品分配到一个分拣站的一个剩余固定货位，切换至下一个分拣站，重复进入S2，直至每个分拣站中所有的剩余固定货位上均分配到商品。
本申请实施方式中，将商品分配到剩余固定货位上的两种分配方式与前述实施方式中的两种分配方式相对应，为使说明书简洁，相同或相近部分可互相参照，在此不再赘述。
为方便说明，下面对步骤S103和步骤S104一并介绍。
步骤S103：根据前瞻订单信息和固定货位上的商品信息，确定各个分拣站的固定货位上的商品的前瞻订单行数量。
步骤S104：根据各个分拣站的固定货位上的商品的前瞻订单行数量，确定分配到各个分拣站的机动货位上的商品。
本申请实施例中，根据历史订单信息将商品均衡分配到各个分拣站的固定货位，由于历史订单信息对应上一月或是上一周的订单内容，其包含了一段较长时间内的订单信息，因此，根据历史订单信息确定各个固定货位的商品的分配方法，可以使得各个分拣站的作业量在较长一段时间内相对均衡。但是，由于前瞻订单信息的中各种商品出现的频率可能与历史订单信息中各种商品出现的频率不同，在短时间内(例如一个小时或几个小时内)，各个分拣站的作业量还是会有一定差别。
因此，为了平衡短时间内各个分拣站的作业量，本申请实施例在各个分拣站中除了设置固定货位外，还会设置机动货位。
由于前瞻订单信息和历史订单信息存在差异，因此，根据前瞻订单信息和当前各个分拣站的固定货位的分配情况，可以确定出在前瞻订单下，各个分拣站的商品的订单行数量，进而根据各个分拣站的商品的订单行数量，对各个分拣站上的机动货位分配商品，从而平衡各个分拣站的作业量。
作为一种可选的实施方式，步骤S104可以包括如下实施方式：
第一步，根据前瞻订单信息将各个分拣站按照各个分拣站的订单行数量大小进行排序，并确定每个分拣站的第二平均订单行数量。
具体地，将前瞻订单信息下各个分拣站按照订单行数量从大到小排列，并且根据前瞻订单信息确定每个分拣站的第二平均订单行数量。其中，第二平均订单行数量为前瞻订单中的订单行总数除以分拣站的数量。
第二步，确定第一分拣站中的第一商品，第一分拣站为分拣站中订单行总数量最多的分拣站，第一商品为第一分拣站中订单行数量最多的商品。
第三步，将第一商品分配到第二分拣站的机动货位上，并将第一商品对应的部分订单行或全部订单行分配到第二分拣站中，以使第一分拣站的订单行数量与第二平均订单行数量的差值小于预设阈值，并更新各个分拣站的订单行数，第二分拣站为分拣站中订单行数量最少的分拣站；以此类推，直至每一个分拣站的订单行数量与第二平均订单行数量的差值小于预设阈值。
本申请实施例中，根据前瞻订单信息，确定出分拣站中订单行数量最多的第一分拣站以及第一分拣站中订单行数量最多的第一商品。将第一商品分配到分拣站中订单行数量最少的第二分拣站的机动货位上，并将第一商品对应的部分订单行分配到第二分拣站中，然后更新各个分拣站的订单行数。
不断重复上述方法，直至每一个分拣站的订单行数量与第二平均订单行数量的差值小于预设阈值。由于不同固定货位之间的商品均不相同，在分配机动货位后，也可能无法 使得每个分拣站的订单行数量与第二平均订单行数量完全一样(即每个分拣站的作业量完全相同)。因此，设置预设阈值，当每一个分拣站的订单行数量与第二平均订单行数量的差值小于预设阈值时，则认为每个分拣站的当前作业量较为均衡。
需要说明的是，机动货位的数量可以为一个或多个，本申请对此不作具体限定，可以根据商品的实际情况进行选择。
通过上述方法，将订单行数最多的分拣站中订单行数最多的商品分配到订单行数最少的分拣站的机动货位上，并重复上述过程，直至每个分拣站的订单行数量与第二平均订单行数量的差值小于预设阈值，从而保证各个分拣站的作业量较为均衡，从而提高拆零分拣的整体工作效率。
本申请实施例提供一种商品分配方法，根据历史订单信息将商品均衡分配到各个分拣站的固定货位上，实现在较长一段时间内，各个分拣站的作业量能较为均衡。根据前瞻订单信息确定各个分拣站的机动货位上的商品，保证在前瞻订单信息下各个分拣站的作业量能较为均衡。通过对固定货位和机动货位的分配，使得各个分拣站的作业量较为均衡，从而提高所有分拣站的整体工作效率。
基于同一发明构思，本申请实施例中还提供一种商品分配装置。请参阅图2，图2为本申请实施例提供的一种商品分配装置的结构框图，该商品分配装置200包括：
获取模块201，用于获取历史订单信息和前瞻订单信息，所述历史订单信息是指已完成的订单信息，所述前瞻订单信息是指未执行的订单信息；
分配模块202，用于根据所述历史订单信息中的各商品的历史订单行数量，将各商品均衡分配到各个分拣站的固定货位上；其中，所述各商品的历史订单行数量表示所述各商品在所述历史订单信息中出现的次数；根据所述前瞻订单信息和所述固定货位上的商品信息，确定各个所述分拣站的固定货位上的商品的前瞻订单行数量；根据各个所述分拣站的固定货位上的商品的前瞻订单行数量，确定分配到各个所述分拣站的机动货位上的商品。
在可选的实施方式中，每个所述分拣站包括多个固定货位，所述多个固定货位包括第一固定货位和多个剩余固定货位，每个所述固定货位用于存放一种所述商品，所述分配模块202还用于根据所述历史订单信息确定每种商品的历史订单行数量，并将各种商品按照所述历史订单行数量从大到小排序；按照各种商品的所述历史订单行数量从大到小的顺序，依次为每个所述分拣站的第一固定货位分配一种商品；将剩余商品均衡分配到各个所述分拣站的剩余固定货位上。
在可选的实施方式中，所述分配模块202还用于根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q
ave，所述第一平均订单行数量q
ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；针对一个分拣站，执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从小到大排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；S3：比较q
sum与q
ave*(n
c+1)，若q
sum大于或等于q
ave*(n
c+1)，则进入S4；若q
sum小于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum大于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到当前分拣站的一个所述剩余固定货位中，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；S5：将剩余的所有商品 中，历史订单行数量最多的商品分配到当前分拣站的一个所述剩余固定货位，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；切换至下一个分拣站，重复S1-S5，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
在可选的实施方式中，所述分配模块202还用于根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q
ave，所述第一平均订单行数量q
ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从小到大排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；S3：比较q
sum与q
ave*(n
c+1)，若q
sum大于或等于q
ave*(n
c+1)，则进入S4；若q
sum小于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum大于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到一个分拣站的一个所述剩余固定货位中，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品；S5：将剩余的所有商品中，历史订单行数量最多的商品分配到一个分拣站的一个所述剩余固定货位，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
在可选的实施方式中，每个所述分拣站包括多个固定货位，所述多个固定货位包括第一固定货位和多个剩余固定货位，每个所述固定货位用于存放一种商品，所述分配模块202还用于根据所述历史订单信息确定每种商品的历史订单行数量，并将各种商品按照所述历史订单行数量从小到大排序；按照各种商品的所述历史订单行数量从小到大的顺序，依次为每个所述分拣站的第一固定货位分配一种商品；将剩余商品均衡分配到各个所述分拣站的剩余固定货位上。
在可选的实施方式中，所述分配模块202还用于根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q
ave，所述第一平均订单行数量q
ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；针对一个分拣站，执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从大到小排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；S3：比较q
sum与q
ave*(n
c+1)，若q
sum小于或等于q
ave*(n
c+1)，则进入S4；若q
sum大于q
ave*(n
c+1)，则进入S2；若剩余的所有商品均不满足q
sum小于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到当前分拣站的一个所述剩余固定货位中，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；S5：将剩余的所有商品中，历史订单行数量最少的商品分配到当前分拣站的一个所述剩余固定货位，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；切换至下一个分拣站，重复S1-S5，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
在可选的实施方式中，所述分配模块202还用于根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q
ave，所述第一平均订单行数量q
ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从大到小排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q
sum；S3：比较q
sum与q
ave*(n
c+1)，若q
sum小于或等于q
ave*(n
c+1)，则进入S4；若q
sum大于q
ave*(n
c+1)，则进入S2；若剩余的所有商品 均不满足q
sum小于或等于q
ave*(n
c+1)，则进入S5；其中，n
c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到一个分拣站的一个所述剩余固定货位中，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品；S5：将剩余的所有商品中，历史订单行数量最少的商品分配到一个分拣站的一个所述剩余固定货位，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
在可选的实施方式中，所述分配模块202还用于根据所述前瞻订单信息将各个所述分拣站按照各个分拣站的订单行数量大小进行排序，并确定每个所述分拣站的第二平均订单行数量；确定第一分拣站中的第一商品，所述第一分拣站为所述分拣站中订单行总数量最多的分拣站，所述第一商品为所述第一分拣站中订单行数量最多的商品；将所述第一商品分配到第二分拣站的机动货位上，并将所述第一商品对应的部分订单行或全部订单行分配到所述第二分拣站中，以使所述第一分拣站的订单行数量与所述第二平均订单行数量的差值小于预设阈值，并更新各个所述分拣站的订单行数，所述第二分拣站为所述分拣站中订单行数量最少的分拣站；以此类推，直至每一个所述分拣站的订单行数量与所述第二平均订单行数量的差值小于预设阈值。
请参阅图3，图3为本申请实施例的电子设备300的结构示意图，该电子设备300包括：至少一个处理器301，至少一个通信接口302，至少一个存储器303和至少一个总线304。其中，总线304用于实现这些组件直接的连接通信，通信接口302用于与其他节点设备进行信令或数据的通信，存储器303存储有处理器301可执行的机器可读指令。当电子设备300运行时，处理器301与存储器303之间通过总线304通信，机器可读指令被处理器301调用时执行上述占据栅格地图构建方法。
处理器301可以是一种集成电路芯片，具有信号处理能力。上述处理器301可以是通用处理器，包括中央处理器(Central Processing Unit，CPU)、网络处理器(Network Processor，NP)等；还可以是数字信号处理器(Digital Signal Processing，DSP)、专用集成电路(Application Specific Integrated Circuit，ASIC)、现成可编程门阵列(Field-Programmable Gate Array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。其可以实现或者执行本申请实施例中公开的各种方法、步骤及逻辑框图。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。
存储器303可以包括但不限于随机存取存储器(Random Access Memory，RAM)，只读存储器(Read Only Memory，ROM)，可编程只读存储器(Programmable Read-Only Memory，PROM)，可擦除只读存储器(Erasable Programmable Read-Only Memory，EPROM)，电可擦除只读存储器(Electric Erasable Programmable Read-Only Memory，EEPROM)等。
可以理解，图3所示的结构仅为示意，电子设备300还可包括比图3中所示更多或者更少的组件，或者具有与图3所示不同的配置。图3中所示的各组件可以采用硬件、软件或其组合实现。于本申请实施例中，电子设备300可以是，但不限于台式机、笔记本电脑、智能手机、智能穿戴设备、车载设备等实体设备，还可以是虚拟机等虚拟设备。另外，电子设备300也不一定是单台设备，还可以是多台设备的组合，例如服务器集群，等等。
此外，本申请实施例还提供一种计算机存储介质，该计算机存储介质上存储有计算机程序，该计算机程序被计算机运行时，执行如上述实施例中占据栅格地图构建方法的 步骤。
在本申请所提供的实施例中，应该理解到，所揭露装置和方法，可以通过其它的方式实现。以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，又例如，多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些通信接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
另外，作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
再者，在本申请各个实施例中的各功能模块可以集成在一起形成一个独立的部分，也可以是各个模块单独存在，也可以两个或两个以上模块集成形成一个独立的部分。
需要说明的是，功能如果以软件功能模块的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(Read-Only Memory，ROM)随机存取存储器(Random Access Memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
在本文中，诸如第一和第二等之类的关系术语仅仅用来将一个实体或者操作与另一个实体或操作区分开来，而不一定要求或者暗示这些实体或操作之间存在任何这种实际的关系或者顺序。
以上所述仅为本申请的实施例而已，并不用于限制本申请的保护范围，对于本领域的技术人员来说，本申请可以有各种更改和变化。凡在本申请的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本申请的保护范围之内。
Claims (11)
- 一种商品分配方法，其特征在于，包括：获取历史订单信息和前瞻订单信息，所述历史订单信息是指已完成的订单信息，所述前瞻订单信息是指未执行的订单信息；根据所述历史订单信息中的各商品的历史订单行数量，将各商品均衡分配到各个分拣站的固定货位上；其中，所述各商品的历史订单行数量表示所述各商品在所述历史订单信息中出现的次数；根据所述前瞻订单信息和所述固定货位上的商品信息，确定各个所述分拣站的固定货位上的商品的前瞻订单行数量；根据各个所述分拣站的固定货位上的商品的前瞻订单行数量，确定分配到各个所述分拣站的机动货位上的商品。
- 根据权利要求1所述的方法，其特征在于，每个所述分拣站包括多个固定货位，所述多个固定货位包括第一固定货位和多个剩余固定货位，每个所述固定货位用于存放一种商品；所述根据所述历史订单信息中的各商品的历史订单行数量，将各商品均衡分配到各个分拣站的固定货位上，包括：根据所述历史订单信息确定每种商品的历史订单行数量，并将各种商品按照所述历史订单行数量从大到小排序；按照各种商品的所述历史订单行数量从大到小的顺序，依次为每个所述分拣站的第一固定货位分配一种商品；将剩余商品均衡分配到各个所述分拣站的剩余固定货位上。
- 根据权利要求2所述的方法，其特征在于，所述将剩余商品均衡分配到各个所述分拣站的剩余固定货位上，包括：根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q ave，所述第一平均订单行数量q ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；针对一个分拣站，执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从小到大排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q sum；S3：比较q sum与q ave*(n c+1)，若q sum大于或等于q ave*(n c+1)，则进入S4；若q sum小于q ave*(n c+1)，则进入S2；若剩余的所有商品均不满足q sum大于或等于q ave*(n c+1)，则进入S5；其中，n c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到当前分拣站的一个所述剩余固定货位中，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；S5：将剩余的所有商品中，历史订单行数量最多的商品分配到当前分拣站的一个所述剩余固定货位，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；切换至下一个分拣站，重复S1-S5，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
- 根据权利要求2所述的方法，其特征在于，所述将剩余商品均衡分配到各个所述分拣站的剩余固定货位上，包括：根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q ave，所述第一平均订单行数量q ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从小到大排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q sum；S3：比较q sum与q ave*(n c+1)，若q sum大于或等于q ave*(n c+1)，则进入S4；若q sum小于q ave*(n c+1)，则进入S2；若剩余的所有商品均不满足q sum大于或等于q ave*(n c+1)，则进入S5；其中，n c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到一个分拣站的一个所述剩余固定货位中，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品；S5：将剩余的所有商品中，历史订单行数量最多的商品分配到一个分拣站的一个所述剩余固定货位，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
- 根据权利要求1所述的方法，其特征在于，每个所述分拣站包括多个固定货位，所述多个固定货位包括第一固定货位和多个剩余固定货位，每个所述固定货位用于存放一种商品；所述根据所述历史订单信息中的各商品的历史订单行数量，将各商品均衡分配到各个分拣站的固定货位上，包括：根据所述历史订单信息确定每种商品的历史订单行数量，并将各种商品按照所述历史订单行数量从小到大排序；按照各种商品的所述历史订单行数量从小到大的顺序，依次为每个所述分拣站的第一固定货位分配一种商品；将剩余商品均衡分配到各个所述分拣站的剩余固定货位上。
- 根据权利要求5所述的方法，其特征在于，所述将剩余商品均衡分配到各个所述分拣站的剩余固定货位上，包括：根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q ave，所述第一平均订单行数量q ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；针对一个分拣站，执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从大到小排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q sum；S3：比较q sum与q ave*(n c+1)，若q sum小于或等于q ave*(n c+1)，则进入S4；若q sum大于q ave*(n c+1)，则进入S2；若剩余的所有商品均不满足q sum小于或等于q ave*(n c+1)，则进入S5；其中，n c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到当前分拣站的一个所述剩余固定货位中，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；S5：将剩余的所有商品中，历史订单行数量最少的商品分配到当前分拣站的一个所述剩余固定货位，重复进入S2，至当前分拣站中所有的剩余固定货位上都分配到商品；切换至下一个分拣站，重复S1-S5，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
- 根据权利要求2所述的方法，其特征在于，所述将剩余商品均衡分配到各个所述分拣站的剩余固定货位上，包括：根据所述每种商品的历史订单行数量和各个所述分拣站的固定货位的总数量，确定第一平均订单行数量q ave，所述第一平均订单行数量q ave为平均到每个所述分拣站的每个固定货位上的平均订单行数量；执行以下步骤：S1：将所述剩余商品中按照历史订单行数量从大到小排序；S2：依次选出一种商品与该分拣站当前已分配的商品的历史订单行数相加，得到q sum；S3：比较q sum与q ave*(n c+1)，若q sum小于或等于q ave*(n c+1)，则进入S4；若q sum大于q ave*(n c+1)，则进入S2；若剩余的所有商品均不满足q sum小于或等于q ave*(n c+1)，则进入S5；其中，n c为该分拣站中已经分配商品的固定货位数；S4：将选出的商品分配到一个分拣站的一个所述剩余固定货位中，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品；S5：将剩余的所有商品中，历史订单行数量最少的商品分配到一个分拣站的一个所述剩余固定货位，切换至下一个分拣站，重复进入S2，直至每个所述分拣站中所有的剩余固定货位上均分配到商品。
- 根据权利要求1所述的方法，其特征在于，所述根据各个所述分拣站的固定货位上的商品的前瞻订单行数量，确定分配到各个所述分拣站的机动货位上的商品，包括：根据所述前瞻订单信息将各个所述分拣站按照各个分拣站的订单行数量大小进行排序，并确定每个所述分拣站的第二平均订单行数量；确定第一分拣站中的第一商品，所述第一分拣站为所述分拣站中订单行总数量最多的分拣站，所述第一商品为所述第一分拣站中订单行数量最多的商品；将所述第一商品分配到第二分拣站的机动货位上，并将所述第一商品对应的部分订单行或全部订单行分配到所述第二分拣站中，以使所述第一分拣站的订单行数量与所述第二平均订单行数量的差值小于预设阈值，并更新各个所述分拣站的订单行数，所述第二分拣站为所述分拣站中订单行数量最少的分拣站；以此类推，直至每一个所述分拣站的订单行数量与所述第二平均订单行数量的差值小于预设阈值。
- 一种商品分配装置，其特征在于，所述装置包括：获取模块，用于获取历史订单信息和前瞻订单信息，所述历史订单信息是指已完成的订单信息，所述前瞻订单信息是指未执行的订单信息；分配模块，用于根据所述历史订单信息中的各商品的历史订单行数量，将各商品均衡分配到各个分拣站的固定货位上；其中，所述各商品的历史订单行数量表示所述各商品在所述历史订单信息中出现的次数；根据所述前瞻订单信息和所述固定货位上的商品信息，确定各个所述分拣站的固定货位上的商品的前瞻订单行数量；根据各个所述分拣站的固定货位上的商品的前瞻订单行数量，确定分配到各个所述分拣站的机动货位上的商品。
- 一种电子设备，其特征在于，包括：处理器、存储器和总线；所述处理器和所述存储器通过所述总线完成相互间的通信；所述存储器存储有可被所述处理器执行的程序指令， 所述处理器调用所述程序指令能够执行如权利要求1-8任一项所述的方法。
- 一种计算机存储介质，其特征在于，所述计算机存储介质设有计算机指令，所述计算机指令被计算机运行时，所述计算机执行如权利要求1-8中任一项所述的方法。
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110916449.2 | 2021-08-11 | ||
| CN202110916449.2A CN113360839B (zh) | 2021-08-11 | 2021-08-11 | 商品分配方法、装置、电子设备和计算机存储介质 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2023015954A1 true WO2023015954A1 (zh) | 2023-02-16 |
Family
ID=77522932
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/CN2022/089420 WO2023015954A1 (zh) | 2021-08-11 | 2022-04-27 | 商品分配方法、装置、电子设备和计算机存储介质 |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN113360839B (zh) |
| WO (1) | WO2023015954A1 (zh) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113360839B (zh) * | 2021-08-11 | 2021-11-19 | 浙江凯乐士科技集团股份有限公司 | 商品分配方法、装置、电子设备和计算机存储介质 |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8952284B1 (en) * | 2008-09-16 | 2015-02-10 | Amazon Technologies, Inc. | Method and apparatus for managing the allocation of items to processing stations in an order fulfillment process |
| CN109978423A (zh) * | 2017-12-28 | 2019-07-05 | 北京京东尚科信息技术有限公司 | 库存调度方法、装置以及计算机可读存储介质 |
| CN110436108A (zh) * | 2019-09-11 | 2019-11-12 | 浙江国自机器人技术有限公司 | 一种基于agv平台的高效动态货物分拣系统 |
| CN111476413A (zh) * | 2020-04-03 | 2020-07-31 | 上海明略人工智能(集团)有限公司 | 基于大数据的仓库储位分配方法及系统 |
| CN113360839A (zh) * | 2021-08-11 | 2021-09-07 | 浙江凯乐士科技集团股份有限公司 | 商品分配方法、装置、电子设备和计算机存储介质 |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11724879B2 (en) * | 2018-06-01 | 2023-08-15 | Beijing Geekplus Technology Co., Ltd. | Management method, device and system applied to goods-to-person system, server and computer storage medium |
| CN111582781B (zh) * | 2020-04-24 | 2023-04-28 | 清华大学深圳国际研究生院 | 一种根据补货订单分配货架的方法及计算机可读存储介质 |
| CN112938301B (zh) * | 2021-02-07 | 2022-10-14 | 苏州牧星智能科技有限公司 | 一种针对配送中心的商品拣选系统与方法 |
| CN112734344A (zh) * | 2021-03-31 | 2021-04-30 | 牧星机器人(江苏)有限公司 | 一种商品仓储中的商品入库优化方法、装置及仓储系统 |
-
2021
- 2021-08-11 CN CN202110916449.2A patent/CN113360839B/zh active Active
-
2022
- 2022-04-27 WO PCT/CN2022/089420 patent/WO2023015954A1/zh unknown
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8952284B1 (en) * | 2008-09-16 | 2015-02-10 | Amazon Technologies, Inc. | Method and apparatus for managing the allocation of items to processing stations in an order fulfillment process |
| CN109978423A (zh) * | 2017-12-28 | 2019-07-05 | 北京京东尚科信息技术有限公司 | 库存调度方法、装置以及计算机可读存储介质 |
| CN110436108A (zh) * | 2019-09-11 | 2019-11-12 | 浙江国自机器人技术有限公司 | 一种基于agv平台的高效动态货物分拣系统 |
| CN111476413A (zh) * | 2020-04-03 | 2020-07-31 | 上海明略人工智能(集团)有限公司 | 基于大数据的仓库储位分配方法及系统 |
| CN113360839A (zh) * | 2021-08-11 | 2021-09-07 | 浙江凯乐士科技集团股份有限公司 | 商品分配方法、装置、电子设备和计算机存储介质 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113360839B (zh) | 2021-11-19 |
| CN113360839A (zh) | 2021-09-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2022057248A1 (zh) | 订单处理方法、装置、设备、系统及存储介质 | |
| JP2021519473A (ja) | Ｇｔｐシステムの管理方法と装置、システム、サーバーならびにコンピュータ記憶媒体 | |
| WO2023015954A1 (zh) | 商品分配方法、装置、电子设备和计算机存储介质 | |
| CN115660380B (zh) | 货到人拣选的订单处理方法及装置 | |
| CN110826953A (zh) | 一种仓库存储设备规划的方法和装置 | |
| CN110689293B (zh) | 一种物品出库的处理方法和装置 | |
| CN111461583A (zh) | 一种库存盘点方法和装置 | |
| CN111507651A (zh) | 应用于人机混合仓库的订单数据处理方法和装置 | |
| CN112966992A (zh) | 一种订单生产方法和装置 | |
| CN111339064A (zh) | 数据倾斜矫正方法、装置及计算机可读存储介质 | |
| JP2003323479A (ja) | 配分処理システム、配分処理装置および配分処理方法 | |
| CN108288139B (zh) | 资源分配方法及装置 | |
| CN111105194A (zh) | 一种商品配货方法、智能装置和计算机可读存储介质 | |
| CN115759929A (zh) | 货物拣选方法、装置、电子设备和可读存储介质 | |
| CN111754059A (zh) | 一种任务组合方法和装置 | |
| CN111768136A (zh) | 库存调度方法和装置 | |
| CN113342781B (zh) | 一种数据迁移的方法、装置、设备及存储介质 | |
| CN110834858A (zh) | 一种在仓库中存储货物的方法和装置 | |
| CN111612259B (zh) | 仓库调拨量确定方法、装置、电子设备及可读存储介质 | |
| CN115099865A (zh) | 一种数据处理方法和装置 | |
| CN113191703A (zh) | 储位分配的方法和装置 | |
| CN112749865A (zh) | 一种资源分配方法和装置 | |
| CN111950830A (zh) | 一种任务分配方法和装置 | |
| CN113449892A (zh) | 仓库管理优化方法、系统、设备和介质 | |
| CN113657821A (zh) | 一种入库方法和装置 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 22854954 Country of ref document: EP Kind code of ref document: A1 |
|
| NENP | Non-entry into the national phase |
Ref country code: DE |