WO2019047432A1 - 订单处理方法和装置 - Google Patents

订单处理方法和装置 Download PDF

Info

Publication number
WO2019047432A1
WO2019047432A1 PCT/CN2017/118697 CN2017118697W WO2019047432A1 WO 2019047432 A1 WO2019047432 A1 WO 2019047432A1 CN 2017118697 W CN2017118697 W CN 2017118697W WO 2019047432 A1 WO2019047432 A1 WO 2019047432A1
Authority
WO
WIPO (PCT)
Prior art keywords
order
delivery
allocated
type
client
Prior art date
Application number
PCT/CN2017/118697
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 WO2019047432A1 publication Critical patent/WO2019047432A1/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
    • 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

Definitions

  • the present application relates to the field of computer technology, and in particular to the field of Internet technologies, and in particular, to an order processing method and apparatus.
  • the distribution order is usually used to distribute express orders, and the direct delivery mode is used for delivery orders. This method has a high distribution cost and causes a certain amount of waste of resources.
  • the purpose of the embodiment of the present application is to propose an improved order processing method and apparatus to solve the technical problems mentioned in the above background art.
  • the embodiment of the present application provides A1, an order processing method, the method includes: acquiring an order to be allocated, wherein the order to be allocated includes a first type of order and a second type of order, the first type of order and the second type of The order is an order for delivery by different delivery modes; the order with the order validity requirement of the order of the second type is selected from the first type of order; the delivery mode of the selected first type of order is configured as the first The delivery mode used for the two types of orders.
  • selecting an order with an order time validity requirement similar to the second type of order from the first type of order including: calculating the time and expectation of the user placing the order of the first type according to the order information The time difference between the delivery times; the first type of order corresponding to the time difference of the delivery time condition satisfying the order of the second type is selected.
  • the method further comprises: determining a matching degree between the to-be-allocated order and the at least one delivery client; and respectively, between the to-be-allocated order and the at least one delivery client The matching degree, the target delivery client matching the to-be-assigned order is allocated; the to-assigned order that does not match the target delivery client is filtered out from the to-be-allocated order as a new to-be-allocated order to update the to-be-allocated order.
  • A5 The method of the above A1, the method further comprising: assigning a target delivery client to the selected first type of order.
  • A6 The method as described in A3, determining the matching degree between the to-be-allocated order and the at least one delivery client, respectively, comprising: acquiring an order group of the at least one delivery client; and comparing the similarity of the order in the statistical order group with the to-be-distributed order is greater than or equal to The number of orders with a preset first similarity threshold; the ratio of the number of calculated statistics to the total number of orders for the order group; if the ratio is greater than or equal to the preset ratio threshold, the order to be assigned and the order in the order group The highest similarity is determined as the degree of matching between the order to be assigned and the delivery client.
  • A7 The method according to A5, wherein the target delivery client is allocated for the selected first type of order, comprising: determining the similarity between the orders based on the selected order information of the first type of order, and the order information includes: a cargo address, a shipping address, and an expected delivery time; generating at least one order group based on the similarity, wherein an order similarity between any two orders in an order group is greater than or equal to a preset second similarity threshold; And determining, according to the order information of the order in the at least one order group and the information of the at least one delivery client, the matching degree of the at least one order group and the at least one delivery client respectively, the information of the delivery client includes at least one of the following: the average delivery speed of the delivery client And the order information of the unfinished order of the delivery client; the order group is assigned to the delivery client whose matching degree is greater than or equal to the preset matching degree threshold.
  • the order group is allocated to the delivery client whose matching degree is greater than or equal to the preset matching degree threshold, and includes: assigning a matching degree greater than or equal to the preset matching for the order group based on the maximum weight matching algorithm.
  • the delivery client with a threshold assigning a matching degree greater than or equal to the preset matching for the order group based on the maximum weight matching algorithm.
  • the embodiment of the present application provides a B1, an order processing device, the device includes: an obtaining unit configured to acquire an order to be allocated, wherein the to-be-allocated order includes a first type of order and a second type of order, The first type of order and the second type of order are orders for delivery by using different delivery modes; the selecting unit is configured to select an order time validity requirement from the first type of order and the second An order similar to the type of order; a configuration unit configured to configure a delivery mode of the selected first type of order as a delivery mode employed by the second type of order.
  • the selecting unit comprising: a calculating module, configured to calculate a time difference between a user placing time and an expected delivery time of the first type of order according to the order information; selecting a module, configuring A first type of order corresponding to a time difference corresponding to a delivery time condition that satisfies a second type of order.
  • the device of the above-mentioned B1 the device further comprising: a determining unit configured to determine a degree of matching between the to-be-allocated order and the at least one delivery client; the first allocating unit configured to be based on the to-be-allocated order Assigning a target delivery client that matches the to-be-assigned order to the matching degree of the at least one delivery client, and an update unit configured to filter out the target delivery client from the to-be-allocated order Assign an order as a new pending order to update the pending order.
  • the determining unit comprising: a first obtaining module, configured to acquire order information of an order to be allocated, and order information of an order allocated to the at least one delivery client, wherein the order to be allocated
  • the order information and the order information of the order allocated to the delivery client include a pickup address, a delivery address, and a desired delivery time;
  • the first determining module is configured to use the order information based on the to-be-allocated order and assign to
  • the order information of the order of the delivery client determines a pickup address distance between the pickup address of the order to be dispensed and the pickup address of the order allocated to the delivery client, and the delivery address of the to-be-allocated order Time interval between the shipping address distance between the shipping address of the order assigned to the delivery client and the expected delivery time of the order to be dispensed and the expected delivery time of the order assigned to the delivery client
  • a second determining module configured to determine based on the pickup address distance, the delivery address distance, and the time interval The line to be dispensed
  • the determining unit comprising: a second acquiring module, configured to acquire an order group of the at least one delivery client; and a statistics module configured to count the order in the order group and the to-be-allocated order The number of orders having a similarity greater than or equal to a preset first similarity threshold; a calculation module configured to calculate a ratio of the number of statistics to the total number of orders of the order group; and a third determining module configured to The ratio is greater than or equal to the preset ratio threshold, and the highest similarity between the to-be-allocated order and the order in the order group is determined as the matching degree between the to-be-allocated order and the delivery client.
  • the second allocation unit comprising: a first determining module, configured to determine the similarity between the orders based on the selected order information of the first type of order, the order information The picking address, the shipping address, and the expected delivery time; the generating module configured to generate at least one order group based on the similarity, wherein an order similarity between any two orders in an order group is greater than or And a second determining module configured to determine, according to the order information of the order in the at least one order group and the information of the at least one delivery client, the at least one order group and the at least a matching degree of the delivery client, the information of the delivery client includes at least one of the following: an average delivery speed of the delivery client and order information of the delivery client's outstanding order; an allocation module configured to assign the order group to the matching degree A delivery client that is greater than or equal to the preset match threshold.
  • the allocation module is further configured to: allocate, according to a maximum weight matching algorithm, a delivery client whose matching degree is greater than or equal to a preset matching degree threshold.
  • the embodiment of the present application provides C1, an electronic device, the electronic device includes: one or more processors; and a storage device, configured to store one or more programs, when the one or more programs are one or more of the foregoing
  • the processor when executed, causes the one or more processors described above to implement the method as described in any of the implementations of A1 through A8.
  • the embodiment of the present application provides D1.
  • a computer readable storage medium having stored thereon a computer program, wherein the computer program is executed by a processor to implement a method as described in any one of Embodiments A1 to A8.
  • the order processing method and apparatus first acquires an order to be distributed, wherein the order to be distributed includes a first type of order and a second type of order that are delivered by using different delivery modes, and then, from the first In the type of order, the order with the order validity requirement similar to the second type of order is selected, and finally, the delivery mode of the selected first type of order is configured as the delivery mode adopted by the second type of order, thereby providing An order fusion mechanism for different distribution modes saves distribution costs.
  • FIG. 1 is an exemplary system architecture diagram to which the present application can be applied;
  • FIG. 2 is a flow chart of one embodiment of an order processing method in accordance with the present application.
  • FIG. 3 is a schematic diagram of an application scenario of an order processing method according to the present application.
  • FIG. 5 is a block diagram showing an embodiment of an order processing apparatus according to the present application.
  • FIG. 6 is a block diagram showing the structure of a computer system suitable for implementing the server of the embodiment of the present application.
  • FIG. 1 illustrates an exemplary system architecture 100 in which an embodiment of an order processing method or order processing device of the present application may be applied.
  • system architecture 100 can include distribution clients 1011, 1012, networks 1021, 1022, 1023, user terminals 1031, 1032, 1033, and server 104.
  • the network 1021 is used to provide a medium for communication links between the distribution clients 1011, 1012 and the server 104; the network 1022 is used to provide a communication link between the distribution clients 1011, 1012 and the user terminals 1031, 1032, 1033. Medium; network 1023 is used to provide a medium for communication links between user terminals 1031, 1032, 1033 and server 104.
  • Networks 1021, 1022, 1023 may include various types of connections, such as wired, wireless communication links, fiber optic cables, and the like.
  • the delivery personnel can use the delivery client 1011, 1012 to interact with the server 104 via the network 1021 to obtain order information and the like from the server 104; the delivery personnel can also use the delivery client 1011, 1012 to communicate with the user terminals 1031, 1032, 1033 via the network 1022. Interacting to send messages to the user terminals 1031, 1032, 1033, etc.; the user can interact with the server 104 over the network 1023 using the user terminals 1031, 1032, 1033 to submit an order and store the order information in the server 104 or the like.
  • Various communication client applications such as take-out applications, shopping applications, financial payment applications, instant communication software, and logistics information query applications, can be installed on the user terminals 1031, 1032, and 1033.
  • the delivery clients 1011, 1012 may be various electronic devices having a display screen and supporting information processing, messaging, and reception, including but not limited to smartphones, tablets, and the like.
  • the user terminals 1031, 1032, 1033 may be various electronic devices having a display screen and supporting information processing, message transmission and reception, including but not limited to smart phones, tablets, smart watches, laptop portable computers, desktop computers, and the like. .
  • Server 104 may be a server that provides various services, such as a background order server that pushes order information to delivery clients 1011, 1012.
  • the background order server may obtain an order to be allocated, the order to be allocated includes an order of a first type and an order of a second type, and the order to be allocated may be an order submitted by the user terminals 1031, 1032, and 1033;
  • the type of order the order with the order validity requirement similar to the above-mentioned second type of order is selected; finally, the delivery mode of the selected first type of order can be configured as the delivery mode adopted by the second type of order.
  • the delivery client 1011, 1012 that orders the delivery using the delivery mode adopted by the second type of order can push the order information of the selected first type of order.
  • the order processing method provided by the embodiment of the present application is generally executed by the server 104. Accordingly, the order processing apparatus is generally disposed in the server 104.
  • the order processing method includes the following steps:
  • Step 201 Acquire an order to be allocated.
  • the electronic device (for example, the server shown in FIG. 1) on which the order processing method runs may obtain an order to be allocated locally or remotely, and the order to be allocated may be an order for receiving the user. An order that has not been assigned.
  • the electronic device may directly acquire the to-be-allocated order from the local storage; or when the electronic device is a background server supporting the logistics/takeaway application on the terminal device
  • the order to be allocated may be obtained from the terminal device by using a wired connection or a wireless connection.
  • the order information may include the user's order time, expected delivery time, order identification, item name and item number involved in the order, remark information, consignee name, and phone number, and the like.
  • the to-be-allocated order may include a first type of order and a second type of order, wherein the first type of order and the second type of order are orders that are delivered by using different delivery modes.
  • the distribution model is the basic strategy and method adopted by enterprises for distribution. It refers to the combination form of the elements that constitute the distribution movement and the standard form of its movement.
  • the first type of order may be an order for delivery in a distributed distribution mode or an order for delivery by a direct delivery mode; the second type of order may also be an order for delivery in a distributed distribution mode or by direct delivery. The order for the mode to be delivered.
  • the second type of order is an order for delivery by the direct delivery mode; and when the first type of order is an order for delivery by the direct delivery mode At the time, the second type of order mentioned above is an order for delivery in the distributed distribution mode.
  • the order for distribution using the distributed distribution mode is generally a courier order (an order with low timeliness requirement), and the distribution process of the distributed distribution mode is as follows: the order is first picked up by the delivery personnel from the pick-up point of the order and It is sent to the nearby point A, and then sent to the distribution center of the above target area from the point A by the shuttle. For example, there may be 3 to 5 buses from the point A to the distribution center, and then the departure point of the target area. Send the order to the point B near the receiving point. If there is 3 to 5 buses from the distribution point to the point B in one day, when the order arrives at the point B, the ordering staff of the point B will place the order. The items involved are delivered to the user.
  • Orders for direct delivery mode are generally for take-out orders (orders with high timeliness requirements).
  • the delivery process for direct delivery mode is as follows: the order is picked up by the delivery personnel from the pick-up point of the order and delivered directly to the order. At the point of shipment, the entire delivery process is completed by a delivery person.
  • Orders that are distributed using the distributed distribution mode can be orders that are delivered by the courier company.
  • Orders that are delivered by the direct delivery mode can be derived from the take-out application.
  • the electronic devices can be distributed according to the order type corresponding to the order. Orders are differentiated from orders placed in direct delivery mode.
  • each of the to-be-allocated orders can be allocated to the delivery personnel for the delivery personnel to deliver the items involved in the assigned order.
  • the to-be-allocated order may be an order to be allocated in the target area, and the target area may be a certain city, for example, Beijing, Shanghai, etc.; or may be a pre-divided area, for example , within the three rings, within the five rings, and so on.
  • the delivery stage may include an order waiting allocation stage, an order allocation stage, a delivery personnel order receiving stage, a delivery personnel picking stage, a delivery personnel delivery stage, a customer receipt object stage, and customer feedback. Stage and so on.
  • Step 202 Select an order with an order time validity requirement similar to the second type of order from the first type of order.
  • the electronic device may select an order with an order time validity requirement similar to the second type of order from the first type of order.
  • Timeliness is the property that information has value for decision-making only for a certain period of time.
  • the timeliness of the order may be an attribute that delivers the item corresponding to the order within a certain delivery time period. When the delivery time period is greater than the preset threshold, the timeliness requirement of the order is low, when the delivery time period is less than When the threshold is preset, the timeliness of the order is high.
  • Order timeliness requirements can be set by the ordering user or default.
  • the electronic device may determine that at least two orders whose difference between the delivery time periods of the order is less than the preset difference are determined as the order validity requirement; or at least two orders whose delivery time periods are greater than the preset threshold may be It is determined that the order validity requirements are similar; it is also possible to determine at least two orders whose delivery time periods are less than the preset threshold as the order validity requirements are approximated.
  • the electronic device can select an order that needs to be delivered within three hours in the first type of order; or, under normal circumstances, the order of the second type of order has higher timeliness and if the delivery is When the time period is less than or equal to four hours, the time limit for setting the order is high.
  • the electronic device can also select the order that needs to be delivered within four hours in the first type of order, that is, select an order with high timeliness of the order.
  • the electronic device can select an order that can be delivered after six hours in the first type of order; or, in general, the order type of the second type of order has lower timeliness and if the order is delivered When the time period is more than four hours, the time limit for setting the order is low, and the electronic device can also select an order that can be delivered after four hours in the first type of order.
  • the order information of the order to be delivered may include a user placing time and an expected delivery time.
  • the electronic device can determine the time difference between the user placing time and the expected delivery time of the first type of order based on the order information. Specifically, the electronic device may first acquire the order information of the first type of order, and then obtain the user placing time and the expected delivery time in the order information, and determine the time between the user placing the order and the expected delivery time. The time difference. Thereafter, the first type of order corresponding to the time difference of the delivery time condition of the order of the second type can be selected.
  • the time difference that satisfies the delivery time condition may be a time difference that is less than or equal to the duration threshold. For example, when the duration threshold is 3 hours, the user is selected to place an order. The first type of order is less than 3 hours between the time and the expected delivery time.
  • Step 203 Configure the selected delivery mode of the first type of order as the delivery mode adopted by the second type of order.
  • the electronic device may configure the delivery mode of the first type of order selected in step 202 as the delivery mode adopted by the second type of order.
  • the electronic device may use the direct delivery mode to deliver the selected first type of order;
  • the type of order is delivered by the direct delivery mode, and when the second type of order is delivered by the distributed distribution mode, the electronic device can use the distributed distribution mode to deliver the selected first type of order.
  • the technical solution of the embodiment can combine the express order with the take-out order and then use the delivery mode of the take-out order to deliver, or combine the express order with the take-out order and then use the delivery mode of the express order to deliver.
  • FIG. 3 is a schematic diagram of an application scenario of an order processing method according to the present embodiment.
  • the server 301 first obtains an order to be dispensed 303, wherein the to-be-allocated order 303 includes a courier order 304 and a take-out order 305, where there are three express orders, namely express order A 3041, express order B 3042 and express order C 3043.
  • take-out orders are generally required to be delivered within four hours
  • express order A 3041 requires delivery of 306 within two days
  • express order B 3042 requires delivery of 307 within eight hours
  • express delivery order C 3043 requires delivery within two hours 308.
  • the server 301 selects the express order C 3043 from the express order 304. Finally, the server 301 configures the selected delivery mode of the express order C 3043 as the delivery mode adopted by the take-out order, and can push the order information 309 of the express order C 3043 to the delivery delivery client 302.
  • the above embodiment of the present application provides a method for selecting an order that satisfies an order time validity requirement of a second type of order in a first type of order, and configuring a selected delivery mode of the first type of order as a second type.
  • the delivery model used for the order provides an order fusion mechanism for different delivery modes, saving distribution costs.
  • the process 400 of the order processing method includes the following steps:
  • Step 401 Determine a degree of matching between the to-be-assigned order and the at least one delivery client.
  • the electronic device on which the order processing method operates may first determine the degree of matching between the order to be dispensed and the at least one delivery client, respectively.
  • the delivery client may be an electronic device used by the delivery personnel to deliver the order, and the delivery client stores the unprocessed, processed, and processed orders of the delivery personnel.
  • the electronic device may determine the matching degree between the to-be-allocated order and the delivery client according to the order information of the uncompleted order of the delivery client.
  • the electronic device may first obtain order information of an order to be allocated and order information of an order allocated to the at least one delivery client, where the order information and the allocation of the to-be-allocated order
  • the order information for the order of the above delivery client may include a pickup address, a delivery address, and an expected delivery time. Then, the electronic device may determine, according to the order information of the order to be allocated and the order information of the order allocated to the delivery client, the pick-up address of the to-be-allocated order and the pick-up address of the order allocated to the delivery client.
  • the electronic device may determine a degree of matching between the to-be-allocated order and the at least one delivery client based on the pickup address distance, the delivery address distance, and the time interval.
  • the electronic device may determine, according to the pick-up address distance, a matching degree between the to-be-allocated order and the at least one delivery client, and determine, according to the delivery address distance, the to-be-allocated order and the at least one delivery client respectively.
  • the delivery address distance, the weight corresponding to the delivery address distance, the time interval, and the weight corresponding to the time interval determine a matching degree between the to-be-allocated order and the at least one delivery client.
  • the electronic device may pre-store a correspondence table of the pickup address distance and the matching degree, a correspondence table of the delivery address distance and the matching degree, and a correspondence table between the time interval and the matching degree, and the electronic device may be in the electronic device.
  • the matching degree corresponding to the pick-up address distance in the correspondence table of the pick-up address distance and the matching degree is used as the first matching degree;
  • the matching corresponding to the shipping address distance is found in the correspondence table of the shipping address distance and the matching degree
  • the degree is used as the second matching degree;
  • the matching degree corresponding to the time interval is queried as the third matching degree in the correspondence table of the time interval and the matching degree; and the first matching degree, the second matching degree, and the third matching degree are correspondingly acquired.
  • the electronic device may also use the first matching degree as the matching degree between the order to be allocated and the delivery client; or the second matching degree may be used as the matching degree between the order to be allocated and the delivery client; The third matching degree is used as the matching degree between the order to be allocated and the delivery client.
  • the electronic device may first acquire an order group of the at least one delivery client, and the processing order and the unprocessed order on the delivery client may be pre-grouped by the electronic device to generate At least one order group.
  • the electronic device may group the orders with the same pick-up address into one group, for example, group the orders received by the same merchant into one group; the electronic device may also use the corresponding shipping address as the same cell. Orders in the same building are grouped together. For example, orders with corresponding shipping addresses are “Yingdu Building” are grouped together.
  • the electronic device may count the number of orders in the order group of the delivery client that are greater than or equal to the preset first similarity threshold in the order to be allocated, wherein the first similarity threshold may be related to the to-be-allocated
  • the pressure value of the business circle of the order is inversely proportional. The larger the pressure value of the business circle is, the lower the first similarity threshold is, the easier the order is to merge.
  • the pressure of the above business circle is the number of outstanding orders in the business circle and the number of uncompleted orders in the business circle.
  • the ratio of the number of delivery personnel to be delivered; then, the ratio of the counted quantity to the total number of orders of the above order group can be calculated, and whether the ratio is greater than or equal to a preset ratio threshold, for example, 0.5, the order is determined Whether there is more than half of the orders in the group and the similarity of the order to be allocated is greater than the first similarity threshold; if yes, the highest similarity between the order to be allocated and the order in the order group may be determined as the to-be-allocated order The degree of matching with the above delivery client.
  • a preset ratio threshold for example, 0.5
  • the electronic device may select the largest ratio of the number of orders in the order group that is greater than or equal to the first similarity threshold to the total number of orders of the order group.
  • the order group is used as the target order group, and the highest similarity between the order in the target order group and the order to be allocated can be determined as the matching degree between the above-mentioned order to be dispensed and the above-mentioned delivery client.
  • Step 402 Assign a target delivery client that matches the to-be-distributed order based on the degree of matching between the order to be allocated and the at least one delivery client.
  • the electronic device may allocate a target delivery client that matches the to-be-allocated order based on the matching degree between the to-assigned order and the at least one delivery client determined in step 401.
  • the electronic device may allocate the above-mentioned to-be-distributed order to the delivery client with the highest matching degree, or may determine the delivery client whose matching degree is higher than the preset matching degree threshold, and may be in the above-mentioned determined delivery client. Any of the delivery clients allocates the above-mentioned order to be dispensed.
  • the electronic device may push the order information of the to-be-allocated order to the target delivery client that matches the to-be-distributed order, and the order information may include at least one of the following: an order identifier, an item name involved in the order, and an item quantity, and the remarks Information, consignee name and phone number, pick-up address information, shipping address information, user order time and expected delivery time.
  • step 403 the to-be-allocated order that does not match the target delivery client is filtered out from the to-be-allocated order as a new to-be-allocated order to update the to-be-allocated order.
  • the electronic device may filter out the to-be-allocated order that does not match the target delivery client from the to-be-distributed order as a new to-be-allocated order. To update the pending order.
  • step 404 an order to be allocated is obtained.
  • Step 405 selecting an order with an order time validity requirement similar to the second type of order from the first type of order.
  • Step 406 Configure the selected delivery mode of the first type of order as the delivery mode adopted by the second type of order.
  • steps 404-406 are substantially the same as the operations of steps 201-203, and details are not described herein again.
  • Step 407 assigning a target delivery client to the selected first type of order.
  • the electronic device may allocate the selected first type of order.
  • a target delivery client that delivers the delivery mode of the second type of order.
  • the electronic device may allocate the target delivery customer for direct delivery mode for the selected first type of order.
  • the electronic device may allocate the target of the first type of order to be distributed in the distributed distribution mode.
  • Distribution client After the target delivery client is allocated, the electronic device may push the order information to the delivery client in the form of a short message, or push the order information to the delivery client in the form of a message alert of the external sale/logistics application.
  • the electronic device may be any one of the selected first type of order distribution systems; or the number of pending orders of the delivery client may be less than the selected first type of order.
  • the delivery client with a preset number threshold; the delivery client with the shortest distance between the current location of the delivery client and the pickup address indicated by the order may also be assigned to the selected first type of order.
  • the electronic device may first determine the similarity between the orders based on the selected order information of the first type of the order, wherein the order information may include a pick-up address. , shipping address and expected delivery time. Specifically, the electronic device may determine the similarity between the orders based on the pickup address distance between the pickup addresses corresponding to the respective orders; or may determine the distance based on the delivery address between the delivery addresses corresponding to the respective orders.
  • the similarity between the orders; the similarity between the orders may also be determined based on the time interval between the expected delivery times corresponding to the respective orders; and may also be based on the above-mentioned pickup address distance, the above-mentioned delivery address distance, and the above-mentioned time interval , to determine the similarity between orders.
  • the electronic device may generate at least one order group based on the similarity, such that the order similarity between any two orders in each of the generated at least one order group is greater than or equal to a preset second similarity Threshold.
  • the matching degree of the at least one order group and the at least one delivery client respectively may be determined based on the order information of the order in the at least one order group and the information of the at least one delivery client, wherein the information of the delivery client may include at least the following One: the average delivery speed of the delivery client and the order information of the delivery client's outstanding orders.
  • the electronic device may determine a match between the order information of the at least one order group and the uncompleted order of the delivery client respectively based on an average pickup address distance between the order in the order group and the uncompleted order of the delivery client.
  • Degree; the degree of matching between the at least one order group and the order information of the uncompleted order of the delivery client may be determined based on the average delivery address distance between the order in the order group and the outstanding order of the delivery client;
  • the time interval between the average expected delivery time between the order in the order group and the outstanding order of the delivery client determining the degree of matching between the at least one order group and the order information of the delivery client's outstanding orders; Determining the average pick-up address distance between the order in the group and the uncompleted order of the delivery client, the average delivery address distance, and the average expected delivery time interval, determining the at least one order group and the delivery client's outstanding order respectively
  • the degree of matching between order information; the above electronic devices are also The average value of the difference between the user placing time and the expected delivery time
  • the electronic device may assign the order group to the delivery client whose matching degree is greater than or equal to the preset matching degree threshold, and may push the order information of the at least one order in the order group to the matched delivery client, the electronic The device can assign the order group to the most matching delivery client, or assign the order group any delivery client with a matching degree greater than or equal to the above matching threshold.
  • the electronic device may first delete the delivery client whose matching degree is less than the matching degree threshold for the order group, and the retention matching degree is greater than or equal to the matching.
  • a threshold delivery client, and a pre-allocation relationship table between the order group and the reserved delivery client the pre-allocation relationship table can be used to store the distribution client to which the order group can be assigned and the matching degree with the delivery client
  • the electronic device may allocate the delivery client in the pre-allocation relationship table to the order group based on a maximum weight matching algorithm (Kuhn-Munkres algorithm), so that the allocated at least one delivery client and the assigned order The sum of the matching degrees of the groups is the maximum.
  • Kuhn-Munkres algorithm maximum weight matching algorithm
  • the above-mentioned maximum weight matching algorithm is also called a bipartite graph maximum weight matching algorithm.
  • the bipartite graph means that all vertices can be divided into two sets, for example, an X set and an Y set, wherein any two points in the X set are not connected. And any two points in the Y set are not connected, and the points in the X set are connected with the points in the Y set.
  • a bipartite graph is a weighted bipartite graph.
  • the bipartite graph maximum weight matching algorithm is a matching algorithm that finds the weights of the respective lines added to the maximum value.
  • the vertices in the X set are set as each order group, and the vertices in the Y set are set as the respective delivery clients, and the weight of the connection between the order group and the delivery client is set as the matching degree between the order group and the delivery client, A matching set is obtained in which the sum of the links is the maximum value, and each order group can be assigned to the corresponding delivery client according to the above matching set.
  • the flow 400 of the order processing method in the present embodiment highlights the respective orders to be distributed and the delivery customers before the distribution mode is configured for the distribution order.
  • the present application provides an embodiment of an order processing apparatus, and the apparatus embodiment corresponds to the method embodiment shown in FIG. Used in a variety of electronic devices.
  • the order processing apparatus 500 of this embodiment includes an acquisition unit 501, a selection unit 502, and a configuration unit 503.
  • the obtaining unit 501 is configured to acquire an order to be allocated, wherein the order to be allocated includes a first type of order and a second type of order, and the first type of order and the second type of order are distributed by using different delivery modes.
  • the ordering unit 502 is configured to select an order from the first type of order that the order time validity requirement is similar to the second type of order; the configuration unit 503 is configured to use the delivery mode of the selected first type of order The delivery mode used for the second type of order.
  • the specific processing of the obtaining unit 501, the selecting unit 502, and the configuring unit 503 of the order processing apparatus 500 may refer to step 201, step 202, and step 203 in the corresponding embodiment of FIG.
  • the selecting unit 502 may include a computing module (not shown) and a selecting module (not shown).
  • the order information of the order to be delivered may include the user's order time and expected delivery time.
  • the calculating module may determine, according to the order information, a time difference between a user placing time of the first type of order and an expected delivery time. Specifically, the calculating module may first obtain the order information of the first type of order, and then obtain the user placing time and the expected delivery time in the order information, and determine the time between the user placing the order and the expected delivery time. The time difference. Thereafter, the selection module may select the first type of order corresponding to the time difference of the delivery time condition of the second type of order. If the delivery time condition is delivered within a time period of the preset duration threshold, the time difference that satisfies the delivery time condition may be a time difference that is less than or equal to the duration threshold.
  • the order processing apparatus 500 may further include a determining unit (not shown), a first allocating unit (not shown), and an updating unit (not shown) Out).
  • the determining unit may first determine the degree of matching between the order to be allocated and the at least one delivery client.
  • the delivery client may be an electronic device used by the delivery personnel to deliver the order, and the delivery client stores the unprocessed, processed, and processed orders of the delivery personnel.
  • the determining unit may determine the matching degree between the order to be allocated and the delivery client according to the order information of the uncompleted order of the delivery client.
  • the first allocating unit may allocate a target delivery client that matches the to-be-allocated order based on the degree of matching between the to-be-allocated order and the at least one delivery client determined by the determining unit.
  • the first allocating unit may allocate the to-be-allocated order to the delivery client with the highest matching degree, or may determine the delivery client whose matching degree is higher than the preset matching degree threshold, and may send the determined delivery client to the above-mentioned delivery client. Any of the distribution clients in the distribution of the above-mentioned order to be allocated.
  • the first allocating unit may push the order information of the to-be-allocated order to the target delivery client matched with the to-be-allocated order.
  • the update unit may filter out the to-be-allocated order that does not match the target delivery client from the to-be-allocated order as a new to-be-allocated order to update the to-be-allocated order. Assign an order.
  • the determining unit may include a first acquiring module (not shown), a first determining module (not shown), and a second determining module (not shown) show).
  • the first obtaining module may first obtain the order information of the order to be allocated and the order information of the order allocated to the at least one delivery client, wherein the order information of the order to be allocated and the order information of the order allocated to the delivery client may be Includes pickup address, shipping address, and expected delivery time. Thereafter, the first determining module may determine, between the order information of the order to be allocated and the order information of the order allocated to the delivery client, between the pick-up address of the to-be-allocated order and the pick-up address of the order allocated to the delivery client.
  • the pick-up address distance, the shipping address distance between the shipping address of the above-mentioned order to be dispensed and the shipping address of the order assigned to the above-mentioned delivery client, and the expected delivery time of the above-mentioned order to be dispensed and assigned to the above-mentioned delivery client The time interval between the expected delivery times of the order.
  • the second determining module may determine a matching degree between the to-be-allocated order and the at least one delivery client, respectively, based on the pick-up address distance, the shipping address distance, and the time interval.
  • the second determining module may determine, according to the pick-up address distance, a matching degree between the to-be-allocated order and the at least one delivery client, and determine, according to the shipping address distance, that the to-be-allocated order is respectively a matching degree between the at least one delivery client; and determining, according to the time interval, a matching degree between the to-be-assigned order and the at least one delivery client; and the distance between the pick-up address and the pick-up address Corresponding weight, the above-mentioned delivery address distance, the weight corresponding to the delivery address distance, the time interval and the weight corresponding to the time interval, determine the matching degree between the to-be-allocated order and the at least one delivery client respectively.
  • the order processing apparatus 500 may further include a second allocation unit (not shown).
  • the second allocating unit may allocate a target delivery client that delivers the delivery mode of the second type of order for the selected first type of order.
  • the second allocation unit may allocate the target of the first type of order to be delivered in the direct delivery mode.
  • the delivery client when the first type of order is delivered by the direct delivery mode, and the second type of order is distributed by the distributed distribution mode, the second allocation unit may allocate the first type of order to the distributed distribution mode.
  • the target delivery client that delivers the shipment.
  • the determining unit may include a second acquiring module (not shown in the figure), a statistic module (not shown), a computing module (not shown), and A third determination module (not shown).
  • the second obtaining module may first acquire an order group of the at least one delivery client, and the processing in-process order and the unprocessed order on the delivery client may be pre-grouped to generate at least one order group.
  • the foregoing statistics module may count the number of orders in the order group of the delivery client that are similar to the to-be-allocated order, which is greater than or equal to a preset first similarity threshold, wherein the first similarity threshold may be associated with the to-be-assigned
  • the pressure value of the business circle of the order is inversely proportional. The larger the pressure value of the business circle is, the lower the first similarity threshold is, the easier the order is to merge.
  • the pressure of the above business circle is the number of outstanding orders in the business circle and the number of uncompleted orders in the business circle.
  • the calculation module may calculate a ratio of the calculated quantity to the total number of orders of the order group, and determine whether the ratio is greater than or equal to a preset ratio threshold, for example, 0.5 Determining whether there is more than half of the order in the order group and the similarity of the order to be allocated is greater than the first similarity threshold; if yes, the third determining module may set the highest order of the order to be allocated and the order in the order group The similarity is determined as the degree of matching between the above-mentioned to-be-allocated order and the above-mentioned delivery client.
  • a preset ratio threshold for example, 0.5 Determining whether there is more than half of the order in the order group and the similarity of the order to be allocated is greater than the first similarity threshold
  • the foregoing second allocation unit may include a first determining module (not shown), a generating module (not shown), and a second determining module (not shown) Shown and assigned module (not shown).
  • the first determining module may first determine the similarity between the orders based on the order information of the selected first type of order, wherein the order information may include a picking address, a shipping address, and a desired delivery time. Specifically, the first determining module may determine the similarity between the orders based on the pick-up address distance between the pick-up addresses corresponding to the respective orders; or may be based on the shipping address distance between the shipping addresses corresponding to the respective orders.
  • the generating module may generate at least one order group based on the similarity, so that the order similarity between any two orders in each of the generated at least one order group is greater than or equal to a preset second similarity Threshold.
  • the second determining module may determine, according to the order information of the order in the at least one order group and the information of the at least one delivery client, a matching degree between the at least one order group and the at least one delivery client, wherein the distribution client
  • the information may include at least one of the following: an average delivery speed of the delivery client and an order information of the delivery client's outstanding order.
  • the second determining module may determine, between the at least one order group and the order information of the uncompleted order of the delivery client, based on an average pick-up address distance between the order in the order group and the uncompleted order of the delivery client.
  • the matching degree; the matching degree between the at least one order group and the order information of the uncompleted order of the delivery client may be determined based on an average delivery address distance between the order in the order group and the uncompleted order of the delivery client;
  • the matching degree between the at least one order group and the order information of the delivery client's outstanding orders may be determined based on the time interval of the average expected delivery time between the order in the order group and the uncompleted order of the delivery client; Determining the at least one order group and the delivery client are not completed based on the average pickup address distance, the average delivery address distance, and the average expected delivery time interval between the order in the order group and the delivery client's outstanding order.
  • the degree of matching between the order information of the order; the second The module may also determine an average of the difference between the user's ordering time and the expected delivery time for each order in each order group as the average remaining time, and based on the average remaining time and the average delivery speed of at least one delivery client, A degree of matching between the order information of the at least one order group and the uncompleted order of the delivery client is determined.
  • the foregoing allocation module may assign the order group to the delivery client whose matching degree is greater than or equal to the preset matching degree threshold, and may push the order information of the at least one order in the order group to the matched delivery client, the foregoing allocation
  • the module can assign the order group to the most matching delivery client, or assign the order group any delivery client with a matching degree greater than or equal to the above matching threshold.
  • the foregoing allocation module may first delete the delivery client whose matching degree is less than the matching degree threshold for the order group, and the retention matching degree is greater than or equal to the foregoing matching.
  • a threshold delivery client, and a pre-allocation relationship table between the order group and the reserved delivery client the pre-allocation relationship table can be used to store the distribution client to which the order group can be assigned and the matching degree with the delivery client Afterwards, the foregoing allocation module may allocate the delivery client in the pre-allocation relationship table to the order group based on the maximum weight matching algorithm (Kuhn-Munkres algorithm), so that the allocated at least one delivery client and the assigned order The sum of the matching degrees of the groups is the maximum.
  • Kuhn-Munkres algorithm maximum weight matching algorithm
  • the above-mentioned maximum weight matching algorithm is also called a bipartite graph maximum weight matching algorithm.
  • the bipartite graph means that all vertices can be divided into two sets, for example, an X set and an Y set, wherein any two points in the X set are not connected. And any two points in the Y set are not connected, and the points in the X set are connected with the points in the Y set.
  • a bipartite graph is a weighted bipartite graph.
  • the bipartite graph maximum weight matching algorithm is a matching algorithm that finds the weights of the respective lines added to the maximum value.
  • the vertices in the X set are set as each order group, and the vertices in the Y set are set as the respective delivery clients, and the weight of the connection between the order group and the delivery client is set as the matching degree between the order group and the delivery client, A matching set is obtained in which the sum of the links is the maximum value, and each order group can be assigned to the corresponding delivery client according to the above matching set.
  • FIG. 6 a block diagram of a computer system 600 suitable for use in implementing a server in accordance with an embodiment of the present invention is shown.
  • the server shown in FIG. 6 is merely an example, and should not impose any limitation on the function and scope of use of the embodiments of the present application.
  • computer system 600 includes a central processing unit (CPU) 601 that can be loaded into a program in random access memory (RAM) 603 according to a program stored in read only memory (ROM) 602 or from storage portion 608. And perform various appropriate actions and processes.
  • RAM random access memory
  • ROM read only memory
  • RAM random access memory
  • various programs and data required for the operation of the system 600 are also stored.
  • the CPU 601, the ROM 602, and the RAM 603 are connected to each other through a bus 604.
  • An input/output (I/O) interface 605 is also coupled to bus 604.
  • the following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, etc.; an output portion 607 including, for example, a liquid crystal display (LCD) and a speaker; a storage portion 608 including a hard disk or the like; and including a LAN card, a modem, etc.
  • the communication section 609 performs communication processing via a network such as the Internet.
  • Driver 610 is also coupled to I/O interface 605 as needed.
  • a removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory or the like, is mounted on the drive 610 as needed so that a computer program read therefrom is installed into the storage portion 608 as needed.
  • an embodiment of the present disclosure includes a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for executing the method illustrated in the flowchart.
  • the computer program can be downloaded and installed from the network via communication portion 609, and/or installed from removable media 611.
  • the central processing unit (CPU) 601 the above-described functions defined in the method of the present application are performed.
  • the computer readable medium described above may be a computer readable signal medium or a computer readable storage medium or any combination of the two.
  • the computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of computer readable storage media may include, but are not limited to, electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable Programmable read only memory (EPROM or flash memory), optical fiber, portable compact disk read only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the foregoing.
  • a computer readable storage medium may be any tangible medium that can contain or store a program, which can be used by or in connection with an instruction execution system, apparatus or device.
  • a computer readable signal medium may include a data signal that is propagated in the baseband or as part of a carrier, carrying computer readable program code. Such propagated data signals can take a variety of forms including, but not limited to, electromagnetic signals, optical signals, or any suitable combination of the foregoing.
  • the computer readable signal medium can also be any computer readable medium other than a computer readable storage medium, which can transmit, propagate, or transport a program for use by or in connection with the instruction execution system, apparatus, or device.
  • Program code embodied on a computer readable medium can be transmitted by any suitable medium, including but not limited to wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
  • each block of the flowchart or block diagram can represent a module, a program segment, or a portion of code that includes one or more of the logic functions for implementing the specified.
  • Executable instructions can also occur in a different order than that illustrated in the drawings. For example, two successively represented blocks may in fact be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending upon the functionality involved.
  • each block of the block diagrams and/or flowcharts, and combinations of blocks in the block diagrams and/or flowcharts can be implemented in a dedicated hardware-based system that performs the specified function or operation. Or it can be implemented by a combination of dedicated hardware and computer instructions.
  • the units involved in the embodiments of the present invention may be implemented by software or by hardware.
  • the described unit may also be provided in the processor, for example, as a processor including an acquisition unit, a selection unit, and a configuration unit.
  • the names of these units do not in any way constitute a limitation on the unit itself.
  • the acquisition unit may also be described as "a unit that acquires an order to be dispensed.”
  • the present application also provides a computer readable medium, which may be included in the apparatus described in the above embodiments, or may be separately present and not incorporated into the apparatus.
  • the computer readable medium carries one or more programs, when the one or more programs are executed by the device, causing the device to: obtain an order to be dispensed, wherein the order to be dispensed includes an order of the first type and a second type Orders, the first type of order and the second type of order are orders for delivery using different delivery modes; from the first type of order, the order with the order validity requirement similar to the second type of order is selected;
  • the delivery mode of the first type of order is configured as the delivery mode employed by the second type of order.

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本申请实施例公开了订单处理方法和装置。该方法的一具体实施方式包括：获取待分配订单，其中，待分配订单包括第一类型的订单和第二类型的订单，第一类型的订单和第二类型的订单为采用不同的配送模式进行配送的订单；从第一类型的订单中选取订单时效性要求与第二类型的订单相近似的订单；将选取出的第一类型的订单的配送模式配置为第二类型的订单所采用的配送模式。该实施方式提供了一种不同配送模式的订单融合机制，节省了配送成本。

Description

订单处理方法和装置
相关申请的交叉引用
本申请要求于2017年9月7日提交的中国专利申请号为“201710800613.7”的优先权，其全部内容作为整体并入本申请中。
技术领域
本申请涉及计算机技术领域，具体涉及互联网技术领域，尤其涉及订单处理方法和装置。
背景技术
随着互联网行业的快速发展，物流行业改变了人们的购物方式，外卖行业改变了人们的餐饮行为。稳定、可靠、快捷、准时地完成订单配送是获得用户信赖以及提高企业竞争力的重要手段。目前，通常采用集散配送模式对快递订单进行配送，采用直送配送模式对外卖订单进行配送，这种方式的配送成本较高，且造成了一定程度的资源浪费。
发明内容
本申请实施例的目的在于提出一种改进的订单处理方法和装置，来解决以上背景技术部分提到的技术问题。
本申请实施例提供A1、一种订单处理方法，该方法包括：获取待分配订单，其中，待分配订单包括第一类型的订单和第二类型的订单，第一类型的订单和第二类型的订单为采用不同的配送模式进行配送的订单；从第一类型的订单中选取订单时效性要求与第二类型的订单相近似的订单；将选取出的第一类型的订单的配送模式配置为第二类型的订单所采用的配送模式。
A2、如A1上述的方法，从第一类型的订单中选取订单时效性要 求与第二类型的订单相近似的订单，包括：根据订单信息，计算第一类型的订单的用户下单时间与期望送达时间之间的时间差；选取满足第二类型的订单的配送时间条件的时间差对应的第一类型的订单。
A3、如A1上述的方法，在获取待分配订单之前，该方法还包括：确定待分配订单分别与至少一个配送客户端之间的匹配度；基于待分配订单分别与至少一个配送客户端之间的匹配度，分配与待分配订单匹配的目标配送客户端；从待分配订单中筛选出没有匹配上目标配送客户端的待分配订单作为新的待分配订单，以更新待分配订单。
A4、如A3上述的方法，确定待分配订单分别与至少一个配送客户端之间的匹配度，包括：获取待分配订单的订单信息以及分配给至少一个配送客户端的订单的订单信息，其中，待分配订单的订单信息以及分配给配送客户端的订单的订单信息均包括取货地址、送货地址和期望送达时间；基于待分配订单的订单信息以及分配给配送客户端的订单的订单信息，确定待分配订单的取货地址与分配给配送客户端的订单的取货地址之间的取货地址距离、待分配订单的送货地址与分配给配送客户端的订单的送货地址之间的送货地址距离和待分配订单的期望送达时间与分配给配送客户端的订单的期望送达时间之间的时间间隔；基于取货地址距离、送货地址距离和时间间隔，确定待分配订单分别与至少一个配送客户端之间的匹配度。
A5、如A1上述的方法，该方法还包括：为选取出的第一类型的订单分配目标配送客户端。
A6、如A3上述的方法，确定待分配订单分别与至少一个配送客户端之间的匹配度，包括：获取至少一个配送客户端的订单组；统计订单组中与待分配订单的相似度大于或等于预设的第一相似度阈值的订单的数量；计算统计的数量与订单组的订单总数量的比值；如果比值大于或等于预设的比值阈值，则将待分配订单与订单组中的订单的最高相似度确定为待分配订单与配送客户端的匹配度。
A7、如A5上述的方法，为选取出的第一类型的订单分配目标配送客户端，包括：基于选取出的第一类型的订单的订单信息，确定订单之间的相似度，订单信息包括取货地址、送货地址和期望送达时间； 基于相似度生成至少一个订单组，其中，一个订单组中的任意两个订单之间的订单相似度大于或等于预设的第二相似度阈值；基于至少一个订单组中订单的订单信息和至少一个配送客户端的信息，确定至少一个订单组分别与至少一个配送客户端的匹配度，配送客户端的信息包括以下至少一项：配送客户端的平均送货速度和配送客户端的未完成订单的订单信息；将订单组分配给匹配度大于或等于预设的匹配度阈值的配送客户端。
A8、如A7上述的方法，将订单组分配给匹配度大于或等于预设的匹配度阈值的配送客户端，包括：基于最大权匹配算法，为订单组分配匹配度大于或等于预设的匹配度阈值的配送客户端。
本申请实施例提供了B1、一种订单处理装置，该装置包括：获取单元，配置用于获取待分配订单，其中，所述待分配订单包括第一类型的订单和第二类型的订单，所述第一类型的订单和所述第二类型的订单为采用不同的配送模式进行配送的订单；选取单元，配置用于从所述第一类型的订单中选取订单时效性要求与所述第二类型的订单相近似的订单；配置单元，配置用于将选取出的第一类型的订单的配送模式配置为所述第二类型的订单所采用的配送模式。
B2、如B1上述的装置，选取单元，包括：计算模块，配置用于根据订单信息，计算所述第一类型的订单的用户下单时间与期望送达时间之间的时间差；选取模块，配置用于选取满足第二类型的订单的配送时间条件的时间差对应的第一类型的订单。
B3、如B1上述的装置，该装置还包括：确定单元，配置用于确定待分配订单分别与至少一个配送客户端之间的匹配度；第一分配单元，配置用于基于所述待分配订单分别与至少一个配送客户端之间的匹配度，分配与所述待分配订单匹配的目标配送客户端；更新单元，配置用于从所述待分配订单中筛选出没有匹配上目标配送客户端的待分配订单作为新的待分配订单，以更新待分配订单。
B4、如B3上述的装置，确定单元，包括：第一获取模块，配置用于获取待分配订单的订单信息以及分配给所述至少一个配送客户端的订单的订单信息，其中，所述待分配订单的订单信息以及分配给所 述配送客户端的订单的订单信息均包括取货地址、送货地址和期望送达时间；第一确定模块，配置用于基于所述待分配订单的订单信息以及分配给所述配送客户端的订单的订单信息，确定所述待分配订单的取货地址与分配给所述配送客户端的订单的取货地址之间的取货地址距离、所述待分配订单的送货地址与分配给所述配送客户端的订单的送货地址之间的送货地址距离和所述待分配订单的期望送达时间与分配给所述配送客户端的订单的期望送达时间之间的时间间隔；第二确定模块，配置用于基于所述取货地址距离、所述送货地址距离和所述时间间隔，确定所述待分配订单分别与至少一个配送客户端之间的匹配度。
B5、如B1上述的装置，该装置还包括：第二分配单元，配置用于为所述选取出的第一类型的订单分配目标配送客户端。
B6、如B3上述的装置，确定单元，包括：第二获取模块，配置用于获取所述至少一个配送客户端的订单组；统计模块，配置用于统计所述订单组中与所述待分配订单的相似度大于或等于预设的第一相似度阈值的订单的数量；计算模块，配置用于计算统计的数量与所述订单组的订单总数量的比值；第三确定模块，配置用于如果所述比值大于或等于预设的比值阈值，则将所述待分配订单与所述订单组中的订单的最高相似度确定为所述待分配订单与所述配送客户端的匹配度。
B7、如B5上述的装置，第二分配单元，包括：第一确定模块，配置用于基于所述选取出的第一类型的订单的订单信息，确定订单之间的相似度，所述订单信息包括取货地址、送货地址和期望送达时间；生成模块，配置用于基于所述相似度生成至少一个订单组，其中，一个订单组中的任意两个订单之间的订单相似度大于或等于预设的第二相似度阈值；第二确定模块，配置用于基于所述至少一个订单组中订单的订单信息和至少一个配送客户端的信息，确定所述至少一个订单组分别与所述至少一个配送客户端的匹配度，所述配送客户端的信息包括以下至少一项：配送客户端的平均送货速度和配送客户端的未完成订单的订单信息；分配模块，配置用于将订单组分配给匹配度大于 或等于预设的匹配度阈值的配送客户端。
B8、如B7上述的装置，分配模块进一步配置用于：基于最大权匹配算法，为订单组分配匹配度大于或等于预设的匹配度阈值的配送客户端。
本申请实施例提供了C1、一种电子设备，该电子设备包括：一个或多个处理器；存储装置，用于存储一个或多个程序，当上述一个或多个程序被上述一个或多个处理器执行时，使得上述一个或多个处理器实现如A1到A8中任一实现方式描述的方法。
本申请实施例提供了D1、一种计算机可读存储介质，其上存储有计算机程序，其特征在于，该计算机程序被处理器执行时实现如A1到A8中任一实现方式描述的方法。
本申请实施例提供的订单处理方法和装置，通过首先获取待分配订单，其中，待分配订单包括采用不同的配送模式进行配送的第一类型的订单和第二类型的订单，之后，从第一类型的订单中选取订单时效性要求与第二类型的订单相近似的订单，最后，将选取出的第一类型的订单的配送模式配置为第二类型的订单所采用的配送模式，从而提供了一种不同配送模式的订单融合机制，节省了配送成本。
附图说明
通过阅读参照以下附图所作的对非限制性实施例所作的详细描述，本申请的其它特征、目的和优点将会变得更明显：
图1是本申请可以应用于其中的示例性系统架构图；
图2是根据本申请的订单处理方法的一个实施例的流程图；
图3是根据本申请的订单处理方法的应用场景的一个示意图；
图4是根据本申请的订单处理方法的又一个实施例的流程图；
图5是根据本申请的订单处理装置的一个实施例的结构示意图；
图6是适于用来实现本申请实施例的服务器的计算机系统的结构示意图。
具体实施方式
下面结合附图和实施例对本申请作进一步的详细说明。可以理解的是，此处所描述的具体实施例仅仅用于解释相关发明，而非对该发明的限定。另外还需要说明的是，为了便于描述，附图中仅示出了与有关发明相关的部分。
需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。下面将参考附图并结合实施例来详细说明本申请。
图1示出了可以应用本申请的订单处理方法或订单处理装置的实施例的示例性系统架构100。
如图1所示，系统架构100可以包括配送客户端1011、1012，网络1021、1022、1023，用户终端1031、1032、1033和服务器104。其中，网络1021用以在配送客户端1011、1012和服务器104之间提供通信链路的介质；网络1022用以在配送客户端1011、1012和用户终端1031、1032、1033之间提供通信链路的介质；网络1023用以在用户终端1031、1032、1033和服务器104之间提供通信链路的介质。网络1021、1022、1023可以包括各种连接类型，例如有线、无线通信链路或者光纤电缆等等。
配送人员可以使用配送客户端1011、1012通过网络1021与服务器104交互，以从服务器104中获取订单信息等；配送人员也可以使用配送客户端1011、1012通过网络1022与用户终端1031、1032、1033交互，以向用户终端1031、1032、1033发送消息等；用户可以使用用户终端1031、1032、1033通过网络1023与服务器104交互，以提交订单并将订单信息存储在服务器104中等。用户终端1031、1032、1033上可以安装有各种通讯客户端应用，例如外卖类应用、购物类应用、金融支付类应用、即时通信软件、物流信息查询类应用等。
配送客户端1011、1012可以是具有显示屏并且支持信息处理、消息发送与接收的各种电子设备，包括但不限于智能手机、平板电脑等等。用户终端1031、1032、1033可以是具有显示屏并且支持信息处理、消息发送与接收的各种电子设备，包括但不限于智能手机、平板电脑、智能手表、膝上型便携计算机和台式计算机等等。
服务器104可以是提供各种服务的服务器，例如向配送客户端1011、1012推送订单信息的后台订单服务器。后台订单服务器可以获取待分配订单，上述待分配订单包括第一类型的订单和第二类型的订单，上述待分配订单可以为用户终端1031、1032、1033提交的订单；之后，可以从上述第一类型的订单中选取订单时效性要求与上述第二类型的订单相近似的订单；最后，可以将选取出的第一类型的订单的配送模式配置为上述第二类型的订单所采用的配送模式，并可以向采用第二类型的订单所采用的配送模式进行订单配送的配送客户端1011、1012推送所选取的第一类型的订单的订单信息。
需要说明的是，本申请实施例所提供的订单处理方法一般由服务器104执行，相应地，订单处理装置一般设置于服务器104中。
应该理解，图1中的配送客户端、网络、用户终端和服务器的数目仅仅是示意性的。根据实现需要，可以具有任意数目的配送客户端、网络、用户终端和服务器。
继续参考图2，示出了根据本申请的订单处理方法的一个实施例的流程200。该订单处理方法，包括以下步骤：
步骤201，获取待分配订单。
在本实施例中，订单处理方法运行于其上的电子设备(例如图1所示的服务器)可以从本地或者远程地获取待分配订单，上述待分配订单可以为接收到用户的下单请求而未进行分配的订单。当订单已保存在电子设备的存储器中时，上述电子设备可以直接从本地的存储器获取上述待分配订单；或者，当上述电子设备是对终端设备上的物流/外卖类应用进行支持的后台服务器时，其可以通过有线连接方式或者无线连接方式从上述终端设备获取上述待分配订单。订单信息可以包括用户下单时间、期望送达时间、订单标识，订单所涉及的物品名称以及物品数量，备注信息，收货人名称以及电话号码等等。
在本实施例中，上述待分配订单可以包括第一类型的订单和第二类型的订单，其中，上述第一类型的订单和上述第二类型的订单为采用不同的配送模式进行配送的订单，配送模式是企业对配送所采用的基本战略和方法，它是指构成配送运动的诸要素的组合形态及其运动 的标准形式。在这里，上述第一类型的订单可以为采用集散配送模式进行配送的订单或采用直送配送模式进行配送的订单；上述第二类型的订单也可以为采用集散配送模式进行配送的订单或采用直送配送模式进行配送的订单。当上述第一类型的订单为采用集散配送模式进行配送的订单时，上述第二类型的订单为采用直送配送模式进行配送的订单；当上述第一类型的订单为采用直送配送模式进行配送的订单时，上述第二类型的订单为采用集散配送模式进行配送的订单。
在本实施例中，采用集散配送模式进行配送的订单一般为快递订单(对时效性要求低的订单)，集散配送模式的配送过程如下：订单首先由配送人员从订单的取货点取货并送往附近的点部A，再通过班车从点部A被送往上述目标区域的集散地，如一天可能有3至5辆从点部A发往集散地的班车，再从上述目标区域的集散地发车将订单送往收货点附近的点部B，如一天可能有3至5辆从集散地发往点部B的班车，当订单到达点部B之后，再由点部B的配送人员将订单所涉及的物品送达到用户处。采用直送配送模式进行配送的订单一般为外卖订单(对时效性要求高的订单)，直送配送模式的配送过程如下：订单由配送人员从订单的取货点取货，并直接配送到订单的送货点，整个配送过程由一个配送人员完成。采用集散配送模式进行配送的订单可以为快递公司委托进行配送的订单，采用直送配送模式进行配送的订单可以来源于外卖应用，上述电子设备可以依据订单所对应的订单类型对采用集散配送模式进行配送的订单和采用直送配送模式进行配送的订单进行区分。
在上述待分配订单进入物流流程后，即可以向配送人员分配各个待分配订单，以供配送人员对分配到的订单所涉及的物品进行配送。
在本实施例中，上述待分配订单可以为目标区域内的待分配订单，上述目标区域可以为某一城市，例如，北京市、上海市等等；也可以为预先划分的某一区域，例如，三环内、五环内等等。在配送过程中，可以包括多个配送阶段，配送阶段可以包括订单等待分配阶段，订单分配阶段，配送人员接单阶段，配送人员取货阶段，配送人员送货阶段，客户签收物件阶段以及客户反馈阶段等等。
步骤202，从第一类型的订单中选取订单时效性要求与第二类型的订单相近似的订单。
在本实施例中，上述电子设备可以从第一类型的订单中选取订单时效性要求与第二类型的订单相近似的订单。时效性是指信息仅在一定时间段内对决策具有价值的属性。订单时效性可以是在一定的配送时间段内将订单对应的物品送达才具有价值的属性，当上述配送时间段大于预设的阈值时，则订单时效性要求低，当上述配送时间段小于预设的阈值时，则订单时效性要求高。订单时效性要求可以是下单用户设置的，也可以是缺省的。上述电子设备可以将订单的配送时间段之间的差值小于预设差值的至少两个订单确定为订单时效性要求相近似；也可以将配送时间段均大于预设阈值的至少两个订单确定为订单时效性要求相近似；还可以将配送时间段均小于预设阈值的至少两个订单确定为订单时效性要求相近似。
作为示例，当第一类型的订单(快递订单)采用集散配送模式进行配送，第二类型的订单(外卖订单)采用直送配送模式进行配送时，若第二类型的订单通常需要在三个小时内送达，则上述电子设备可以在第一类型的订单中选取需要在三个小时内进行配送的订单；或者，在通常情况下，第二类型的订单的订单时效性要求较高，且若配送时间段小于等于四个小时时，设置订单时效性要求高，上述电子设备还可以在第一类型的订单中选取需要在四个小时内进行配送的订单，即选取订单时效性要求高的订单。
作为示例，当第一类型的订单(外卖订单)采用直送配送模式进行配送，第二类型的订单(快递订单)采用集散配送模式进行配送时，若第二类型的订单通常需要在六个小时后送达，则上述电子设备可以在第一类型的订单中选取可以在六个小时后进行配送的订单；或者，在通常情况下，第二类型的订单的订单时效性要求较低，且若配送时间段大于四个小时时，设置订单时效性要求低，上述电子设备还可以在第一类型的订单中选取可以在四个小时后进行配送的订单。
在本实施例的一些可选的实现方式中，待配送订单的订单信息可以包括用户下单时间和期望送达时间。上述电子设备可以根据订单信 息，确定上述第一类型的订单的用户下单时间和期望送达时间之间的时间差。具体地，上述电子设备可以首先获取上述第一类型的订单的订单信息，之后，可以获取订单信息中的用户下单时间和期望送达时间，并确定用户下单时间和期望送达时间之间的时间差。之后，可以选取满足第二类型的订单的配送时间条件的时间差对应的第一类型的订单。若配送时间条件为在预设时长阈值的时间段内送达，则满足上述配送时间条件的时间差可以为小于等于上述时长阈值的时间差，例如，当上述时长阈值为3小时，则选取用户下单时间与期望送达时间之间的时间差小于3小时的第一类型的订单。
步骤203，将选取出的第一类型的订单的配送模式配置为第二类型的订单所采用的配送模式。
在本实施例中，上述电子设备可以将在步骤202中选取出的第一类型的订单的配送模式配置为上述第二类型的订单所采用的配送模式。当上述第一类型的订单采用集散配送模式进行配送，第二类型的订单采用直送配送模式进行配送时，上述电子设备可以采用直送配送模式对选取出的第一类型的订单进行配送；当第一类型的订单采用直送配送模式进行配送，第二类型的订单采用集散配送模式进行配送时，上述电子设备可以采用集散配送模式对选取出的第一类型的订单进行配送。本实施例的技术方案可以将快递订单与外卖订单进行合并后用外卖订单的配送模式进行配送，也可以将快递订单与外卖订单进行合并后用快递订单的配送模式进行配送。
继续参见图3，图3是根据本实施例的订单处理方法的应用场景的一个示意图。在图3的应用场景中，服务器301首先获取待分配订单303，其中，待分配订单303包括快递订单304和外卖订单305，在这里，存在三个快递订单，分别为快递订单A 3041、快递订单B 3042和快递订单C 3043。在通常情况下，外卖订单一般要求在四个小时内送达，快递订单A 3041要求两天内送达306，快递订单B 3042要求八小时内送达307，快递订单C 3043要求两小时内送达308，由于快递订单C 3043的订单时效性要求与外卖订单相近似，服务器301从快递订单304中选取出快递订单C 3043。最后，服务器301将选取出的快 递订单C 3043的配送模式配置为外卖订单所采用的配送模式，并可以向外卖配送客户端302推送快递订单C 3043的订单信息309。
本申请的上述实施例提供的方法通过在第一类型的订单中选取满足第二类型的订单的订单时效性要求的订单，并将选取出的第一类型的订单的配送模式配置为第二类型的订单所采用的配送模式，从而提供了一种不同配送模式的订单融合机制，节省了配送成本。
进一步参考图4，其示出了订单处理方法的又一个实施例的流程400。该订单处理方法的流程400，包括以下步骤：
步骤401，确定待分配订单分别与至少一个配送客户端之间的匹配度。
在本实施例中，订单处理方法运行于其上的电子设备(例如图1所示的服务器)可以首先确定待分配订单分别与至少一个配送客户端之间的匹配度。上述配送客户端可以为配送人员在进行订单配送时所使用的电子设备，上述配送客户端上存储有配送人员未处理、处理中和已处理的订单。上述电子设备可以根据配送客户端的未完成订单的订单信息，确定待分配订单分别与配送客户端之间的匹配度。
在本实施例的一些可选的实现方式中，上述电子设备可以首先获取待分配订单的订单信息以及分配给上述至少一个配送客户端的订单的订单信息，其中，上述待分配订单的订单信息和分配给上述配送客户端的订单的订单信息均可以包括取货地址、送货地址和期望送达时间。之后，上述电子设备基于待分配订单的订单信息以及分配给上述配送客户端的订单的订单信息，可以确定上述待分配订单的取货地址与分配给上述配送客户端的订单的取货地址之间的取货地址距离、上述待分配订单的送货地址与分配给上述配送客户端的订单的送货地址之间的送货地址距离和上述待分配订单的期望送达时间与分配给上述配送客户端的订单的期望送达时间之间的时间间隔。最后，上述电子设备可以基于上述取货地址距离、上述送货地址距离和上述时间间隔，确定上述待分配订单分别与至少一个配送客户端之间的匹配度。上述电子设备可以基于上述取货地址距离，确定上述待分配订单分别与至少一个配送客户端之间的匹配度；也可以基于上述送货地址距离，确 定上述待分配订单分别与至少一个配送客户端之间的匹配度；还可以基于上述时间间隔，确定上述待分配订单分别与至少一个配送客户端之间的匹配度；还可以基于上述取货地址距离、上述取货地址距离对应的权重、上述送货地址距离、上述送货地址距离对应的权重、上述时间间隔和上述时间间隔对应的权重，确定上述待分配订单分别与至少一个配送客户端之间的匹配度。
具体地，上述电子设备中可以预先存储有上述取货地址距离与匹配度的对应表、上述送货地址距离与匹配度的对应表和上述时间间隔与匹配度的对应表，上述电子设备可以在取货地址距离与匹配度的对应表中查询到取货地址距离所对应的匹配度作为第一匹配度；在送货地址距离与匹配度的对应表中查询到送货地址距离所对应的匹配度作为第二匹配度；在时间间隔与匹配度的对应表中查询到时间间隔所对应的匹配度作为第三匹配度；再获取第一匹配度、第二匹配度和第三匹配度所对应的权重；求取第一匹配度与对应的权重之积、第二匹配度与对应的权重之积以及第三匹配度与对应的权重之积；最后，对各个乘积求和得到待分配订单与配送客户端之间的匹配度。上述电子设备也可以将上述第一匹配度作为待分配订单与配送客户端之间的匹配度；也可以将第二匹配度作为待分配订单与配送客户端之间的匹配度；还可以将上述第三匹配度作为待分配订单与配送客户端之间的匹配度。
在本实施例的一些可选的实现方式中，上述电子设备可以首先获取上述至少一个配送客户端的订单组，上述配送客户端上的处理中订单和未处理订单可以被上述电子设备预先分组，生成至少一个订单组。作为示例，上述电子设备可以将对应的取货地址相同的订单分为一组，例如，将同一商户所接收到的订单分为一组；上述电子设备也可以将对应的送货地址为同一小区或同一大厦的订单分为一组，例如，将对应的送货地址均为“盈都大厦”的订单分为一组。之后，上述电子设备可以统计配送客户端的订单组中与上述待分配订单的相似度大于或等于预设的第一相似度阈值的订单的数量，其中，上述第一相似度阈值可以与该待分配订单所属商圈压力值成反比，商圈压力值越大，第 一相似度阈值越低，订单越容易合并，上述商圈压力值为商圈内存在的未完成订单数量与在该商圈内进行配送的配送人员数量之比；然后，可以计算统计出的数量与上述订单组的订单总数量的比值，并确定上述比值是否大于或等于预设的比值阈值，如，0.5，即确定上述订单组中是否存在一半以上的订单与上述待分配订单的相似度大于上述第一相似度阈值；若是，则可以将上述待分配订单与上述订单组中的订单的最高相似度确定为上述待分配订单与上述配送客户端的匹配度。需要说明的是，若配送客户端上存储有至少两个订单组，则上述电子设备可以选取订单组中大于或等于上述第一相似度阈值的订单的数量与订单组的订单总数量的比值最大的订单组作为目标订单组，并可以将目标订单组中的订单与待分配订单的最高相似度确定为上述待分配订单与上述配送客户端的匹配度。
步骤402，基于待分配订单分别与至少一个配送客户端之间的匹配度，分配与待分配订单匹配的目标配送客户端。
在本实施例中，上述电子设备可以基于步骤401中确定出的待分配订单分别与至少一个配送客户端之间的匹配度，分配与上述待分配订单匹配的目标配送客户端。上述电子设备可以将上述待分配订单分配给匹配度最高的配送客户端，也可以确定上述匹配度高于预设的匹配度阈值的配送客户端，并可以向上述确定出的配送客户端中的任一配送客户端分配上述待分配订单。上述电子设备可以向与上述待分配订单所匹配的目标配送客户端推送上述待分配订单的订单信息，上述订单信息可以包括以下至少一项：订单标识，订单所涉及的物品名称以及物品数量，备注信息，收货人名称以及电话号码，取货地址信息，送货地址信息，用户下单时间和期望送达时间。
步骤403，从待分配订单中筛选出没有匹配上目标配送客户端的待分配订单作为新的待分配订单，以更新待分配订单。
在本实施例中，在步骤402中分配与待分配订单匹配的目标配送客户端之后，上述电子设备可以从待分配订单中筛选出没有匹配上目标配送客户端的待分配订单作为新的待分配订单，以更新待分配订单。
步骤404，获取待分配订单。
步骤405，从第一类型的订单中选取订单时效性要求与第二类型的订单相近似的订单。
步骤406，将选取出的第一类型的订单的配送模式配置为第二类型的订单所采用的配送模式。
在本实施例中，步骤404-406的操作与步骤201-203的操作基本相同，在此不再赘述。
步骤407，为选取出的第一类型的订单分配目标配送客户端。
在本实施例中，在步骤406中将选取出的第一类型的订单的配送模式配置为第二类型的订单所采用的配送模式之后，上述电子设备可以为选取出的第一类型的订单分配采用第二类型的订单的配送模式进行配送的目标配送客户端。当第一类型的订单采用集散配送模式进行配送，第二类型的订单采用直送配送模式进行配送时，上述电子设备可以为选取出的第一类型的订单分配以直送配送模式进行配送的目标配送客户端；当第一类型的订单采用直送配送模式进行配送，第二类型的订单采用集散配送模式进行配送时，上述电子设备可以为选取出的第一类型的订单分配以集散配送模式进行配送的目标配送客户端。在分配目标配送客户端之后，上述电子设备可以以短信的形式向配送客户端推送订单信息，也可以以外卖/物流应用的消息提醒的形式向配送客户端推送订单信息。
在本实施例中，上述电子设备可以为选取出的第一类型的订单分配系统中的任一配送客户端；也可以为选取出的第一类型的订单分配配送客户端的待处理订单的数量小于预设的数量阈值的配送客户端；还可以为选取出的第一类型的订单分配配送客户端当前所在位置与订单所指示的取货地址之间的距离最短的配送客户端。
在本实施例的一些可选的实现方式中，上述电子设备可以首先基于上述选取出的第一类型的订单的订单信息，确定订单之间的相似度，其中，上述订单信息可以包括取货地址、送货地址和期望送达时间。具体地，上述电子设备可以基于各个订单对应的取货地址之间的取货地址距离，确定订单之间的相似度；也可以基于各个订单对应的送货地址之间的送货地址距离，确定订单之间的相似度；还可以基于各个 订单对应的期望送达时间之间的时间间隔，确定订单之间的相似度；还可以基于上述取货地址距离、上述送货地址距离和上述时间间隔，确定订单之间的相似度。之后，上述电子设备可以基于上述相似度生成至少一个订单组，使得生成的至少一个订单组中的每个订单组中任意两个订单之间的订单相似度大于或等于预设的第二相似度阈值。作为示例，若上述第二订单相似度阈值为0.6，则生成的每个订单组中的订单A与订单B之间的订单相似度大于0.6、订单A与订单C之间的订单相似度大于0.6、订单B与订单C之间的订单相似度大于0.6。然后，可以基于上述至少一个订单组中订单的订单信息和至少一个配送客户端的信息，确定上述至少一个订单组分别与上述至少一个配送客户端的匹配度，其中，上述配送客户端的信息可以包括以下至少一项：配送客户端的平均送货速度和配送客户端的未完成订单的订单信息。具体地，上述电子设备可以基于订单组中的订单与配送客户端的未完成订单之间的平均取货地址距离，确定上述至少一个订单组分别与配送客户端的未完成订单的订单信息之间的匹配度；可以基于订单组中的订单与配送客户端的未完成订单之间的平均送货地址距离，确定上述至少一个订单组分别与配送客户端的未完成订单的订单信息之间的匹配度；可以基于订单组中的订单与配送客户端的未完成订单之间的平均期望送达时间的时间间隔，确定上述至少一个订单组分别与配送客户端的未完成订单的订单信息之间的匹配度；可以基于订单组中的订单与配送客户端的未完成订单之间的平均取货地址距离、平均送货地址距离和平均期望送达时间的时间间隔，确定上述至少一个订单组分别与配送客户端的未完成订单的订单信息之间的匹配度；上述电子设备也可以将每个订单组中的各个订单的用户下单时间与期望送达时间的差值的平均值确定为平均剩余时间，并基于平均剩余时间和至少一个配送客户端的平均送货速度，确定上述至少一个订单组分别与配送客户端的未完成订单的订单信息之间的匹配度。最后，上述电子设备可以将订单组分配给匹配度大于或等于预设的匹配度阈值的配送客户端，并可以向所匹配的配送客户端推送订单组中的至少一个订单的订单信息，上述电子设备可以将订单组分配给匹配度最高的配送客户 端，也可以为订单组分配匹配度大于或等于上述匹配度阈值的任一配送客户端。
在本实施例的一些可选的实现方式中，针对每个订单组，上述电子设备可以首先删除针对该订单组的匹配度小于上述匹配度阈值的配送客户端，保留匹配度大于或等于上述匹配度阈值的配送客户端，并可以建立该订单组与保留的配送客户端的预分配关系表，上述预分配关系表可以用于存储该订单组可分配给的配送客户端以及与配送客户端的匹配度；之后，上述电子设备可以基于最大权匹配算法(Kuhn-Munkres算法)，为该订单组分配上述预分配关系表中的配送客户端，以使得分配后的至少一个配送客户端与分配到的订单组的匹配度之和为最大值。上述最大权匹配算法也被称为二分图最大权匹配算法，二分图是指：所有顶点可以被分成两个集，例如，X集和Y集，其中，X集中的任意两个点不相连，且Y集中的任意两个点也不相连，而X集中的点与Y集中的点有连线，当这些连线被赋予一定的权重时，这样的二分图为带权二分图。二分图最大权匹配算法是求取各个连线的权重相加为最大值的匹配算法。在这里，将X集中的各个顶点设置为各个订单组，将Y集中的各个顶点设置为各个配送客户端，订单组与配送客户端的连线的权重设置为订单组与配送客户端的匹配度，求取使得各条连线相加之和为最大值的匹配集合，并可以按照上述匹配集合将各个订单组分配给对应的配送客户端。
从图4中可以看出，与图2对应的实施例相比，本实施例中的订单处理方法的流程400突出了在对待分配订单进行配送模式配置之前，先将各个待分配订单与配送客户端进行匹配，以将符合条件的待分配订单分配给对应的配送客户端的步骤。由此，本实施例描述的方案可以先将符合分配条件的待分配订单进行分配，从而，提高了订单的配送效率。
进一步参考图5，作为对上述各图所示方法的实现，本申请提供了一种订单处理装置的一个实施例，该装置实施例与图2所示的方法实施例相对应，该装置具体可以应用于各种电子设备中。
如图5所示，本实施例的订单处理装置500包括：获取单元501、 选取单元502和配置单元503。其中，获取单元501配置用于获取待分配订单，其中，待分配订单包括第一类型的订单和第二类型的订单，第一类型的订单和第二类型的订单为采用不同的配送模式进行配送的订单；选取单元502配置用于从第一类型的订单中选取订单时效性要求与第二类型的订单相近似的订单；配置单元503配置用于将选取出的第一类型的订单的配送模式配置为第二类型的订单所采用的配送模式。
在本实施例中，订单处理装置500的获取单元501、选取单元502和配置单元503的具体处理可以参考图2对应实施例中的步骤201、步骤202和步骤203。
在本实施例的一些可选的实现方式中，上述选取单元502可以包括计算模块(图中未示出)和选取模块(图中未示出)。待配送订单的订单信息可以包括用户下单时间和期望送达时间。上述计算模块可以根据订单信息，确定上述第一类型的订单的用户下单时间和期望送达时间之间的时间差。具体地，上述计算模块可以首先获取上述第一类型的订单的订单信息，之后，可以获取订单信息中的用户下单时间和期望送达时间，并确定用户下单时间和期望送达时间之间的时间差。之后，上述选取模块可以选取满足第二类型的订单的配送时间条件的时间差对应的第一类型的订单。若配送时间条件为在预设时长阈值的时间段内送达，则满足上述配送时间条件的时间差可以为小于等于上述时长阈值的时间差。
在本实施例的一些可选的实现方式中，上述订单处理装置500还可以包括确定单元(图中未示出)、第一分配单元(图中未示出)和更新单元(图中未示出)。上述确定单元可以首先确定待分配订单分别与至少一个配送客户端之间的匹配度。上述配送客户端可以为配送人员在进行订单配送时所使用的电子设备，上述配送客户端上存储有配送人员未处理、处理中和已处理的订单。上述确定单元可以根据配送客户端的未完成订单的订单信息，确定待分配订单分别与配送客户端之间的匹配度。上述第一分配单元可以基于上述确定单元确定出的待分配订单分别与至少一个配送客户端之间的匹配度，分配与上述待分配 订单匹配的目标配送客户端。上述第一分配单元可以将上述待分配订单分配给匹配度最高的配送客户端，也可以确定上述匹配度高于预设的匹配度阈值的配送客户端，并可以向上述确定出的配送客户端中的任一配送客户端分配上述待分配订单。上述第一分配单元可以向与上述待分配订单所匹配的目标配送客户端推送上述待分配订单的订单信息。在上述第一分配单元分配与待分配订单匹配的目标配送客户端之后，上述更新单元可以从待分配订单中筛选出没有匹配上目标配送客户端的待分配订单作为新的待分配订单，以更新待分配订单。
在本实施例的一些可选的实现方式中，上述确定单元可以包括第一获取模块(图中未示出)、第一确定模块(图中未示出)和第二确定模块(图中未示出)。上述第一获取模块可以首先获取待分配订单的订单信息以及分配给上述至少一个配送客户端的订单的订单信息，其中，上述待分配订单的订单信息和分配给上述配送客户端的订单的订单信息均可以包括取货地址、送货地址和期望送达时间。之后，上述第一确定模块基于待分配订单的订单信息以及分配给上述配送客户端的订单的订单信息，可以确定上述待分配订单的取货地址与分配给上述配送客户端的订单的取货地址之间的取货地址距离、上述待分配订单的送货地址与分配给上述配送客户端的订单的送货地址之间的送货地址距离和上述待分配订单的期望送达时间与分配给上述配送客户端的订单的期望送达时间之间的时间间隔。最后，上述第二确定模块可以基于上述取货地址距离、上述送货地址距离和上述时间间隔，确定上述待分配订单分别与至少一个配送客户端之间的匹配度。具体地，上述第二确定模块可以基于上述取货地址距离，确定上述待分配订单分别与至少一个配送客户端之间的匹配度；也可以基于上述送货地址距离，确定上述待分配订单分别与至少一个配送客户端之间的匹配度；还可以基于上述时间间隔，确定上述待分配订单分别与至少一个配送客户端之间的匹配度；还可以基于上述取货地址距离、上述取货地址距离对应的权重、上述送货地址距离、上述送货地址距离对应的权重、上述时间间隔和上述时间间隔对应的权重，确定上述待分配订单分别与至少一个配送客户端之间的匹配度。
在本实施例的一些可选的实现方式中，上述订单处理装置500还可以包括第二分配单元(图中未示出)。上述第二分配单元可以为选取出的第一类型的订单分配采用第二类型的订单的配送模式进行配送的目标配送客户端。当第一类型的订单采用集散配送模式进行配送，第二类型的订单采用直送配送模式进行配送时，上述第二分配单元可以为选取出的第一类型的订单分配以直送配送模式进行配送的目标配送客户端；当第一类型的订单采用直送配送模式进行配送，第二类型的订单采用集散配送模式进行配送时，上述第二分配单元可以为选取出的第一类型的订单分配以集散配送模式进行配送的目标配送客户端。
在本实施例的一些可选的实现方式中，上述确定单元可以包括第二获取模块(图中未示出)、统计模块(图中未示出)、计算模块(图中未示出)和第三确定模块(图中未示出)。上述第二获取模块可以首先获取上述至少一个配送客户端的订单组，上述配送客户端上的处理中订单和未处理订单可以被预先分组，生成至少一个订单组。之后，上述统计模块可以统计配送客户端的订单组中与上述待分配订单的相似度大于或等于预设的第一相似度阈值的订单的数量，其中，上述第一相似度阈值可以与该待分配订单所属商圈压力值成反比，商圈压力值越大，第一相似度阈值越低，订单越容易合并，上述商圈压力值为商圈内存在的未完成订单数量与在该商圈内进行配送的配送人员数量之比；然后，上述计算模块可以计算统计出的数量与上述订单组的订单总数量的比值，并确定上述比值是否大于或等于预设的比值阈值，如，0.5，即确定上述订单组中是否存在一半以上的订单与上述待分配订单的相似度大于上述第一相似度阈值；若是，则上述第三确定模块可以将上述待分配订单与上述订单组中的订单的最高相似度确定为上述待分配订单与上述配送客户端的匹配度。
在本实施例的一些可选的实现方式中，上述第二分配单元可以包括第一确定模块(图中未示出)、生成模块(图中未示出)、第二确定模块(图中未示出)和分配模块(图中未示出)。上述第一确定模块可以首先基于上述选取出的第一类型的订单的订单信息，确定订单之间的相似度，其中，上述订单信息可以包括取货地址、送货地址和期望 送达时间。具体地，上述第一确定模块可以基于各个订单对应的取货地址之间的取货地址距离，确定订单之间的相似度；也可以基于各个订单对应的送货地址之间的送货地址距离，确定订单之间的相似度；还可以基于各个订单对应的期望送达时间之间的时间间隔，确定订单之间的相似度；还可以基于上述取货地址距离、上述送货地址距离和上述时间间隔，确定订单之间的相似度。之后，上述生成模块可以基于上述相似度生成至少一个订单组，使得生成的至少一个订单组中的每个订单组中任意两个订单之间的订单相似度大于或等于预设的第二相似度阈值。然后，上述第二确定模块可以基于上述至少一个订单组中订单的订单信息和至少一个配送客户端的信息，确定上述至少一个订单组分别与上述至少一个配送客户端的匹配度，其中，上述配送客户端的信息可以包括以下至少一项：配送客户端的平均送货速度和配送客户端的未完成订单的订单信息。具体地，上述第二确定模块可以基于订单组中的订单与配送客户端的未完成订单之间的平均取货地址距离，确定上述至少一个订单组分别与配送客户端的未完成订单的订单信息之间的匹配度；可以基于订单组中的订单与配送客户端的未完成订单之间的平均送货地址距离，确定上述至少一个订单组分别与配送客户端的未完成订单的订单信息之间的匹配度；可以基于订单组中的订单与配送客户端的未完成订单之间的平均期望送达时间的时间间隔，确定上述至少一个订单组分别与配送客户端的未完成订单的订单信息之间的匹配度；可以基于订单组中的订单与配送客户端的未完成订单之间的平均取货地址距离、平均送货地址距离和平均期望送达时间的时间间隔，确定上述至少一个订单组分别与配送客户端的未完成订单的订单信息之间的匹配度；上述第二确定模块也可以将每个订单组中的各个订单的用户下单时间与期望送达时间的差值的平均值确定为平均剩余时间，并基于平均剩余时间和至少一个配送客户端的平均送货速度，确定上述至少一个订单组分别与配送客户端的未完成订单的订单信息之间的匹配度。最后，上述分配模块可以将订单组分配给匹配度大于或等于预设的匹配度阈值的配送客户端，并可以向所匹配的配送客户端推送订单组中的至少一个订单的订单信息，上述分配模 块可以将订单组分配给匹配度最高的配送客户端，也可以为订单组分配匹配度大于或等于上述匹配度阈值的任一配送客户端。
在本实施例的一些可选的实现方式中，针对每个订单组，上述分配模块可以首先删除针对该订单组的匹配度小于上述匹配度阈值的配送客户端，保留匹配度大于或等于上述匹配度阈值的配送客户端，并可以建立该订单组与保留的配送客户端的预分配关系表，上述预分配关系表可以用于存储该订单组可分配给的配送客户端以及与配送客户端的匹配度；之后，上述分配模块可以基于最大权匹配算法(Kuhn-Munkres算法)，为该订单组分配上述预分配关系表中的配送客户端，以使得分配后的至少一个配送客户端与分配到的订单组的匹配度之和为最大值。上述最大权匹配算法也被称为二分图最大权匹配算法，二分图是指：所有顶点可以被分成两个集，例如，X集和Y集，其中，X集中的任意两个点不相连，且Y集中的任意两个点也不相连，而X集中的点与Y集中的点有连线，当这些连线被赋予一定的权重时，这样的二分图为带权二分图。二分图最大权匹配算法是求取各个连线的权重相加为最大值的匹配算法。在这里，将X集中的各个顶点设置为各个订单组，将Y集中的各个顶点设置为各个配送客户端，订单组与配送客户端的连线的权重设置为订单组与配送客户端的匹配度，求取使得各条连线相加之和为最大值的匹配集合，并可以按照上述匹配集合将各个订单组分配给对应的配送客户端。
下面参考图6，其示出了适于用来实现本发明实施例的服务器的计算机系统600的结构示意图。图6示出的服务器仅仅是一个示例，不应对本申请实施例的功能和使用范围带来任何限制。
如图6所示，计算机系统600包括中央处理单元(CPU)601，其可以根据存储在只读存储器(ROM)602中的程序或者从存储部分608加载到随机访问存储器(RAM)603中的程序而执行各种适当的动作和处理。在RAM 603中，还存储有系统600操作所需的各种程序和数据。CPU 601、ROM 602以及RAM 603通过总线604彼此相连。输入/输出(I/O)接口605也连接至总线604。
以下部件连接至I/O接口605：包括键盘、鼠标等的输入部分606； 包括诸如液晶显示器(LCD)以及扬声器等的输出部分607；包括硬盘等的存储部分608；以及包括诸如LAN卡、调制解调器等的网络接口卡的通信部分609。通信部分609经由诸如因特网的网络执行通信处理。驱动器610也根据需要连接至I/O接口605。可拆卸介质611，诸如磁盘、光盘、磁光盘、半导体存储器等等，根据需要安装在驱动器610上，以便于从其上读出的计算机程序根据需要被安装入存储部分608。
特别地，根据本公开的实施例，上文参考流程图描述的过程可以被实现为计算机软件程序。例如，本公开的实施例包括一种计算机程序产品，其包括承载在计算机可读介质上的计算机程序，该计算机程序包含用于执行流程图所示的方法的程序代码。在这样的实施例中，该计算机程序可以通过通信部分609从网络上被下载和安装，和/或从可拆卸介质611被安装。在该计算机程序被中央处理单元(CPU)601执行时，执行本申请的方法中限定的上述功能。需要说明的是，本申请上述的计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质或者是上述两者的任意组合。计算机可读存储介质例如可以是——但不限于——电、磁、光、电磁、红外线、或半导体的系统、装置或器件，或者任意以上的组合。计算机可读存储介质的更具体的例子可以包括但不限于：具有一个或多个导线的电连接、便携式计算机磁盘、硬盘、随机访问存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、光纤、便携式紧凑磁盘只读存储器(CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。在本申请中，计算机可读存储介质可以是任何包含或存储程序的有形介质，该程序可以被指令执行系统、装置或者器件使用或者与其结合使用。而在本申请中，计算机可读的信号介质可以包括在基带中或者作为载波一部分传播的数据信号，其中承载了计算机可读的程序代码。这种传播的数据信号可以采用多种形式，包括但不限于电磁信号、光信号或上述的任意合适的组合。计算机可读的信号介质还可以是计算机可读存储介质以外的任何计算机可读介质，该计算机可读介质可以发送、传播或者传输用于由指令执行系统、装置或者器件 使用或者与其结合使用的程序。计算机可读介质上包含的程序代码可以用任何适当的介质传输，包括但不限于：无线、电线、光缆、RF等等，或者上述的任意合适的组合。
附图中的流程图和框图，图示了按照本发明各种实施例的系统、方法和计算机程序产品的可能实现的体系架构、功能和操作。在这点上，流程图或框图中的每个方框可以代表一个模块、程序段、或代码的一部分，该模块、程序段、或代码的一部分包含一个或多个用于实现规定的逻辑功能的可执行指令。也应当注意，在有些作为替换的实现中，方框中所标注的功能也可以以不同于附图中所标注的顺序发生。例如，两个接连地表示的方框实际上可以基本并行地执行，它们有时也可以按相反的顺序执行，这依所涉及的功能而定。也要注意的是，框图和/或流程图中的每个方框、以及框图和/或流程图中的方框的组合，可以用执行规定的功能或操作的专用的基于硬件的系统来实现，或者可以用专用硬件与计算机指令的组合来实现。
描述于本发明实施例中所涉及到的单元可以通过软件的方式实现，也可以通过硬件的方式来实现。所描述的单元也可以设置在处理器中，例如，可以描述为：一种处理器包括获取单元、选取单元和配置单元。其中，这些单元的名称在某种情况下并不构成对该单元本身的限定。例如，获取单元还可以被描述为“获取待分配订单的单元”。
作为另一方面，本申请还提供了一种计算机可读介质，该计算机可读介质可以是上述实施例中描述的装置中所包含的；也可以是单独存在，而未装配入该装置中。上述计算机可读介质承载有一个或者多个程序，当上述一个或者多个程序被该装置执行时，使得该装置：获取待分配订单，其中，待分配订单包括第一类型的订单和第二类型的订单，第一类型的订单和第二类型的订单为采用不同的配送模式进行配送的订单；从第一类型的订单中选取订单时效性要求与第二类型的订单相近似的订单；将选取出的第一类型的订单的配送模式配置为第二类型的订单所采用的配送模式。
以上描述仅为本发明的较佳实施例以及对所运用技术原理的说明。本领域技术人员应当理解，本发明中所涉及的发明范围，并不限 于上述技术特征的特定组合而成的技术方案，同时也应涵盖在不脱离上述发明构思的情况下，由上述技术特征或其等同特征进行任意组合而形成的其它技术方案。例如上述特征与本发明中公开的(但不限于)具有类似功能的技术特征进行互相替换而形成的技术方案。

Claims (18)

  1. 一种订单处理方法，其特征在于，所述方法包括：
    获取待分配订单，其中，所述待分配订单包括第一类型的订单和第二类型的订单，所述第一类型的订单和所述第二类型的订单为采用不同的配送模式进行配送的订单；
    从所述第一类型的订单中选取订单时效性要求与所述第二类型的订单相近似的订单；
    将选取出的第一类型的订单的配送模式配置为所述第二类型的订单所采用的配送模式。
  2. 根据权利要求1所述的方法，其特征在于，所述从所述第一类型的订单中选取订单时效性要求与所述第二类型的订单相近似的订单，包括：
    根据订单信息，计算所述第一类型的订单的用户下单时间与期望送达时间之间的时间差；
    选取满足第二类型的订单的配送时间条件的时间差对应的第一类型的订单。
  3. 根据权利要求1所述的方法，其特征在于，在所述获取待分配订单之前，所述方法还包括：
    确定待分配订单分别与至少一个配送客户端之间的匹配度；
    基于所述待分配订单分别与至少一个配送客户端之间的匹配度，分配与所述待分配订单匹配的目标配送客户端；
    从所述待分配订单中筛选出没有匹配上目标配送客户端的待分配订单作为新的待分配订单，以更新待分配订单。
  4. 根据权利要求3所述的方法，其特征在于，所述确定待分配订单分别与至少一个配送客户端之间的匹配度，包括：
    获取待分配订单的订单信息以及分配给所述至少一个配送客户端 的订单的订单信息，其中，所述待分配订单的订单信息以及分配给所述配送客户端的订单的订单信息均包括取货地址、送货地址和期望送达时间；
    基于所述待分配订单的订单信息以及分配给所述配送客户端的订单的订单信息，确定所述待分配订单的取货地址与分配给所述配送客户端的订单的取货地址之间的取货地址距离、所述待分配订单的送货地址与分配给所述配送客户端的订单的送货地址之间的送货地址距离和所述待分配订单的期望送达时间与分配给所述配送客户端的订单的期望送达时间之间的时间间隔；
    基于所述取货地址距离、所述送货地址距离和所述时间间隔，确定所述待分配订单分别与至少一个配送客户端之间的匹配度。
  5. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    为所述选取出的第一类型的订单分配目标配送客户端。
  6. 根据权利要求3所述的方法，其特征在于，所述确定待分配订单分别与至少一个配送客户端之间的匹配度，包括：
    获取所述至少一个配送客户端的订单组；
    统计所述订单组中与所述待分配订单的相似度大于或等于预设的第一相似度阈值的订单的数量；
    计算统计的数量与所述订单组的订单总数量的比值；
    如果所述比值大于或等于预设的比值阈值，则将所述待分配订单与所述订单组中的订单的最高相似度确定为所述待分配订单与所述配送客户端的匹配度。
  7. 根据权利要求5所述的方法，其特征在于，所述为所述选取出的第一类型的订单分配目标配送客户端，包括：
    基于所述选取出的第一类型的订单的订单信息，确定订单之间的相似度，所述订单信息包括取货地址、送货地址和期望送达时间；
    基于所述相似度生成至少一个订单组，其中，一个订单组中的任 意两个订单之间的订单相似度大于或等于预设的第二相似度阈值；
    基于所述至少一个订单组中订单的订单信息和至少一个配送客户端的信息，确定所述至少一个订单组分别与所述至少一个配送客户端的匹配度，所述配送客户端的信息包括以下至少一项：配送客户端的平均送货速度和配送客户端的未完成订单的订单信息；
    将订单组分配给匹配度大于或等于预设的匹配度阈值的配送客户端。
  8. 根据权利要求7所述的方法，其特征在于，所述将订单组分配给匹配度大于或等于预设的匹配度阈值的配送客户端，包括：
    基于最大权匹配算法，为订单组分配匹配度大于或等于预设的匹配度阈值的配送客户端。
  9. 一种订单处理装置，其特征在于，所述装置包括：
    获取单元，配置用于获取待分配订单，其中，所述待分配订单包括第一类型的订单和第二类型的订单，所述第一类型的订单和所述第二类型的订单为采用不同的配送模式进行配送的订单；
    选取单元，配置用于从所述第一类型的订单中选取订单时效性要求与所述第二类型的订单相近似的订单；
    配置单元，配置用于将选取出的第一类型的订单的配送模式配置为所述第二类型的订单所采用的配送模式。
  10. 根据权利要求9所述的装置，其特征在于，所述选取单元，包括：
    计算模块，配置用于根据订单信息，计算所述第一类型的订单的用户下单时间与期望送达时间之间的时间差；
    选取模块，配置用于选取满足第二类型的订单的配送时间条件的时间差对应的第一类型的订单。
  11. 根据权利要求9所述的装置，其特征在于，所述装置还包括：
    确定单元，配置用于确定待分配订单分别与至少一个配送客户端之间的匹配度；
    第一分配单元，配置用于基于所述待分配订单分别与至少一个配送客户端之间的匹配度，分配与所述待分配订单匹配的目标配送客户端；
    更新单元，配置用于从所述待分配订单中筛选出没有匹配上目标配送客户端的待分配订单作为新的待分配订单，以更新待分配订单。
  12. 根据权利要求11所述的装置，其特征在于，所述确定单元，包括：
    第一获取模块，配置用于获取待分配订单的订单信息以及分配给所述至少一个配送客户端的订单的订单信息，其中，所述待分配订单的订单信息以及分配给所述配送客户端的订单的订单信息均包括取货地址、送货地址和期望送达时间；
    第一确定模块，配置用于基于所述待分配订单的订单信息以及分配给所述配送客户端的订单的订单信息，确定所述待分配订单的取货地址与分配给所述配送客户端的订单的取货地址之间的取货地址距离、所述待分配订单的送货地址与分配给所述配送客户端的订单的送货地址之间的送货地址距离和所述待分配订单的期望送达时间与分配给所述配送客户端的订单的期望送达时间之间的时间间隔；
    第二确定模块，配置用于基于所述取货地址距离、所述送货地址距离和所述时间间隔，确定所述待分配订单分别与至少一个配送客户端之间的匹配度。
  13. 根据权利要求9所述的装置，其特征在于，所述装置还包括：
    第二分配单元，配置用于为所述选取出的第一类型的订单分配目标配送客户端。
  14. 根据权利要求11所述的装置，其特征在于，所述确定单元，包括：
    第二获取模块，配置用于获取所述至少一个配送客户端的订单组；
    统计模块，配置用于统计所述订单组中与所述待分配订单的相似度大于或等于预设的第一相似度阈值的订单的数量；
    计算模块，配置用于计算统计的数量与所述订单组的订单总数量的比值；
    第三确定模块，配置用于如果所述比值大于或等于预设的比值阈值，则将所述待分配订单与所述订单组中的订单的最高相似度确定为所述待分配订单与所述配送客户端的匹配度。
  15. 根据权利要求13所述的装置，其特征在于，所述第二分配单元，包括：
    第一确定模块，配置用于基于所述选取出的第一类型的订单的订单信息，确定订单之间的相似度，所述订单信息包括取货地址、送货地址和期望送达时间；
    生成模块，配置用于基于所述相似度生成至少一个订单组，其中，一个订单组中的任意两个订单之间的订单相似度大于或等于预设的第二相似度阈值；
    第二确定模块，配置用于基于所述至少一个订单组中订单的订单信息和至少一个配送客户端的信息，确定所述至少一个订单组分别与所述至少一个配送客户端的匹配度，所述配送客户端的信息包括以下至少一项：配送客户端的平均送货速度和配送客户端的未完成订单的订单信息；
    分配模块，配置用于将订单组分配给匹配度大于或等于预设的匹配度阈值的配送客户端。
  16. 根据权利要求15所述的装置，其特征在于，所述分配模块进一步配置用于：
    基于最大权匹配算法，为订单组分配匹配度大于或等于预设的匹配度阈值的配送客户端。
  17. 一种电子设备，包括：
    一个或多个处理器；
    存储装置，用于存储一个或多个程序，
    当所述一个或多个程序被所述一个或多个处理器执行时，使得所述一个或多个处理器实现如权利要求1-8中任一所述的方法。
  18. 一种计算机可读存储介质，其上存储有计算机程序，其特征在于，该程序被处理器执行时实现如权利要求1-8中任一所述的方法。
PCT/CN2017/118697 2017-09-07 2017-12-26 订单处理方法和装置 WO2019047432A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710800613.7A CN107845012B (zh) 2017-09-07 2017-09-07 订单处理方法和装置
CN201710800613.7 2017-09-07

Publications (1)

Publication Number Publication Date
WO2019047432A1 true WO2019047432A1 (zh) 2019-03-14

Family

ID=61683273

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/118697 WO2019047432A1 (zh) 2017-09-07 2017-12-26 订单处理方法和装置

Country Status (2)

Country Link
CN (1) CN107845012B (zh)
WO (1) WO2019047432A1 (zh)

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11721809B2 (en) * 2021-09-01 2023-08-08 Enevate Corporation Silicate and organosilicon containing additives for silicon-based Li ion batteries
CN110390498A (zh) * 2018-04-17 2019-10-29 北京京东尚科信息技术有限公司 订单分配方法和装置
CN108665179A (zh) * 2018-05-17 2018-10-16 北京顺丰同城科技有限公司 物流调度方法、装置、电子设备以及计算机可读存储介质
CN108681857B (zh) * 2018-05-18 2020-03-10 北京顺丰同城科技有限公司 一种配送订单分配方法及装置、计算机可读存储介质
CN110648093A (zh) * 2018-06-07 2020-01-03 李公健 一种接单配送载体做多种业务运营的系统和方法
CN109214712A (zh) * 2018-10-15 2019-01-15 北京顺丰同城科技有限公司 一种订单调度方法及装置
CN109636217A (zh) * 2018-12-19 2019-04-16 拉扎斯网络科技（上海）有限公司 一种订单调度方法、装置、电子设备和存储介质
CN109872225A (zh) * 2019-02-21 2019-06-11 北京无二之旅科技有限公司 分单方法及装置
CN109934537A (zh) * 2019-03-12 2019-06-25 北京同城必应科技有限公司 订单分配方法、装置、服务器和存储介质
CN111738637A (zh) * 2019-03-25 2020-10-02 北京京东尚科信息技术有限公司 订单处理方法、装置、电子设备及介质
CN111754151A (zh) * 2019-03-29 2020-10-09 北京三快在线科技有限公司 一种路径规划方法及装置
CN110580576A (zh) * 2019-08-27 2019-12-17 南京领行科技股份有限公司 一种订单派发方法及装置
CN113822515A (zh) * 2021-01-12 2021-12-21 西安京迅递供应链科技有限公司 包裹配送方法和装置
CN114723376B (zh) * 2022-06-08 2022-09-13 浙江口碑网络技术有限公司 引导配送客户端处理运单的方法及装置、运单处理方法

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110208560A1 (en) * 2003-05-12 2011-08-25 Adeel Najmi Determining Order Lead Time for a Supply Chain Using a Probability Distribution of Order Lead Time
CN105719009A (zh) * 2015-07-24 2016-06-29 北京小度信息科技有限公司 配送任务的处理方法及装置
CN106447470A (zh) * 2016-11-30 2017-02-22 北京小度信息科技有限公司 配送订单分配方法和装置

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105096129A (zh) * 2014-05-15 2015-11-25 华为技术有限公司 一种数据处理系统及方法
CN105160503A (zh) * 2015-07-16 2015-12-16 绍兴越淘网络技术有限公司 一种网站运营商直接实现同城当天配送的方法
CN105260873B (zh) * 2015-11-03 2021-02-26 多点生活(中国)网络科技有限公司 一种基于o2o模式的配送调度方法及调度系统
CN106327085A (zh) * 2016-08-26 2017-01-11 多点生活(中国)网络科技有限公司 一种订单智能调度方法
CN107093038A (zh) * 2016-11-18 2017-08-25 北京小度信息科技有限公司 配送方式选择方法和装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110208560A1 (en) * 2003-05-12 2011-08-25 Adeel Najmi Determining Order Lead Time for a Supply Chain Using a Probability Distribution of Order Lead Time
CN105719009A (zh) * 2015-07-24 2016-06-29 北京小度信息科技有限公司 配送任务的处理方法及装置
CN106447470A (zh) * 2016-11-30 2017-02-22 北京小度信息科技有限公司 配送订单分配方法和装置

Also Published As

Publication number Publication date
CN107845012B (zh) 2021-08-10
CN107845012A (zh) 2018-03-27

Similar Documents

Publication Publication Date Title
WO2019047432A1 (zh) 订单处理方法和装置
WO2019047431A1 (zh) 信息推送方法和装置
WO2019056640A1 (zh) 订单处理方法及装置
CN109961306B (zh) 一种物品的库存分配方法和装置
CN107451785B (zh) 用于输出信息的方法和装置
CN110648089A (zh) 一种确定物品送达时效的方法和装置
WO2022063300A1 (zh) 调拨信息生成方法、物品调拨方法、装置、设备和介质
CN113537861A (zh) 补货方法和补货装置
US20240020633A1 (en) Warehousing data processing method and apparatus, medium, and electronic device
WO2019015254A1 (zh) 信息处理方法和装置
WO2019033676A1 (zh) 订单处理方法和装置
CN113706064A (zh) 一种订单处理方法和装置
WO2023202107A1 (zh) 包裹信息更新方法和装置
CN116151718A (zh) 一种海外仓管理系统、方法、设备及存储介质
CN113095911B (zh) 订单处理方法、装置、电子设备和计算机可读介质
CN111626802A (zh) 用于处理信息的方法和装置
CN111260271A (zh) 用于缩短门店订单拣货时长的方法和装置
CN110895777A (zh) 一种处理超时服务单的方法和装置
CN115619350A (zh) 基于联合政务服务的证件领取方法、装置、设备及介质
WO2021238516A1 (zh) 资源调拨数据的生成方法和装置
CN114202210A (zh) 一种任务分配方法和装置
CN115019943A (zh) 一种医药数据管理方法及系统
CN113762674B (zh) 订单配送方法和装置
CN113762876A (zh) 信息生成方法、装置、电子设备和计算机可读介质
CN113538080A (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: 17924110

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 11/09/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 17924110

Country of ref document: EP

Kind code of ref document: A1