ORDER GROUP ALLOCATION METHOD AND DEVICE
First Claim
1. An order group allocation method, comprising:
- determining, based on a matching score between each of a plurality of to-be-processed order groups and each of a plurality of delivery persons, a to-be-processed order group with a lowest matching score corresponding to each delivery person;
dividing, based on the to-be-processed order group with the lowest matching score corresponding to each delivery person, the to-be-processed order groups and the delivery persons into a plurality of non-intersecting sub-combinations, wherein “
non-intersecting”
means that there is no overlapping to-be-processed order groups and no overlapping delivery persons between the sub-combinations; and
allocating, based on an order group allocation process for each sub-combination, the to-be-processed order groups, so that each to-be-processed order group in each sub-combination is allocated to a delivery person in a corresponding sub-combination.
0 Assignments
0 Petitions
Accused Products
Abstract
An order group allocation method and apparatus are disclosed. The order group allocation method includes: determining, based on a matching score between each of a plurality of to-be-processed order groups and each of a plurality of delivery persons, an order group with a lowest matching score corresponding to each delivery person; dividing the to-be-processed order groups and the delivery persons into a plurality of non-intersecting sub-combinations; and allocating the to-be-processed order group based on an order group allocation process for each sub-combination, so that each to-be-processed order group in each sub-combination is allocated to a delivery person in a corresponding sub-combination. The method of the present disclosure improves order group allocation efficiency.
-
Citations
12 Claims
-
1. An order group allocation method, comprising:
-
determining, based on a matching score between each of a plurality of to-be-processed order groups and each of a plurality of delivery persons, a to-be-processed order group with a lowest matching score corresponding to each delivery person; dividing, based on the to-be-processed order group with the lowest matching score corresponding to each delivery person, the to-be-processed order groups and the delivery persons into a plurality of non-intersecting sub-combinations, wherein “
non-intersecting”
means that there is no overlapping to-be-processed order groups and no overlapping delivery persons between the sub-combinations; andallocating, based on an order group allocation process for each sub-combination, the to-be-processed order groups, so that each to-be-processed order group in each sub-combination is allocated to a delivery person in a corresponding sub-combination. - View Dependent Claims (2, 3, 4, 5, 11, 12)
-
-
6. An order group allocation apparatus, comprising:
-
a determining module, configured to determine, based on a matching score between each of a plurality to-be-processed order groups and each of a plurality delivery persons, a to-be-processed order group with a lowest matching score corresponding to each delivery person; a division module, configured to divide, based on the to-be-processed order group with the lowest matching score corresponding to each delivery person, the to-be-processed order groups and the delivery persons into a plurality of non-intersecting sub-combinations, wherein “
non-intersecting”
means that there is no overlapping to-be-processed order groups and no overlapping delivery persons between the sub-combinations; andan allocation module, configured to allocate, based on an order group allocation process for each sub-combination, the to-be-processed order groups, so that each to-be-processed order group in each sub-combination is allocated to a delivery person in a corresponding sub-combination. - View Dependent Claims (7, 8, 9, 10)
-
Specification