CN116703272A - Method and device for determining sorting grid to which order belongs - Google Patents

Method and device for determining sorting grid to which order belongs Download PDF

Info

Publication number
CN116703272A
CN116703272A CN202310651727.5A CN202310651727A CN116703272A CN 116703272 A CN116703272 A CN 116703272A CN 202310651727 A CN202310651727 A CN 202310651727A CN 116703272 A CN116703272 A CN 116703272A
Authority
CN
China
Prior art keywords
sorting
order
grid
area
sorting grid
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
CN202310651727.5A
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.)
Shanghai 100me Network Technology Co ltd
Original Assignee
Shanghai 100me Network 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 Shanghai 100me Network Technology Co ltd filed Critical Shanghai 100me Network Technology Co ltd
Priority to CN202310651727.5A priority Critical patent/CN116703272A/en
Publication of CN116703272A publication Critical patent/CN116703272A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30—Computing systems specially adapted for manufacturing

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Quality & Reliability (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Warehouses Or Storage Devices (AREA)

Abstract

The embodiment of the application provides a method and a device for determining sorting grids to which orders belong, comprising the following steps: based on the matching relation of the area to which the delivery address belongs, determining a preselected sorting grid which accords with the minimum relation of the area to which the first delivery address of the order to be delivered belongs from sorting grids of stored orders; the matching relation of the distribution address belonging areas comprises a plurality of layers of belonging areas and is matched in sequence from small to large according to the layers of the belonging areas; and after the remaining space of the preselected sorting grid meets the storage space of the order to be distributed, determining the preselected sorting grid as the sorting grid to which the order to be distributed belongs. The sorting grid conforming to the minimum relation of the area with the first delivery address of the order to be delivered is determined to be the pre-selected sorting grid, and then the pre-selected sorting grid of the order to be delivered which can be placed is determined to be the sorting grid to which the order to be delivered belongs, so that the order to be delivered which belongs to a rider is placed in the handover cabinet in a concentrated mode, and the order finding efficiency of the rider is improved.

Description

Method and device for determining sorting grid to which order belongs
Technical Field
The application relates to the technical field of order distribution, in particular to a method and a device for determining sorting grids to which orders belong.
Background
Along with the acceleration of urban life rhythm and the improvement of living standard of people, more and more people need to ensure the quality of life under the condition of saving time and cost. Therefore, in order to distribute the articles to the users in the shortest time, a large number of pre-cabins are distributed around the users by merchants, goods are sent to the pre-cabins from the large cabins according to the replenishment amount of each pre-cabin, then workers in the pre-cabins pack and place the goods of the users in the delivery cabinet according to the orders of the users, and then the riders take the goods required to be distributed out of the delivery cabinet to distribute the goods, and the goods are sent to the hands of the users, so that the purchase demands of the users around the pre-cabins are met.
At present, workers in the front bin can place orders in different communities on different shelves in a scattered mode, so that a rider takes out goods to be distributed from a delivery cabinet in the shelves and then distributes the goods. But can result in a relatively decentralised placement of orders that the rider needs to deliver, resulting in less efficient delivery of the desired goods.
In summary, how to improve the efficiency of the rider to find the goods is a technical problem to be solved currently.
Disclosure of Invention
The embodiment of the application provides a method and a device for determining sorting grids to which orders belong, which are used for solving the problem that in the prior art, the efficiency of a rider in finding goods to be distributed is low.
In a first aspect, an embodiment of the present application provides a method for determining a sorting grid to which an order belongs, including: based on the matching relation of the area to which the delivery address belongs, determining a preselected sorting grid which accords with the minimum relation of the area to which the first delivery address of the order to be delivered belongs from sorting grids of stored orders; the matching relation of the distribution address belonging areas comprises a plurality of layers of belonging areas and is matched in sequence from small to large according to the layers of the belonging areas; and after the remaining space of the preselected sorting grid meets the storage space of the order to be distributed, determining the preselected sorting grid as the sorting grid to which the order to be distributed belongs.
According to the technical scheme, the sorting grid which accords with the minimum relation of the area and the first delivery address of the order to be delivered is determined to be the pre-selected sorting grid, and then the pre-selected sorting grid of the order to be delivered which can be placed is determined to be the sorting grid to which the order to be delivered belongs, so that the order to be delivered which belongs to a rider is placed in the handover cabinet in a concentrated mode, and the order finding efficiency of the rider is improved.
Optionally, the matching relation of the area to which the delivery address belongs comprises the matching of the same cell and the matching of the same area; wherein, the area of the cell is smaller than the area of the patch; based on the matching relation of the area to which the delivery address belongs, a preselected sorting grid which accords with the minimum relation of the area to which the first delivery address of the order to be delivered belongs is determined from sorting grids of stored orders, and the method comprises the following steps: determining whether a second delivery address of the stored order in the sorting grid and a first delivery address of the order to be delivered are in the same cell or not according to the sorting grid of any stored order; if the cell is the same cell, the sorting grid is a preselected sorting grid; if the sorting grids of all stored orders do not meet the requirements of the different communities, determining whether the second delivery address of the stored orders in the sorting grids and the first delivery address of the to-be-delivered orders are the same communities or not according to the sorting grids of any stored orders; if the sorting grids are the same-piece areas, the sorting grids are preselected sorting grids.
Optionally, the pre-selected sorting grid and the first distribution address are the same cell; the method further comprises the steps of: if the remaining space of the preselected sorting grid does not meet the storage space of the order to be distributed, taking the sorting grid with the second distribution address and the first distribution address of the stored order as the same area as the preselected sorting grid; and after the remaining space of the preselected sorting grid meets the storage space of the order to be distributed, determining the preselected sorting grid as the sorting grid to which the order to be distributed belongs.
Optionally, the pre-selected sorting grid and the first distribution address are the same area; the method further comprises the steps of: if the remaining space of the preselected sorting grid does not meet the storage space of the order to be distributed, determining a first target goods shelf meeting the order requirement of the contract area from all goods shelves; determining adjacent sorting grids of the same-area sorting grids in the first target goods shelf as preselected sorting grids; the same-segment sorting grid is a sorting grid with the second delivery address and the first delivery address being the same segment; and after the remaining space of the preselected sorting grid meets the storage space of the order to be distributed, determining the preselected sorting grid as the sorting grid to which the order to be distributed belongs.
Optionally, the adjacent sorting grids are adjacent sorting grids of the same-area sorting grids; or the adjacent sorting grid is the closest sorting grid to the centroid of the sorting grid in the same area in the target goods shelf.
Optionally, the method further comprises: if all the sorting grids of the stored orders do not meet the requirements of the same area or if the first target storage racks meeting the requirements of the area orders are not arranged in all the storage racks, determining second target storage racks meeting the requirements of the number of the idle sorting grids/the number of the area from all the storage racks; and determining the idle sorting grid in the second target goods shelf as the sorting grid to which the to-be-distributed order belongs.
Optionally, the determining the pre-selected sorting grid conforming to the minimum relation of the area to which the first delivery address of the order to be delivered belongs includes: if the weight of the order to be distributed is larger than a first threshold value, determining the order to be distributed as a target weight order; and determining a preselected sorting grid which accords with the minimum relation of the area and the first delivery address of the order to be delivered and meets the requirements of the shelf level from all sorting grids of the stored orders.
In a second aspect, an embodiment of the present application provides a device for determining a sorting grid to which an order belongs, where the device includes an obtaining unit, configured to determine, from sorting grids in which an order is stored, a preselected sorting grid that accords with a minimum relation of a region to which a first delivery address of the order to be delivered belongs, based on a matching relation of the region to which the delivery address belongs; the matching relation of the distribution address belonging areas comprises a plurality of layers of belonging areas and is matched in sequence from small to large according to the layers of the belonging areas; and the processing unit is used for determining the preselected sorting grid as the sorting grid to which the to-be-dispensed order belongs after the remaining space of the preselected sorting grid meets the storage space of the to-be-dispensed order.
Optionally, the matching relation of the area to which the delivery address belongs comprises the matching of the same cell and the matching of the same area; wherein, the area of the cell is smaller than the area of the patch; the acquisition unit is specifically configured to: determining whether a second delivery address of the stored order in the sorting grid and a first delivery address of the order to be delivered are in the same cell or not according to the sorting grid of any stored order; if the cell is the same cell, the sorting grid is a preselected sorting grid; if the sorting grids of all stored orders do not meet the requirements of the different communities, determining whether the second delivery address of the stored orders in the sorting grids and the first delivery address of the to-be-delivered orders are the same communities or not according to the sorting grids of any stored orders; if the sorting grids are the same-piece areas, the sorting grids are preselected sorting grids.
Optionally, the pre-selected sorting grid and the first distribution address are the same cell; the processing unit is further configured to: if the remaining space of the preselected sorting grid does not meet the storage space of the order to be distributed, taking the sorting grid with the second distribution address and the first distribution address of the stored order as the same area as the preselected sorting grid; and after the remaining space of the preselected sorting grid meets the storage space of the order to be distributed, determining the preselected sorting grid as the sorting grid to which the order to be distributed belongs.
Optionally, the pre-selected sorting grid and the first distribution address are the same area; the processing unit is further configured to: if the remaining space of the preselected sorting grid does not meet the storage space of the order to be distributed, determining a first target goods shelf meeting the order requirement of the contract area from all goods shelves; determining adjacent sorting grids of the same-area sorting grids in the first target goods shelf as preselected sorting grids; the same-segment sorting grid is a sorting grid with the second delivery address and the first delivery address being the same segment; and after the remaining space of the preselected sorting grid meets the storage space of the order to be distributed, determining the preselected sorting grid as the sorting grid to which the order to be distributed belongs.
Optionally, the adjacent sorting grids are adjacent sorting grids of the same-area sorting grids; or the adjacent sorting grid is the closest sorting grid to the centroid of the sorting grid in the same area in the target goods shelf.
Optionally, the processing unit is further configured to: if all the sorting grids of the stored orders do not meet the requirements of the same area or if the first target storage racks meeting the requirements of the area orders are not arranged in all the storage racks, determining second target storage racks meeting the requirements of the number of the idle sorting grids/the number of the area from all the storage racks; and determining the idle sorting grid in the second target goods shelf as the sorting grid to which the to-be-distributed order belongs.
Optionally, the acquiring unit is specifically configured to: if the weight of the order to be distributed is larger than a first threshold value, determining the order to be distributed as a target weight order; and determining a preselected sorting grid which accords with the minimum relation of the area and the first delivery address of the order to be delivered and meets the requirements of the shelf level from all sorting grids of the stored orders.
In a third aspect, an embodiment of the present application further provides an electronic device, including at least one processor and at least one memory, where the memory stores a computer program, and when the program is executed by the processor, causes the processor to execute a method for determining a sort grid to which an order belongs in the first aspect.
In a fourth aspect, an embodiment of the present application further provides a computer readable storage medium, where a program is stored, where the program when executed on a computer causes the computer to implement a method for determining a sort grid to which an order belongs according to the first aspect.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly described below, it will be apparent that the drawings in the following description are only some embodiments of the present application, and that other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic diagram of an application scenario provided in an embodiment of the present application;
FIG. 2 is a flow chart of a method for determining a sort grid to which an order belongs according to an embodiment of the present application;
FIG. 3 is a flow chart of a method for determining preselected sorting bins according to an embodiment of the present application;
FIG. 4 is a flowchart of a method for determining a sort grid to which an order to be distributed belongs according to an embodiment of the present application;
FIG. 5 is a flowchart of a method for sorting bins to which orders to be distributed belong according to another embodiment of the present application;
fig. 6 is a schematic structural diagram of determining a sorting grid to which an order belongs according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be described in further detail below with reference to the accompanying drawings, and it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
Fig. 1 is a schematic diagram of an application scenario provided in an embodiment of the present application. The application scene comprises a front-end warehouse, a supplier, a rider and a user. Taking as an example a lead bin 101, a supplier 102, a rider 103 and a user 104. In general, the suppliers 102 will deliver the products to the pre-warehouse 101 in advance for storage, after the user 104 places the required products on the platform a, the staff of the pre-warehouse 101 packages the products according to the order placed by the user 104, then the staff will place the packaged products in the delivery cabinet, and the rider 103 will take out the required delivered products from the delivery cabinet and deliver them until the products are delivered to the user 104.
In one possible case, the staff of the pre-bin 101 divides the shelves according to the order addresses corresponding to the goods, that is, the goods with the order addresses of the same cell are placed in the same shelf, and the goods with the order addresses of different cells are placed in different shelves. However, since the area of the cell is too small, the number of orders in the same period is small, so that when the platform a orders the same piece of the area, the same rider will be preferentially allocated to the same rider. When a rider arrives at the delivery cabinet to pick up goods, the goods required to be delivered by the rider are scattered on different shelves, so that the efficiency of finding the goods required to be delivered by the rider is low.
In summary, the embodiment of the application provides a method for determining sorting grids to which orders belong, which is used for solving the problem that the efficiency of a rider in finding goods to be distributed is low.
As shown in fig. 2, a flowchart of a method for determining a sorting grid to which an order belongs is provided in an embodiment of the present application, where the method includes the following steps:
step 201, determining a pre-selected sorting grid which accords with the minimum relation of the area with the first delivery address of the order to be delivered from all sorting grids of the stored order based on the matching relation of the area to which the delivery address belongs.
In the embodiment of the application, in order to improve the efficiency of finding the goods by the rider, the order to which the rider belongs needs to be placed in the same cross cabinet or a plurality of adjacent cross cabinets as much as possible. Generally, the platform will assign orders in the same area to the same rider preferentially when dispatching orders. Therefore, it is necessary to place the to-be-delivered orders belonging to the same area in a centralized manner in the cross-cabinet, wherein the smaller the area to which the to-be-delivered order belongs, the greater the likelihood that the to-be-delivered order belongs to the rider. Specifically, a pre-selected sorting bin that matches the minimum relationship of the area to which the first delivery address of the order to be delivered matches is determined from sorting bins of the stored order based on the matching relationship of the area to which the delivery address belongs. The matching relation of the distribution address belonging areas comprises a plurality of layers of belonging areas and is matched according to the layers from small to large.
Step 202, determining the pre-selected sorting grid as the sorting grid to which the to-be-dispensed order belongs after the remaining space of the pre-selected sorting grid meets the storage space of the to-be-dispensed order.
In the embodiment of the application, after the remaining space of the pre-selected sorting grid meets the storage space of the order to be distributed, the pre-selected sorting grid can be determined to be placed for the order to be distributed, so that the pre-selected sorting grid can be determined to be the sorting grid to which the order to be distributed belongs.
As can be seen from the above steps 201 to 202, by determining the sorting grid conforming to the minimum relation of the area to which the first delivery address of the to-be-delivered order belongs as the pre-selected sorting grid, and then determining the pre-selected sorting grid of the to-be-delivered order which can be placed as the sorting grid to which the to-be-delivered order belongs, the to-be-delivered order belonging to the rider is placed in the delivery cabinet more intensively, and the efficiency of finding the order by the rider is improved.
As shown in fig. 3, a flowchart of a method for determining a pre-selected sorting grid according to an embodiment of the present application includes the following steps:
step 301, determining, for any sorting grid in which orders are stored, whether the second delivery address of the order stored in the sorting grid and the first delivery address of the order to be delivered are in the same cell, if so, executing step 302, and if not, executing step 303.
In the embodiment of the application, the matching relation of the area to which the delivery address belongs comprises the matching of the same cell and the matching of the same patch; the area of the cell is smaller than the area of the chip, and the smaller the area of the order to be distributed is, the greater the possibility that the order to be distributed belongs to a rider is, so that the order to be distributed is firstly placed in the sorting grids belonging to the same cell in a concentrated mode, and the efficiency of finding the order to be distributed by the rider is improved. Specifically, according to the matching relation of the areas to which the delivery addresses belong, whether the second delivery address of the stored order in the sorting grid and the first delivery address of the to-be-delivered order are in the same cell is determined for the sorting grid of any stored order, if so, the fact that the stored order in the same cell as the to-be-delivered order exists in the sorting grid is indicated, the sorting grid can be determined as a preselected sorting grid, and whether the sorting grid to which the to-be-delivered order belongs is determined according to the residual volume of the preselected sorting grid conveniently. If not, the fact that the stored orders belonging to the same district with the to-be-distributed orders do not exist in the sorting grids is indicated, and the range of the area needs to be enlarged, so that the follow-up determination of the pre-selected sorting grids is realized.
Step 302, sorting grids are preselected sorting grids.
Step 303, determining whether the second delivery address of the stored order and the first delivery address of the to-be-delivered order in the sorting grid are the same segment for any sorting grid of the stored order, if yes, executing step 304, and if no, executing step 305.
In the embodiment of the application, since the sorting grid belonging to the same cell with the order to be distributed does not exist in the sorting grid, the range of the area needs to be enlarged, wherein the enlarged area is the same area. Specifically, for a sorting grid of any stored order, determining whether the second delivery address of the stored order and the first delivery address of the to-be-delivered order in the sorting grid are the same-piece area, if so, indicating that there is a stored order belonging to the same-piece area as the to-be-delivered order in the sorting grid, and determining the sorting grid as a preselected sorting grid. If not, the fact that stored orders belonging to the same area with the to-be-distributed orders do not exist in the sorting grids is indicated, and a follow-up step is needed to determine the pre-selected sorting grids.
Step 304, the sorting grid is a preselected sorting grid.
And 305, determining a second target goods shelf meeting the requirement of the number of idle sorting grids/the number of areas from the goods shelves.
In the embodiment of the application, since no stored orders of which the orders to be distributed belong to the same area exist in the sorting grids, the larger the number of the idle sorting grids/the number of the areas on the shelf is, the more idle the shelf is indicated, and the sorting grids on the shelf can be preferentially determined as the preselected sorting grids. Thus, it is first necessary to determine a second target pallet from among the pallets that meets the number of empty sort bins/area number requirements. Wherein meeting the number of free sort bins/number of regions requirement may be the number of free sort bins/number of regions being greater than a second threshold. For example, there are 3 shelves, namely shelf a, shelf B and shelf C, respectively, wherein the number of free sorting cells on shelf a is 4, the number of areas is 4, the number of free sorting cells on shelf B is 8, the number of areas is 2, the number of free sorting cells on shelf C is 6, the number of areas is 3, and the second threshold is 3, wherein since shelf is free sorting cell number/number of areas on a=1, free sorting cell number/number of areas on shelf b=2, and free sorting cell number/number of areas on shelf c=4, the shelf meeting the requirement of free sorting cell number/number of areas is shelf C, i.e. shelf C is the second target shelf.
And 306, determining the idle sorting grid in the second target goods shelf as the sorting grid to which the to-be-distributed order belongs.
As can be seen from the steps 301 to 306, the pre-selected sorting grids corresponding to the minimum relationship between the first delivery address of the order to be delivered and the area can be determined more accurately by sequentially matching the pre-selected sorting grids according to the level from small to large of the area, and the sorting grids to which the order to be delivered belongs can be determined more accurately according to the pre-selected sorting grids.
Optionally, the following describes how to determine the sorting grid to which the order to be distributed belongs if the pre-selected sorting grid and the first distribution address of the order to be distributed are in the same cell.
As shown in fig. 4, a flowchart of a method for determining a sorting grid to which an order to be distributed belongs according to an embodiment of the present application includes the following steps:
step 401, determining whether the remaining space of the pre-selected sorting grid meets the storage space of the order to be distributed, if yes, executing step 402, and if not, executing step 403.
In the embodiment of the application, the pre-selected sorting grid is the sorting grid which accords with the minimum relation of the area to which the first delivery address of the order to be delivered belongs. Wherein the minimum relation of the areas is the same cell. However, in order to determine whether the pre-selected sorting bin can be the sorting bin to which the order to be dispensed belongs, it is also necessary to determine whether the order to be dispensed can be placed in the pre-selected sorting bin. In one possible implementation, it is determined whether the remaining space of the pre-selected sorting bin meets the storage space of the order to be dispensed, and if so, it is indicated that the pre-selected sorting bin can place the order to be dispensed, and therefore the pre-selected sorting bin is determined as the sorting bin to which the order to be dispensed belongs. If not, the remaining space of the pre-selected sorting grid is smaller than the storage space of the to-be-distributed order, and the pre-selected sorting grid cannot store the to-be-distributed order, so that the order of the same area is placed in the sorting grid in a concentrated mode, and subsequent processing is needed.
Step 402, determining a preselected sorting grid as the sorting grid to which the order to be distributed belongs.
Step 403, taking the sorting grid with the second delivery address and the first delivery address of the stored order being the same area as the pre-selected sorting grid.
In the embodiment of the application, since the preselected sorting grid which accords with the first distribution address of the order to be distributed in the same cell cannot store the sorting grid to which the order to be distributed belongs, in order to realize centralized placement of the order in the same area in the sorting grid, a rider can conveniently take the order to be distributed, efficiency of taking the order to be distributed by the rider is improved, the sorting grid which accords with the minimum relation of the area to which the first distribution address of the order to be distributed accords with is determined as the same piece of area through sequential matching according to the level from the area to the large, that is, the sorting grid with the second distribution address of the stored order and the first distribution address as the same piece of area is used as the preselected sorting grid.
Step 404, determining whether the remaining space of the pre-selected sorting grid meets the storage space of the order to be distributed, if yes, executing step 405, and if not, executing step 406.
In the embodiment of the application, whether the remaining space of the pre-selected sorting grid meets the storage space of the order to be distributed is judged, if so, the pre-selected sorting grid can be put into the order to be distributed, and therefore, the pre-selected sorting grid is determined to be the sorting grid to which the order to be distributed belongs. If not, the remaining space of the pre-selected sorting grid is smaller than the storage space of the to-be-distributed order, and the pre-selected sorting grid cannot store the to-be-distributed order, so that the order of the same area is placed in the sorting grid in a concentrated mode, and subsequent processing is needed.
Step 405, determining the pre-selected sorting bin as the sorting bin to which the order to be dispensed belongs.
Step 406, determining whether a first target shelf meeting the regional order requirements can be determined from the shelves, if yes, executing step 407, and if not, executing step 408.
In the embodiment of the application, the pre-selected sorting grid cannot store the to-be-dispensed order, wherein the pre-selected sorting grid is the sorting grid belonging to the same area as the first dispensing address of the to-be-dispensed order. Therefore, in order to realize that the orders in the same area are placed in the sorting grids as intensively as possible, preferably, the to-be-distributed orders are placed in adjacent sorting grids of the same-area sorting grids, so that a rider can conveniently find the to-be-distributed orders, the time for finding the to-be-distributed orders is saved, and the efficiency for finding the to-be-distributed orders is improved. Specifically, it is first determined whether a first target shelf meeting the area order requirement can be determined from the shelves, where the first target shelf is a shelf meeting the area order requirement, and the area order requirement includes multiple levels of shelves with pre-target sorting grids and matches according to the number of pre-selected sorting grids from large to small levels.
For example, there are multiple shelves where the to-be-delivered order is placed, namely, shelf a, shelf B and shelf C, where shelf a has 4 pre-selected sorting grids, shelf B has 3 pre-selected sorting grids, and shelf C has no pre-selected sorting grid, because the likelihood that the same order belongs to the same rider in the same area is high, in order to facilitate the rider to take the to-be-delivered order on the same shelf as much as possible, in order to improve the efficiency of finding the to-be-delivered order, shelf a may be preferentially determined as the first target shelf, and if adjacent sorting grids of sorting grids in the same area in shelf a can place the to-be-delivered order, the adjacent sorting grids of the pre-selected sorting grids in shelf a are determined as the sorting grids to which the to-be-delivered order belongs. If the adjacent sorting grids of the same-segment sorting grids in the storage rack A cannot store the to-be-dispensed order, determining the storage rack B as a first target storage rack, and if the adjacent sorting grids of the same-segment sorting grids in the storage rack B can be placed for the to-be-dispensed order, determining the adjacent sorting grids of the same-segment sorting grids in the storage rack B as the sorting grids to which the to-be-dispensed order belongs. If adjacent sorting grids of the same-area sorting grids in the shelves B cannot be placed for the to-be-dispensed order, since the first target shelf meeting the area requirement does not exist in each shelf, subsequent processing is needed to determine the sorting grid to which the to-be-dispensed order belongs.
Step 407, determining adjacent sorting bins of the same-bin sorting bins in the first target pallet as preselected sorting bins.
In the embodiment of the application, adjacent sorting grids of the same-area sorting grids in the first target goods shelf are determined to be preselected sorting grids, wherein the adjacent sorting grids are adjacent sorting grids of the same-area sorting grids; or the adjacent sorting grid is the closest sorting grid to the centroid of the sorting grid in the same area in the target goods shelf.
Step 408, determining a second target shelf meeting the requirement of the number of idle sorting grids/the number of areas from the shelves;
in the embodiment of the present application, the specific content of this step is the same as that of step 305, and will not be described here.
Step 409, determining the pre-selected sorting grid satisfying that the remaining space of the pre-selected sorting grid is larger than the storage space of the order to be distributed as the sorting grid to which the order to be distributed belongs.
And 410, determining the idle sorting grid in the second target goods shelf as the sorting grid to which the to-be-distributed order belongs.
As can be seen from steps 401 to 410, by sequentially matching the remaining space of the pre-selected sorting grid with the storage space of the order to be distributed according to the level from small to large in the area, it can be more accurately determined whether the pre-selected sorting grid is the sorting grid to which the order to be distributed belongs.
In another possible implementation, how to determine the sorting grid to which the order to be distributed belongs if the pre-selected sorting grid and the first distribution address of the order to be distributed are the same segment is described below.
As shown in fig. 5, another method for sorting grids to which an order to be distributed belongs according to an embodiment of the present application is shown in the flowchart, and includes the following steps:
step 501, it is determined whether the remaining space of the pre-selected sorting grid meets the storage space of the order to be distributed, if yes, step 502 is executed, and if no, step 503 is executed.
In the embodiment of the present application, the specific content of this step is the same as that of step 406, and will not be described here again.
Step 502, determining adjacent sorting bins of the same-bin sorting bins in the first target pallet as preselected sorting bins.
In the embodiment of the present application, the specific content of this step is the same as that of step 407, and will not be described here again.
Step 503, determining a second target shelf meeting the requirement of the number of idle sorting grids/the number of areas from the shelves;
in the embodiment of the present application, the specific content of this step is the same as that of step 408, and will not be described here again.
And step 504, determining the idle sorting grid in the second target goods shelf as the sorting grid to which the to-be-distributed order belongs.
In the embodiment of the present application, the specific content of the step is the same as that of step 409, and will not be described herein.
As can be seen from the above steps 501 to 504, by sequentially matching the remaining space of the pre-selected sorting grid with the storage space of the order to be distributed according to the level from small to large in the area, it can be more accurately determined whether the pre-selected sorting grid is the sorting grid to which the order to be distributed belongs.
In one possible case, if the weight of the to-be-dispensed order is greater than the first threshold, determining that the to-be-dispensed order is a target weight order, and determining a preselected sorting grid which accords with the minimum relation of the area and the shelf level requirement with the first dispensing address of the to-be-dispensed order from all sorting grids of the stored orders for facilitating the staff to place the target weight order in the sorting grid. The requirements of the shelf level may be predetermined, may be determined according to an average height of a worker, or may be determined according to a specific situation, which is not described herein. The matching relation of the distribution address belonging areas comprises a plurality of layers of belonging areas and is matched according to the layers from small to large. And then after the remaining space of the preselected sorting grid meets the storage space of the order to be distributed, determining the preselected sorting grid as the sorting grid to which the order to be distributed belongs.
Based on the same technical concept as described above, an embodiment of the present application provides a device for determining a sorting grid to which an order belongs, referring to fig. 6, the device 600 includes: the acquiring unit 601 is configured to determine, from sorting lattices of the stored orders, a preselected sorting lattice that accords with a minimum relationship of the area to which the first delivery address of the order to be delivered belongs, based on a matching relationship of the area to which the delivery address belongs; the matching relation of the distribution address belonging areas comprises a plurality of layers of belonging areas and is matched in sequence from small to large according to the layers of the belonging areas; the processing unit 602 is configured to determine the pre-selected sorting bin as a sorting bin to which the to-be-dispensed order belongs after the remaining space of the pre-selected sorting bin satisfies the storage space of the to-be-dispensed order.
Optionally, the matching relation of the area to which the delivery address belongs comprises the matching of the same cell and the matching of the same area; wherein, the area of the cell is smaller than the area of the patch; the acquisition unit 601 specifically is configured to: determining whether a second delivery address of the stored order in the sorting grid and a first delivery address of the order to be delivered are in the same cell or not according to the sorting grid of any stored order; if the cell is the same cell, the sorting grid is a preselected sorting grid; if the sorting grids of all stored orders do not meet the requirements of the different communities, determining whether the second delivery address of the stored orders in the sorting grids and the first delivery address of the to-be-delivered orders are the same communities or not according to the sorting grids of any stored orders; if the sorting grids are the same-piece areas, the sorting grids are preselected sorting grids.
Optionally, the pre-selected sorting grid and the first distribution address are the same cell; the processing unit 602 is further configured to: if the remaining space of the preselected sorting grid does not meet the storage space of the order to be distributed, taking the sorting grid with the second distribution address and the first distribution address of the stored order as the same area as the preselected sorting grid; and after the remaining space of the preselected sorting grid meets the storage space of the order to be distributed, determining the preselected sorting grid as the sorting grid to which the order to be distributed belongs.
Optionally, the pre-selected sorting grid and the first distribution address are the same area; the processing unit 602 is further configured to: if the remaining space of the preselected sorting grid does not meet the storage space of the order to be distributed, determining a first target goods shelf meeting the order requirement of the contract area from all goods shelves; determining adjacent sorting grids of the same-area sorting grids in the first target goods shelf as preselected sorting grids; the same-segment sorting grid is a sorting grid with the second delivery address and the first delivery address being the same segment; and after the remaining space of the preselected sorting grid meets the storage space of the order to be distributed, determining the preselected sorting grid as the sorting grid to which the order to be distributed belongs.
Optionally, the adjacent sorting grids are adjacent sorting grids of the same-area sorting grids; or the adjacent sorting grid is the closest sorting grid to the centroid of the sorting grid in the same area in the target goods shelf.
Optionally, the processing unit 602 is further configured to: if all the sorting grids of the stored orders do not meet the requirements of the same area or if the first target storage racks meeting the requirements of the area orders are not arranged in all the storage racks, determining second target storage racks meeting the requirements of the number of the idle sorting grids/the number of the area from all the storage racks; and determining the idle sorting grid in the second target goods shelf as the sorting grid to which the to-be-distributed order belongs.
Optionally, the obtaining unit 601 is further configured to: if the weight of the order to be distributed is larger than a first threshold value, determining the order to be distributed as a target weight order; and determining a preselected sorting grid which accords with the minimum relation of the area and the first delivery address of the order to be delivered and meets the requirements of the shelf level from all sorting grids of the stored orders.
Based on the same technical concept, the embodiment of the present application further provides an electronic device, as shown in fig. 7, where the electronic device 700 includes at least one processor 701 and a memory 702 connected to the at least one processor, and in the embodiment of the present application, a specific connection medium between the processor 701 and the memory 702 is not limited, and in fig. 7, the processor 701 and the memory 702 are connected by a bus, for example. The buses may be divided into address buses, data buses, control buses, etc.
In the embodiment of the present application, the memory 702 stores instructions executable by the at least one processor 701, and the at least one processor 701 can execute the steps included in the method for determining the sorting grid to which the order belongs by executing the instructions stored in the memory 702.
Where the processor 701 is a control center of a computing device, various interfaces and lines may be utilized to connect various portions of the computing device, implement data processing by executing or executing instructions stored in the memory 702 and invoking data stored in the memory 702. Alternatively, the processor 701 may include one or more processing units, and the processor 701 may integrate an application processor and a modem processor, wherein the application processor primarily processes an operating system, a user interface, an application program, and the like, and the modem processor primarily processes issuing instructions. It will be appreciated that the modem processor described above may not be integrated into the processor 701. In some embodiments, processor 701 and memory 702 may be implemented on the same chip, or they may be implemented separately on separate chips in some embodiments.
The processor 701 may be a general purpose processor such as a Central Processing Unit (CPU), digital signal processor, application specific integrated circuit (Application Specific Integrated Circuit, ASIC), field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, and may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with an embodiment of a method of obtaining data may be embodied directly in a hardware processor for execution, or in a combination of hardware and software modules in a processor for execution.
The memory 702 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The Memory 702 may include at least one type of storage medium, and may include, for example, flash Memory, hard disk, multimedia card, card Memory, random access Memory (Random Access Memory, RAM), static random access Memory (Static Random Access Memory, SRAM), programmable Read-Only Memory (Programmable Read Only Memory, PROM), read-Only Memory (ROM), charged erasable programmable Read-Only Memory (Electrically Erasable Programmable Read-Only Memory), magnetic Memory, magnetic disk, optical disk, and the like. Memory 702 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory 702 in embodiments of the present application may also be circuitry or any other device capable of performing storage functions for storing program instructions and/or data.
Based on the same technical concept, the embodiment of the application also provides a computer readable storage medium, which stores a computer program executable by a computing device, and when the program runs on the electronic device, the electronic device is caused to execute the steps of the method for determining the sorting grid to which the order belongs.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiments and all such alterations and modifications as fall within the scope of the application.
It will be apparent to those skilled in the art that various modifications and variations can be made to the present application without departing from the spirit or scope of the application. Thus, it is intended that the present application also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.

Claims (10)

1. A method of determining a sort grid to which an order belongs, comprising:
based on the matching relation of the area to which the delivery address belongs, determining a preselected sorting grid which accords with the minimum relation of the area to which the first delivery address of the order to be delivered belongs from sorting grids of stored orders; the matching relation of the distribution address belonging areas comprises a plurality of layers of belonging areas and is matched in sequence according to the layers from small to large of the belonging areas;
and after the remaining space of the pre-selected sorting grid meets the storage space of the to-be-distributed order, determining the pre-selected sorting grid as the sorting grid to which the to-be-distributed order belongs.
2. The method of claim 1, wherein the matching relationship of the area to which the delivery address belongs includes a same cell match and a same tile match; wherein, the area of the cell is smaller than the area of the patch;
based on the matching relation of the area to which the delivery address belongs, a preselected sorting grid which accords with the minimum relation of the area to which the first delivery address of the order to be delivered belongs is determined from sorting grids of stored orders, and the method comprises the following steps:
determining whether a second delivery address of an order stored in a sorting grid and a first delivery address of an order to be delivered are in the same cell or not according to the sorting grid of any stored order; if the cells are the same cell, the sorting grid is a preselected sorting grid;
if the sorting grids of all stored orders do not meet the requirements of the same cell, determining whether a second delivery address of the stored orders in the sorting grids and a first delivery address of the orders to be delivered are the same cell or not according to the sorting grid of any stored order; and if the sorting grids are the same-piece areas, the sorting grids are preselected sorting grids.
3. The method of claim 2 wherein said preselected sort bin is co-located with said first dispatch address; the method further comprises the steps of:
if the remaining space of the preselected sorting grid does not meet the storage space of the order to be distributed, taking the sorting grid with the second distribution address and the first distribution address of the stored order as the same piece area as the preselected sorting grid;
and after the remaining space of the pre-selected sorting grid meets the storage space of the to-be-distributed order, determining the pre-selected sorting grid as the sorting grid to which the to-be-distributed order belongs.
4. The method of claim 2 wherein said preselected sort grid is co-tile with said first dispatch address; the method further comprises the steps of:
if the remaining space of the preselected sorting grid does not meet the storage space of the to-be-distributed order, determining a first target goods shelf meeting the contract area order requirement from all goods shelves;
determining adjacent sorting grids of the same-area sorting grids in the first target goods shelf as preselected sorting grids; the same-area sorting grid is a sorting grid with a second distribution address and the first distribution address being the same-area;
and after the remaining space of the pre-selected sorting grid meets the storage space of the to-be-distributed order, determining the pre-selected sorting grid as the sorting grid to which the to-be-distributed order belongs.
5. The method of claim 4, wherein the adjacent sort bin is an adjacent sort bin of the same-sector sort bin; or (b)
The adjacent sorting grids are sorting grids closest to the mass center of the sorting grids in the same area in the target goods shelf.
6. The method as recited in claim 2, further comprising:
if all the sorting grids of the stored orders do not meet the requirements of the same area or if the first target storage racks meeting the requirements of the area orders are not arranged in all the storage racks, determining second target storage racks meeting the requirements of the number of the idle sorting grids/the number of the area from all the storage racks;
and determining the idle sorting grid in the second target goods shelf as the sorting grid to which the to-be-distributed order belongs.
7. The method of claim 1, wherein determining a preselected sort bin that corresponds to a minimum relationship to the area to which the first delivery address of the order to be delivered belongs comprises:
if the weight of the order to be distributed is larger than a first threshold value, determining the order to be distributed as a target weight order;
and determining a preselected sorting grid which accords with the minimum relation of the area and the first delivery address of the order to be delivered and meets the requirements of the shelf level from all sorting grids of the stored orders.
8. An apparatus for determining a sort bin to which an order belongs, comprising:
the acquisition unit is used for determining a preselected sorting grid which accords with the minimum relation of the area with the first delivery address of the order to be delivered from all sorting grids of the stored order based on the matching relation of the area to which the delivery address belongs; the matching relation of the distribution address belonging areas comprises a plurality of layers of belonging areas and is matched in sequence according to the layers from small to large of the belonging areas;
and the processing unit is used for determining the pre-selected sorting grid as the sorting grid to which the to-be-dispensed order belongs after the remaining space of the pre-selected sorting grid meets the storage space of the to-be-dispensed order.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method of any of claims 1-7 when the program is executed by the processor.
10. A computer readable storage medium, characterized in that it stores a computer program executable by a computer device, which program, when run on the computer device, causes the computer device to perform the steps of the method according to any one of claims 1-7.
CN202310651727.5A 2023-06-02 2023-06-02 Method and device for determining sorting grid to which order belongs Pending CN116703272A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310651727.5A CN116703272A (en) 2023-06-02 2023-06-02 Method and device for determining sorting grid to which order belongs

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310651727.5A CN116703272A (en) 2023-06-02 2023-06-02 Method and device for determining sorting grid to which order belongs

Publications (1)

Publication Number Publication Date
CN116703272A true CN116703272A (en) 2023-09-05

Family

ID=87830630

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310651727.5A Pending CN116703272A (en) 2023-06-02 2023-06-02 Method and device for determining sorting grid to which order belongs

Country Status (1)

Country Link
CN (1) CN116703272A (en)

Similar Documents

Publication Publication Date Title
CN107103446B (en) Inventory scheduling method and device
KR102630723B1 (en) Order processing method, apparatus, device, system and storage medium
CN109978423B (en) Inventory scheduling method, inventory scheduling device and computer-readable storage medium
CN109544054B (en) Inventory scheduling method, inventory scheduling device and computer-readable storage medium
CN107963385B (en) Method and system for processing goods in logistics storage field
CN109767151B (en) Storage management method, device, medium and electronic equipment
CN110322172B (en) Inventory scheduling method, inventory scheduling device and computer-readable storage medium
CN110334993B (en) Method and device for managing and controlling seeding goods space and computer equipment
CN112085453A (en) Order processing method, device, equipment, system and storage medium
CN109823755B (en) Method, device, system, equipment and storage medium for processing logistics sorting information
CN106960300A (en) Implementation method and device are filled at the beginning of a kind of stock of Medical Logistics industry
CN113753462B (en) Task allocation method, device, equipment, warehousing system and storage medium
CN113200275A (en) Packing box arranging method, device, equipment, storage system and storage medium
CN110803447B (en) Article transportation management method, device and system and storage medium
WO2022206290A1 (en) Order processing method and apparatus, device, system, medium, and product
CN112396368A (en) Distribution route planning method and system and server equipment
CN107203865B (en) Order distribution method and device
CN112288376A (en) Cargo loading scheme generation method, device and equipment and readable storage medium
CN112232726A (en) Goods picking method, device, server and storage medium
CN113998358A (en) Method, device, equipment, storage medium and program product for picking up goods
CN116703272A (en) Method and device for determining sorting grid to which order belongs
CN112950123A (en) Order allocation method, device, system, storage medium and program product
CN111126643B (en) Reservation method and reservation device of platform and readable storage medium
CN113762820A (en) Goods-to-person picking control method, system, electronic device and storage medium
CN110288287B (en) Method and system for sorting stored goods

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