WO2019000780A1 - 订单调度方法、装置、电子设备及计算机可读存储介质 - Google Patents

订单调度方法、装置、电子设备及计算机可读存储介质 Download PDF

Info

Publication number
WO2019000780A1
WO2019000780A1 PCT/CN2017/110001 CN2017110001W WO2019000780A1 WO 2019000780 A1 WO2019000780 A1 WO 2019000780A1 CN 2017110001 W CN2017110001 W CN 2017110001W WO 2019000780 A1 WO2019000780 A1 WO 2019000780A1
Authority
WO
WIPO (PCT)
Prior art keywords
order
orders
dispatchers
dispatcher
allocated
Prior art date
Application number
PCT/CN2017/110001
Other languages
English (en)
French (fr)
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 WO2019000780A1 publication Critical patent/WO2019000780A1/zh

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/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
    • 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
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • 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

Definitions

  • the present disclosure relates to the field of Internet technologies, and in particular, to an order scheduling method, apparatus, electronic device, and computer readable storage medium.
  • the existing logistics dispatch system can guarantee the delivery efficiency of most orders.
  • the existing logistics dispatching system can only preferentially guarantee the distribution efficiency of a small number of orders.
  • Most of the orders still have the problem of delivery timeout, so it is necessary to provide a kind of A new order scheduling solution to further improve order delivery efficiency and reduce the probability of order overtime delivery.
  • the present disclosure provides a solution, the main principle of which is: in the scenario where multiple types of dispatchers coexist, unified scheduling of multiple types of dispatchers from the perspective of order fusion, and realizing multiple capacity.
  • the complementarity between the two to further improve the order delivery efficiency and reduce the probability of order overtime delivery.
  • an order scheduling method including:
  • a dispatcher is assigned to the order in the set of to-be-distributed orders from the at least two types of dispatchers.
  • acquiring at least two types of delivery personnel corresponding to each of the orders to be allocated, forming a waiting Assign a collection of orders including:
  • the order allocation process is a single-distribution process, a grouping process, or a merging process including a single-distribution process and a grouping process.
  • an order in the to-be-distributed order set is from the at least two types of dispatchers.
  • Assign distributors including:
  • the dispatcher is assigned to the order that is not allocated by the parallel allocation process in the set of to-be-distributed orders in the grouping distribution process.
  • the dispatcher who needs to deliver the order and assigns the dispatcher to the order in the set of the to-be-distributed order by the parallel distribution process, including:
  • the dispatcher is assigned to the orders in the set of the to-be-distributed orders by the parallel distribution process.
  • the order allocation process is the to-be-allocated order Orders in the collection are assigned to the dispatcher, including:
  • the part-time delivery personnel of the at least two types of delivery personnel, from the part-time delivery personnel, the delivery personnel who have orders to be delivered, and the parallel distribution process is the to-be-allocated order Orders in the collection are assigned to the dispatcher, including:
  • the information of the order is sent to the dispatcher who matches the order with the first matching degree requirement, so that the matching degree with the order meets the first matching degree requirement.
  • the delivery staff grabs the order;
  • the dispatcher is allocated to the order that is not allocated by the parallel distribution process in the set of to-be-distributed orders, including:
  • the dispatchers are assigned to the orders that are not allocated by the parallel distribution process in the set of to-be-distributed orders in the group distribution process in turn from each type of dispatcher.
  • the full-time dispatcher of the at least two types of dispatchers, from the full-time dispatcher, the grouping process is not allocated by the batch allocation process in the set of to-be-distributed orders Order distribution distributors, including:
  • a distributor is assigned to each of the order groups from the full-time distributor according to the degree of matching between each of the order groups and each of the full-time distributors.
  • a part-time distributor of the at least two types of dispatchers, from the part-time dispatcher, the grouping process is not allocated in the set of to-be-distributed orders by the parallel allocation process.
  • Order distribution distributors including:
  • the order group For each order group, when a dispatcher initiates a grab operation for the order group, the order group is assigned to the dispatcher who initiated the grab operation.
  • an order scheduling apparatus including:
  • An obtaining module configured to obtain an order to be allocated corresponding to at least two types of delivery personnel, and form a collection of orders to be allocated;
  • a determining module configured to determine an order allocation process when the at least two types of dispatchers are uniformly scheduled
  • an allocating module configured to allocate a distributor from the at least two types of dispatchers to the orders in the set of to-be-distributed in the process of executing the order allocation process.
  • the obtaining module is configured to:
  • the order allocation process is a single-distribution process, a grouping distribution process, or a merged distribution process including a single-distribution process and a grouping process.
  • the allocation module is configured to:
  • the dispatcher is assigned to the order that is not allocated by the parallel allocation process in the set of to-be-distributed orders in the grouping distribution process.
  • the allocating module is configured to: when assigning a dispatcher to an order in the set of to-be-distributed orders in a parallel allocation process:
  • the dispatcher is assigned to the orders in the set of the to-be-distributed orders by the parallel distribution process.
  • the distribution module is configured to:
  • the distribution module is configured to:
  • the information of the order is sent to the dispatcher who matches the order with the first matching degree requirement, so that the matching degree with the order meets the first matching degree requirement.
  • the delivery staff grabs the order;
  • the allocating module is configured to: according to the at least two types of distribution, when the distribution module is allocated to the order that is not allocated by the single distribution process in the set of to-be-distributed orders in the group distribution process.
  • the distribution module is configured to:
  • a distributor is assigned to each of the order groups from the full-time distributor according to the degree of matching between each of the order groups and each of the full-time distributors.
  • a part-time distributor of the at least two types of dispatchers the distribution module is configured to:
  • the order group For each order group, when a dispatcher initiates a grab operation for the order group, the order group is assigned to the dispatcher who initiated the grab operation.
  • Embodiments of the present disclosure also provide an electronic device comprising: a memory and a processor; the memory storing one or more computer instructions that, when executed by the processor, implement the method The steps in the method provided by the example.
  • the embodiment of the present disclosure further provides a computer readable storage medium storing a computer program, the computer program being executed to implement the steps in the method provided by the foregoing method embodiment.
  • At least two types of delivery personnel corresponding to each of the to-be-allocated orders are merged to form a set of orders to be distributed, and at least two types of delivery personnel are uniformly scheduled, and an order allocation process in a unified scheduling is adopted, from at least two
  • the dispatcher assigns the dispatcher to the merged order to be dispatched, and uniformly dispatches the multi-type dispatchers from the perspective of order fusion, thereby achieving the complementarity between multiple transport capacities, which is beneficial to further improve the order delivery efficiency and reduce the order timeout.
  • the probability of delivery is provided.
  • FIG. 1 is a schematic flowchart of an order scheduling method according to an embodiment of the present disclosure
  • FIG. 2 is a schematic flowchart of an order scheduling method according to another embodiment of the present disclosure.
  • FIG. 3 is a schematic structural diagram of an order scheduling apparatus according to still another embodiment of the present disclosure.
  • FIG. 1 is a schematic flowchart diagram of an order scheduling method according to an embodiment of the present disclosure. As shown in FIG. 1, the method includes:
  • the logistics dispatching system employs multiple types of dispatchers, and different types of dispatchers are mainly responsible for delivering respective corresponding orders.
  • an order pool can be configured for each type of delivery personnel, and all types of delivery personnel are mainly responsible for delivering orders in their respective order pools.
  • Many types of dispensers may include, but are not limited to, full-time distributors and part-time distributors.
  • the staff of the full-time distribution staff is relatively fixed, and the staff of the part-time distribution staff is relatively mobile. Therefore, compared with the part-time delivery staff, the overall distribution service quality of the full-time distribution staff is relatively high, but the delivery cost is relatively high. .
  • the merchant may select the type of distributor for his or her order, and once the merchant selects the type of distributor, the order for the merchant will enter the corresponding order pool and wait for scheduling by the logistics dispatch system.
  • the logistics dispatching system may also select the type of dispatcher for the order according to the overall capacity of the various types of dispatchers; when the logistics dispatching system selects the type of dispatcher for the order, the order will enter the corresponding order pool and wait for logistics Scheduling of the scheduling system.
  • the logistics dispatching system may also select the type of dispatcher for the order according to the delivery demand of the order; when the logistics dispatching system selects the type of dispatcher for the order, the order will enter the corresponding order pool and wait for the scheduling of the logistics dispatching system.
  • the order dispatching system uses various types of dispatchers, and different types of dispatchers are used for different orders, making full use of the advantages of various types of dispatchers, and the order delivery efficiency can be improved to some extent. However, if we can further integrate and dispatch multiple types of distributors on the basis of coexistence of multiple types of dispatchers, and realize the complementary capacity between multiple types of dispatchers, it will help to further improve the order delivery efficiency and reduce the probability of order overtime delivery. .
  • the order scheduling method provided by the embodiment combines the unified scheduling idea of the dispatcher from the perspective of order fusion, and realizes the fusion adjustment among multiple types of dispatchers. degree.
  • the flow of the order scheduling method provided by this embodiment is as follows:
  • the to-be-distributed order set contains the to-be-allocated orders corresponding to each of the at least two types of dispatchers.
  • the first type of dispatcher's pending order is order a, order b, and order c
  • the second type of dispatcher's pending order is order e, order f, and order g
  • the to-be-distributed order set contains order a, order b.
  • the order allocation process when the at least two types of dispatchers are uniformly scheduled is determined.
  • a dispatcher is assigned to the order in the set of orders to be dispensed from at least two types of dispatchers.
  • the order allocation process needs to involve at least two types of dispatchers, so the order allocation process here is different from the existing order allocation process. .
  • at least two types of dispatchers need to be scheduled, so that the orders in the set of orders to be allocated are allocated to the relatively idle distributors of the various types of dispatchers, instead of the orders in the set of orders to be dispensed. All are assigned to a certain type of distribution staff, to achieve the purpose of unified scheduling of at least two types of distribution staff, to achieve complementarity between multiple capacity.
  • the at least two types of delivery personnel corresponding to each of the to-be-allocated orders are merged to form a set of orders to be distributed, and at least two types of delivery personnel are uniformly scheduled, and the order allocation process in the unified scheduling is adopted, from at least two types.
  • the dispatcher assigns the dispatcher to the merged order to be dispatched, and uniformly dispatches the multi-type dispatchers from the perspective of order fusion to realize the complementarity between multiple transport capacities, which is beneficial to further improve the order delivery efficiency and reduce the order overtime delivery. The probability.
  • At least two types of order pools corresponding to at least two types of dispatchers may be determined; and the to-be-allocated orders in the at least two types of order pools are obtained to form a set of orders to be allocated.
  • the order to be assigned corresponding to the type of dispatcher can be obtained from the order pool corresponding to the dispatcher.
  • the order to be allocated corresponding to each type of dispatcher may be one or more.
  • a priority between at least two types of dispatchers can be set.
  • the orders to be allocated can be obtained from the order pools corresponding to at least two types of dispatchers in order according to the priority between the two types of dispatchers, thereby forming a set of orders to be allocated.
  • the orders to be allocated may also be obtained from the corresponding order pools of the at least two types of dispatchers in parallel, thereby forming a set of orders to be allocated.
  • the to-be-allocated order may be obtained from the corresponding order pool according to the order in which the new orders in the corresponding order pools of the at least two types of delivery personnel arrive in order, thereby forming a set of orders to be allocated.
  • the order allocation process when the at least two types of dispatchers are uniformly scheduled may be a single allocation process, or may be a group allocation process, or may include a single allocation process and A converged distribution process for the grouping process.
  • the single-distribution process is actually an order appending process, which is mainly to judge whether a new order can be added to a dispatcher who needs to deliver the order, so that the dispatcher can deliver the new order by the way, thereby achieving the purpose of saving transportation capacity.
  • the grouping process refers to the process of grouping orders and ordering them in order group units.
  • the converged distribution process refers to the process of order allocation in combination with the single distribution process and the group distribution process.
  • the fusion allocation process may be performed, and in the process of performing the fusion allocation process, among the at least two types of dispatchers, the order collection to be allocated is The order is assigned to the distributor.
  • a fusion allocation process includes: performing a single-allocation process and then performing a packet allocation process.
  • the following is an example of performing a single-distribution process and then performing a converged allocation process of the grouping process, in which, in the process of performing the converged distribution process, the distributors are assigned to the orders in the to-be-distributed order set from at least two types of dispatchers. process.
  • the order allocation process for the unified scheduling of at least two types of dispatchers is to execute and distribute the process first, and then perform the integrated distribution process of the grouping process, there are still at least two types of dispatchers among the dispatchers who need to be delivered. And assigning a dispatcher to the order in the set of orders to be distributed by the side-by-side distribution process, that is, a single-distribution process; and then, from the at least two types of dispatchers, the grouping process is not included in the set of pending orders
  • the order assigned to the distribution process assigns the distributor, the grouping process.
  • the order in the set of the order to be distributed may be sequentially selected from the at least two types of dispatchers who have orders to be delivered in the set manner. Assign a distributor.
  • the "sequence" here refers to the meaning of executing one by one in a certain order.
  • the distribution of the order to the orders in the set of orders to be dispensed by the parallel allocation process actually means: according to a certain order, from each type of delivery Among the staff members who have orders to be delivered, the distribution order is assigned to the order in the order to be assigned.
  • a type ID can be configured for each type of dispatcher. Based on this, the order IDs of the at least two types of dispatchers can be assigned in order from the smallest to the largest, and from the dispatchers who have orders to be delivered in each type of dispatcher, and the order allocation process is used to allocate the orders in the set of orders to be allocated. Delivery staff.
  • At least two types of dispatchers include full-time distributors and part-time distributors.
  • the full-time distributor has a type ID of 00001111 (binary) and a part-time distributor has a type ID of 00011111 (binary).
  • the dispatcher when entering the single-distribution process, the dispatcher can be assigned to the order in the set of orders to be assigned from the dispatcher who has the order to be delivered from the full-time dispatcher; Among the dispatchers who still have orders to be delivered, the dispatcher is assigned to the order in the set of orders to be assigned by the parallel order distribution process.
  • At least two types of dispatchers include full-time distributors and part-time distributors.
  • the part-time distributor has a type ID of 00001111 (binary) and a full-time distributor has a type ID of 00011111 (binary).
  • the distributors who have orders to be delivered from the part-time distributors can be assigned to the orders in the order to be assigned by the single-distribution process;
  • the dispatcher is assigned to the order in the set of orders to be assigned by the parallel order distribution process.
  • type ID of the above-mentioned distributor is only an example. In practical applications, different values can be set and different hexadecimal methods can be used.
  • the priority between at least two types of dispatchers can be pre-configured. Based on this, in accordance with the priority between at least two types of dispatchers, the dispatchers who have orders to be delivered among the types of dispatchers in turn can be assigned to the orders in the set of orders to be dispensed by the single-distribution process.
  • At least two types of dispatchers include full-time distributors and part-time distributors, and full-time distributors have higher priority than part-time distributors. Based on this, when entering the single-distribution process, the dispatcher can be assigned to the order in the set of orders to be assigned from the dispatcher who has the order to be delivered from the full-time dispatcher; Among the dispatchers who still have orders to be delivered, the dispatcher is assigned to the order in the set of orders to be assigned by the parallel order distribution process.
  • At least two types of dispatchers include full-time distributors and part-time distributors, and part-time distributors have higher priority than full-time distributors. Based on this, when entering the single-distribution process, the distributors who have orders to be delivered from the part-time distributors can be assigned to the orders in the order to be assigned by the single-distribution process; Among the dispatchers who still have orders to be delivered, the dispatcher is assigned to the order in the set of orders to be assigned by the parallel order distribution process.
  • the logistics dispatching system will have different scheduling methods for the dispatcher during the execution and single allocation process.
  • the scheduling mode of the logistics dispatching system to the dispatcher may include: an assignment mode and a grab mode.
  • the above assignment mode refers to the distribution mode in which the logistics dispatching system directly assigns orders to the corresponding dispatchers.
  • the dispatcher In the assignment mode, the dispatcher has no decision-making power and the order allocation efficiency is high.
  • the above-mentioned grabbing mode refers to that the order dispatching system sends the order information to the dispatcher, and the dispatcher decides whether to grab the order and assigns the order to the dispatcher of the grabbing order.
  • the dispatcher has the decision-making power, the management is more flexible, and the degree of freedom of the part-time dispatcher is higher, which is beneficial to improve the order allocation efficiency.
  • an assignment mode can be used to ensure order allocation efficiency
  • a grab mode can be used to ensure order allocation efficiency
  • the full-time dispatcher can use the assignment method, and from the dispatcher who has the order to be delivered from the full-time dispatcher, the single dispatcher The process assigns a dispatcher to the order in the order to be assigned. Similarly, for part-time delivery personnel, the method of grabbing the order can be used. From the part-time distributor who has the order to be delivered, the dispatcher is assigned to the order in the set of orders to be distributed.
  • the process of assigning the distributors to the orders in the to-be-distributed order collection by the assignment process from the dispatcher who has the order to be delivered from the full-time distributor includes: obtaining the order to be assigned An order that has not been allocated in the collection; for each order in the order that is not allocated in the assigned order set, the degree of matching between the order and the dispatcher who has an order to be delivered among the full-time distributors is calculated; Determining whether there is a distribution person in the full-time distribution staff who still needs to deliver the order, whether there is a delivery person who matches the order with the first matching degree requirement; if the judgment result is present, directly assign the order to A matcher with the order that matches the first match requirement.
  • the grab-selling method is used, and among the part-time distributors who have orders to be delivered, the distribution order is assigned to the orders in the to-be-distributed order set by the parallel allocation process: obtaining the to-be-distributed order set An order that has not been assigned; for each order in the order that is not allocated in the distribution order set, the matching degree between the order and the distributor who has an order to be delivered among the part-time distributors is calculated.
  • the order may be calculated according to at least one of an attribute of the order, such as a user attribute, a merchant attribute, and an order's own attribute, between the order and the part-time delivery person, each ordering order of the delivery person who needs to be delivered. Similarity.
  • Sim_A_11 represents the similarity between the order A_1 and the order of the dispatcher P_1 to be delivered
  • Sim_A_12 represents the similarity between the order A_1 and the order of the dispatcher P_2 to be delivered
  • Sim_A_21 represents the order to be delivered of the order A_2 and the dispatcher P_1
  • Sim_A_31 represents the similarity between the order A_3 and the order to be delivered by the delivery staff P_1
  • Sim_A_32 represents the order A_3 and the delivery staff P_2
  • Sim_A_41 represents the similarity between the order A_4 and the order to be delivered of the delivery person P_1
  • Sim_A_42 represents the similarity between the order A_4 and the order to be delivered of the delivery person P_2
  • Sim_A_51 represents the order A_5
  • the similarity between the orders that are not allocated in the distribution order set and the waiting orders of the distributors who have orders to be delivered among the full-time distributors or part-time distributors is calculated, and the pending order collection is not calculated.
  • the assigned order is matched with the dispatcher who has the order to be delivered to each of the full-time distributors or part-time distributors.
  • the first order in the set of the order to be dispensed and the first dispatcher who has the order to be delivered among the full-time distributors or the part-time distributors, the first order and the first dispatcher's pending order may be The similarity between the weights is weighted and summed as the degree of matching between the first order and the first dispatcher.
  • the first order may be any order that is not allocated in the set of orders to be allocated; correspondingly, the first dispatcher may be any dispatcher who has an order to be delivered by a full-time distributor or a part-time dispatcher.
  • the distributors may be allocated to the orders in the to-be-distributed order set that are not allocated by the single-partitioning process in the grouping process from the at least two types of dispatchers in a set manner.
  • the "sequence" here refers to the meaning of executing one by one in a certain order.
  • the distribution of the orders in the set of to-be-distributed orders that are not allocated by the parallel allocation process is actually referred to as: in a certain order, from each type of dispatcher.
  • the distribution staff is assigned to the order in the collection of pending orders that is not allocated by the order allocation process in the group allocation process.
  • the manner set here may be that the type IDs of at least two types of dispatchers are in ascending order, and from each type of dispatcher, the grouping process is not in the set of pending orders. Assign the dispatcher to the order assigned by the side-by-side distribution process.
  • At least two types of dispatchers include full-time distributors and part-time distributors.
  • the full-time distributor has a type ID of 00001111 (binary) and a part-time distributor has a type ID of 00011111 (binary).
  • the distributors may be assigned to the orders that are not allocated by the order allocation process from the full-time distributors in the group distribution process; and from the part-time distributors,
  • the group assignment process assigns a distributor to an order in the collection of pending orders that is not assigned by the order assignment process.
  • At least two types of dispatchers include full-time distributors and part-time distributors.
  • the part-time distributor has a type ID of 00001111 (binary) and a full-time distributor has a type ID of 00011111 (binary).
  • the distributors may be assigned from the part-time distributors to the orders in the to-be-distributed order collection that are not allocated by the parallel allocation process, and then from the full-time distributors.
  • the group assignment process assigns a distributor to an order in the collection of pending orders that is not assigned by the order assignment process.
  • the method set here may also be according to the priority between at least two types of dispatchers, and sequentially from each type of dispatcher, the grouping process is the uncollected order set.
  • the order assigned to the single distribution process is assigned to the distributor.
  • At least two types of dispatchers include full-time distributors and part-time distributors, and full-time distributors have higher priority than part-time distributors.
  • the distributors may be assigned to the orders that are not allocated by the order allocation process from the full-time distributors in the group distribution process; and from the part-time distributors, The grouping process is not in the collection of orders to be allocated.
  • the order assigned to the single distribution process is assigned to the distributor.
  • At least two types of dispatchers include full-time distributors and part-time distributors, and part-time distributors have higher priority than full-time distributors.
  • the distributors may be assigned from the part-time distributors to the orders in the to-be-distributed order collection that are not allocated by the parallel allocation process, and then from the full-time distributors.
  • the group assignment process assigns a distributor to an order in the collection of pending orders that is not assigned by the order assignment process.
  • the logistics dispatching system will have different scheduling methods for the dispatcher in the process of performing the grouping process.
  • the scheduling mode of the logistics dispatching system to the dispatcher may include: an assignment mode and a grab mode.
  • an assignment mode can be used to ensure order allocation efficiency
  • a grab mode can be used to ensure order allocation efficiency
  • the full-time dispatcher can use the assignment method. From the full-time dispatcher, the grouping process is the unassigned order set. The order assigned to the single distribution process is assigned to the distributor. Similarly, for a part-time distributor, the grabber can be used to allocate the dispatcher from the part-time dispatcher to the order that is not allocated by the order allocation process in the set of orders to be distributed.
  • the assignment method is used to assign the distributors to the orders in the to-be-distributed order collection that are not assigned by the order allocation process, including:
  • the order that is not allocated by the order allocation process in the to-be-distributed order set is divided into at least one order group; the matching degree between each order group in at least one order group and each dispatcher in the full-time dispatcher is calculated; The degree of matching between each order group and each of the full-time distributors is assigned to each order group from the full-time distributor.
  • the order-sending method is used, and from the part-time distribution staff, the distribution order is assigned to the orders in the to-be-distributed order collection that are not allocated by the parallel distribution process, including:
  • the order of matching between the order group and the part-time distributor is from high to low, and the information of each order group is sent to each of the part-time distributors to wait for the delivery personnel to grab the order;
  • An order group when a dispatcher initiates a grab operation for the order group, assigns the order group to a dispatcher who initiates a grab operation.
  • an order that is not allocated by the order allocation process in the to-be-distributed order set needs to be divided into at least one order group.
  • the unassigned order set may be calculated according to at least one of an attribute of an order that is not allocated by the order allocation process, such as a user attribute, a merchant attribute, and an order self attribute.
  • the similarity between the orders assigned by the distribution process can be calculated based on the order addresses of two orders that are not allocated in the order allocation process. The closer the ordering address of the two orders, the more similar the two orders are.
  • the similarity between two orders that are not allocated by the order allocation process can be calculated based on the estimated delivery times of two orders that are not allocated in the order allocation process. The closer the estimated delivery time of two orders is, the more similar the two orders are.
  • two orders that are not allocated by the parallel allocation process can be calculated according to the estimated delivery time, the order address, the delivery address, and the order time of two orders that are not allocated by the parallel distribution process. Similarity.
  • the sub-similarity of the four dimensions may be calculated according to the estimated delivery time, the ordering address, the delivery address, and the ordering time of the order, and then the sub-similarity of the four dimensions is numerically processed, for example, Weighted summation yields similarities between two orders that are not allocated by the side-by-side distribution process.
  • the orders in the to-be-distributed order set that are not allocated by the order allocation process are divided into at least one order group. For example, orders with similarities within the same similarity range can be grouped into one group.
  • the execution process of the single-allocation process can be referred to the above-mentioned order from at least two types of dispatchers.
  • the description of the dispatcher is assigned to the order in the set of orders to be dispensed by the parallel order distribution process.
  • the execution process of the grouping process can be referred to as the above-mentioned order from at least two types of dispatchers, and the grouping process is not in the set of orders to be allocated.
  • the description of the distributor is assigned to the order assigned by the side-by-side distribution process.
  • FIG. 2 In the application scenario of the integration of the full-time distributor and the part-time distributor, the flow of an order scheduling method is shown in FIG. 2, and includes the following steps:
  • step 201 the order dispatching system performs unified scheduling on the orders in the order pool corresponding to the full-time distributor and the part-time dispatcher.
  • the order pool corresponding to the part-time distributor, from which the order to be assigned is obtained.
  • the order pool corresponding to the part-time delivery staff may be scanned first, and the order to be allocated may be obtained therefrom; and the order pool corresponding to the full-time distributor is scanned, and the order to be allocated is obtained therefrom.
  • the order pool corresponding to the full-time distributor and the order pool corresponding to the part-time distributor can be scanned in parallel to obtain the order to be allocated from the two order pools.
  • the process of arranging the single order in the assignment mode comprises: calculating, for each order in the set of orders to be allocated, the order to be taken of each of the dispatchers and the full-time distributor who need to deliver the order
  • Matching degree determining whether there is a dispatcher who has an order to be delivered among the full-time distributors, and whether there is a dispatcher who matches the order with the first matching degree; if the judgment result is present, the order is A dispatcher assigned to the order that matches the first match requirement.
  • step 203 After performing the parallel allocation process in the assignment mode, determine whether there are any unallocated orders in the to-be-distributed order set; if yes, execute step 204; if not, end the operation.
  • the process of the single order allocation in the grab order mode comprises: respectively calculating between each order remaining in the set of orders to be allocated and the order to be taken of each of the part-time dispatchers who have orders to be delivered. Similarity between the order and the part-time delivery staff based on the similarity between each order remaining in the set of orders to be allocated and the order-to-order order of each of the part-time distributors who need to deliver the order.
  • the matching degree between the delivery personnel who need to deliver the order determine whether there is a delivery staff who has the order matching requirement between the part-time delivery personnel and the delivery personnel who meet the first matching degree; The judgment result is that the information of the order is sent to the dispatcher who matches the order of the first matching degree with the order, so that the dispatcher can grab the bill; when the dispatcher initiates the grabbing operation, the The order is assigned to the dispatcher who initiated the grab operation.
  • step 205 After performing the parallel allocation process in the grab order mode, determine whether there is still an unallocated order in the to-be-distributed order set; if yes, execute step 206; if not, end the operation.
  • the grouping process in an assignment mode includes: calculating a similarity between the remaining unallocated orders in the set of orders to be allocated; and dividing the orders into at least one order group according to the similarity between the orders .
  • the “distributor” is not limited here, and it can be any dispatcher who can be scheduled in the assignment mode.
  • the order group is associated with the delivery staff by using a global optimal algorithm; the order group associated with a delivery person is added to the order queue corresponding to the delivery person for storage, Wait for the delivery staff to deliver. For the delivery staff, a new order group can be read from the order queue for delivery when the order group for which it is currently being delivered is about to be completed.
  • the grouping process in the grabbing mode includes: calculating a matching degree between each of the remaining unallocated order groups in the to-be-distributed order set and each of the part-time dispatchers; based on the order group and the dispatcher
  • the matching degree is sent to each dispatcher according to the order of matching between the delivery staff and the order group, in order to wait for the delivery personnel to grab the order.
  • the logistics dispatch system can assign the order group to the dispatcher who initiated the grab operation.
  • the next round of scheduling process may be re-entered.
  • the theoretical packet allocation method should include the operation of grouping the order, but because the packet allocation process in the assignment mode is prior, that is, the remaining unallocated orders are grouped in step 206, and step 208 is The remaining unallocated order groups are allocated in step 206, so the packet allocation process in the snatch mode described in step 208 does not include the operation of grouping the orders. Similarly, if the packet allocation process in the snatch mode is prior, the packet allocation process in the snatch mode will include the operation of grouping the order, and the packet allocation process in the subsequent assignment mode will not include the grouping of the order. operating.
  • step 201 the orders in the order pool corresponding to the full-time distributor and the part-time distributor are uniformly scheduled.
  • steps 202-204 in the parallel distribution process, the full-time distribution staff and the part-time delivery personnel are scheduled in sequence, and when the delivery of the full-time delivery staff is insufficient, the part-time delivery staff is used to deliver the goods.
  • the capacity of the part-time distribution staff to supplement the full play The advantages of road distribution, saving capacity and improving distribution efficiency.
  • steps 205-208 in the group distribution process, the full-time distribution staff and the part-time distribution staff are scheduled in sequence, and in the case of insufficient capacity of the full-time distribution staff, the full-time distribution staff is supplemented by the capacity of the part-time delivery staff. To achieve the complementarity between the two capacity, so as to ensure the delivery efficiency of the order and maximize the user experience when the transportation cost is as low as possible.
  • the execution bodies of the steps of the method provided by the foregoing embodiments may all be the same device, or the method may also be performed by different devices.
  • the execution body of steps 101 to 103 may be device A; for example, the execution body of steps 101 and 102 may be device A, the execution body of step 103 may be device B, and the like.
  • FIG. 3 is a schematic structural diagram of an order scheduling apparatus according to still another embodiment of the present disclosure. As shown in FIG. 3, the apparatus includes an acquisition module 31, a determination module 32, and an allocation module 33.
  • the obtaining module 31 is configured to obtain an order to be allocated corresponding to each of the at least two types of dispatchers, and form a set of orders to be allocated.
  • the determining module 32 is configured to determine an order allocation process when the at least two types of dispatchers are uniformly scheduled.
  • the distribution module 33 is configured to allocate a distributor from the at least two types of dispatchers to the orders in the set of orders to be allocated during the execution of the order distribution process.
  • the obtaining module 31 is configured to: determine at least two types of order pools corresponding to at least two types of dispatchers; and obtain orders to be allocated in at least two types of order pools to form a set of orders to be allocated.
  • the order allocation process is a side-by-side distribution process, a grouping distribution process, or a merging distribution process including a side-by-side distribution process and a grouping process.
  • the allocation module 33 is configured to:
  • the dispatcher is assigned to the orders in the set of orders to be distributed by the parallel distribution process;
  • the dispatcher is assigned to the order in the to-be-distributed order set that is not allocated by the order allocation process in the grouping distribution process.
  • the allocation module 33 is configured to: when assigning a dispatcher to an order in the set of orders to be dispensed in a single-partition allocation process:
  • the dispatchers are assigned to the orders in the set of orders to be assigned by the parallel allocation process.
  • an allocation module 33 is used to:
  • the order is directly assigned to the dispatcher who matches the order with the first matching degree requirement.
  • an allocation module 33 is used to:
  • the information of the order is sent to the dispatcher who meets the first matching degree requirement with the matching degree, so that the delivery personnel who match the order meet the first matching degree requirement to grab the order;
  • the allocating module 33 is configured to: when assigning a dispatcher to an order that is not allocated in the order allocation process in the set of to-be-distributed orders by the grouping process:
  • the dispatchers are assigned to the orders in the to-be-distributed order set that are not allocated by the parallel allocation process in each group of dispatchers in turn.
  • the distribution module 33 is used to:
  • the order that is not allocated by the order allocation process in the to-be-distributed order set is divided into at least one order group;
  • the distribution module 33 is configured to:
  • the order that is not allocated by the order allocation process in the to-be-distributed order set is divided into at least one order group;
  • the information of each order group is sent to each of the part-time delivery personnel to wait for the delivery personnel to grab the order;
  • the order group For each order group, when a dispatcher initiates a grab operation for the order group, the order group is assigned to the dispatcher who initiated the grab operation.
  • the order scheduling device provided in this embodiment can be used to execute the corresponding process in the foregoing method embodiments, and the specific working principle is not described herein.
  • the order scheduling device combines the to-be-allocated orders corresponding to at least two types of dispatchers to form a set of orders to be distributed, performs unified scheduling on at least two types of dispatchers, and adopts an order allocation process during unified scheduling.
  • At least two types of dispatchers distribute the dispatchers for the merged orders to be distributed, and uniformly dispatch the multi-type dispatchers from the perspective of order integration, thereby achieving complementarity between multiple transport capacities, which is beneficial to further improving the order delivery efficiency and reducing The probability that the order will be delivered over time.
  • embodiments of the present disclosure can be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware aspects. Moreover, the present disclosure may take the form of a computer program product embodied on one or more computer readable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.
  • computer readable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.
  • a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
  • processors CPUs
  • input/output interfaces network interfaces
  • memory volatile and non-volatile memory
  • the memory may include non-persistent memory, random access memory (RAM), and/or non-volatile memory in a computer readable medium, such as read only memory (ROM) or flash memory.
  • RAM random access memory
  • ROM read only memory
  • Memory is an example of a computer readable medium.
  • Computer readable media includes both permanent and non-persistent, removable and non-removable media.
  • Information storage can be implemented by any method or technology.
  • the information can be computer readable instructions, data structures, modules of programs, or other data.
  • Examples of computer readable storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), only Read Memory (ROM), EEPROM, Flash Memory or other memory technology, CD-ROM, Digital Versatile Disc (DVD) or other optics Storage, magnetic tape cartridges, magnetic tape storage or other magnetic storage devices or any other non-transportable media can be used to store information that can be accessed by computing devices.
  • computer readable media does not include temporary storage of computer readable media, such as modulated data signals and carrier waves.
  • embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or a combination of software and hardware aspects. Moreover, the present disclosure may take the form of a computer program product embodied on one or more computer readable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.
  • computer readable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • an order scheduling method including:
  • a dispatcher is assigned to the order in the set of to-be-distributed orders from the at least two types of dispatchers.
  • A2 in the method of A1, obtaining the to-be-allocated order corresponding to each of the at least two types of dispatchers, forming a set of orders to be allocated, including:
  • A3 The method according to A1, wherein the order allocation process is a parallel allocation process, a grouping distribution process, or a fusion allocation process including a parallel allocation process and a grouping distribution process.
  • the order is assigned to the distributor, including:
  • the dispatcher is assigned to the order that is not allocated by the parallel allocation process in the set of to-be-distributed orders in the grouping distribution process.
  • A5. The method according to A4, wherein, from among the at least two types of dispatchers, the dispatcher who needs to deliver the order, the dispatcher is assigned to the order in the set of the to-be-distributed order by the single-listing process, including:
  • the dispatcher is assigned to the orders in the set of the to-be-distributed orders by the parallel distribution process.
  • A6 The method according to A5, wherein the full-time dispatcher of the at least two types of dispatchers, from the dispatcher who has an order to be delivered among the full-time dispatchers, Assign an order to the dispatcher in the order collection, including:
  • A7 The method according to A5 or A6, wherein the part-time delivery staff of the at least two types of delivery personnel, from the part-time delivery personnel, the distribution staff who need to deliver the order, and the single distribution process is The order distribution distributors in the collection of order collections, including:
  • the information of the order is sent to the dispatcher who matches the order with the first matching degree requirement, so that the matching degree with the order meets the first matching degree requirement.
  • the delivery staff grabs the order;
  • A8 The method according to A4, wherein, from the at least two types of dispatchers, the dispatcher is allocated to the order that is not allocated by the parallel distribution process in the set of to-be-distributed orders, and includes:
  • the dispatchers are assigned to the orders that are not allocated by the parallel distribution process in the set of to-be-distributed orders in the group distribution process in turn from each type of dispatcher.
  • A9 The method according to A8, wherein a full-time dispatcher of the at least two types of dispatchers, from the full-time dispatcher, uses a grouping distribution process as the unassigned order set in the to-be-allocated order set.
  • Outgoing orders are assigned to the dispatcher, including:
  • a distributor is assigned to each of the order groups from the full-time distributor according to the degree of matching between each of the order groups and each of the full-time distributors.
  • A10 The method according to A8 or A9, wherein a part-time distributor of the at least two types of dispatchers, from the part-time dispatcher, the group allocation process is not assigned by the order in the set of to-be-distributed orders
  • the order assigned to the distribution of the distribution staff including:
  • the order group For each order group, when a dispatcher initiates a grab operation for the order group, the order group is assigned to the dispatcher who initiated the grab operation.
  • an order scheduling apparatus including:
  • An obtaining module configured to obtain an order to be allocated corresponding to at least two types of delivery personnel, and form a collection of orders to be allocated;
  • a determining module configured to determine an order allocation process when the at least two types of dispatchers are uniformly scheduled
  • an allocating module configured to allocate a distributor from the at least two types of dispatchers to the orders in the set of to-be-distributed in the process of executing the order allocation process.
  • the allocation module is configured to:
  • the dispatcher is assigned to the order that is not allocated by the parallel allocation process in the set of to-be-distributed orders in the grouping distribution process.
  • the dispatcher is assigned to the orders in the set of the to-be-distributed orders by the parallel distribution process.
  • the distribution module is configured to:
  • the information of the order is sent to the dispatcher who matches the order with the first matching degree requirement, so that the matching degree with the order meets the first matching degree requirement.
  • the delivery staff grabs the order;
  • the dispatchers are assigned to the orders that are not allocated by the parallel distribution process in the set of to-be-distributed orders in the group distribution process in turn from each type of dispatcher.
  • the distribution module is configured to:
  • a distributor is assigned to each of the order groups from the full-time distributor according to the degree of matching between each of the order groups and each of the full-time distributors.
  • the order group For each order group, when a dispatcher initiates a grab operation for the order group, the order group is assigned to the dispatcher who initiated the grab operation.
  • the embodiment of the present disclosure further discloses C21, an electronic device, comprising: a memory and a processor; the memory stores one or more computer instructions, when the one or more computer instructions are executed by the processor, The steps in the method of any of A1-A10.
  • the embodiment of the present disclosure further discloses D22, a computer readable storage medium storing a computer program, the computer program being executed to implement the steps in the method of any one of the above A1-A10.

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • General Factory Administration (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

一种订单调度方法、装置、电子设备及计算机可读存储介质，从订单融合的角度对多类型配送员进行统一调度，实现多种运力之间的互补，以进一步提高订单的配送效率，降低订单超时配送的概率。订单调度方法包括：获取至少两类配送员各自对应的待分配订单，形成待分配订单集合（101）；确定对至少两类配送员进行统一调度时的订单分配流程（102）；在执行订单分配流程的过程中，从至少两类配送员中为待分配订单集合中的订单分配配送员（103）。

Description

订单调度方法、装置、电子设备及计算机可读存储介质 技术领域
本公开涉及互联网技术领域，尤其涉及一种订单调度方法、装置、电子设备及计算机可读存储介质。
背景技术
随着互联网技术的快速发展，基于互联网的应用越来越多，例如外卖类应用、购物类应用。基于这些应用，用户足不出户即可获取自己所需的物品。这些应用在便利用户的同时，也面临着物品配送问题，于是物流调度系统应运而生。物流调度系统的主要任务是将订单合理分配给配送员，使得订单能尽快送到用户手中，同时能尽量节省运力。
在通常情况下，现有物流调度系统可以保证大部分订单的配送效率。但是，在一些特殊情况下，例如下单高峰期，由于运力有限，现有物流调度系统也只能优先保证少量订单的配送效率，大部分订单仍旧存在配送超时的问题，因此有待于提供一种新的订单调度方案，以进一步提高订单配送效率，降低订单超时配送的概率。
发明内容
针对现有技术存在的问题，本公开提供一种解决方案，其主要原理是：在多类型配送员并存的场景中，从订单融合的角度对多类型配送员进行统一调度，实现多种运力之间的互补，以进一步提高订单的配送效率，降低订单超时配送的概率。
基于上述分析，本公开实施例提供一种订单调度方法，包括：
获取至少两类配送员各自对应的待分配订单，形成待分配订单集合；
确定对所述至少两类配送员进行统一调度时的订单分配流程；
在执行所述订单分配流程的过程中，从所述至少两类配送员中为所述待分配订单集合中的订单分配配送员。
在一可选实施方式中，获取至少两类配送员各自对应的待分配订单，形成待 分配订单集合，包括：
确定与所述至少两类配送员一一对应的至少两类订单池；
获取所述至少两类订单池中的待分配订单，形成所述待分配订单集合。
在一可选实施方式中所述订单分配流程为并单分配流程、分组分配流程或包括并单分配流程和分组分配流程的融合分配流程。
在一可选实施方式中，当所述订单分配流程为融合分配流程时，在执行所述订单分配流程的过程中，从所述至少两类配送员中为所述待分配订单集合中的订单分配配送员，包括：
从所述至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员；
从所述至少两类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
在一可选实施方式中，从所述至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员，包括：
按照所述至少两类配送员之间的优先级，依次从每类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员。
在一可选实施方式中，对所述至少两类配送员中的专职配送员，从所述专职配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员，包括：
获取所述待分配订单集合中未被分配出去的订单；
对所述待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单与所述专职配送员中各个尚有订单需要配送的配送员之间的匹配度；
判断所述专职配送员中各个尚有订单需要配送的配送员中，是否存在与所述订单之间的匹配度符合第一匹配度要求的配送员；
若判断结果为存在，直接将所述订单分配给与所述订单之间的匹配度符合第一匹配度要求的配送员。
在一可选实施方式中，对所述至少两类配送员中的兼职配送员，从所述兼职配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员，包括：
获取所述待分配订单集合中未被分配出去的订单；
对所述待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单与所述兼职配送员中各个尚有订单需要配送的配送员之间的匹配度；
判断所述兼职配送员中各个尚有订单需要配送的配送员中，是否存在与所述订单之间的匹配度符合第一匹配度要求的配送员；
若判断结果为存在，将所述订单的信息发送给与所述订单之间的匹配度符合第一匹配度要求的配送员，以供与所述订单之间的匹配度符合第一匹配度要求的配送员抢单；
当有配送员发起抢单操作时，将所述订单分配给发起抢单操作的配送员。
在一可选实施方式中，从所述至少两类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员，包括：
按照所述至少两类配送员之间的优先级，依次从每类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
在一可选实施方式中，对所述至少两类配送员中专职配送员，从所述专职配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员，包括：
将所述待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；
计算所述至少一个订单组中每个订单组与所述专职配送员中各配送员之间的匹配度；
根据所述每个订单组与所述专职配送员中各配送员之间的匹配度，从所述专职配送员中为所述每个订单组分配配送员。
在一可选实施方式中，对所述至少两类配送员中兼职配送员，从所述兼职配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员，包括：
将所述待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；
计算所述至少一个订单组中每个订单组与所述兼职配送员中各配送员之间的匹配度；
按照每个订单组与所述兼职配送员中各配送员之间的匹配度由高到低的顺序，将每个订单组的信息发送给所述兼职配送员中各配送员，以等待配送员抢单； 以及
对每个订单组，当有配送员针对所述订单组发起抢单操作时，将所述订单组分配给发起抢单操作的配送员。
相应地，本公开实施例还提供一种订单调度装置，包括：
获取模块，用于获取至少两类配送员各自对应的待分配订单，形成待分配订单集合；
确定模块，用于确定对所述至少两类配送员进行统一调度时的订单分配流程；
分配模块，用于在执行所述订单分配流程的过程中，从所述至少两类配送员中为所述待分配订单集合中的订单分配配送员。
在一可选实施方式中，所述获取模块用于：
确定与所述至少两类配送员一一对应的至少两类订单池；
获取所述至少两类订单池中的待分配订单，形成所述待分配订单集合。
在一可选实施方式中，所述订单分配流程为并单分配流程、分组分配流程或包括并单分配流程和分组分配流程的融合分配流程。
在一可选实施方式中，当所述订单分配流程为融合分配流程时，所述分配模块用于：
从所述至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员；
从所述至少两类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
在一可选实施方式中，所述分配模块在以并单分配流程为所述待分配订单集合中的订单分配配送员时，用于：
按照所述至少两类配送员之间的优先级，依次从每类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员。
在一可选实施方式中，对所述至少两类配送员中的专职配送员，所述分配模块用于：
获取所述待分配订单集合中未被分配出去的订单；
对所述待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单与所述专职配送员中各个尚有订单需要配送的配送员之间的匹配度；
判断所述专职配送员中各个尚有订单需要配送的配送员中，是否存在与所述 订单之间的匹配度符合第一匹配度要求的配送员；
若判断结果为存在，直接将所述订单分配给与所述订单之间的匹配度符合第一匹配度要求的配送员。
在一可选实施方式中，对所述至少两类配送员中的兼职配送员，所述分配模块用于：
获取所述待分配订单集合中未被分配出去的订单；
对所述待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单与所述兼职配送员中各个尚有订单需要配送的配送员之间的匹配度；
判断所述兼职配送员中各个尚有订单需要配送的配送员中，是否存在与所述订单之间的匹配度符合第一匹配度要求的配送员；
若判断结果为存在，将所述订单的信息发送给与所述订单之间的匹配度符合第一匹配度要求的配送员，以供与所述订单之间的匹配度符合第一匹配度要求的配送员抢单；
当有配送员发起抢单操作时，将所述订单分配给发起抢单操作的配送员。
在一可选实施方式中，所述分配模块在以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员时，用于：按照所述至少两类配送员之间的优先级，依次从每类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
在一可选实施方式中，对所述至少两类配送员中专职配送员，所述分配模块用于：
将所述待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；
计算所述至少一个订单组中每个订单组与所述专职配送员中各配送员之间的匹配度；
根据所述每个订单组与所述专职配送员中各配送员之间的匹配度，从所述专职配送员中为所述每个订单组分配配送员。
在一可选实施方式中，对所述至少两类配送员中兼职配送员，所述分配模块用于：
将所述待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；
计算所述至少一个订单组中每个订单组与所述兼职配送员中各配送员之间的匹配度；
按照每个订单组与所述兼职配送员中各配送员之间的匹配度由高到低的顺序，将每个订单组的信息发送给所述兼职配送员中各配送员，以等待配送员抢单；以及
对每个订单组，当有配送员针对所述订单组发起抢单操作时，将所述订单组分配给发起抢单操作的配送员。
本公开实施例还提供一种电子设备，包括：存储器和处理器；所述存储器存储有一条或多条计算机指令，所述一条或多条计算机指令在被所述处理器执行时实现上述方法实施例提供的方法中的步骤。
本公开实施例还提供一种存储有计算机程序的计算机可读存储介质，所述计算机程序被执行时实现上述方法实施例提供的方法中的步骤。
在本公开实施例中，将至少两类配送员各自对应的待分配订单进行融合，形成待分配订单集合，对至少两类配送员进行统一调度，采用统一调度时的订单分配流程，从至少两类配送员中为融合后的待分配订单分配配送员，从订单融合的角度对多类型配送员进行统一调度，实现多种运力之间的互补，有利于进一步提高订单的配送效率，降低订单超时配送的概率。
附图说明
此处所说明的附图用来提供对本公开的进一步理解，构成本公开的一部分，本公开的示意性实施例及其说明用于解释本公开，并不构成对本公开的不当限定。在附图中：
图1为本公开一实施例提供的订单调度方法的流程示意图；
图2为本公开另一实施例提供的订单调度方法的流程示意图；
图3为本公开又一实施例提供的订单调度装置的结构示意图。
具体实施方式
为使本公开的目的、技术方案和优点更加清楚，下面将结合本公开具体实施例及相应的附图对本公开技术方案进行清楚、完整地描述。显然，所描述的实施 例仅是本公开一部分实施例，而不是全部的实施例。基于本公开中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本公开保护的范围。
图1为本公开一实施例提供的订单调度方法的流程示意图。如图1所示，所述方法包括：
101、获取至少两类配送员各自对应的待分配订单，形成待分配订单集合。
102、确定对所述至少两类配送员进行统一调度时的订单分配流程。
103、在执行所述订单分配流程的过程中，从所述至少两类配送员中为所述待分配订单集合中的订单分配配送员。
在本实施例中，物流调度系统采用多种类型的配送员，不同类型的配送员主要负责配送各自对应的订单。为了便于管理各类配送员对应的订单，可以为各类配送员分别配置订单池，各类配送员主要负责配送各自对应订单池中的订单。多种类型的配送员可以包括但不限于：专职配送员和兼职配送员。一般来说，专职配送员的人员比较固定，兼职配送员的人员流动性较大，所以相对于兼职配送员来说，专职配送员的整体配送服务质量相对较高，但配送费用也相对较高。
可选地，可由商家为自己的订单选择配送员类型，一旦商家选定配送员类型，该商家的订单就会进入相应的订单池，并等待物流调度系统的调度。或者，也可以由物流调度系统根据各类配送员的整体运力情况，为订单选择配送员类型；当物流调度系统为订单选定配送员类型，该订单就会进入相应的订单池，并等待物流调度系统的调度。或者，物流调度系统也可以根据订单的配送需求，为订单选择配送员类型；当物流调度系统为订单选定配送员类型，该订单就会进入相应的订单池，并等待物流调度系统的调度。
订单调度系统采用多种类型的配送员，并且针对不同订单，采用不同类型的配送员，充分利用各类配送员的优势，一定程度上可以提高订单配送效率。但是，如果能够在多类型配送员并存的基础上对多类型配送员做进一步融合调度，实现多类型配送员之间的运力互补，将有利于进一步提高订单的配送效率，降低订单超时配送的概率。
一般来说，不同类型的配送员对应订单池中订单数量有所不同，这意味着不同类型的配送员的忙闲程度会有所不同。基于此，本实施例提供的订单调度方法从订单融合的角度，结合配送员统一调度思想，实现多类型配送员之间的融合调 度。本实施例提供的订单调度方法的流程如下：
获取至少两类配送员各自对应的待分配订单，形成待分配订单集合。待分配订单集合包含至少两类配送员中每类配送员对应的待分配订单。例如，第一类配送员的待分配订单为订单a、订单b和订单c；第二类配送员的待分配订单为订单e、订单f和订单g，则待分配订单集合包含订单a、订单b、订单c、订单e、订单f和订单g。这意味着，对至少两类配送员对应的待分配订单不做区分调度，而是将至少两类配送员对应的待分配订单做统一调度，从而在订单层面实现融合。
之后，确定对至少两类配送员进行统一调度时的订单分配流程。在执行所确定的订单分配流程的过程中，从至少两类配送员中为待分配订单集合中的订单分配配送员。在现有技术中，一次订单分配过程只会调度一类配送员，而在本实施例中，订单分配流程需要涉及至少两类配送员，所以这里的订单分配流程不同于现有的订单分配流程。在本实施例的订单分配流程中，需要调度至少两类配送员，从而将待分配订单集合中的订单分配给各类配送员中相对空闲的配送员，而不是将待分配订单集合中的订单全部分配给某一类配送员，达到对至少两类配送员进行统一调度的目的，实现多种运力之间的互补。
在本实施例中，将至少两类配送员各自对应的待分配订单进行融合，形成待分配订单集合，对至少两类配送员进行统一调度，采用统一调度时的订单分配流程，从至少两类配送员中为融合后的待分配订单分配配送员，从订单融合的角度对多类型配送员进行统一调度，实现多种运力之间的互补，有利于进一步提高订单的配送效率，降低订单超时配送的概率。
在上述实施例或下述实施例中，首先，需要获取至少两类配送员各自对应的待分配订单，形成待分配订单集合。可选地，可以确定与至少两类配送员一一对应的至少两类订单池；获取至少两类订单池中的待分配订单，形成待分配订单集合。对任一类配送员来说，可以从该类配送员对应的订单池中获取该类配送员对应的待分配订单。每类配送员对应的待分配订单可以是一个或多个。
优选地，可以设置至少两类配送员之间的优先级。基于此，可以按照至少两类配送员之间的优先级，依次从至少两类配送员各自对应的订单池中获取待分配订单，从而形成待分配订单集合。
可选地，也可以并行地从至少两类配送员各自对应的订单池中获取待分配订单，从而形成待分配订单集合。
可选地，也可以根据至少两类配送员各自对应订单池中新订单到达的先后顺序，依次从相应订单池中获取待分配订单，从而形成待分配订单集合。
在上述实施例或下述实施例中，对至少两类配送员进行统一调度时的订单分配流程可以是并单分配流程，或者，可以是分组分配流程，或者可以是同时包括并单分配流程和分组分配流程的融合分配流程。
其中，并单分配流程实际上是一种订单追加流程，主要是判断新订单是否可以追加给尚有订单需要配送的配送员，以便该配送员可以顺路配送新订单，达到节约运力的目的。分组分配流程是指将订单分组，以订单组为单位进行订单分配的过程。融合分配流程是指结合并单分配流程和分组分配流程进行订单分配的过程。
当对至少两类配送员进行统一调度时的订单分配流程为融合分配流程时，可以执行融合分配流程，并在执行融合分配流程的过程中，从至少两类配送员中为待分配订单集合中的订单分配配送员。
在一可选实施方式中，一种融合分配流程包括：先执行并单分配流程，再执行分组分配流程。
下面以先执行并单分配流程，再执行分组分配流程的融合分配流程为例，说明在执行融合分配流程的过程中，从至少两类配送员中为待分配订单集合中的订单分配配送员的过程。
当对至少两类配送员进行统一调度时的订单分配流程为先执行并单分配流程，再执行分组分配流程的融合分配流程时，从至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员，即并单分配流程；然后，从所述至少两类配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员，即分组分配流程。
可选地，在上述并单分配流程中，可以按照设定的方式，依次从至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员。这里的“依次”是指按照一定的次序，逐一执行的意思。其中，依次从至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员实际上是指：按照一定的次序，从每类配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员。
在一种实施方式中，可以为每类配送员配置类型ID。基于此，可以按照至少两类配送员的类型ID从小到大的顺序，依次从每类配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员。
一种情况：至少两类配送员包括专职配送员和兼职配送员，专职配送员的类型ID为00001111(二进制)，兼职配送员的类型ID为00011111(二进制)。基于此，当进入并单分配流程时，可以先从专职配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员；再从兼职配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员。
另一种情况：至少两类配送员包括专职配送员和兼职配送员，兼职配送员的类型ID为00001111(二进制)，专职配送员的类型ID为00011111(二进制)。基于此，当进入并单分配流程时，可以先从兼职配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员；再从专职配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员。
值得说明的是，上述配送员的类型ID仅为举例，实际应用中，可以设置不同数值并且可以采用不同进制方式。
在另一种实施方式中，可以预先配置至少两类配送员之间的优先级。基于此，可以按照至少两类配送员之间的优先级，依次从每类配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员。
一种情况：至少两类配送员包括专职配送员和兼职配送员，专职配送员的优先级高于兼职配送员的优先级。基于此，当进入并单分配流程时，可以先从专职配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员；再从兼职配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员。
另一种情况：至少两类配送员包括专职配送员和兼职配送员，兼职配送员的优先级高于专职配送员的优先级。基于此，当进入并单分配流程时，可以先从兼职配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员；再从专职配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员。
值得说明的是，无论是上述哪种情况，根据配送员类型的不同，物流调度系统在执行并单分配流程过程中，对配送员的调度方式也会有所不同。物流调度系统对配送员的调度方式可以包括：指派模式和抢单模式。
上述指派模式是指由物流调度系统直接将订单指派给相应配送员的分配方式。在指派模式中，配送员没有决策权，订单分配效率较高。相应地，上述抢单模式是指由订单调度系统将订单的信息发送给配送员，由配送员决定是否抢单，并将订单分配给抢中订单的配送员的分配方式。在抢单模式中，配送员具有决策权，管理较灵活，兼职配送员的自由度较高，有利于提高订单分配效率。
例如，对于专职配送员，可以采用指派模式，以保证订单分配效率；对于兼职配送员，可以采用抢单模式，以保证订单分配效率。
结合物流调度系统对配送员的调度方式，无论是上述哪一种情况，对专职配送员来说，可以采用指派方式，从专职配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员。同理，对兼职配送员来说，可以采用抢单方式，从兼职配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员。
对专职配送员来说，采用指派方式，从专职配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员的过程包括：获取待分配订单集合中未被分配出去的订单；对待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单与专职配送员中各个尚有订单需要配送的配送员之间的匹配度；判断专职配送员中各个尚有订单需要配送的配送员中，是否存在与所述订单之间的匹配度符合第一匹配度要求的配送员；若判断结果为存在，直接将所述订单分配给与所述订单之间的匹配度符合第一匹配度要求的配送员。
对兼职配送员来说，采用抢单方式，从兼职配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员包括：获取待分配订单集合中未被分配出去的订单；对待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单与所述兼职配送员中各个尚有订单需要配送的配送员之间的匹配度；判断兼职配送员中各个尚有订单需要配送的配送员中，是否存在与所述订单之间的匹配度符合第一匹配度要求的配送员；若判断结果为存在，将所述订单的信息发送给与所述订单之间的匹配度符合第一匹配度要求的配送员，以供与所述订单之间的匹配度符合第一匹配度要求的配送员抢单；当有配送员发 起抢单操作时，将所述订单分配给发起抢单操作的配送员。
在上述并单分配流程中，需要计算待分配订单集合中未被分配出去的订单与专职配送员或兼职配送员中各个尚有订单需要配送的配送员之间的匹配度。可选地，可以根据订单的属性，例如用户属性、商户属性以及订单自身属性中的至少一种，计算该订单与兼职配送员中各个尚有订单需要配送的配送员的待取单订单之间的相似度。
举例说明，假设待分配订单集合中未被分配出去的订单有5个，记为订单A_1、订单A_2、订单A_3、订单A_4和订单A_5，专职配送员或兼职配送员中尚有订单需要配送的配送员为2个，记为配送员P_1和配送员P_2，则经过上述相似度计算之后，可以获得5个订单中每个订单与2个配送员中每个配送员的待配送订单之间的相似度，可表示为：Sim_A_11、Sim_A_12、Sim_A_21、Sim_A_22、Sim_A_31、Sim_A_32、Sim_A_41、Sim_A_42、Sim_A_51以及Sim_A_52。其中，Sim_A_11表示订单A_1与配送员P_1的待配送订单之间的相似度；Sim_A_12表示订单A_1与配送员P_2的待配送订单之间的相似度；Sim_A_21表示订单A_2与配送员P_1的待配送订单之间的相似度；Sim_A_22表示订单A_2与配送员P_2的待配送订单之间的相似度；Sim_A_31表示订单A_3与配送员P_1的待配送订单之间的相似度；Sim_A_32表示订单A_3与配送员P_2的待配送订单之间的相似度；Sim_A_41表示订单A_4与配送员P_1的待配送订单之间的相似度；Sim_A_42表示订单A_4与配送员P_2的待配送订单之间的相似度；Sim_A_51表示订单A_5与配送员P_1的待配送订单之间的相似度；Sim_A_52表示订单A_5与配送员P_2的待配送订单之间的相似度。
接着，对待分配订单集合中未被分配出去的各订单与专职配送员或兼职配送员中各个尚有订单需要配送的配送员的待取单订单之间的相似度，计算待分配订单集合中未被分配出去的各订单与专职配送员或兼职配送员中各个尚有订单需要配送的配送员的匹配度。
可选地，对待分配订单集合中的第一订单和专职配送员或兼职配送员中尚有订单需要配送的第一配送员来说，可以将第一订单与第一配送员的待取订单之间的相似度进行加权求和，作为第一订单与第一配送员的匹配度。其中，第一订单可以是待分配订单集合中未被分配出去的任意订单；相应地，第一配送员可以是专职配送员或兼职配送员中尚有订单需要配送的任意配送员。
可选地，在上述分组分配流程中，可以按照设定的方式，依次从至少两类配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员。这里的“依次”是指按照一定的次序，逐一执行的意思。其中，依次从至少两类配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员实际上是指：按照一定的次序，从每类配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
与上述并单分配流程相类似，这里设定的方式可以是按照至少两类配送员的类型ID从小到大的顺序，依次从每类配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
一种情况：至少两类配送员包括专职配送员和兼职配送员，专职配送员的类型ID为00001111(二进制)，兼职配送员的类型ID为00011111(二进制)。基于此，当进入分组分配流程时，可以先从专职配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员；再从兼职配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
另一种情况：至少两类配送员包括专职配送员和兼职配送员，兼职配送员的类型ID为00001111(二进制)，专职配送员的类型ID为00011111(二进制)。基于此，当进入分组分配流程时，可以先从兼职配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员；再从专职配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
与上述并单分配流程相类似，这里设定的方式还可以是按照至少两类配送员之间的优先级，依次从每类配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
一种情况：至少两类配送员包括专职配送员和兼职配送员，专职配送员的优先级高于兼职配送员的优先级。基于此，当进入分组分配流程时，可以先从专职配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员；再从兼职配送员中，以分组分配流程为待分配订单集合中未以并 单分配流程分配出去的订单分配配送员。
另一种情况：至少两类配送员包括专职配送员和兼职配送员，兼职配送员的优先级高于专职配送员的优先级。基于此，当进入分组分配流程时，可以先从兼职配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员；再从专职配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
同理，无论是上述哪种情况，根据配送员类型的不同，物流调度系统在执行分组分配流程过程中，对配送员的调度方式也会有所不同。物流调度系统对配送员的调度方式可以包括：指派模式和抢单模式。
例如，对于专职配送员，可以采用指派模式，以保证订单分配效率；对于兼职配送员，可以采用抢单模式，以保证订单分配效率。
结合物流调度系统对配送员的调度方式，无论是上述哪一种情况，对专职配送员来说，可以采用指派方式，从专职配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员。同理，对兼职配送员来说，可以采用抢单方式，从兼职配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
对专职配送员来说，采用指派方式，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员，包括：
将待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；计算至少一个订单组中每个订单组与专职配送员中各配送员之间的匹配度；根据每个订单组与专职配送员中各配送员之间的匹配度，从专职配送员中为每个订单组分配配送员。
对兼职配送员来说，采用抢单方式，从兼职配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员，包括：
将待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；计算至少一个订单组中每个订单组与兼职配送员中各配送员之间的匹配度；按照每个订单组与兼职配送员中各配送员之间的匹配度由高到低的顺序，将每个订单组的信息发送给兼职配送员中各配送员，以等待配送员抢单；以及对每个订单组，当有配送员针对所述订单组发起抢单操作时，将所述订单组分配给发起抢单操作的配送员。
在上述分组分配流程中，需要将待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组。可选地，可以根据待分配订单集合中未以并单分配流程分配出去的订单的属性，例如用户属性、商户属性以及订单自身属性中的至少一种，计算待分配订单集合中未以并单分配流程分配出去的订单之间的相似度。例如，可以根据两个未以并单分配流程分配出去的订单的取单地址，计算两个未以并单分配流程分配出去的订单之间的相似度。两个订单的取单地址越近，两个订单越相似。又例如，可以根据两个未以并单分配流程分配出去的订单的预计送达时间，计算两个未以并单分配流程分配出去的订单之间的相似度。两个订单的预计送达时间越接近，两个订单越相似。又例如，可以根据两个未以并单分配流程分配出去的订单的预计送达时间、取单地址、送单地址以及下单时间，计算两个未以并单分配流程分配出去的订单之间的相似度。可选地，可以分别根据订单的预计送达时间、取单地址、送单地址以及下单时间计算出四个维度的子相似度，然后将四个维度的子相似度子进行数值处理，例如加权求和，得到两个未以并单分配流程分配出去的订单之间的相似度。
接着，根据待分配订单集合中未以并单分配流程分配出去的订单之间的相似度，将待分配订单集合中未以并单分配流程分配出去的订单划分为至少一个订单组。例如，可以将相似度在同一相似度范围内的订单划分为一组。
值得说明的是，当对至少两类配送员进行统一调度时的订单分配流程为并单分配流程时，并单分配流程的执行过程可参见上述依次从至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员的描述。当对至少两类配送员进行统一调度时的订单分配流程为分组分配流程时，分组分配流程的执行过程可参见上述依次从至少两类配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员的描述。
在对专职配送员与兼职配送员进行融合的应用场景中，一种订单调度方法的流程如图2所示，包括以下步骤：
201、扫描专职配送员和兼职配送员各自对应的订单池，从两个订单池中搜集待分配订单，形成待分配订单集合。
在步骤201中，订单调度系统对专职配送员和兼职配送员对应订单池中的订单做统一调度。
例如，可以先扫描专职配送员对应的订单池，从中获取待分配订单；再扫描 兼职配送员对应的订单池，从中获取待分配订单。
又例如，可以先扫描兼职配送员对应的订单池，从中获取待分配订单；再扫描专职配送员对应的订单池，从中获取待分配订单。
又例如，可以并行扫描专职配送员对应的订单池和兼职配送员对应的订单池，从两个订单池中获取待分配订单。
202、执行指派模式下的并单分配流程，以从专职配送员中尚有订单需要配送的配送员中为待分配订单集合中的订单分配配送员。
可选地，一种指派模式下的并单分配流程包括：针对待分配订单集合中的每个订单，计算该订单与专职配送员中尚有订单需要配送的各配送员的待取单订单之间的相似度；基于该订单与专职配送员中尚有订单需要配送的各配送员的待取单订单之间相似度，计算该订单与专职配送员中尚有订单需要配送的各配送员之间的匹配度；判断专职配送员中尚有订单需要配送的各配送员中，是否存在与该订单之间的匹配度符合第一匹配度要求的配送员；若判断结果为存在，将该订单分配给与该订单之间的匹配度符合第一匹配度要求的配送员。
203、在执行指派模式下的并单分配流程之后，判断待分配订单集合中是否还有未分配的订单；若是，则执行步骤204；若否，结束此次操作。
204、执行抢单模式下的并单分配流程，以从兼职配送员中尚有订单需要配送的配送员中为待分配订单集合中剩余未分配的订单分配配送员。
可选地，一种抢单模式下的并单分配流程包括：分别计算待分配订单集合中剩余的每个订单与兼职配送员中尚有订单需要配送的各配送员的待取单订单之间的相似度；基于待分配订单集合中剩余的每个订单与兼职配送员中尚有订单需要配送的各配送员的待取单订单之间的相似度，计算该订单与兼职配送员中尚有订单需要配送的各配送员之间的匹配度；判断兼职配送员中尚有订单需要配送的各配送员中，是否存在与该订单之间的匹配度符合第一匹配度要求的配送员；若判断结果为存在，将该订单的信息发送给与该订单之间的匹配度符合第一匹配度要求的配送员，以供这些配送员抢单；当有配送员发起抢单操作时，将该订单分配给发起抢单操作的配送员。
205、在执行抢单模式下的并单分配流程之后，判断待分配订单集合中是否还存在未分配的订单；若是，则执行步骤206；若否，结束此次操作。
206、执行指派模式下的分组分配流程，以从专职配送员中为待分配订单集 合中剩余未分配的订单分配配送员。
可选地，一种指派模式下的分组分配流程包括：计算待分配订单集合中剩余未分配的订单之间的相似度；根据这些订单之间的相似度，将这些订单划分为至少一个订单组。计算每个订单组与专职配送员中各配送员之间的匹配度，这里不对“各配送员”做限定，可以是指派模式下任何可以被调度的配送员。基于订单组与配送员之间的匹配度，采用全局最优算法将订单组与配送员进行关联；将关联到某一配送员的订单组，加入该配送员对应的订单队列中进行保存，以等待该配送员进行配送。对配送员来说，在其当前配送的订单组即将完成时，可以从订单队列中读取新的订单组进行配送。
207、在执行指派模式下的分组分配流程之后，判断待分配订单集合中是否还存在未分配的订单组；若是，则执行步骤208；若否，结束此次操作。
208、执行抢单模式下的分组分配流程，以从兼职配送员中为待分配订单集合中剩余未分配的订单组分配配送员，并返回执行步骤201。
可选地，一种抢单模式下的分组分配流程包括：计算待分配订单集合中剩余未分配的每个订单组与兼职配送员中各配送员之间的匹配度；基于订单组与配送员之间的匹配度，按照各配送员与订单组之间的匹配度由高到低的顺序，将订单组的信息发送给各配送员，以等待配送员抢单。对任一订单组来说，若有配送员抢单，则物流调度系统可以将该订单组分配给发起抢单操作的配送员。
可选地，若在设定的抢单超时时间(例如12分钟)内没有配送员抢单，则可以重新进入下一轮调度过程。
值得说明的是，理论上的分组分配方式应该包括对订单分组的操作，但是因为指派模式下的分组分配流程在先，即在步骤206中对剩余未分配的订单进行了分组，而步骤208是对步骤206剩余未分配的订单组进行分配，故在步骤208所述的抢单模式下的分组分配流程未包括对订单分组的操作。同理，若抢单模式下的分组分配流程在先，则抢单模式下的分组分配流程会包括对订单分组的操作，而在后的指派模式下的分组分配流程将不包括对订单分组的操作。
在本实施例中，在步骤201中，对专职配送员和兼职配送员对应订单池中的订单进行统一调度。在步骤202-204中，在并单分配流程中，依次对专职配送员和兼职配送员进行调度，在实现顺路配送的同时，在专职配送员顺路配送的运力不足时，利用兼职配送员顺路配送的运力对兼职配送员进行补充，以充分发挥顺 路配送的优势，节约运力，提高配送效率。进一步，在步骤205-208中，在分组分配流程中，依次对专职配送员和兼职配送员进行调度，在专职配送员的运力不足的情况下，利用兼职配送员的运力对专职配送员进行补充，实现两种运力之间的互补，使得在运力成本尽可能低的情况下，保证订单的配送效率，尽量提高用户体验。
需要说明的是，上述实施例所提供方法的各步骤的执行主体均可以是同一设备，或者，该方法也由不同设备作为执行主体。比如，步骤101至步骤103的执行主体可以为设备A；又比如，步骤101和102的执行主体可以为设备A，步骤103的执行主体可以为设备B；等等。
图3为本公开又一实施例提供的订单调度装置的结构示意图。如图3所示，装置包括：获取模块31、确定模块32和分配模块33。
获取模块31，用于获取至少两类配送员各自对应的待分配订单，形成待分配订单集合。
确定模块32，用于确定对至少两类配送员进行统一调度时的订单分配流程。
分配模块33，用于在执行订单分配流程的过程中，从至少两类配送员中为待分配订单集合中的订单分配配送员。
在一可选实施方式中，获取模块31用于：确定与至少两类配送员一一对应的至少两类订单池；获取至少两类订单池中的待分配订单，形成待分配订单集合。
在一可选实施方式中，订单分配流程为并单分配流程、分组分配流程或包括并单分配流程和分组分配流程的融合分配流程。
在一可选实施方式中，当订单分配流程为融合分配流程时，分配模块33用于：
从至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员；
从至少两类配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
在一可选实施方式中，分配模块33在以并单分配流程为待分配订单集合中的订单分配配送员时，用于：
按照至少两类配送员之间的优先级，依次从每类配送员中尚有订单需要配送的配送员中，以并单分配流程为待分配订单集合中的订单分配配送员。
在一可选实施方式中，对至少两类配送员中的专职配送员，分配模块33用于：
获取待分配订单集合中未被分配出去的订单；
对待分配订单集合中未被分配出去的订单中的每个订单，计算订单与专职配送员中各个尚有订单需要配送的配送员之间的匹配度；
判断专职配送员中各个尚有订单需要配送的配送员中，是否存在与订单之间的匹配度符合第一匹配度要求的配送员；
若判断结果为存在，直接将订单分配给与订单之间的匹配度符合第一匹配度要求的配送员。
在一可选实施方式中，对至少两类配送员中的兼职配送员，分配模块33用于：
获取待分配订单集合中未被分配出去的订单；
对待分配订单集合中未被分配出去的订单中的每个订单，计算订单与兼职配送员中各个尚有订单需要配送的配送员之间的匹配度；
判断兼职配送员中各个尚有订单需要配送的配送员中，是否存在与订单之间的匹配度符合第一匹配度要求的配送员；
若判断结果为存在，将订单的信息发送给与订单之间的匹配度符合第一匹配度要求的配送员，以供与订单之间的匹配度符合第一匹配度要求的配送员抢单；
当有配送员发起抢单操作时，将订单分配给发起抢单操作的配送员。
在一可选实施方式中，分配模块33在以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员时，用于：
按照至少两类配送员之间的优先级，依次从每类配送员中，以分组分配流程为待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
在一可选实施方式中，对至少两类配送员中专职配送员，分配模块33用于：
将待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；
计算至少一个订单组中每个订单组与专职配送员中各配送员之间的匹配度；
根据每个订单组与专职配送员中各配送员之间的匹配度，从专职配送员中为每个订单组分配配送员。
在一可选实施方式中，对至少两类配送员中兼职配送员，分配模块33用于：
将待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；
计算至少一个订单组中每个订单组与兼职配送员中各配送员之间的匹配度；
按照每个订单组与兼职配送员中各配送员之间的匹配度由高到低的顺序，将每个订单组的信息发送给兼职配送员中各配送员，以等待配送员抢单；以及
对每个订单组，当有配送员针对订单组发起抢单操作时，将订单组分配给发起抢单操作的配送员。
本实施例提供的订单调度装置，可用于执行上述方法实施例中的相应流程，其具体工作原理不再赘述。
本实施例提供的订单调度装置，将至少两类配送员各自对应的待分配订单进行融合，形成待分配订单集合，对至少两类配送员进行统一调度，采用统一调度时的订单分配流程，从至少两类配送员中为融合后的待分配订单分配配送员，从订单融合的角度对多类型配送员进行统一调度，实现多种运力之间的互补，有利于进一步提高订单的配送效率，降低订单超时配送的概率。
本领域内的技术人员应明白，本公开的实施例可提供为方法、系统、或计算机程序产品。因此，本公开可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本公开可采用在一个或多个其中包含有计算机可用程序代码的计算机可读存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本公开是参照根据本公开实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
在一个典型的配置中，计算设备包括一个或多个处理器(CPU)、输入/输出接口、网络接口和内存。
内存可能包括计算机可读介质中的非永久性存储器，随机存取存储器(RAM)和/或非易失性内存等形式，如只读存储器(ROM)或闪存(flash RAM)。内存是计算机可读介质的示例。
计算机可读介质包括永久性和非永久性、可移动和非可移动媒体可以由任何方法或技术来实现信息存储。信息可以是计算机可读指令、数据结构、程序的模块或其他数据。计算机的可读存储介质的例子包括，但不限于相变内存(PRAM)、静态随机存取存储器(SRAM)、动态随机存取存储器(DRAM)、其他类型的随机存取存储器(RAM)、只读存储器(ROM)、电可擦除可编程只读存储器(EEPROM)、快闪记忆体或其他内存技术、只读光盘只读存储器(CD-ROM)、数字多功能光盘(DVD)或其他光学存储、磁盒式磁带，磁带磁磁盘存储或其他磁性存储设备或任何其他非传输介质，可用于存储可以被计算设备访问的信息。按照本文中的界定，计算机可读介质不包括暂存电脑可读媒体(transitory media)，如调制的数据信号和载波。
还需要说明的是，术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、商品或者设备不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、商品或者设备所固有的要素。在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括所述要素的过程、方法、商品或者设备中还存在另外的相同要素。
本领域技术人员应明白，本公开的实施例可提供为方法、系统或计算机程序产品。因此，本公开可采用完全硬件实施例、完全软件实施例或结合软件和硬件方面的实施例的形式。而且，本公开可采用在一个或多个其中包含有计算机可用程序代码的计算机可读存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
以上所述仅为本公开的实施例而已，并不用于限制本公开。对于本领域技术人员来说，本公开可以有各种更改和变化。凡在本公开的精神和原理之内所作的任何修改、等同替换、改进等，均应包含在本公开的权利要求范围之内。
本公开实施例公开A1、一种订单调度方法，包括：
获取至少两类配送员各自对应的待分配订单，形成待分配订单集合；
确定对所述至少两类配送员进行统一调度时的订单分配流程；
在执行所述订单分配流程的过程中，从所述至少两类配送员中为所述待分配订单集合中的订单分配配送员。
A2、如A1所述的方法中，获取至少两类配送员各自对应的待分配订单，形成待分配订单集合，包括：
确定与所述至少两类配送员一一对应的至少两类订单池；
获取所述至少两类订单池中的待分配订单，形成所述待分配订单集合。
A3、如A1所述的方法中，所述订单分配流程为并单分配流程、分组分配流程或包括并单分配流程和分组分配流程的融合分配流程。
A4、如A3所述的方法中，当所述订单分配流程为融合分配流程时，在执行所述订单分配流程的过程中，从所述至少两类配送员中为所述待分配订单集合中的订单分配配送员，包括：
从所述至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员；
从所述至少两类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
A5、如A4所述的方法中，从所述至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员，包括：
按照所述至少两类配送员之间的优先级，依次从每类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员。
A6、如A5所述的方法中，对所述至少两类配送员中的专职配送员，从所述专职配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员，包括：
获取所述待分配订单集合中未被分配出去的订单；
对所述待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单 与所述专职配送员中各个尚有订单需要配送的配送员之间的匹配度；
判断所述专职配送员中各个尚有订单需要配送的配送员中，是否存在与所述订单之间的匹配度符合第一匹配度要求的配送员；
若判断结果为存在，直接将所述订单分配给与所述订单之间的匹配度符合第一匹配度要求的配送员。
A7、如A5或A6所述的方法中，对所述至少两类配送员中的兼职配送员，从所述兼职配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员，包括：
获取所述待分配订单集合中未被分配出去的订单；
对所述待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单与所述兼职配送员中各个尚有订单需要配送的配送员之间的匹配度；
判断所述兼职配送员中各个尚有订单需要配送的配送员中，是否存在与所述订单之间的匹配度符合第一匹配度要求的配送员；
若判断结果为存在，将所述订单的信息发送给与所述订单之间的匹配度符合第一匹配度要求的配送员，以供与所述订单之间的匹配度符合第一匹配度要求的配送员抢单；
当有配送员发起抢单操作时，将所述订单分配给发起抢单操作的配送员。
A8、如A4所述的方法中，从所述至少两类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员，包括：
按照所述至少两类配送员之间的优先级，依次从每类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
A9、如A8所述的方法中，对所述至少两类配送员中专职配送员，从所述专职配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员，包括：
将所述待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；
计算所述至少一个订单组中每个订单组与所述专职配送员中各配送员之间的匹配度；
根据所述每个订单组与所述专职配送员中各配送员之间的匹配度，从所述专职配送员中为所述每个订单组分配配送员。
A10、如A8或A9所述的方法中，对所述至少两类配送员中兼职配送员，从所述兼职配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员，包括：
将所述待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；
计算所述至少一个订单组中每个订单组与所述兼职配送员中各配送员之间的匹配度；
按照每个订单组与所述兼职配送员中各配送员之间的匹配度由高到低的顺序，将每个订单组的信息发送给所述兼职配送员中各配送员，以等待配送员抢单；以及
对每个订单组，当有配送员针对所述订单组发起抢单操作时，将所述订单组分配给发起抢单操作的配送员。
本公开实施例还公开B11、一种订单调度装置，包括：
获取模块，用于获取至少两类配送员各自对应的待分配订单，形成待分配订单集合；
确定模块，用于确定对所述至少两类配送员进行统一调度时的订单分配流程；
分配模块，用于在执行所述订单分配流程的过程中，从所述至少两类配送员中为所述待分配订单集合中的订单分配配送员。
B12、如B11所述的装置中，所述获取模块用于：
确定与所述至少两类配送员一一对应的至少两类订单池；
获取所述至少两类订单池中的待分配订单，形成所述待分配订单集合。
B13、如B11所述的装置中，所述订单分配流程为并单分配流程、分组分配流程或包括并单分配流程和分组分配流程的融合分配流程。
B14、如B13所述的装置中，当所述订单分配流程为融合分配流程时，所述分配模块用于：
从所述至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员；
从所述至少两类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
B15、如B14所述的装置中，所述分配模块在以并单分配流程为所述待分配 订单集合中的订单分配配送员时，用于：
按照所述至少两类配送员之间的优先级，依次从每类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员。
B16、如B15所述的装置中，对所述至少两类配送员中的专职配送员，所述分配模块用于：
获取所述待分配订单集合中未被分配出去的订单；
对所述待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单与所述专职配送员中各个尚有订单需要配送的配送员之间的匹配度；
判断所述专职配送员中各个尚有订单需要配送的配送员中，是否存在与所述订单之间的匹配度符合第一匹配度要求的配送员；
若判断结果为存在，直接将所述订单分配给与所述订单之间的匹配度符合第一匹配度要求的配送员。
B17、如B15或B16所述的装置中，对所述至少两类配送员中的兼职配送员，所述分配模块用于：
获取所述待分配订单集合中未被分配出去的订单；
对所述待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单与所述兼职配送员中各个尚有订单需要配送的配送员之间的匹配度；
判断所述兼职配送员中各个尚有订单需要配送的配送员中，是否存在与所述订单之间的匹配度符合第一匹配度要求的配送员；
若判断结果为存在，将所述订单的信息发送给与所述订单之间的匹配度符合第一匹配度要求的配送员，以供与所述订单之间的匹配度符合第一匹配度要求的配送员抢单；
当有配送员发起抢单操作时，将所述订单分配给发起抢单操作的配送员。
B18、如B14所述的装置中，所述分配模块在以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员时，用于：
按照所述至少两类配送员之间的优先级，依次从每类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
B19、如B18所述的装置中，对所述至少两类配送员中专职配送员，所述分配模块用于：
将所述待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一 个订单组；
计算所述至少一个订单组中每个订单组与所述专职配送员中各配送员之间的匹配度；
根据所述每个订单组与所述专职配送员中各配送员之间的匹配度，从所述专职配送员中为所述每个订单组分配配送员。
B20、如B18或B19所述的装置中，对所述至少两类配送员中兼职配送员，所述分配模块用于：
将所述待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；
计算所述至少一个订单组中每个订单组与所述兼职配送员中各配送员之间的匹配度；
按照每个订单组与所述兼职配送员中各配送员之间的匹配度由高到低的顺序，将每个订单组的信息发送给所述兼职配送员中各配送员，以等待配送员抢单；以及
对每个订单组，当有配送员针对所述订单组发起抢单操作时，将所述订单组分配给发起抢单操作的配送员。
本公开实施例还公开C21、一种电子设备，包括：存储器和处理器；所述存储器存储有一条或多条计算机指令，所述一条或多条计算机指令在被所述处理器执行时实现上述A1-A10任一项所述方法中的步骤。
本公开实施例还公开D22、一种存储有计算机程序的计算机可读存储介质，所述计算机程序被执行时实现上述A1-A10任一项所述方法中的步骤。

Claims (22)

  1. 一种订单调度方法，包括：
    获取至少两类配送员各自对应的待分配订单，形成待分配订单集合；
    确定对所述至少两类配送员进行统一调度时的订单分配流程；
    在执行所述订单分配流程的过程中，从所述至少两类配送员中为所述待分配订单集合中的订单分配配送员。
  2. 根据权利要求1所述的方法，获取至少两类配送员各自对应的待分配订单，形成待分配订单集合，包括：
    确定与所述至少两类配送员一一对应的至少两类订单池；
    获取所述至少两类订单池中的待分配订单，形成所述待分配订单集合。
  3. 根据权利要求1所述的方法，其中，所述订单分配流程为并单分配流程、分组分配流程或包括并单分配流程和分组分配流程的融合分配流程。
  4. 根据权利要求3所述的方法，其中，当所述订单分配流程为融合分配流程时，在执行所述订单分配流程的过程中，从所述至少两类配送员中为所述待分配订单集合中的订单分配配送员，包括：
    从所述至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员；
    从所述至少两类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
  5. 根据权利要求4所述的方法，其中，从所述至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员，包括：
    按照所述至少两类配送员之间的优先级，依次从每类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员。
  6. 根据权利要求5所述的方法，其中，对所述至少两类配送员中的专职配送员，从所述专职配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员，包括：
    获取所述待分配订单集合中未被分配出去的订单；
    对所述待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单 与所述专职配送员中各个尚有订单需要配送的配送员之间的匹配度；
    判断所述专职配送员中各个尚有订单需要配送的配送员中，是否存在与所述订单之间的匹配度符合第一匹配度要求的配送员；
    若判断结果为存在，直接将所述订单分配给与所述订单之间的匹配度符合第一匹配度要求的配送员。
  7. 根据权利要求5或6所述的方法，其中，对所述至少两类配送员中的兼职配送员，从所述兼职配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员，包括：
    获取所述待分配订单集合中未被分配出去的订单；
    对所述待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单与所述兼职配送员中各个尚有订单需要配送的配送员之间的匹配度；
    判断所述兼职配送员中各个尚有订单需要配送的配送员中，是否存在与所述订单之间的匹配度符合第一匹配度要求的配送员；
    若判断结果为存在，将所述订单的信息发送给与所述订单之间的匹配度符合第一匹配度要求的配送员，以供与所述订单之间的匹配度符合第一匹配度要求的配送员抢单；
    当有配送员发起抢单操作时，将所述订单分配给发起抢单操作的配送员。
  8. 根据权利要求4所述的方法，其中，从所述至少两类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员，包括：
    按照所述至少两类配送员之间的优先级，依次从每类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
  9. 根据权利要求8所述的方法，其中，对所述至少两类配送员中专职配送员，从所述专职配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员，包括：
    将所述待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；
    计算所述至少一个订单组中每个订单组与所述专职配送员中各配送员之间的匹配度；
    根据所述每个订单组与所述专职配送员中各配送员之间的匹配度，从所述专 职配送员中为所述每个订单组分配配送员。
  10. 根据权利要求8或9所述的方法，其中，对所述至少两类配送员中兼职配送员，从所述兼职配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员，包括：
    将所述待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；
    计算所述至少一个订单组中每个订单组与所述兼职配送员中各配送员之间的匹配度；
    按照每个订单组与所述兼职配送员中各配送员之间的匹配度由高到低的顺序，将每个订单组的信息发送给所述兼职配送员中各配送员，以等待配送员抢单；以及
    对每个订单组，当有配送员针对所述订单组发起抢单操作时，将所述订单组分配给发起抢单操作的配送员。
  11. 一种订单调度装置，包括：
    获取模块，用于获取至少两类配送员各自对应的待分配订单，形成待分配订单集合；
    确定模块，用于确定对所述至少两类配送员进行统一调度时的订单分配流程；
    分配模块，用于在执行所述订单分配流程的过程中，从所述至少两类配送员中为所述待分配订单集合中的订单分配配送员。
  12. 根据权利要求11所述的装置，其中，所述获取模块用于：
    确定与所述至少两类配送员一一对应的至少两类订单池；
    获取所述至少两类订单池中的待分配订单，形成所述待分配订单集合。
  13. 根据权利要求11所述的装置，其中，所述订单分配流程为并单分配流程、分组分配流程或包括并单分配流程和分组分配流程的融合分配流程。
  14. 根据权利要求13所述的装置，其中，当所述订单分配流程为融合分配流程时，所述分配模块用于：
    从所述至少两类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员；
    从所述至少两类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
  15. 根据权利要求14所述的装置，其中，所述分配模块在以并单分配流程为所述待分配订单集合中的订单分配配送员时，用于：
    按照所述至少两类配送员之间的优先级，依次从每类配送员中尚有订单需要配送的配送员中，以并单分配流程为所述待分配订单集合中的订单分配配送员。
  16. 根据权利要求15所述的装置，其中，对所述至少两类配送员中的专职配送员，所述分配模块用于：
    获取所述待分配订单集合中未被分配出去的订单；
    对所述待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单与所述专职配送员中各个尚有订单需要配送的配送员之间的匹配度；
    判断所述专职配送员中各个尚有订单需要配送的配送员中，是否存在与所述订单之间的匹配度符合第一匹配度要求的配送员；
    若判断结果为存在，直接将所述订单分配给与所述订单之间的匹配度符合第一匹配度要求的配送员。
  17. 根据权利要求15或16所述的装置，其中，对所述至少两类配送员中的兼职配送员，所述分配模块用于：
    获取所述待分配订单集合中未被分配出去的订单；
    对所述待分配订单集合中未被分配出去的订单中的每个订单，计算所述订单与所述兼职配送员中各个尚有订单需要配送的配送员之间的匹配度；
    判断所述兼职配送员中各个尚有订单需要配送的配送员中，是否存在与所述订单之间的匹配度符合第一匹配度要求的配送员；
    若判断结果为存在，将所述订单的信息发送给与所述订单之间的匹配度符合第一匹配度要求的配送员，以供与所述订单之间的匹配度符合第一匹配度要求的配送员抢单；
    当有配送员发起抢单操作时，将所述订单分配给发起抢单操作的配送员。
  18. 根据权利要求14所述的装置，其中，所述分配模块在以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员时，用于：
    按照所述至少两类配送员之间的优先级，依次从每类配送员中，以分组分配流程为所述待分配订单集合中未以并单分配流程分配出去的订单分配配送员。
  19. 根据权利要求18所述的装置，其中，对所述至少两类配送员中专职配送员，所述分配模块用于：
    将所述待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；
    计算所述至少一个订单组中每个订单组与所述专职配送员中各配送员之间的匹配度；
    根据所述每个订单组与所述专职配送员中各配送员之间的匹配度，从所述专职配送员中为所述每个订单组分配配送员。
  20. 根据权利要求18或19所述的装置，其中，对所述至少两类配送员中兼职配送员，所述分配模块用于：
    将所述待分配订单集合中未以并单分配流程分配出去的订单，划分为至少一个订单组；
    计算所述至少一个订单组中每个订单组与所述兼职配送员中各配送员之间的匹配度；
    按照每个订单组与所述兼职配送员中各配送员之间的匹配度由高到低的顺序，将每个订单组的信息发送给所述兼职配送员中各配送员，以等待配送员抢单；以及
    对每个订单组，当有配送员针对所述订单组发起抢单操作时，将所述订单组分配给发起抢单操作的配送员。
  21. 一种电子设备，其中，包括：存储器和处理器；所述存储器存储有一条或多条计算机指令，所述一条或多条计算机指令在被所述处理器执行时实现权利要求1-10任一项所述方法中的步骤。
  22. 一种存储有计算机程序的计算机可读存储介质，其中，所述计算机程序被执行时实现权利要求1-10任一项所述方法中的步骤。
PCT/CN2017/110001 2017-06-27 2017-11-08 订单调度方法、装置、电子设备及计算机可读存储介质 WO2019000780A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710500829.1A CN107403295B (zh) 2017-06-27 2017-06-27 订单调度方法及装置
CN201710500829.1 2017-06-27

Publications (1)

Publication Number Publication Date
WO2019000780A1 true WO2019000780A1 (zh) 2019-01-03

Family

ID=60404546

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/110001 WO2019000780A1 (zh) 2017-06-27 2017-11-08 订单调度方法、装置、电子设备及计算机可读存储介质

Country Status (2)

Country Link
CN (2) CN111950959A (zh)
WO (1) WO2019000780A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110751433A (zh) * 2019-09-25 2020-02-04 北京三快在线科技有限公司 订单的分配方法和装置，电子设备及存储介质
CN113421140A (zh) * 2020-05-11 2021-09-21 阿里巴巴集团控股有限公司 订单处理方法、装置、系统及电子设备
CN114202132A (zh) * 2020-09-02 2022-03-18 北京三快在线科技有限公司 订单分配方法、装置、存储介质及电子设备

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108647892A (zh) * 2018-05-14 2018-10-12 北京顺丰同城科技有限公司 一种订单调度方法、装置及电子设备
CN108921445A (zh) * 2018-07-13 2018-11-30 广州餐道信息科技有限公司 一种蜂窝式订单指派方法
CN110751350B (zh) * 2018-07-23 2024-03-19 盒马(中国)有限公司 配送调度系统、方法、装置及电子设备
CN110874700A (zh) * 2018-09-03 2020-03-10 菜鸟智能物流控股有限公司 物流订单匹配方法、装置以及电子设备
CN109242333A (zh) * 2018-09-27 2019-01-18 深圳市云带网投资科技有限公司 一种基于pc端管理、app平台下的企业物流配送服务系统
CN110369307B (zh) * 2018-11-06 2022-11-08 北京京东乾石科技有限公司 一种包裹分拣装置及方法
CN111008800B (zh) * 2019-10-18 2024-02-23 拉扎斯网络科技（上海）有限公司 配送任务的数据处理方法、装置、服务器和存储介质
CN111260240B (zh) * 2020-01-22 2023-09-05 北京京东振世信息技术有限公司 一种任务分配方法及装置
CN111785346A (zh) * 2020-05-29 2020-10-16 北京沃东天骏信息技术有限公司 处方订单派发方法、系统、装置和存储介质
CN112862319B (zh) * 2021-02-08 2023-10-03 北京顺达同行科技有限公司 订单调度的方法、装置、设备及存储介质
CN116341878B (zh) * 2023-05-23 2023-08-18 苏州万店掌网络科技有限公司 一种任务分配方法、装置、设备及可读存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040176962A1 (en) * 2003-03-03 2004-09-09 Justin Mann Residential delivery system
CN103020752A (zh) * 2012-11-22 2013-04-03 南京途牛科技有限公司 订单自动分配系统
CN105741020A (zh) * 2016-01-25 2016-07-06 滴滴（中国）科技有限公司 统一订单分配方法和设备
CN106327085A (zh) * 2016-08-26 2017-01-11 多点生活(中国)网络科技有限公司 一种订单智能调度方法
CN106406915A (zh) * 2016-11-18 2017-02-15 北京小度信息科技有限公司 界面显示方法及装置

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9269103B1 (en) * 2015-02-19 2016-02-23 Square, Inc. Combining orders for delivery
CN105719110A (zh) * 2015-05-22 2016-06-29 北京小度信息科技有限公司 订单处理方法和装置
CN106779526A (zh) * 2016-11-23 2017-05-31 北京小度信息科技有限公司 订单组分配方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040176962A1 (en) * 2003-03-03 2004-09-09 Justin Mann Residential delivery system
CN103020752A (zh) * 2012-11-22 2013-04-03 南京途牛科技有限公司 订单自动分配系统
CN105741020A (zh) * 2016-01-25 2016-07-06 滴滴（中国）科技有限公司 统一订单分配方法和设备
CN106327085A (zh) * 2016-08-26 2017-01-11 多点生活(中国)网络科技有限公司 一种订单智能调度方法
CN106406915A (zh) * 2016-11-18 2017-02-15 北京小度信息科技有限公司 界面显示方法及装置

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110751433A (zh) * 2019-09-25 2020-02-04 北京三快在线科技有限公司 订单的分配方法和装置，电子设备及存储介质
CN113421140A (zh) * 2020-05-11 2021-09-21 阿里巴巴集团控股有限公司 订单处理方法、装置、系统及电子设备
CN114202132A (zh) * 2020-09-02 2022-03-18 北京三快在线科技有限公司 订单分配方法、装置、存储介质及电子设备

Also Published As

Publication number Publication date
CN107403295B (zh) 2020-08-11
CN111950959A (zh) 2020-11-17
CN107403295A (zh) 2017-11-28

Similar Documents

Publication Publication Date Title
WO2019000780A1 (zh) 订单调度方法、装置、电子设备及计算机可读存储介质
CN106779183B (zh) 订单组配送顺序规划方法、路线规划方法及装置
CN108681857B (zh) 一种配送订单分配方法及装置、计算机可读存储介质
CN107094165B (zh) 配送能力确定、配送任务获取、配送资源调度方法和设备
WO2019000779A1 (zh) 订单调度方法、装置、电子设备及计算机可读存储介质
US20200134558A1 (en) Order allocation method and device
WO2017167128A1 (zh) 一种物流资源的调度方法、设备及系统
CN109214739B (zh) 订单处理方法及装置
WO2018095066A1 (zh) 任务分组方法、装置、电子设备及计算机存储介质
CN109146349B (zh) 订单分配方法及装置
CN106779910B (zh) 配送订单分配方法和装置
WO2018223669A1 (zh) 订单配送方法及装置
CN106453146B (zh) 私有云计算资源的分配方法、系统、设备和可读存储介质
CN107844877B (zh) 订单分配方法和装置
CN109118310B (zh) 订单处理方法和装置
CN104040485A (zh) Paas分层调度和自动缩放
CN104040486A (zh) 解耦paas资源、作业和调度
WO2019000786A1 (zh) 订单分配方法及装置
US8527988B1 (en) Proximity mapping of virtual-machine threads to processors
CN108154298B (zh) 配送任务分配方法、装置、电子设备及计算机存储介质
CN104023042B (zh) 云平台资源调度方法
CN110383764A (zh) 无服务器系统中使用历史数据处理事件的系统和方法
WO2019120158A1 (zh) 物品拣选方法及相关设备
CN109523202B (zh) 订单处理方法、装置、设备及计算机可读存储介质
CN104301257B (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: 17916423

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 30/03/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 17916423

Country of ref document: EP

Kind code of ref document: A1