CN109508799B

CN109508799B - Order allocation method and device and electronic equipment

Info

Publication number: CN109508799B
Application number: CN201811124315.1A
Authority: CN
Inventors: 焦俊铭; 高正新
Original assignee: Changsha Daojia Youxiang Home Economics Service Co ltd
Current assignee: Changsha Daojia Youxiang Home Economics Service Co ltd
Priority date: 2018-09-26
Filing date: 2018-09-26
Publication date: 2020-10-09
Anticipated expiration: 2038-09-26
Also published as: CN109508799A

Abstract

The embodiment of the invention provides an order distribution method, an order distribution device and electronic equipment, wherein the method comprises the following steps: the order distribution device receives the order triggered by the user, and at the moment, the order distribution device does not immediately distribute the order, but stores the order triggered by the user into the cache pool. After a period of time, a plurality of orders are stored in the cache pool, and the user-triggered orders are also included in the plurality of orders. And if the plurality of orders stored in the cache pool meet the preset conditions, the order distribution device starts to distribute the plurality of orders in a unified manner. Therefore, the order allocation method comprises the steps of accumulating orders and allocating the accumulated orders at one time, so that the allocation effect of the orders can be guaranteed to be globally optimal, and the overall time utilization rate of a service merchant in the cleaning service providing platform is the highest. The highest overall time utilization may be reflected in a small time interval between orders to which each service merchant is assigned.

Description

Order allocation method and device and electronic equipment

Technical Field

The invention relates to the technical field of internet, in particular to an order distribution method and device and electronic equipment.

Background

In recent years, with the increasing pace of life, the attitudes of people towards doing housework are gradually changing. Compared with the time and labor waste of the hands of the user, more and more people can reserve the cleaning service on double-holidays or vacant time, and the cleaner is helped to clean.

Users can typically use a housekeeping application to reserve a cleaning service. In the prior art, each time a user finishes an order placing operation, an order distribution system associates a service merchant, namely a cleaner, with the order in real time according to a service address and service time input by the user, and the service merchant provides cleaning service for the user. However, by using the real-time order distribution to the service merchants, for any service merchant, the service address distance of the adjacent order is far or the service time interval is long, and the like, which are probably occurred in the distributed order, so that the overall time utilization rate of the service merchant in the cleaning service platform is greatly reduced.

Disclosure of Invention

In view of this, embodiments of the present invention provide an order allocation method, an order allocation device, and an electronic device, so as to improve the overall time utilization rate of a service merchant.

In a first aspect, an embodiment of the present invention provides an order allocation method, including:

receiving an order triggered by a user;

storing the order triggered by the user into a cache pool;

and if the orders stored in the cache pool meet preset conditions, performing allocation processing on the orders, wherein the orders comprise orders triggered by the user.

In a second aspect, an embodiment of the present invention provides an order distribution apparatus, including:

the order receiving module is used for receiving an order triggered by a user;

the order storage module is used for storing the order triggered by the user into a cache pool;

and the allocation module is used for allocating the orders if the orders stored in the cache pool meet preset conditions, wherein the orders comprise orders triggered by the user.

In a third aspect, an embodiment of the present invention provides an electronic device, including: a memory, and a processor coupled to the memory;

the memory to store one or more computer instructions, wherein the one or more computer instructions are for the processor to invoke for execution;

the processor is configured to execute the one or more computer instructions to perform any of the above-described order distribution methods.

According to the order distribution method, the order distribution device and the electronic equipment, the order distribution device receives the order triggered by the user, and at the moment, the order distribution device does not immediately distribute the order, but stores the order triggered by the user into the cache pool. After a period of time, a plurality of orders are stored in the cache pool, and the user-triggered orders are also included in the plurality of orders. And if the plurality of orders stored in the cache pool meet the preset conditions, the order distribution device starts to distribute the plurality of orders in a unified manner. According to the description, the order allocation method is different from a mode of immediately allocating an order when an order appears in the prior art, the order is accumulated firstly, and then a plurality of accumulated orders are allocated at one time, so that the allocation effect of the plurality of orders can be ensured to be globally optimal, namely the overall time utilization rate of a service merchant in the cleaning service providing platform is the highest. This overall time utilization may be reflected in a smaller time interval between orders to which each service merchant is assigned. At the same time, it is easy to understand that the time interval between the allocated orders becomes smaller, and each service merchant can have a continuous spare working time or spare working time without being allocated orders under the condition of the same working time. Therefore, orders triggered by the user subsequently can be continuously distributed to the service merchants with spare working time, the condition that the service merchants cannot service due to unreasonable order distribution is avoided, the user can trigger order operation at any time, and the orders triggered by the user are guaranteed to be executed by the service merchants.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.

Fig. 1 is a flowchart of a first embodiment of an order allocation method according to the present invention;

FIG. 2 is a flowchart of a second embodiment of an order allocation method according to the present invention;

fig. 3 is a flowchart of a third embodiment of an order allocation method according to the present invention;

fig. 4 is a flowchart of a fourth embodiment of an order allocation method according to the present invention;

fig. 5 is a flowchart of a fifth embodiment of an order allocation method according to the present invention;

fig. 6 is a flowchart of a sixth embodiment of an order allocation method according to the present invention;

FIG. 7 is a schematic structural diagram of a first order allocation apparatus according to an embodiment of the present invention;

fig. 8 is a schematic structural diagram of a second order allocation apparatus according to an embodiment of the present invention;

fig. 9 is a schematic structural diagram of a third embodiment of an order distribution apparatus according to the present invention;

fig. 10 is a schematic structural diagram of an electronic device according to a first embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

The terminology used in the embodiments of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the examples of the present invention and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, and "a" and "an" generally include at least two, but do not exclude at least one, unless the context clearly dictates otherwise.

It should be understood that the term "and/or" as used herein is merely one type of association that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.

The words "if", as used herein, may be interpreted as "at … …" or "at … …" or "in response to a determination" or "in response to a detection", depending on the context. Similarly, the phrases "if determined" or "if detected (a stated condition or event)" may be interpreted as "when determined" or "in response to a determination" or "when detected (a stated condition or event)" or "in response to a detection (a stated condition or event)", depending on the context.

It is also noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a good or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such good or system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a commodity or system that includes the element.

In the following description of the background art, the following embodiments of the present invention may be applied to a cleaning application scenario, and the orders involved in the following embodiments may be cleaning orders, and the cleaning orders are reservation orders, that is, the order placing time of the user is earlier than the service time of the order.

Based on this, fig. 1 is a flowchart of a first embodiment of the order distribution method according to the present invention, an execution main body of the order distribution method according to this embodiment may be an order distribution device, and the order distribution device may be implemented as software, or implemented as a combination of software and hardware, and the order distribution device may be integrated in a device on a clean order processing platform side, such as a server. As shown in fig. 1, the method comprises the steps of:

s101, receiving an order triggered by a user.

And S102, storing the order triggered by the user into a cache pool.

S103, if the orders stored in the cache pool meet preset conditions, distributing the orders, wherein the orders comprise orders triggered by a user.

The user can use the terminal equipment provided with the user version cleaning application program to complete the order placing action, so that the generated order is sent to the order distribution device, namely the order distribution device can receive the order triggered by the user. The order attributes of the order may include order time, service address, service content, and the like. Alternatively, the order distribution device may directly store all received orders in the buffer pool, and the orders in the buffer pool of course also include the user-triggered orders.

For the orders stored in the buffer pool, the order distribution device does not directly distribute the orders. Each user can trigger orders through the terminal equipment provided with the user version cleaning application program, so that the orders in the cache pool can be continuously accumulated after a period of time. When a plurality of orders stored in the cache pool meet preset conditions, the order distribution device distributes the plurality of orders in the cache pool.

In practical applications, the condition for triggering the allocation process for the plurality of orders may be one or more of the following: (1) and the number of the orders in the cache pool reaches the preset number. (2) The service addresses corresponding to the plurality of orders in the cache pool belong to the same preset position area, which indicates that the number of orders in a certain preset position area is large, and in order to ensure that a user can normally enjoy the service, the order distribution device can start to distribute the plurality of orders. (3) And the time difference between the earliest service time corresponding to the plurality of orders in the cache pool and the current time is greater than or equal to a preset difference value. The current time is also the time for the order distribution device to determine whether the plurality of orders meet the preset condition, and optionally, the order distribution device may perform the determination operation at intervals of the preset time.

When a plurality of orders stored in the cache pool meet a preset condition, the order distribution device distributes the plurality of orders. One alternative way of distribution:

first, the order distribution device obtains a number of service merchants that are ready to be distributed with orders. Alternatively, the plurality of service merchants are typically all service merchants registered with the cleaning service providing platform. Of course, according to actual needs, the service merchants can be part of all the service merchants with higher service quality.

Then, the taken orders of the available multiple service merchants are obtained. The accepted orders are obtained, that is, the order attributes corresponding to each order and including the service time, the service address and the like are obtained. It should be noted that, in the ordering process, the user may select information such as service time and service address, and may also specify a service merchant. For such a user-designated service merchant order, the order dispensing device would mark it and not dispense it. For example, if the user designates service merchant a to fulfill order 1, then order 1 may be understood as the corresponding accepted order for service merchant a.

Furthermore, the order distribution device may determine a matching degree between the order attributes of the plurality of orders and the order attributes of the taken orders of each of the available plurality of service merchants, and distribute the plurality of orders to the corresponding service merchants according to the matching degree between the orders. Optionally, the matching degree may be expressed in terms of a time matching degree, a distance matching degree, and the like. The specific process of how to allocate a plurality of orders according to the matching degree can be seen in the following embodiments.

In this embodiment, the order distribution device receives an order triggered by a user, and at this time, the order distribution device does not immediately distribute the order, but stores the order triggered by the user in the cache pool. After a period of time, a plurality of orders are stored in the cache pool, and the user-triggered orders are also included in the plurality of orders. And if the plurality of orders stored in the cache pool meet the preset conditions, the order distribution device starts to distribute the plurality of orders in a unified manner. According to the description, the order distribution method provided by the invention is different from the mode that the order distribution is immediately carried out when one order appears in the prior art, and the order distribution method provided by the invention is that the order is accumulated firstly, and then the accumulated orders are distributed at one time, so that the distribution effect of the orders can be ensured to be global optimal, namely the overall time utilization rate of a service merchant in the cleaning service providing platform is highest. This overall time utilization may be reflected in a small time interval between orders to which each service merchant is assigned. At the same time, it is easy to understand that the time interval between the allocated orders becomes smaller, and each service merchant can have a continuous spare working time or spare working time without being allocated orders under the condition of the same working time. Therefore, orders triggered by the user subsequently can be continuously distributed to the service merchants with spare working time, the condition that the service merchants cannot service due to unreasonable order distribution is avoided, the user can trigger order operation at any time, and the orders triggered by the user are guaranteed to be executed by the service merchants.

Fig. 2 is a flowchart of a second embodiment of an order allocation method according to the present invention, and as shown in fig. 2, the method may include the following steps:

s201, receiving an order triggered by a user.

The execution process of step 201 is similar to that of step 101 in the foregoing embodiment, and reference may be made to the related description in the embodiment shown in fig. 1, which is not repeated herein.

S202, storing the orders triggered by the user into a cache pool.

As mentioned in the first embodiment, the order distribution device may directly store all received orders in the buffer pool. However, in practical applications, the orders triggered by the user are actually reserved orders, that is, the service time is later than the order placing time. For orders placed at a relatively close time to the service time, the service merchant may not be able to service the user in a timely manner if the allocation is not made immediately.

Therefore, for the order stored in the buffer pool, alternatively, after the order distribution device receives the order, the time difference between the order placing time and the service time included in the order is determined. If the time difference is greater than the preset value, which indicates that the urgency of service of the order triggered by the user is not very high, the allocation device may store the order with the time difference greater than the preset value into the cache pool. For orders with time difference smaller than the preset value, the rule of immediately allocating after receiving orders is still executed, but the directly allocated orders are out of the discussion scope of the scheme.

S203, if the orders stored in the cache pool meet preset conditions, acquiring a plurality of available service merchants.

S204, acquiring the carried orders corresponding to the M service merchants.

The execution process of the above steps 203-204 is similar to the corresponding steps in the foregoing embodiment, and reference may be made to the related description in the embodiment shown in fig. 1, which is not repeated herein.

For clarity of the scenario description, the number of the plurality of orders is N, the number of the plurality of service merchants available is M, and M > 1, N > 1.

After obtaining the N orders, the order distribution apparatus may further perform steps 205 to 206 described below. Since the procedure is the same for each of the N orders when the following two steps are performed, the following steps 205 to 206 will be described by taking order a, which is any one of the N orders, as an example.

S205, for any order in the N orders, determining a first order and a second order adjacent to the service time of any order from the taken orders of each service merchant.

After the above steps, the order distribution device already knows the order a and the service time of the taken order of each of the M service merchants. At this time, the order distribution device may determine, according to the service time of the order a, the first order and the second order that are adjacent to the service time of the order a from the taken orders of each service merchant. That is, each service merchant determines a pair of first orders and second orders, and each pair of orders corresponds to order A. For the order A, the first order and the second order, the order A, the first order and the second order are sequentially a first order, the order A and a second order according to the service time sequence.

And S206, determining the time matching score of each service merchant for any order according to the service time of any order, the first order and the second order.

Since the determination of the time match score for order A by each service merchant is the same, taking service merchant K and order A as examples, it is explained how to determine the time match score for service merchant K to order A. As is readily known, the service time of each order is a time period consisting of a service start time and a service end time, on the basis of which one alternative is to:

(1) a first time difference is calculated between the service end time of the first order of the service merchant K and the service start time of order a.

(2) A second time difference between the service end time of order A and the service time of a second order of service merchant K is calculated.

(3) And determining a time matching score according to the first time difference and the second time difference.

And if the first time difference meets a preset condition, determining a first part of the time matching score, and if the second time difference meets the preset condition, determining a second part of the time matching score. Alternatively, the order distribution device may directly determine the sum of the first and second portions of the time matching score as the time matching score for order a for service merchant K. The first part and the second part of the time matching score may be a preset fixed score, and may be the same or different. In practical applications, the service time is generally greater than 2 hours, and the preset condition may be that the first time difference is less than or equal to 30 minutes or greater than 3.5 hours, and the second time difference is less than or equal to 30 minutes or greater than 3.5 hours.

Optionally, the order distribution device may further set corresponding weight coefficients for the first part of the time matching score and the second part of the time matching score, respectively, and use the weight coefficient 1+ 2 as the time matching score of the service merchant K for the order a. Here, the weighting factor 1 and the weighting factor 2 may be the same or different.

According to the mode, the order distribution device can sequentially determine the time matching score of each service merchant in the M service merchants to the order A.

One pass through step 206 may actually determine the time match scores for any of the N orders for the M service merchants. Repeating the above steps N times, the order distribution device may determine that M service merchants respectively obtain time matching scores for N orders, that is, M × N time matching scores.

And S207, determining service merchants corresponding to the N orders according to the M times N time matching scores of the M service merchants for the N orders.

Each of the M x N time matching scores obtained by the order distribution means corresponds to a service merchant and an order. At this time, in an optional manner, the hungarian algorithm may be adopted to allocate the N orders to the respective corresponding service merchants. Since the hungarian algorithm is a relatively mature algorithm, a specific implementation thereof will not be described in detail herein.

Alternatively, the order distribution device may obtain a combination of all time matching scores corresponding to the N orders according to the M × N time matching scores, and each time matching score in each combination corresponds to a different service merchant and a different order. Then, the order assigning device calculates the sum of the time matching scores for each combination mode, and selects the combination mode with the highest sum of the time matching scores from all the determined combination modes as the target combination mode. Finally, distributing the N orders to the corresponding service providers according to the target combination mode.

For ease of understanding, the following is exemplified: assume that there are 3 orders, order 1, order 2, and order 3, and 3 serving merchants, merchant 1, merchant 2, and merchant 3. The order distribution device will calculate 3 x 3 time matching scores as shown in table 1 below.

TABLE 1

At this time, the combination of the time matching scores may include the following: "a 1-b 2-c 3", "a 1-c 2-b 3", "a 2-b 1-c 3", "a 2-b 3-c 1", "a 3-b 2-c 1", "a 3-b 1-c 2". If the sum of the time matching scores of the combination of "a 3-b 1-c 2" is the highest, i.e., a3+ b1+ c2 is the highest, the order allocation device allocates order 1 to merchant 2, order 2 to merchant 3, and order 3 to merchant 1.

In this embodiment, the order distribution device receives and stores the order in the buffer pool. If the plurality of orders stored in the cache pool satisfy the preset condition, the order distribution device further obtains a plurality of available service merchants and accepted orders corresponding to the plurality of service merchants, where the number of orders may be N, and the number of available service merchants may be M. For any order in the N orders, the order distribution device determines a first order and a second order adjacent to the service time of the any order from the taken orders of each service merchant according to the service time of the any order, that is, each taken order of each service merchant has a pair of the first order and the second order, wherein the service time of the first order is earlier than that of the second order. And determining the time matching score of each service merchant for any order according to the first order and the second order of each service merchant and the service time of any order. According to the above steps, the order distribution means is actually able to derive M x N time matching scores for M service merchants and N orders. Finally, the order distribution device determines the service merchants corresponding to the N orders according to the M x N time matching scores.

According to the description, the method is different from a mode of immediately distributing orders in an order in the prior art, the order distribution method distributes a plurality of orders at one time based on the matching score of each service merchant for each order, so that the distribution effect of the N orders can reach the global optimum, namely the overall time utilization rate of the service merchants in the cleaning service providing platform is the highest. This overall time utilization may be reflected in a small time interval between orders to which each service merchant is assigned.

The second embodiment uses the score of one dimension, i.e. the time matching score, to allocate the order, so that the allocation effect of the order can achieve the global optimum. It will be readily appreciated that if orders are allocated using multidimensional scores, the allocation effect of the orders can be further optimized. Therefore, on the basis of the second embodiment, fig. 3 is a flowchart of a third embodiment of the order allocation method provided by the embodiment of the present invention, as shown in fig. 3, after step 206, the method may include the following steps:

s301, determining the distance matching score of each service merchant for any order according to the service addresses of any order, the first order and the second order.

The description in the first embodiment is continued by taking the order a and the service merchant K as an example to illustrate the score calculation process. The order distribution device can determine the distance matching score of the service merchant K for the order A according to the order A and the service addresses of the first order and the second order corresponding to the order A in the service merchant K. One alternative way is to:

(1) and acquiring the current driving speed of the service merchant K, a first distance value between the first order and the order A service address and a second distance value between the order A and the second order service address.

(2) A first portion of the distance matching score is determined based on a first time calculated from the travel speed and the first distance value.

(3) A second portion of the distance matching score is determined based on a second time calculated from the travel speed and the second distance value.

(4) A distance match score is determined based on the first portion of the distance match score and the second portion of the distance match score.

Specifically, the first part of the distance matching score is (base time-first time)/a preset parameter;

second part of the distance matching score (base time-first time)/preset parameter

The basic time and the preset parameters are preset values. In practical applications, the base time may be 9000 seconds, and the preset parameter may be 1800 seconds.

Alternatively, the order assignment means may directly take the sum of the first and second portions of the distance matching score as the distance service score for order a by the service merchant K.

Optionally, the order distribution device may further set a corresponding weight coefficient for a first part of the distance matching score and a second part of the distance matching score, and use the weight coefficient 1+ 2 as the distance matching score of the service merchant K for the order a. Here, the weighting factor 1 and the weighting factor 2 may be the same or different.

The higher the distance matching score, the closer the service address of order a is to the service address of the first and second orders of service merchant K. If the order A is distributed to the service merchant K, the time of the service merchant K running between different service addresses can be shortened, so that the service merchant K executes more orders in normal working time, the time utilization rate of the service merchant K is improved, and the overall time utilization rate of all service merchants is further improved.

And S302, calculating the final score of each service merchant for any order according to the distance matching score and the time matching score of each service merchant for any order.

At this time, the time matching score and the distance matching score of the service merchant K for the order a are already obtained, and optionally, the order distribution device may directly use the sum of the time matching score and the distance matching score as the final score of the service merchant K for the order a. Optionally, the order distribution device may further set a corresponding weight coefficient for the time matching score and the distance matching score, and calculate a final score of the service merchant K for the order a according to the weight coefficient, for example, the time matching score + the distance matching score + the weight coefficient II may be used as the final score of the service merchant K for the order a.

The order distribution device can obtain M × N final scores of the M service merchants for the N orders respectively by repeating the steps.

It should be noted that fig. 3 is only an example, and the invention is not limited to determining the time matching score and determining the sequence of the distance matching scores.

And S303, determining service merchants corresponding to the N orders according to the M × N final scores of the M service merchants for the N orders respectively.

This step 303 actually corresponds to step 207 in the second embodiment, and the specific implementation manner is similar to that in step 207 in the second embodiment. However, in this case, the time matching score in the second embodiment needs to be changed to a final score determined by the time matching score and the distance matching score. Therefore, the detailed procedure of order allocation can be referred to the related description in step 207, and will not be described herein.

In this embodiment, on the basis of the second embodiment, a score of another dimension, that is, a distance matching score, is added, and the order allocation device allocates the N orders based on the time matching score and the distance matching score, so that the allocation effect of the N orders is further improved, the allocation effect is globally optimal, that is, the overall time utilization rate of the service merchant in the clean service providing platform is the highest.

Similar to the second embodiment, on the basis of the second embodiment, fig. 4 is a flowchart of a fourth embodiment of the order allocation method provided by the second embodiment of the present invention, as shown in fig. 4, after step 206, the method may include the following steps:

s401, obtaining respective serviceable areas of M service merchants.

Alternatively, the service merchant may set its own serviceable area by using the merchant-version cleaning application, or the service merchant may set the serviceable area by the staff of the cleaning service providing platform. No matter the setting mode of the serviceable area, the setting result can be stored in the cleaning service providing platform. The order distribution device responds to the order distribution operation, and the cleaning service providing platform acquires the serviceable area of each service merchant.

S402, if the service address of any order is in the serviceable area of any service merchant among the M service merchants, and the intervals between the service time of any order and the service time of the first order and the service time of the second order of any service merchant are smaller than the preset intervals, determining the service willingness score of any service merchant for any order.

The description will be made by taking the order a and the service merchant K as examples. The order distribution device may determine whether such a service merchant K exists according to the obtained serviceable area of each service merchant: the serviceable area of the service merchant K includes the service address of the order a, and the intervals between the service times of the order a and the first order and the second order of the service merchant K are both smaller than a preset interval, wherein the preset interval may be 1 hour. If such a service merchant K exists, the service willingness score of the service merchant K for order A is determined. Alternatively, the service will score may be (hours-2 of order a service time) × 2.

The higher the service intent score, the higher the service merchant K is able and willing to fulfill the order A. If the order A is distributed to the service merchant K, the service merchant K can further execute more orders in normal working time, the time utilization rate of the service merchant K is improved, and meanwhile the overall time utilization rate of all service merchants can be further increased. In addition, in practical application, the number of the determined service merchants K may be one or more.

It should be noted that fig. 4 is only an example, and the invention is not limited to determining the time matching score and determining the service will score in the sequential order.

And S403, calculating the final score of any order by any service merchant according to the preset service willingness score and the time matching score of any service merchant for any order.

The execution process of step 403 is similar to that of step 302 in the foregoing embodiment, and reference may be made to the related description in the embodiment shown in fig. 3, which is not repeated herein.

S404, determining the service merchants corresponding to the N orders according to the M × N final scores of the M service merchants for the N orders respectively

This step 404 actually corresponds to step 207 in the second embodiment, and the specific implementation manner is similar to that in step 207 in the second embodiment. However, in this case, the time matching score in the second embodiment needs to be changed to a final score determined by the time matching score and the service intention score. Therefore, the detailed procedure of order allocation can be referred to the related description in step 207, and will not be described herein.

In this embodiment, on the basis of the second embodiment, a score of another dimension, that is, a service intention score, is added, and the order allocation device allocates the N orders based on the time matching score and the service intention score, so that the allocation effect of the N orders is further improved, and the allocation effect is globally optimal.

Similar to the third and fourth embodiments, on the basis of the second embodiment, fig. 5 is a flowchart of a fifth embodiment of the order allocation method provided by the embodiment of the present invention, as shown in fig. 5, after step 206, the method may include the following steps:

s501, counting the number of the orders taken by each of the M service merchants.

And S502, respectively determining the order density score of each service merchant according to the number of the received orders.

After the order allocation device obtains the respective accepted orders of the M service merchants, the order allocation device may count the number of accepted orders of each service merchant, and determine the score of each service merchant for the order density of the order according to the number of accepted orders.

The description will be made by taking the order a and the service merchant K as an example. In an alternative, the order density score for order a by the service merchant K is (the number of orders taken by the service merchant K-2) 3.

The higher the order density score, the more orders taken by the facilitator K. If the order A is distributed to the service merchant K, the service merchant K can further execute more orders in normal working time, the time utilization rate of the service merchant K is improved, and meanwhile the overall time utilization rate of all service merchants can be further increased.

It should be noted that fig. 5 is only an example, and the invention is not limited to determining the time matching score and determining the order density score.

And S503, calculating the final score of each service merchant for any order according to the time matching score and the order density score of each service merchant for any order.

The execution process of step 503 is similar to that of steps 302 and 403 in the foregoing embodiment, and reference may be made to the related description in the embodiments shown in fig. 3 and fig. 4, which is not repeated herein.

And S504, determining the service merchants corresponding to the N orders according to the M × N final scores of the M service merchants for the N orders respectively.

This step 504 actually corresponds to step 207 in the second embodiment, and the specific implementation manner thereof is similar to that of step 207 in the second embodiment. Except that the time matching score in the first embodiment is changed to the final score determined by the time matching score and the order density score. Therefore, the detailed procedure of order allocation can be referred to the related description in step 207, and will not be described herein.

In this embodiment, on the basis of the second embodiment, a score of another dimension, that is, an order density score, is added, and the order distribution device distributes the N orders based on the time matching score and the order density score, so as to further improve the distribution effect of the N orders, and make the distribution effect achieve global optimization, that is, make the distance between the order distributed by each service merchant and the service address of the order smaller.

Similar to the third to fifth embodiments, on the basis of the second embodiment, fig. 6 is a flowchart of a sixth embodiment of the order allocation method provided by the embodiment of the present invention, as shown in fig. 6, after step 206, the method may include the following steps:

s601, obtaining user types of ordering users corresponding to the N orders and respective service quality grades of the M service merchants.

After the order distribution device obtains the N orders, that is, the order placing user information included in each of the N orders is obtained, where the order placing user information may include a user type, a user name, and the like of an order placing user, and the user type may include a new user and an old user. Meanwhile, the order distribution device can also acquire the merchant information of each of the M service merchants, wherein the merchant information includes the identity information, the serviceable area, the service quality level and the like of the service merchant. The quality of service level may be determined based on the rating of the service merchant's historical orders.

S602, if the user type of the ordering user corresponding to any order and the service quality grade of any service merchant in the M service merchants meet preset conditions, determining the service quality score of any order by any service merchant.

The description will be made by taking the order a and the service merchant K as an example. And the order distribution device determines whether the user type of the order placing user corresponding to the order A meets a preset condition or not according to the obtained user information and the service merchant information, and determines whether the service quality grade of the service merchant K meets the preset condition or not. And if the order A and the service merchant K both meet respective preset conditions, determining the service quality score of the service merchant K for the order A. Alternatively, the qos score may be a predetermined fixed value. The preset condition that the user type needs to be met is that the user type of the next user is a new user, and the preset condition that the service quality grade needs to be met is that the service quality grade of the service merchant is higher than the preset grade.

The purpose of setting the service quality score can ensure that the order placed by the new user can be distributed to the service merchants with higher service levels as much as possible, thereby improving the repeated order placing rate of the new user and improving the user stickiness.

And S603, calculating the final score of any order by any service merchant according to the time matching score and the service quality score of any service merchant for any order.

The execution process of step 603 is similar to that of steps 302, 403, and 503 in the foregoing embodiments, and reference may be made to the related description in the embodiments shown in fig. 3 to fig. 5, which is not repeated herein.

And S604, determining the service merchants corresponding to the N orders according to the M × N final scores of the M service merchants for the N orders respectively.

This step 604 actually corresponds to step 207 in the second embodiment, and the specific implementation manner is similar to that in step 207 in the second embodiment. However, in this case, the time matching score in the second embodiment needs to be changed to a final score determined by the time matching score and the quality of service score. Therefore, the detailed procedure of order allocation can be referred to the related description in step 207, and will not be described herein.

In this embodiment, on the basis of the second embodiment, a score of another dimension, that is, a service quality score, is added, and the order allocation device allocates the N orders based on the time matching score and the service quality score, so as to further improve the allocation effect of the N orders, so that the allocation effect is globally optimal, that is, the distance between the order that each service merchant can allocate and the service address of the order is small.

It should be noted that in the third to sixth embodiments, actually, the distance matching score, the willingness to service score, the order density score and the quality of service score are respectively added to the time matching score determined in the second embodiment, and the N orders are allocated according to the scores of two dimensions. However, in practical applications, the order allocation apparatus may calculate the time matching score, the distance matching score, the service will score, the order density score and the service quality score respectively in the manners provided in the above embodiments, and allocate the N orders according to one or more of the several scores.

In addition, the above embodiments all directly distribute N orders in a unified manner. In practical applications, the N orders may be grouped, and the orders are distributed in units of groups, where after step 204, the order distribution method may further include the following steps:

(1) the N orders are grouped according to the service time of the orders to obtain at least one order group.

After the order distribution device obtains the N orders, the orders may be grouped according to the service start time of the orders to obtain at least one order group.

Alternatively, the order distribution means may group the N orders according to the service start time of the orders.

The order distribution device can divide the order with the service starting time in a certain time period into one order group. For example, orders with the service starting time of 8: 00-8: 30 are divided into one order group, orders with the service starting time of 8: 30-9: 00 are divided into one order group, and the like.

The user can also select one of a plurality of time periods provided by the user edition application program as the service time, the initial service time of the order is uniform, and the order distribution device can divide the order with the same service initial time into one order group. For example, an order with a service start time of 8:00 is divided into one order group, an order with a service start time of 9:00 is divided into one order group, and so on.

Alternatively, the order distribution device may group the orders according to the service start time of the orders and the service duration of the orders at the same time, that is, divide the orders with the same service start time and the same service duration into one order group, or divide the orders with the service start time in a certain time period and the same service duration into one order group.

(2) And sequencing at least one order group according to the sequence of order service time in the order group.

(3) Step 205 is performed for any order in the order set in turn according to the sorting result of the order set.

Then, the order distributing device sorts at least one order group according to the order service time sequence, and distributes a plurality of orders in each order group in sequence by taking the order group as a unit. For a specific allocation process, reference may be made to the above embodiments, and details are not described herein.

The grouping and sorting processing procedure is added in the order distributing method, so that the order distributing device distributes orders in the current order group on the basis of the already distributed orders in the previous order group. This allows the order to be distributed in batches, which may make the distribution process more time-ordered. Meanwhile, the method is combined with the multidimensional scores for use, so that the distribution effect of the N orders can be further improved, and the distribution effect can reach the global optimum.

Fig. 7 is a schematic structural diagram of a first embodiment of an order distribution apparatus according to the present invention, and as shown in fig. 7, the order distribution apparatus includes: an order receiving module 11, an order storage module 12 and an allocation module 13.

And the order receiving module 11 is used for receiving an order triggered by a user.

And the order storage module 12 stores the order triggered by the user into the cache pool.

And the allocating module 13 is configured to, if the multiple orders stored in the cache pool meet a preset condition, perform allocation processing on the multiple orders, where the multiple orders include an order triggered by a user.

Optionally, the order storage module 12 in the order distribution device is specifically configured to: and if the time difference between the service time and the order placing time is greater than the preset value, storing the order triggered by the user into a cache pool.

Optionally, the allocation module 13 in the order allocation apparatus is specifically configured to: obtaining a plurality of service merchants available; and distributing the plurality of orders to the plurality of service merchants according to the matching degree between the order attributes of the plurality of orders and the order attributes of the taken orders corresponding to the plurality of service merchants.

The apparatus shown in fig. 7 can perform the method of the embodiment shown in fig. 1, and reference may be made to the related description of the embodiment shown in fig. 1 for a part of this embodiment that is not described in detail. The implementation process and technical effect of the technical solution refer to the description in the embodiment shown in fig. 1, and are not described herein again.

Fig. 8 is a schematic structural diagram of a second embodiment of the order distribution apparatus according to the present invention, and as shown in fig. 8, the number of the multiple orders is N, the number of the multiple service merchants is M, M > 1, and N > 1; on the basis of the embodiment shown in fig. 7, the allocation module 13 in the order allocation apparatus specifically includes: an order acquisition unit 131, an order determination module 132, a time matching scoring unit 133, and an assignment unit 134.

The order obtaining unit 131 is configured to obtain the taken orders corresponding to the M service merchants.

An order determining unit 132, configured to determine, for any order of the N orders, a first order and a second order adjacent to a service time of any order from the taken orders of each service merchant, where the service time of the first order is earlier than that of the second order.

The time matching score determining unit 133 is configured to determine a time matching score for any order for each service merchant according to the service time of any order, the first order, and the second order.

The allocating unit 134 is configured to determine service merchants corresponding to the N orders according to M × N time matching scores of the M service merchants for the N orders, respectively.

The apparatus shown in fig. 8 can perform the method of the embodiment shown in fig. 2, and reference may be made to the related description of the embodiment shown in fig. 2 for a part of this embodiment that is not described in detail. The implementation process and technical effect of the technical solution refer to the description in the embodiment shown in fig. 2, and are not described herein again.

Fig. 9 is a schematic structural diagram of a third embodiment of an order distribution device according to an embodiment of the present invention, and as shown in fig. 9, based on the embodiment shown in fig. 8, a distribution module 13 in the order distribution device further includes: a distance matching score determining unit 135 and a calculating unit 136.

A distance matching score determining unit 135, configured to determine a distance matching score for any order for each service merchant according to the service addresses of any order, the first order, and the second order.

And the calculating unit 136 is used for calculating the final score of each service merchant for any order according to the distance matching score and the time matching score of each service merchant for any order.

The allocating unit 134 is configured to determine, according to M × N final scores of the M service merchants for the N orders, service merchants corresponding to the N orders respectively.

Optionally, the allocation module 13 in the order allocation apparatus further includes: a region acquisition unit 137 and a service intention score determination unit 138.

The area obtaining unit 137 is configured to obtain respective serviceable areas of the M service merchants.

The service intention score determining unit 138 is configured to determine a service intention score of any order by any service merchant if the service address of any order is located in a serviceable area of any service merchant among the M service merchants, and intervals between service times of any order and the first order and the second order of any service merchant are smaller than a preset interval.

The calculating unit 136 is configured to calculate a final score of any order by any service merchant according to the preset service willingness score and the time matching score of any service merchant for any order.

Optionally, the allocation module 13 in the order allocation apparatus further includes: a statistics unit 139 and an order density score determination unit 140.

And the counting unit 139 is configured to count the number of the orders taken by each of the M service merchants.

The order density score determining unit 140 is configured to determine an order density score of each service merchant according to the number of the received orders.

And the calculating unit 136 is used for calculating the final score of each service merchant for any order according to the time matching score and the order density score of each service merchant for any order.

Optionally, the allocation module 13 in the order allocation apparatus further includes: information acquisition unit 141 and quality of service score determination unit 142.

The information obtaining unit 141 is configured to obtain user types of the order placing users corresponding to the N orders and respective service quality levels of the M service merchants.

The service quality score determining unit 142 is configured to determine a service quality score of any order by any service merchant if the user type of the order placing user corresponding to any order and the service quality level of any service merchant in the M service merchants meet preset conditions.

And the calculating unit 136 is used for calculating the final score of any order by any service merchant according to the time matching score and the service quality score of any service merchant for any order.

Optionally, the allocation unit 134 in the order allocation apparatus is specifically configured to: acquiring all final score combination modes corresponding to the N orders according to M × N final scores of the N orders by the M service merchants; determining a target final score combination mode with the maximum sum of final scores in all final score combination modes; and determining the service merchants corresponding to the N orders according to the target final score combination mode.

Optionally, the order distribution apparatus further comprises: a grouping module 21 and an ordering module 22.

And the grouping module 21 is configured to group the N orders according to service times of the orders to obtain at least one order group.

And the sequencing module 22 is used for sequencing at least one order group according to the sequence of the order service time in the order group.

An order determining unit 132, configured to perform, for any order in the order group in turn, a step of determining a first order and a second order adjacent to the service time of any order from the taken orders of each service merchant according to the sorting result of the order group.

The apparatus shown in fig. 9 can perform the method of the embodiment shown in fig. 3 to 6, and the related description of the embodiment shown in fig. 3 to 6 can be referred to for the part not described in detail in this embodiment. The implementation process and technical effect of the technical solution refer to the descriptions in the embodiments shown in fig. 3 to 6, and are not described herein again.

The internal functions and structure of the order distribution apparatus are described above, and in one possible design, the structure of the order distribution apparatus may be implemented as an electronic device, such as a server. Fig. 10 is a schematic structural diagram of an electronic device according to a first embodiment of the present invention, and as shown in fig. 10, the electronic device includes: a memory 31, and a processor 32 connected to the memory, the memory 31 being used for storing a program for the electronic device to execute the order allocation method provided in any of the above embodiments, the processor 32 being configured to execute the program stored in the memory 31.

The program comprises one or more computer instructions which, when executed by the processor 32, are capable of performing the steps of:

receiving an order triggered by a user;

storing the order triggered by the user into a cache pool;

and if the orders stored in the cache pool meet the preset conditions, performing distribution processing on the orders, wherein the orders comprise orders triggered by the user.

Optionally, processor 32 is also configured to perform all or some of the method steps described above.

The electronic device may further include a communication interface 33 for communicating with other devices or a communication network.

The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.

Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by adding a necessary general hardware platform, and of course, can also be implemented by a combination of hardware and software. With this understanding in mind, the above technical solutions may be embodied in the form of a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., which includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods according to the various embodiments or some parts of the embodiments.

Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims

1. An order allocation method, comprising:

receiving an order triggered by a user;

storing the order triggered by the user into a cache pool;

if a plurality of orders stored in the cache pool meet preset conditions, performing distribution processing on the plurality of orders, wherein the plurality of orders comprise orders triggered by the user;

the allocating the plurality of orders comprises

Obtaining a plurality of service merchants available;

distributing the plurality of orders to the plurality of service merchants according to the matching degree between the order attributes of the plurality of orders and the order attributes of the taken orders corresponding to the plurality of service merchants;

the number of the orders is N, the number of the service merchants is M, M is more than 1, and N is more than 1;

the allocating the plurality of orders to the plurality of service merchants according to the matching degree between the plurality of order attributes and the order attributes of the taken orders corresponding to the plurality of service merchants respectively comprises:

acquiring the carried orders corresponding to the M service merchants;

for any order in the N orders, determining a first order and a second order adjacent to the service time of the any order from the taken orders of each service merchant, wherein the service time of the first order is earlier than that of the second order;

determining a time matching score of each service merchant for any order according to the service time of any order, the first order and the second order;

and determining the service merchants corresponding to the N orders according to the M times N time matching scores of the M service merchants for the N orders respectively.

2. The method of claim 1, wherein storing the user-triggered order in a buffer pool comprises:

and if the time difference between the service time and the order placing time is greater than a preset value, storing the order triggered by the user into a cache pool.

3. The method of claim 1, wherein the preset condition comprises at least one of: the number of the orders reaches a preset number, the service addresses corresponding to the orders belong to the same preset position area, and the time difference between the earliest service time and the current time corresponding to the orders is larger than or equal to a preset difference value.

4. The method of claim 1, further comprising:

determining a distance matching score of each service merchant for any order according to the service addresses of the any order, the first order and the second order;

calculating the final score of each service merchant for any order according to the distance matching score and the time matching score of each service merchant for any order;

determining the service merchants corresponding to the N orders according to the M × N time matching scores of the M service merchants for the N orders, respectively, including:

and determining the service merchants corresponding to the N orders according to the M x N final scores of the M service merchants for the N orders respectively.

5. The method of claim 1, further comprising:

acquiring respective serviceable areas of the M service merchants;

if the service address of any order is in the serviceable area of any service merchant in the M service merchants and the intervals between the service time of any order and the service time of the first order and the service time of the second order of any service merchant are smaller than the preset interval, determining the service willingness score of any service merchant for any order;

calculating a final score of any order by any service merchant according to a preset service willingness score and a time matching score of any service merchant for any order;

6. The method of claim 1, further comprising:

counting the number of the orders taken by each of the M service merchants;

respectively determining the order density score of each service merchant according to the number of the received orders;

calculating the final score of each service merchant for any order according to the time matching score and the order density score of each service merchant for any order;

7. The method of claim 1, further comprising:

acquiring user types of ordering users corresponding to the N orders and respective service quality grades of the M service merchants;

if the user type of the ordering user corresponding to any order and the service quality grade of any service merchant in the M service merchants meet preset conditions, determining the service quality score of any service merchant for any order;

calculating the final score of any service merchant for any order according to the time matching score and the service quality score of any service merchant for any order;

8. The method according to any one of claims 4 to 7, wherein said determining the service merchant to which each of the N orders corresponds according to the M x N final scores of the M service merchants for the N orders, respectively, comprises:

acquiring all final score combination modes corresponding to the N orders according to M × N final scores of the M service merchants for the N orders respectively;

determining a target final score combination mode with the maximum sum of final scores in all the final score combination modes;

and determining the service merchants corresponding to the N orders according to the target final score combination mode.

9. The method according to any one of claims 1 to 7, wherein after acquiring the N orders with the service time and the current time interval of a preset duration and taking the orders by each of the M service merchants, the method further comprises:

grouping the N orders according to the service time of the orders to obtain at least one order group;

sequencing the at least one order group according to the sequence of order service time in the order group;

and according to the sequencing result of the order group, sequentially executing the step of determining a first order and a second order adjacent to the service time of any order from the accepted orders of each service merchant for any order in the order group.

10. An order distribution apparatus, comprising:

the order receiving module is used for receiving an order triggered by a user;

the allocation module is used for allocating the orders if the orders stored in the cache pool meet preset conditions, wherein the orders comprise orders triggered by the user;

the allocation module is specifically configured to:

obtaining a plurality of service merchants available;

the distribution module includes: the system comprises an order acquisition unit, an order determination module, a time matching scoring unit and a distribution unit;

the order obtaining unit is used for obtaining the carried orders corresponding to the M service merchants;

the order determining unit is used for determining a first order and a second order which are adjacent to the service time of any order from the taken orders of each service merchant for any order in the N orders, wherein the service time of the first order is earlier than that of the second order;

the time matching score determining unit is used for determining the time matching score of each service merchant for any order according to the service time of any order, the first order and the second order;

the distribution unit is configured to determine service merchants corresponding to the N orders according to the M × N time matching scores of the M service merchants for the N orders, respectively.

11. An electronic device, comprising: a memory, and a processor coupled to the memory;

the processor configured to execute the one or more computer instructions to implement the method of order allocation of any of claims 1-9.