Nothing Special   »   [go: up one dir, main page]

WO2021147353A1 - Répartition de commandes - Google Patents

Répartition de commandes Download PDF

Info

Publication number
WO2021147353A1
WO2021147353A1 PCT/CN2020/115991 CN2020115991W WO2021147353A1 WO 2021147353 A1 WO2021147353 A1 WO 2021147353A1 CN 2020115991 W CN2020115991 W CN 2020115991W WO 2021147353 A1 WO2021147353 A1 WO 2021147353A1
Authority
WO
WIPO (PCT)
Prior art keywords
order
orders
dispatched
target
pending
Prior art date
Application number
PCT/CN2020/115991
Other languages
English (en)
Chinese (zh)
Inventor
王圣尧
包建东
郑环宇
Original Assignee
北京三快在线科技有限公司
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 北京三快在线科技有限公司 filed Critical 北京三快在线科技有限公司
Publication of WO2021147353A1 publication Critical patent/WO2021147353A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/23—Clustering techniques
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635—Processing of requisition or of purchase orders
    • 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

Definitions

  • the present disclosure relates to the field of Internet technology, and in particular, to an order scheduling method, device, storage medium, and electronic equipment.
  • the purpose of the present disclosure is to provide an order scheduling method, device, storage medium, and electronic equipment, which can reduce the amount of data calculation and improve real-time performance.
  • an order scheduling method includes: clustering each pending order according to the order information of each pending order within a time unit to obtain Multiple order groups; respectively determine the delivery capacity corresponding to each of the order groups; for each of the order groups, according to the order information of each of the pending orders in the order group and the respective delivery corresponding to the order group
  • the distribution information of the capacity determines the matching degree between each of the pending orders in the order group and each of the distribution capacity corresponding to the order group; according to each of the matching degrees, each of the pending orders is determined Carry out order scheduling.
  • the method further includes: Set a threshold order group, split the order group into multiple order groups, wherein the number of orders to be dispatched in each order group obtained by the split is less than the preset threshold.
  • the clustering the to-be-dispatched orders according to the order information of the to-be-dispatched orders in a time unit to obtain multiple order groups includes: according to the quantity of each of the to-be-dispatched orders and the preset The threshold value determines the number of cluster centers; clusters the pending orders according to the number of cluster centers and the order information of each pending order to obtain the multiple order groups.
  • the performing order scheduling on each of the pending orders according to each of the matching degrees includes: for each of the pending orders, determining the delivery capacity with the highest matching degree corresponding to the pending orders Is the target delivery capacity corresponding to the order to be dispatched; each order to be dispatched is delivered to the corresponding target delivery capacity.
  • the method further includes: For each target delivery capacity, if there are more than two pending orders corresponding to the target delivery capacity, the pending order with the highest matching degree corresponding to the target delivery capacity is determined as the target corresponding to the target delivery capacity Order; in the case that there is one order to be dispatched corresponding to the target delivery capacity, the order to be dispatched is determined as the target order corresponding to the target delivery capacity;
  • the distributing each of the pending orders to the corresponding target distribution capacity includes: allocating each of the target orders to the respective corresponding target distribution capacity.
  • the method further includes: for each target delivery capacity, if there are two or more orders to be dispatched with the highest matching degree corresponding to the target delivery capacity, if each of the highest matching orders is If the task point information of the to-be-scheduled orders is the same, each of the to-be-scheduled orders is taken as the target order of the target delivery capacity; if the task point information of each of the to-be-scheduled orders with the highest matching degree is different, then each of the to-be-scheduled orders is different
  • the dispatch order selects a to-be dispatched order as the target order of the target delivery capacity.
  • the method further includes: taking orders other than the target order among the to-be-dispatched orders as the to-be-dispatched orders in the next time unit.
  • the order information includes different types of task point information
  • the clustering of the orders to be dispatched according to the order information of the orders to be dispatched in a time unit includes: according to the order information of the orders to be dispatched in the time unit
  • the task point information of the same type of the to-be-scheduled orders clusters the to-be-scheduled orders.
  • the respectively determining the delivery capacity corresponding to each of the order groups includes: for each of the order groups, the distance between the current position and the starting position of each of the to-be-scheduled orders in the order group The delivery capacity less than the preset distance is determined as the delivery capacity corresponding to the order group.
  • the matching degree between each of the distribution capacity corresponding to the order group includes: for each of the distribution capacity, according to the distribution information of the distribution capacity, respectively determine to pre-order each of the pending orders in the order group After being allocated to the distribution capacity, the target parameter corresponding to the distribution capacity, the size of the target parameter is used to distinguish the pros and cons of pre-allocating the pending orders to each of the distribution capacities; according to the distribution capacity and The target parameter corresponding to each of the to-be-dispatched orders determines the degree of matching between each of the to-be-dispatched orders and the delivery capacity.
  • an order scheduling device comprising: a clustering module, configured to perform order scheduling on each pending order according to the order information of each pending order within a time unit Clustering to obtain multiple order groups; the first determining module is configured to determine the delivery capacity corresponding to each of the order groups; the second determining module is configured to determine the delivery capacity corresponding to each of the order groups according to The order information of each order to be dispatched in the order group and the distribution information of each delivery capacity corresponding to the order group are determined to determine each of the orders to be dispatched in the order group and each corresponding to the order group The degree of matching between the distribution capacity; the scheduling module is configured to perform order scheduling on each of the orders to be dispatched according to each of the degrees of matching.
  • the clustering module includes: a splitting sub-module configured to split the order group into multiple order groups for an order group in which the number of orders to be scheduled exceeds a preset threshold, wherein, The number of orders to be dispatched in each order group obtained by splitting is less than the preset threshold.
  • the clustering module is configured to determine the number of cluster centers according to the number of each of the pending orders and the preset threshold; according to the number of the cluster centers, and each of the pending orders The order information of the dispatch order clusters the pending orders to obtain the multiple order groups.
  • the scheduling module includes: a first determining sub-module configured to determine, for each of the pending orders, the delivery capacity with the highest matching degree corresponding to the pending orders as the first determining sub-module. Dispatch the target delivery capacity corresponding to the order; the allocation sub-module is configured to allocate each of the pending orders to the corresponding target delivery capacity.
  • the scheduling module includes: a second determining sub-module configured to deliver capacity for each target, and when there are more than two orders to be dispatched corresponding to the target distribution capacity, the The pending order with the highest matching degree corresponding to the target delivery capacity is determined as the target order corresponding to the target delivery capacity; in the case that there is one pending order corresponding to the target delivery capacity, the pending order is determined as the The target order corresponding to the target delivery capacity; the allocation sub-module is configured to allocate each of the target orders to the corresponding target delivery capacity.
  • the device is further configured to target delivery capacity for each target, and if there are two or more orders to be dispatched with the highest matching degree corresponding to the target delivery capacity, if the highest matching degree is If the task point information of each order to be dispatched is the same, then each order to be dispatched is regarded as the target order of the target delivery capacity; if the task point information of each order to be dispatched with the highest matching degree is different, then the order is different from each other.
  • the to-be-dispatched order selects a to-be-dispatched order as the target order of the target delivery capacity.
  • the device further includes: a third determining module configured to take orders other than the target order among the pending orders as the pending orders to be dispatched in the next time unit.
  • a third determining module configured to take orders other than the target order among the pending orders as the pending orders to be dispatched in the next time unit.
  • the order information includes different types of task point information;
  • the clustering module includes: a clustering sub-module configured to perform tasks of the same type according to each of the to-be-scheduled orders in the time unit Point information to cluster the pending orders.
  • the first determining module is configured to: for each of the order groups, determine the delivery capacity whose current position is less than a preset distance from the starting position of each of the orders to be dispatched in the order group Is the delivery capacity corresponding to the order group.
  • the second determining module includes: a third determining sub-module configured to determine, for each of the distribution capacity, according to the distribution information of the distribution capacity, to separately determine the distribution of each of the orders in the order group.
  • the target parameter corresponding to the delivery capacity after the order to be dispatched is pre-allocated to the delivery capacity, and the size of the target parameter is used to distinguish the pros and cons of pre-allocating the order to be dispatched to each delivery capacity; according to the The target parameter corresponding to the delivery capacity and each of the orders to be dispatched determines the degree of matching between each of the orders to be dispatched and the delivery capacity.
  • a computer-readable storage medium having a computer program stored thereon, and when the program is executed by a processor, the steps of any of the methods described in the first aspect are implemented.
  • an electronic device including: a memory on which a computer program is stored; and a processor configured to execute the computer program in the memory to implement the following steps: For the order information of each pending order within a time unit, cluster each pending order to obtain multiple order groups; respectively determine the delivery capacity corresponding to each of the order groups; for each of the order groups, according to The order information of each order to be dispatched in the order group and the distribution information of each delivery capacity corresponding to the order group determine each of the orders to be dispatched in the order group and each corresponding to the order group The degree of matching between the distribution capacity; according to each degree of matching, order scheduling is performed on each of the orders to be dispatched.
  • each pending order is clustered in the present disclosure, when calculating the matching degree between the pending order and the delivery capacity, only the matching between the delivery capacity corresponding to its order group needs to be calculated Therefore, it can effectively reduce the amount of calculation required to calculate the matching degree, and during order scheduling, it can also perform partial scheduling for each order group.
  • it effectively reduces the complexity of order scheduling, and on the other hand, it reduces the complexity of order scheduling.
  • the amount of calculation during order scheduling improves the efficiency and accuracy of order scheduling. It has good real-time performance and fast speed. It can be applied to large-scale order scheduling tasks and meet the needs of instant delivery services. In addition, it can also be used within the time unit.
  • the pending orders are processed in parallel to further improve the efficiency of order scheduling.
  • the method provided by the present disclosure can greatly reduce the amount of data access and the calculation of the algorithm, and reduce the requirements for memory and computing resources when implementing the method, it can also effectively broaden the order scheduling method provided by the present disclosure. The scope of application.
  • Fig. 1 is a flowchart of an order scheduling method according to an embodiment of the present disclosure
  • FIG. 2 is a flowchart of an exemplary embodiment of order scheduling for orders to be scheduled according to the matching degree
  • Fig. 3 is a block diagram of an order scheduling device according to an embodiment of the present disclosure.
  • Fig. 4 is a block diagram showing an electronic device according to an exemplary embodiment
  • Fig. 5 is a block diagram showing an electronic device according to an exemplary embodiment
  • Fig. 6 is a schematic diagram showing an implementation environment according to an exemplary embodiment.
  • order scheduling is usually carried out in a geographical dimension. For example, every minute all new orders are matched with dispatchers in the area in real time through a scheduling algorithm.
  • the matching calculation process requirements usually need to be completed in a relatively short time. Since the matching of multiple orders and multiple distributors is a global optimization, there may be coupling between each matching relationship. Therefore, through the above method, the amount of calculation required for order scheduling is too large and time-consuming.
  • Fig. 1 shows a flowchart of an order scheduling method according to an embodiment of the present disclosure. As shown in Figure 1, the method may include:
  • the order information includes starting position information and destination position information corresponding to the order to be dispatched.
  • the starting location information is the initial location corresponding to the order to be dispatched.
  • the starting location information is the location of the merchant who made the items in the order
  • the destination location information is the expected delivery of the order. s position.
  • the starting location information is the user's pick-up location corresponding to the order
  • the destination location information is the user's drop-off location corresponding to the order.
  • the starting location information and the destination location information respectively indicate one or more locations.
  • one order corresponds to multiple stores, that is, the user may purchase items from multiple stores in one order At this time, you need to go to each store to obtain the corresponding items, so as to deliver the prepared items to the destination location.
  • the duration of the time unit can be set according to actual usage scenarios. For example, for scenarios with higher real-time requirements, the duration is set to be shorter, and for scenarios with lower real-time requirements, the duration is set to be longer. In another example, different time lengths are set according to different time periods. Take a takeaway scenario as an example, the time length set during the evening peak period is shorter, and the time length set for other time periods is slightly longer. The above are only exemplary descriptions, and the present disclosure does not limit this.
  • the delivery capacity corresponding to each order group is determined respectively.
  • the delivery capacity includes one or more of delivery personnel, delivery robots, and unmanned vehicles.
  • the distribution capacity corresponding to the determined order group is the distribution capacity used to distribute the pending orders in the order group.
  • the distribution capacity refers to the manpower or material resources that can carry out the distribution.
  • each pending order in the order group corresponds to the order group
  • the distribution information of the distribution capacity is the current location of the distribution capacity, the information of the orders currently to be distributed by the distribution capacity, and so on.
  • the matching degree between the order to be delivered and the delivery capacity is used to characterize the pros and cons of the order to be dispatched by the delivery capacity. Wherein, the greater the matching degree, the better the delivery capacity to deliver the pending order.
  • the pros and cons of the delivery capacity of the pending order refers to the possibility that the delivery capacity will deliver the order in a timely manner, where the better the delivery capacity is to deliver the pending order, the delivery capacity will deliver the order in time The higher the probability, the worse the delivery capacity to deliver the pending order, and the lower the probability that the delivery capacity will complete the order in time.
  • the orders to be dispatched in each order group and the corresponding delivery capacity of the order group can be separately dispatched, so that when calculating the matching degree between the order to be dispatched and the delivery capacity, It only needs to be calculated separately for each order group, and there is no need to match the current pending orders with the corresponding delivery capacity of other order groups, which can effectively reduce the amount of calculation required for order scheduling.
  • each order group is processed in parallel, or each order group is processed in sequence, or each time the target quantity of order groups is processed in parallel, and then the remaining target quantity is processed in parallel.
  • the order group is processed, and so on, the embodiment of the present disclosure does not limit the processing manner of each order group.
  • the matching degree corresponding to each order to be dispatched only includes the matching degree between it and the delivery capacity corresponding to the order group to which the order to be dispatched belongs. Therefore, when order scheduling is performed, it can be targeted for each order group. Dispatch separately.
  • each pending order is clustered in the present disclosure, when calculating the matching degree between the pending order and the delivery capacity, only the matching degree between the delivery capacity corresponding to its order group needs to be calculated, which can effectively reduce The amount of calculation required to calculate the matching degree, and when performing order scheduling, it can also perform partial scheduling for each order group.
  • it effectively reduces the complexity of order scheduling on the other hand, it also reduces the calculation during order scheduling.
  • the real-time performance is good, the speed is fast, and it can be applied to large-scale order scheduling tasks, and can meet the needs of instant delivery services.
  • Parallel processing can further improve the efficiency of order scheduling.
  • the method provided by the present disclosure can greatly reduce the amount of data access and the calculation of the algorithm, and reduce the requirements for memory and computing resources when implementing the method, it can also effectively broaden the order scheduling method provided by the present disclosure. The scope of application.
  • the order information includes different types of task point information.
  • it includes the task point information of the starting type, such as the locations of multiple merchants in the same order in the example described above, and optionally, it also includes the task point information of the destination type, such as the order corresponding to the example described above The user’s drop-off location, etc.
  • each order information includes the initial type of task point information, such as the location of the merchant making the takeaway corresponding to the takeaway order (ie the pickup location); it also includes the purpose type of task point information, The user who ordered the takeout expects the delivery location (that is, the delivery location) of the takeout.
  • the exemplary embodiment of clustering the to-be-dispatched orders according to the order information of the to-be-dispatched orders in a time unit is as follows, including:
  • clustering is performed according to the starting position of each order to be scheduled. Therefore, the starting positions of the orders to be scheduled in the same cluster obtained are similar, so as to be able to group as much as possible.
  • the pending orders corresponding to the merchants in the business district are clustered.
  • clustering can be performed according to the destination positions of the orders to be scheduled, so that the destination positions of the orders to be scheduled in the same cluster obtained are similar, so that users belonging to similar cells or communities can be assigned to the corresponding to-be-scheduled orders Orders are clustered.
  • the to-be-scheduled orders are clustered according to the task point information of the same type of each to-be-scheduled order in a time unit, so that the to-be-scheduled orders with similar starting positions or similar destination positions can be clustered To the same order group. Therefore, by clustering orders to be dispatched, orders to be dispatched that are close to each other can be grouped into the same order group, while orders to be dispatched in different order groups are far apart, so there is no need to consider different order groups when scheduling orders. The influence between the orders to be dispatched realizes the independent order dispatching of each order group, and can effectively reduce the amount of data calculation in the order dispatching process.
  • the order group is split into multiple order groups, where the splitting The number of orders to be dispatched in each order group obtained is less than the preset threshold.
  • the preset threshold is set according to actual usage scenarios, which is not limited in the present disclosure.
  • N clusters will be obtained. After that, determine the number of pending orders in each cluster. If the number of pending orders in one of the clusters (denoted as cluster C) exceeds the preset threshold, cluster C is split at this time.
  • the distance threshold is further adjusted to perform re-clustering according to the order information of the pending orders in cluster C. For example, during the initial clustering, cluster any two orders to be scheduled whose starting position is less than M1, and when splitting cluster C, set the starting position of cluster C to any two orders whose starting position is less than M2. Clustering of orders to be dispatched, where M2 is less than M1.
  • the K-Means (K-means clustering) algorithm is used for re-clustering during splitting, where K is any integer greater than or equal to 1, for example, the value of K is based on the number of orders to be scheduled in cluster C and the The preset threshold is determined. For example, if the number of orders to be scheduled in cluster C is Q, and the preset threshold is P, then the value of K is greater than the ratio of Q to P, so as to avoid sub-clusters after splitting as much as possible The number of pending orders is greater than the preset threshold.
  • the number of cluster centers (K) is determined according to the number of orders to be dispatched in the order group and the number of the preset threshold. According to the K clusters The center re-clusters the order group to obtain K clusters, that is, re-divides the order group into K order groups.
  • clustering the scheduled orders according to the order information of each pending order in a time unit to obtain multiple order groups includes: determining the number of cluster centers according to the number of each pending order and a preset threshold ;According to the number of cluster centers and the order information of each pending order, the scheduled orders are clustered to obtain multiple order groups.
  • the sub-cluster is further split until the sub-cluster obtained by splitting cluster C
  • the data of the orders to be dispatched is less than the preset threshold, that is, the number of orders to be dispatched in each order group obtained by splitting is less than the preset threshold.
  • each order group contains a small number of pending orders, thereby further reducing the computing resources consumed in subsequent calculations of the matching degree between pending orders and delivery capacity. And to a certain extent, it can also ensure that the number of orders to be allocated in each order group is relatively uniform, ensuring high concurrency in order scheduling while also ensuring the consistency of processing efficiency, thereby ensuring the accuracy of order scheduling.
  • this step may include:
  • the delivery capacity whose current position is less than the preset distance from the starting position of each pending order in the order group is determined as the delivery capacity corresponding to the order group.
  • the delivery capacity that is closer to the initial position of the order to be dispatched will be preferentially selected.
  • the starting position of each order to be dispatched in the order group is determined.
  • the starting position is determined according to the order information of the order to be dispatched. If there are multiple positions indicated by the starting position information corresponding to the order to be dispatched, the first position on the path corresponding to the order to be dispatched among the positions indicated by the starting position information is used as the starting position. If the position indicated by the starting position information corresponding to the to-be-dispatched order is one, the position is directly used as the starting position.
  • the multiple locations indicated by the starting location information are connected according to the shortest path rule to obtain the driving route, and the first The first position or the last position is used as the starting position.
  • the distance between the order to be dispatched and each delivery capacity is determined according to the initial position of the order to be dispatched and the current position of each delivery capacity, and the distance is less than the preset distance
  • the distribution capacity of is used as the distribution capacity to be allocated.
  • calculating the distance between two location points is to determine two locations in the map, obtain at least one driving path between the two locations, determine the shortest driving path in the at least one driving path, and set the shortest The length of the driving path is determined as the distance between two location points.
  • a position range within a preset distance range centered on the order to be dispatched is determined, and the delivery capacity whose current position belongs to the position range is determined as the delivery capacity to be allocated.
  • determining a position range centered on the order to be dispatched within a preset distance range refers to determining a position range centered on the order to be dispatched and the distance from the center does not exceed the preset distance.
  • determining the position range according to the position and distance of the center point is to determine a circular area with the order to be dispatched as the center and the preset distance range as the radius. Subsequently, the delivery capacity whose current location belongs to the circular area is determined as the delivery capacity to be allocated.
  • the distribution capacity to be allocated determined according to each pending order in the order group is taken as the distribution capacity corresponding to the order group.
  • the distribution capacity whose current position is less than the preset distance from the starting position of each pending order in the order group is determined as the distribution capacity corresponding to the order group Distribution capacity, on the one hand, can ensure that the distribution capacity reaches the initial position of the pending order in a timely manner, thereby improving the efficiency of order distribution. On the other hand, it can avoid excessive invalid movement of the distribution capacity, thereby saving the resources consumed by the distribution capacity to reach the initial position of the pending order, and improving the rationality and comprehensiveness of the order scheduling method.
  • each pending order in the order group corresponds to the order group.
  • An exemplary embodiment of the degree of matching between various distribution capacities is as follows, and this step includes:
  • each of the distribution capacity according to the distribution information of the distribution capacity, respectively determine the target parameter corresponding to the distribution capacity after each pending order in the order group is pre-allocated to the distribution capacity, and the size of the target parameter Used to distinguish the pros and cons of pre-allocating the pending order to each distribution capacity;
  • the degree of matching between each order to be dispatched and the delivery capacity is determined according to the target parameter corresponding to the delivery capacity and each order to be dispatched.
  • the target parameter is determined by the increase in the distribution itinerary corresponding to the distribution capacity after the order to be dispatched is pre-allocated to the distribution capacity.
  • the increase in the distribution itinerary is used to determine the degree of matching between the order to be dispatched and the distribution capacity. .
  • after allocating order X to the distribution capacity its distribution itinerary increases by a large amount, which means that after the distribution capacity is increased to deliver the order X, it needs to increase more itineraries to complete the distribution.
  • the distribution capacity needs to be bypassed.
  • the order X is delivered by route, that is, the matching degree between the pending order and the delivery capacity is low.
  • the increase in the distribution itinerary is small, which means that after the distribution capacity is increased to distribute the order X, it only needs to add a small amount of itinerary to complete the distribution, if the distribution capacity can be delivered along the way
  • the order X that is, the order to be dispatched has a higher degree of matching with the delivery capacity.
  • the following describes an exemplary embodiment of the increase in the distribution journey corresponding to the distribution capacity after each pending order in the order group is pre-allocated to the distribution capacity according to the distribution information of the distribution capacity. .
  • the order distribution path is planned according to the assigned order of the distribution capacity and the order X, so as to distribute each order assigned and distributed.
  • the search is performed according to the order information (for example, the starting location information and the destination location information) of each order allocated by the delivery capacity, that is, according to the order information of each order , Traverse all the order connection sequence and obtain the total path in each alternative scheme, and use the shortest path as the order delivery path.
  • the difference between the order delivery path and the order delivery path before the unallocated order X is determined as the delivery itinerary increase, that is, the order delivery path change after the order X is pre-allocated for the delivery capacity.
  • the order X is pre-allocated for the delivery capacity, for the delivery capacity, according to the greedy algorithm and the set constraints, with the goal of maximizing the order delivery efficiency, insert into the delivery path of the order
  • the trial planning path corresponding to the distribution capacity is obtained, wherein the constraint condition is related to the set of each task point.
  • the trial planning route is adjusted to obtain the order delivery route corresponding to the delivery capacity.
  • the difference between the order delivery path and the order delivery path before the unallocated order X is determined as the delivery itinerary increase.
  • the delivery itinerary growth amount after determining the delivery itinerary growth amount, take the reciprocal of the delivery itinerary growth amount and perform normalization processing, so as to obtain the degree of matching between the pending order and the delivery capacity, where the delivery itinerary
  • the corresponding target parameter indicates that the pre-allocation of the pending order to the distribution capacity is the better, that is, the greater the matching degree between the pending order and the distribution capacity.
  • the above method of determining the matching degree is only an exemplary description, and is only used to indicate the negative correlation between the growth of the delivery itinerary and the matching degree, that is, the greater the growth of the delivery itinerary, the greater the relationship between the corresponding pending order and the delivery capacity
  • the smaller the matching degree of is not used to limit the present disclosure.
  • the target parameter is determined by the timeout period corresponding to the order to be delivered for the delivery capacity after the order to be dispatched is pre-allocated to the delivery capacity.
  • the delivery time corresponding to each order in the order delivery route is determined.
  • the sum of the time periods in which the delivery time of each order is later than the planned arrival time of the corresponding order is determined as the timeout time corresponding to the pending order of the delivery capacity.
  • the method for determining the matching degree according to the timeout period is the same as the above-mentioned method for determining the matching degree.
  • the relationship between the timeout period and the matching degree is negatively correlated , That is, the longer the timeout period, the smaller the matching degree between the corresponding pending order and the delivery capacity.
  • the corresponding timeout period is determined.
  • the weights corresponding to the timeout time and the delivery itinerary increase are set in advance, so that when the time-out time and the delivery itinerary increase are determined, the weighted sum is determined according to the respective weights as the target parameter, and the matching degree is determined according to the target parameter.
  • the matching degree is also determined by taking the reciprocal of the weighted sum and performing normalization. In this embodiment, the smaller the target parameter, the better the pre-allocation of the pending order to the distribution capacity, that is, the greater the degree of matching between the pending order and the distribution capacity.
  • the method of determining the matching degree according to the target parameters in the above examples is only exemplary, and it is only used to indicate that the determined target parameter and the matching degree are negatively correlated, that is, the larger the target parameter, the corresponding The smaller the matching degree between the order to be dispatched and the delivery capacity is, it is not used to limit the present disclosure.
  • the target parameters corresponding to the distribution capacity after each pending order in the order group is pre-allocated to the distribution capacity are determined according to the distribution information of the distribution capacity for each of the distribution capacity. ; Determine the degree of matching between each order to be dispatched and the delivery capacity according to the target parameter corresponding to the delivery capacity and each order to be dispatched. Therefore, in the above technical solution, it is possible to pre-allocate orders for the distribution capacity, and determine the matching degree between the pending order and the distribution capacity according to the parameter change of the distribution capacity after the order is allocated, so that the parameter change can be used to determine the matching degree between the order to be dispatched and the distribution capacity.
  • the delivery capacity of the delivery of the order is quantitatively expressed, which provides accurate data support for subsequent order scheduling based on the matching degree, and can ensure the rationality of order scheduling and meet the use requirements of order scheduling services.
  • an exemplary embodiment of order scheduling for the order to be scheduled is as follows, as shown in FIG. 2, this step may include:
  • the delivery capacity with the highest matching degree corresponding to the order to be dispatched is determined as the target delivery capacity corresponding to the order to be dispatched.
  • the delivery capacity with the highest matching degree corresponding to the pending order is determined as the target delivery capacity corresponding to the pending order, that is, the optimal delivery capacity of the scheduled order is first used to deliver the pending order Order.
  • the pending order with the highest matching degree corresponding to the target delivery capacity is determined as the target order corresponding to the target delivery capacity
  • the pending order is determined as the target order corresponding to the target delivery capacity.
  • the corresponding delivery capacity is A1, A2, A3, and the pending orders are C1, C2, C3, C4, C5.
  • the target delivery capacity corresponding to C1 is determined to be A2,
  • the determined target distribution capacity corresponding to C2 is A1
  • the determined target distribution capacity corresponding to C3 is A1
  • the determined target distribution capacity corresponding to C4 is A1
  • the determined target distribution capacity corresponding to C5 is A3.
  • the corresponding pending orders are C2, C3, C4.
  • one of the multiple pending orders is selected as the target delivery capacity A1 in this scheduling process.
  • the target order is the order for A1 to deliver.
  • the order to be dispatched with the highest matching degree corresponding to the target delivery capacity is determined as the target order corresponding to the target delivery capacity. If the matching degree between C3 and A1 is higher than the matching degree between C2 and A1, and the matching degree between C3 and A1 is higher than the matching degree between C4 and A1, then C3 is taken as the target order of A1. At this time, C2 and C3 did not perform scheduling allocation in this order scheduling.
  • the corresponding pending order is C1.
  • C1 is directly used as the target order of A2.
  • C5 takes C5 as the target order for A3.
  • the method of determining the target order in other order groups adopts the same method as described above, and will not be repeated here.
  • each order group can be determined separately, and high concurrency in the calculation of the order delivery method can also be ensured, and the efficiency of order scheduling can be effectively improved.
  • the matching degrees of the multiple pending orders corresponding to the target delivery capacity are the same and all have the highest value, it is determined whether the task point information of the multiple pending orders is the same, if the tasks of the multiple pending orders If the point information is the same, then the multiple pending orders will be regarded as the target order of the target delivery capacity; if the multiple pending orders have different task point information, then a pending order will be randomly selected from the multiple pending orders as the target Target order for delivery capacity.
  • the corresponding pending orders are C2, C3, and C4, where the matching degree between C2 and A1 and the matching degree between C3 and A1 are higher than the matching degree between C4 and A1, and the matching degree between C2 and A1 is higher than that between C4 and A1.
  • the matching degree of A1 is the same as the matching degree of C3 and A1, then C2 and C3 are taken as the target orders of A1.
  • C2 and C3 may be orders generated by two users in the same office building to purchase items at the same merchant. In this way, the starting positions and destination positions of C2 and C3 are the same, and the corresponding matching degrees are also the same.
  • each target order is assigned to its corresponding target delivery capacity.
  • each target order in the to-be-dispatched order is determined, so that each target order can be assigned to its corresponding target delivery capacity. For example, assign target order C3 to target delivery capacity A1, target order C1 to target delivery capacity A2, and target order C5 to target delivery capacity A3 to complete this order scheduling.
  • assigning each target order to its corresponding target delivery capacity is to add the order information of the target order to the delivery information of the target delivery capacity, that is, the target order is regarded as the order to be delivered for the target delivery capacity.
  • the distribution capacity is assigned the most suitable order to be dispatched, so as to ensure that in this scheduling, the For the dispatched order, the distribution capacity assigned to it is the most suitable, and for the distribution capacity of each assigned order, the assigned order is also the most suitable, so as to ensure the accuracy of the order scheduling, which is the follow-up
  • the fast delivery of orders provides the basis, and can simplify the complexity of global order scheduling and improve the efficiency of order scheduling.
  • the orders to be dispatched may not be able to be dispatched all through one order dispatch.
  • the pending orders C2 and C3 in the above example that is, no scheduling allocation is performed in this order scheduling. Therefore, the present disclosure also provides the following embodiments to ensure that each pending order can be scheduled, thereby ensuring user experience.
  • the method further includes: taking orders other than the target order among the to-be-dispatched orders as the to-be-dispatched orders in the next time unit.
  • the target order is the order scheduled during the order scheduling process of this time unit. Therefore, for the orders that are not scheduled during the order scheduling process of this time unit (that is, orders other than the target order among the pending orders) ), the partial order is regarded as the to-be-dispatched order to be scheduled in the next time unit, so that the partial order can be scheduled in the subsequent scheduling process.
  • the pending orders to be scheduled in the next time unit also include the newly created orders to be scheduled during the scheduling process of the current time unit, such as those in the current time unit.
  • a new order created by the user a new order created by the user.
  • the steps S11-S14 are re-executed, thereby realizing real-time scheduling of pending orders and improving scheduling efficiency.
  • the implementation of the steps S11-S14 has been described in detail above, and will not be repeated here.
  • the device 300 includes: a clustering module 301 configured to perform an order for each pending order within a time unit. Orders are dispatched for clustering to obtain multiple order groups; the first determining module 302 is configured to determine the delivery capacity corresponding to each of the order groups; the second determining module 303 is configured to target each order group. According to the order group, according to the order information of each order to be dispatched in the order group and the distribution information of each delivery capacity corresponding to the order group, determine each order to be dispatched in the order group and each delivery capacity corresponding to the order group The degree of matching between each; the scheduling module 304 is configured to perform order scheduling on each of the pending orders according to each of the degrees of matching.
  • the clustering module includes: a splitting sub-module configured to split the order group into multiple order groups for an order group in which the number of orders to be scheduled exceeds a preset threshold, wherein the splitting The number of orders to be dispatched in each of the divided order groups is less than the preset threshold.
  • the clustering module is configured to determine the number of cluster centers according to the number of each of the pending orders and the preset threshold; according to the number of the cluster centers, and each of the pending orders The order information of the dispatch order clusters the pending orders to obtain the multiple order groups.
  • the scheduling module includes: a first determining sub-module configured to determine, for each of the pending orders, the delivery capacity with the highest matching degree corresponding to the pending orders as the first determining sub-module that corresponds to the pending orders Corresponding target delivery capacity; an allocation sub-module configured to allocate each of the pending orders to the corresponding target delivery capacity.
  • the scheduling module includes: a second determining sub-module configured to deliver capacity for each target.
  • a second determining sub-module configured to deliver capacity for each target.
  • the order to be dispatched with the highest matching degree corresponding to the capacity is determined as the target order corresponding to the target delivery capacity; if there is one order to be dispatched corresponding to the target delivery capacity, the order to be dispatched is determined as the target order corresponding to the target delivery capacity Target orders; an allocation sub-module configured to allocate each of the target orders to their corresponding target delivery capacity.
  • the device is further configured to target delivery capacity for each target, and if there are two or more orders to be dispatched with the highest matching degree corresponding to the target delivery capacity, if the highest matching degree is If the task point information of each order to be dispatched is the same, then each order to be dispatched is regarded as the target order of the target delivery capacity; if the task point information of each order to be dispatched with the highest matching degree is different, then the order is different from each other.
  • the to-be-dispatched order selects a to-be-dispatched order as the target order of the target delivery capacity.
  • the device further includes: a third determining module configured to take orders other than the target order among the pending orders as the pending orders to be dispatched in the next time unit.
  • a third determining module configured to take orders other than the target order among the pending orders as the pending orders to be dispatched in the next time unit.
  • the order information includes different types of task point information;
  • the clustering module includes:
  • the clustering sub-module is configured to cluster the to-be-scheduled orders according to the task point information of the same type of the to-be-scheduled orders in the time unit.
  • the first determining module is configured to: for each of the order groups, determine the delivery capacity whose current position is less than a preset distance from the starting position of each order to be dispatched in the order group as the The delivery capacity corresponding to the order group.
  • the second determining module includes: a third determining sub-module configured to determine, for each of the distribution capacity, according to the distribution information of the distribution capacity, each pending order in the order group After being pre-allocated to the distribution capacity, the target parameter corresponding to the distribution capacity, the size of the target parameter is used to distinguish the pros and cons of pre-allocating the pending order to each distribution capacity; the fourth determining sub-module is configured to It is used to determine the matching degree between each order to be dispatched and the distribution capacity according to the target parameter corresponding to the distribution capacity and each order to be dispatched.
  • Fig. 4 is a block diagram showing an electronic device 400 according to an exemplary embodiment.
  • the electronic device 400 includes a processor 401 and a memory 402.
  • the electronic device 400 further includes one or more of a multimedia component 403, an input/output (I/O) interface 404, and a communication component 405.
  • a multimedia component 403 an input/output (I/O) interface 404
  • the processor 401 is used to control the overall operation of the electronic device 400 to complete all or part of the steps in the above-mentioned order scheduling method.
  • the memory 402 is used to store various types of data to support the operation of the electronic device 400.
  • the data includes, for example, instructions for any application or method to operate on the electronic device 400, and application-related data, such as Contact data, messages sent and received, pictures, audio, video, etc.
  • the memory 402 is implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (Static Random Access Memory, SRAM for short), electrically erasable and programmable memory devices.
  • SRAM static random access memory
  • the multimedia component 403 may include a screen and an audio component.
  • the screen is, for example, a touch screen, and the audio component is used to output and/or input audio signals.
  • the audio component includes a microphone, which is used to receive external audio signals.
  • the received audio signal is further stored in the memory 402 or sent through the communication component 405.
  • the audio component also includes at least one speaker for outputting audio signals.
  • the I/O interface 404 provides an interface between the processor 401 and other interface modules.
  • the above-mentioned other interface modules may be a keyboard, a mouse, a button, and the like.
  • these buttons are virtual buttons or physical buttons.
  • the communication component 405 is used for wired or wireless communication between the electronic device 400 and other devices. Wireless communication, such as Wi-Fi, Bluetooth, Near Field Communication (NFC), 2G, 3G, 4G, NB-IOT, eMTC, or other 5G, etc., or one or more of them The combination is not limited here. Therefore, the corresponding communication component 405 includes: a Wi-Fi module, a Bluetooth module, an NFC module, and so on.
  • the electronic device 400 is controlled by one or more application specific integrated circuits (Application Specific Integrated Circuit, ASIC for short), digital signal processor (Digital Signal Processor, DSP for short), and digital signal processing equipment (Digital Signal Processing Device).
  • ASIC Application Specific Integrated Circuit
  • DSP Digital Signal Processor
  • DSPD programmable logic device
  • PLD programmable Logic Device
  • FPGA field programmable gate array
  • controller microcontroller, microprocessor or other electronic components , Used to execute the above order scheduling method.
  • a computer-readable storage medium including program instructions that, when executed by a processor, implement the steps of the above-mentioned order scheduling method.
  • the computer-readable storage medium is the aforementioned memory 402 including program instructions, and the aforementioned program instructions can be executed by the processor 401 of the electronic device 400 to complete the aforementioned order scheduling method.
  • Fig. 5 is a block diagram showing an electronic device 500 according to an exemplary embodiment.
  • the electronic device 500 is provided as a server. 5
  • the electronic device 500 includes a processor 522, the number of which may be one or more, and a memory 532 for storing a computer program executable by the processor 522.
  • the computer program stored in the memory 532 includes one or more modules each corresponding to a set of instructions.
  • the processor 522 is configured to execute the computer program to execute the aforementioned order scheduling method.
  • the electronic device 500 further includes a power supply component 526 and a communication component 550, the power supply component 526 is configured to perform power management of the electronic device 500, and the communication component 550 is configured to implement the communication of the electronic device 500, for example, wired or Wireless communication.
  • the electronic device 500 further includes an input/output (I/O) interface 558.
  • the operation of the electronic device 500 is based on an operating system stored in the memory 532, such as Windows ServerTM, Mac OS XTM, UnixTM, LinuxTM, and so on.
  • a computer-readable storage medium including program instructions that, when executed by a processor, implement the steps of the above-mentioned order scheduling method.
  • the computer-readable storage medium may be the aforementioned memory 532 including program instructions, and the aforementioned program instructions may be executed by the processor 522 of the electronic device 500 to complete the aforementioned order scheduling method.
  • a computer-readable storage medium on which a computer program is stored.
  • the program is executed by a processor, the following steps are implemented: According to the order information of each pending order in a time unit, Each pending order is clustered to obtain multiple order groups; the distribution capacity corresponding to each order group is determined respectively; for each order group, according to the order information of each pending order in the order group and the distribution capacity corresponding to the order group To determine the matching degree between each pending order in the order group and each distribution capacity corresponding to the order group; according to each matching degree, order scheduling is performed on each pending order.
  • the following steps are further implemented: for an order group in which the number of orders to be dispatched exceeds a preset threshold, the order group is split into multiple order groups, where the split The number of orders to be dispatched in each order group is less than the preset threshold.
  • the following steps are implemented: determine the number of cluster centers according to the number of orders to be dispatched and a preset threshold; according to the number of cluster centers, and the orders of each order to be dispatched The information is clustered on the orders to be dispatched, and multiple order groups are obtained.
  • the following steps are implemented: for each order to be dispatched, the delivery capacity with the highest matching degree corresponding to the order to be dispatched is determined as the target delivery capacity corresponding to the order to be dispatched; Assign each pending order to the corresponding target delivery capacity.
  • the following steps are also implemented: for each target delivery capacity, if there are more than two orders to be dispatched corresponding to the target delivery capacity, the order corresponding to the target delivery capacity will be The pending order with the highest matching degree is determined as the target order corresponding to the target delivery capacity; when there is one pending order corresponding to the target delivery capacity, the pending order is determined as the target order corresponding to the target delivery capacity; Dispatching orders to the corresponding target distribution capacity includes: assigning each target order to its corresponding target distribution capacity.
  • the following steps are further implemented: taking orders other than the target order among the pending orders as the pending orders to be dispatched in the next time unit.
  • the order information includes different types of task point information; when the program is executed by the processor, the following steps are implemented: according to the same type of task point information of each pending order in a time unit, the pending orders are gathered kind.
  • the following steps are implemented: For each order group, determine the delivery capacity whose current position and the starting position of each pending order in the order group are less than the preset distance The distribution capacity corresponding to the order group.
  • the following steps are implemented: for each distribution capacity, according to the distribution information of the distribution capacity, it is determined to pre-allocate each pending order in the order group to the distribution capacity, and the distribution The target parameter corresponding to the capacity.
  • the size of the target parameter is used to distinguish the pros and cons of pre-allocating the pending orders to each distribution capacity; according to the distribution capacity and the target parameters corresponding to each pending order, determine the difference between each pending order and the distribution capacity suitability.
  • an electronic device includes: a memory on which a computer program is stored; and a processor configured to execute the computer program in the memory to implement the following steps:
  • the order information of each pending order in a time unit is clustered to obtain multiple order groups; the delivery capacity corresponding to each order group is determined respectively; for each order group, according to each pending order in the order group
  • the order information of the dispatch order and the distribution information of each distribution capacity corresponding to the order group determine the matching degree between each pending order in the order group and each distribution capacity corresponding to the order group; according to each matching degree, each pending order is determined Carry out order scheduling.
  • the processor is further configured to execute a computer program in the memory to implement the following steps: for an order group in which the number of orders to be dispatched exceeds a preset threshold, the order group is split into Multiple order groups, where the number of orders to be dispatched in each of the split order groups is less than a preset threshold.
  • the processor is configured to execute a computer program in the memory to implement the following steps: determine the number of cluster centers according to the number of orders to be dispatched and a preset threshold; The quantity and the order information of each pending order are clustered to obtain multiple order groups.
  • the processor is further configured to execute a computer program in the memory to implement the following steps: for each pending order, the delivery capacity with the highest matching degree corresponding to the pending order is determined as The target delivery capacity corresponding to the order to be dispatched; each order to be dispatched is assigned to the corresponding target delivery capacity.
  • the processor is further configured to execute a computer program in the memory to implement the following steps: for each target distribution capacity, in the case where there are more than two orders to be dispatched corresponding to the target distribution capacity Next, the order to be dispatched with the highest matching degree corresponding to the target delivery capacity is determined as the target order corresponding to the target delivery capacity; when there is one order to be dispatched corresponding to the target delivery capacity, the order to be dispatched is determined as the target delivery The target order corresponding to the capacity; the processor is configured to execute a computer program in the memory to implement the following steps: each target order is assigned to the corresponding target distribution capacity.
  • the processor is further configured to execute a computer program in the memory to implement the following steps: take orders other than the target order among the orders to be scheduled as the orders to be scheduled in the next time unit Pending orders.
  • the order information includes different types of task point information; the processor is configured to execute a computer program in the memory to implement the following steps: according to the same type of orders for each pending order in a time unit Task point information, clustering orders to be scheduled.
  • the processor is configured to execute a computer program in the memory to implement the following steps: For each order group, compare the current position with the starting position of each pending order in the order group. The delivery capacity whose distance is less than the preset distance is determined as the delivery capacity corresponding to the order group.
  • the processor is configured to execute a computer program in the memory to implement the following steps: for each distribution capacity, according to the distribution information of the distribution capacity, respectively determine the order group to be dispatched After the order is pre-allocated to the distribution capacity, the target parameter corresponding to the distribution capacity.
  • the size of the target parameter is used to distinguish the pros and cons of pre-allocating the pending orders to each distribution capacity; each is determined according to the distribution capacity and the target parameters corresponding to each pending order The degree of matching between pending orders and delivery capacity.
  • a computer program product includes a computer program that can be executed by a programmable device, and the computer program has a function for executing the foregoing when executed by the programmable device.
  • the code part of the order scheduling method is further provided, the computer program product includes a computer program that can be executed by a programmable device, and the computer program has a function for executing the foregoing when executed by the programmable device.
  • a computer program product includes a computer program that can be executed by a programmable device.
  • the following steps are implemented: Order information of orders to be dispatched, cluster each order to be dispatched to obtain multiple order groups; respectively determine the delivery capacity corresponding to each order group; for each order group, according to the order information of each order to be dispatched in the order group.
  • the distribution information of each distribution capacity corresponding to the order group determines the matching degree between each pending order in the order group and each distribution capacity corresponding to the order group; order scheduling is performed on each pending order according to each matching degree.
  • the following steps are further implemented: for an order group in which the number of orders to be dispatched exceeds a preset threshold, the order group is split into multiple order groups, where The number of orders to be dispatched in each of the divided order groups is less than the preset threshold.
  • the following steps are implemented: determine the number of cluster centers according to the number of orders to be dispatched and a preset threshold; according to the number of cluster centers, and the number of orders to be dispatched
  • the order information clusters the orders to be scheduled to obtain multiple order groups.
  • the following steps are implemented: for each pending order, the delivery capacity with the highest matching degree corresponding to the pending order is determined as the target delivery capacity corresponding to the pending order ; Assign each pending order to the corresponding target distribution capacity.
  • the following steps are also implemented: For each target delivery capacity, if there are more than two orders to be dispatched corresponding to the target delivery capacity, it will correspond to the target delivery capacity.
  • the pending order with the highest matching degree is determined as the target order corresponding to the target delivery capacity; in the case of one pending order corresponding to the target delivery capacity, the pending order is determined as the target order corresponding to the target delivery capacity;
  • the allocation of pending orders to the corresponding target delivery capacity includes: allocating each target order to its corresponding target delivery capacity.
  • the following step is further implemented: taking orders other than the target order among the orders to be dispatched as orders to be dispatched in the next time unit.
  • the order information includes different types of task point information; when the computer level is executed by the electronic device, the following steps are implemented: according to the same type of task point information of each pending order in a time unit, the pending order is processed Clustering.
  • the following steps are implemented: For each order group, the distance between the current position and the starting position of each pending order in the order group is smaller than the delivery capacity of the preset distance Determine the delivery capacity corresponding to the order group.
  • the following steps are implemented: for each distribution capacity, according to the distribution information of the distribution capacity, respectively determine to pre-allocate each pending order in the order group to the distribution capacity, The target parameter corresponding to the distribution capacity, the size of the target parameter is used to distinguish the pros and cons of pre-allocating the pending orders to each distribution capacity; according to the distribution capacity and the target parameters corresponding to each pending order, determine the difference between each pending order and the distribution capacity The degree of match.
  • Fig. 6 is a schematic diagram showing an implementation environment according to an exemplary embodiment.
  • the implementation environment includes a plurality of first terminals 601, a plurality of second terminals 602, and a server 603.
  • the terminal 601 is directly or indirectly connected to the server 603 in a wired or wireless manner
  • the multiple second terminals 602 are directly or indirectly connected to the server 603 in a wired or wireless manner, respectively.
  • first terminals 601 are installed with a first target application client
  • multiple second terminals 602 are installed with a second target application client
  • the server 603 is for the first target application client and the second target application client.
  • the server that provides services at the end.
  • the first target application client is a client with a purchasing service function, for example, the first target application client is a shopping client, an instant messaging client, and so on.
  • the second target application client is a client with a task distribution function, for example, a delivery client.
  • multiple first terminals 601 upload multiple user orders to the server 602, and the server 602 performs order scheduling on the multiple orders, and distributes the delivery tasks of the multiple orders to multiple second terminals 602.
  • the user using the second terminal 602 delivers the multiple orders.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Theoretical Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Accounting & Taxation (AREA)
  • Tourism & Hospitality (AREA)
  • Finance (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Data Mining & Analysis (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • General Engineering & Computer Science (AREA)
  • Evolutionary Biology (AREA)
  • Evolutionary Computation (AREA)
  • General Factory Administration (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

Selon l'invention, un regroupement est effectué sur chaque commande à expédier selon des informations de commande de chaque commande à expédier au cours d'une unité de temps, et une pluralité de groupes de commandes est obtenue; des forces de transport de livraison correspondant à chaque groupe de commandes sont respectivement déterminées; par rapport à chaque groupe de commandes, des degrés de concordance entre chaque commande à expédier au sein dudit groupe de commandes et des forces de transport de livraison correspondant au groupe de commandes sont déterminés d'après les informations de commande de chaque commande à expédier au sein du groupe de commandes et des informations de livraison de chaque force de transport de livraison correspondant au groupe de commandes; la répartition de commandes est effectuée sur chaque commande à expédier selon les degrés de concordance.
PCT/CN2020/115991 2020-01-21 2020-09-17 Répartition de commandes WO2021147353A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010071676.5A CN113222305B (zh) 2020-01-21 2020-01-21 订单调度方法、装置、存储介质和电子设备
CN202010071676.5 2020-01-21

Publications (1)

Publication Number Publication Date
WO2021147353A1 true WO2021147353A1 (fr) 2021-07-29

Family

ID=76991630

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/115991 WO2021147353A1 (fr) 2020-01-21 2020-09-17 Répartition de commandes

Country Status (2)

Country Link
CN (1) CN113222305B (fr)
WO (1) WO2021147353A1 (fr)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113673934A (zh) * 2021-08-26 2021-11-19 深圳市易流科技股份有限公司 一种订单与线路的匹配方法及装置、设备和存储介质
CN113723676A (zh) * 2021-08-23 2021-11-30 郑州时空隧道信息技术有限公司 一种一路多单的线路规划方法及装置
CN113793195A (zh) * 2021-08-25 2021-12-14 深圳依时货拉拉科技有限公司 网约车订单处理方法、装置、计算机设备及可读存储介质
CN113988992A (zh) * 2021-11-17 2022-01-28 杭州拼便宜网络科技有限公司 订单信息发送方法、装置、电子设备和计算机可读介质
CN114638580A (zh) * 2022-04-06 2022-06-17 深圳市海柔创新科技有限公司 配送订单的处理方法、装置和设备
CN114936768A (zh) * 2022-05-12 2022-08-23 浙江吉利控股集团有限公司 一种网约车订单的处理方法、装置、设备及介质
CN116843166A (zh) * 2023-08-31 2023-10-03 湘江实验室 一种打车方法、装置、设备及介质
CN116957290A (zh) * 2023-08-09 2023-10-27 北京丰赞科技有限公司 一种团餐订单的配送运力调度方法及装置
CN117094536A (zh) * 2023-10-19 2023-11-21 青岛冠成软件有限公司 一种订单数据分析方法及系统
CN117557077A (zh) * 2024-01-12 2024-02-13 宁波安得智联科技有限公司 运力分配方法、运力分配设备以及存储介质

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113723673B (zh) * 2021-08-18 2024-12-03 郑州时空隧道信息技术有限公司 一种订单指派方法及系统
CN114372754B (zh) * 2022-01-11 2023-04-28 拉扎斯网络科技（上海）有限公司 订单匹配方法、装置及计算机设备
CN118195191B (zh) * 2022-12-14 2025-01-21 北京三快在线科技有限公司 自动驾驶车辆混合调度系统以及自动驾驶车辆

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030187686A1 (en) * 2002-03-29 2003-10-02 Fujitsu Limited Shipped product allocating system, method and program therefor
CN105468698A (zh) * 2015-11-18 2016-04-06 上海电机学院 一种海量订单实时处理方法
CN109583799A (zh) * 2017-09-28 2019-04-05 北京三快在线科技有限公司 区域划分的方法及装置、电子设备
CN109800997A (zh) * 2019-01-30 2019-05-24 拉扎斯网络科技（上海）有限公司 一种订单分配方法、装置、存储介质和电子设备
CN109934537A (zh) * 2019-03-12 2019-06-25 北京同城必应科技有限公司 订单分配方法、装置、服务器和存储介质

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107392512B (zh) * 2016-11-25 2018-06-01 北京小度信息科技有限公司 任务分组方法和装置
CN107392405B (zh) * 2017-01-26 2018-06-01 北京小度信息科技有限公司 数据处理方法、装置及设备
CN107292701A (zh) * 2017-05-25 2017-10-24 北京小度信息科技有限公司 订单分组方法和装置
CN107392412B (zh) * 2017-06-05 2021-10-12 北京星选科技有限公司 订单调度方法和装置
CN107844879A (zh) * 2017-06-27 2018-03-27 北京小度信息科技有限公司 订单分配方法和装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030187686A1 (en) * 2002-03-29 2003-10-02 Fujitsu Limited Shipped product allocating system, method and program therefor
CN105468698A (zh) * 2015-11-18 2016-04-06 上海电机学院 一种海量订单实时处理方法
CN109583799A (zh) * 2017-09-28 2019-04-05 北京三快在线科技有限公司 区域划分的方法及装置、电子设备
CN109800997A (zh) * 2019-01-30 2019-05-24 拉扎斯网络科技（上海）有限公司 一种订单分配方法、装置、存储介质和电子设备
CN109934537A (zh) * 2019-03-12 2019-06-25 北京同城必应科技有限公司 订单分配方法、装置、服务器和存储介质

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113723676A (zh) * 2021-08-23 2021-11-30 郑州时空隧道信息技术有限公司 一种一路多单的线路规划方法及装置
CN113793195A (zh) * 2021-08-25 2021-12-14 深圳依时货拉拉科技有限公司 网约车订单处理方法、装置、计算机设备及可读存储介质
CN113793195B (zh) * 2021-08-25 2024-03-15 深圳依时货拉拉科技有限公司 网约车订单处理方法、装置、计算机设备及可读存储介质
CN113673934A (zh) * 2021-08-26 2021-11-19 深圳市易流科技股份有限公司 一种订单与线路的匹配方法及装置、设备和存储介质
CN113673934B (zh) * 2021-08-26 2024-04-26 深圳市易流科技股份有限公司 一种订单与线路的匹配方法及装置、设备和存储介质
CN113988992A (zh) * 2021-11-17 2022-01-28 杭州拼便宜网络科技有限公司 订单信息发送方法、装置、电子设备和计算机可读介质
CN114638580A (zh) * 2022-04-06 2022-06-17 深圳市海柔创新科技有限公司 配送订单的处理方法、装置和设备
CN114936768A (zh) * 2022-05-12 2022-08-23 浙江吉利控股集团有限公司 一种网约车订单的处理方法、装置、设备及介质
CN116957290B (zh) * 2023-08-09 2024-02-27 上海丰赞科技有限公司 一种团餐订单的配送运力调度方法及装置
CN116957290A (zh) * 2023-08-09 2023-10-27 北京丰赞科技有限公司 一种团餐订单的配送运力调度方法及装置
CN116843166B (zh) * 2023-08-31 2023-11-21 湘江实验室 一种打车方法、装置、设备及介质
CN116843166A (zh) * 2023-08-31 2023-10-03 湘江实验室 一种打车方法、装置、设备及介质
CN117094536B (zh) * 2023-10-19 2024-01-12 青岛冠成软件有限公司 一种订单数据分析方法及系统
CN117094536A (zh) * 2023-10-19 2023-11-21 青岛冠成软件有限公司 一种订单数据分析方法及系统
CN117557077A (zh) * 2024-01-12 2024-02-13 宁波安得智联科技有限公司 运力分配方法、运力分配设备以及存储介质
CN117557077B (zh) * 2024-01-12 2024-04-26 宁波安得智联科技有限公司 运力分配方法、运力分配设备以及存储介质

Also Published As

Publication number Publication date
CN113222305A (zh) 2021-08-06
CN113222305B (zh) 2023-05-16

Similar Documents

Publication Publication Date Title
WO2021147353A1 (fr) Répartition de commandes
US11265369B2 (en) Methods and systems for intelligent distribution of workloads to multi-access edge compute nodes on a communication network
Hussein et al. Efficient task offloading for IoT-based applications in fog computing using ant colony optimization
Liu et al. Online computation offloading and traffic routing for UAV swarms in edge-cloud computing
CN110645983B (zh) 用于无人车的路径规划方法、装置和系统
CN107094165B (zh) 配送能力确定、配送任务获取、配送资源调度方法和设备
US10474504B2 (en) Distributed node intra-group task scheduling method and system
US20160048804A1 (en) Systems and methods for transportation services for package delivery
CN102662764B (zh) 一种基于smdp的动态云计算资源优化分配方法
WO2019037367A1 (fr) Procédé et appareil de traitement de tâche de livraison, et dispositif électronique
CN110069341B (zh) 边缘计算中结合功能按需配置的有依赖关系任务的调度方法
CN103927229A (zh) 在动态可用服务器集群中调度映射化简作业
CN110519370B (zh) 一种基于设施选址问题的边缘计算资源分配方法
WO2019205784A1 (fr) Procédé et appareil d'attribution de tâche de livraison, dispositif électronique et support de stockage informatique
JP6621945B2 (ja) ユーザ行動に基づくサービスディスパッチのシステム及び方法
US20200059097A1 (en) Providing Energy Elasticity Services Via Distributed Virtual Batteries
CN109710406B (zh) 数据分配及其模型训练方法、装置、及计算集群
US20220121467A1 (en) A method and a system for managing the computing resources of a cloud computing platform
CN110991808A (zh) 一种任务分配方法和装置
Ma et al. Fast algorithms for capacitated cloudlet placements
CN117407160A (zh) 一种边缘计算场景下在线任务和离线任务的混合部署方法
CN115016911B (zh) 面向大规模联邦学习的任务编排方法、装置、设备和介质
CN106407007B (zh) 面向弹性分析流程的云资源配置优化方法
US10452126B2 (en) Method for fair off-loading of computational tasks for efficient energy management in mobile devices like smart phones
CN105824919B (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: 20916134

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20916134

Country of ref document: EP

Kind code of ref document: A1