WO2019237693A1

WO2019237693A1 - Order allocation

Info

Publication number: WO2019237693A1
Application number: PCT/CN2018/121210
Authority: WO
Inventors: 王杰; 乜东彬; 罗立东; 邓文哲; 宋子扬; 付志耀; 徐世玥
Original assignee: 北京三快在线科技有限公司
Priority date: 2018-06-12
Filing date: 2018-12-14
Publication date: 2019-12-19
Also published as: CN109118032A

Abstract

The present disclosure relates to an order allocation method and apparatus, and a server and a storage medium. The method comprises: sending information of an order to be allocated; receiving order competition information with regard to said order to be allocated; determining, according to the order competition information, an order competition end moment of said order to be allocated; and allocating said order to be allocated at the order competition end moment of said order to be allocated.

Description

Order allocation

Cross-reference to related applications

This patent application claims priority from a Chinese patent application filed on June 12, 2018, with an application number of 201810603020.6, and an invention name of "Order Distribution Method, Device, Server, and Storage Medium". The full text of the application is incorporated by reference. Incorporated herein.

Technical field

The present disclosure relates to the field of information processing technology, and in particular, to the distribution of network orders.

Background technique

With the development of the Internet economy, more and more users choose to obtain the services they need through the network. When a user needs a certain service, he places an order through the network. Accordingly, the service provider obtains the order through the network. After the service provider obtains the order, it allocates the order to the corresponding service personnel through the server, so that the service personnel can provide services to the user.

You can set a fixed end-of-rush time for the order to be allocated. Before this fixed time, the service staff can grab the order. At this fixed time, select the appropriate service staff from all the service staff participating in the order grab, and then The pending order is assigned to the selected service person. Taking the allocation of taxi order as an example, before a fixed time, the driver can grab the order. At this fixed time, determine the appropriate driver from all the drivers participating in the order, and then assign the taxi order to the driver.

Summary of the Invention

To overcome the problems in the related art, the present disclosure provides an order allocation method, device, server, and storage medium.

In order to achieve the foregoing objective, a first aspect of an embodiment of the present disclosure provides an order allocation method, where the method includes:

Send information on orders to be allocated;

Receiving the order rush information for the order to be allocated;

Determine, according to the order rush information, the end time of the rush order of the order to be allocated;

Allocating the to-be-allocated order at the moment when the pre-order of the to-be-allocated order is completed.

Optionally, determining the time when the order rush is completed based on the order rush information includes:

Initialize the end-of-rush time of the order to be allocated as a preset time;

Detecting whether the order grabbing information is received before the preset time;

If at least one order rushing information is received before the preset time, updating the order rushing end time of the order to be allocated according to the received at least one order rushing information;

If the order rush information is not received before the preset time, then the order rush end time of the order to be allocated is determined as the preset time.

Optionally, updating the order end time of the order to be allocated according to the received at least one order rush information includes:

Determine the first end time of the order rush according to the first order rush information received before the preset time;

Update the end-of-rush time of the order to be allocated to the first end-of-rush time and the earliest end of the preset time;

Repeatedly updating the order end time of the pending order according to the new order order information received before the updated order end time, until no new order is received before the updated order end time Order information so far.

Optionally, determining the end time of the order rush according to the received order rush information includes:

Determine the end time of the first rush order according to the received first rush order information;

Initializing the end-of-rush time of the pending order as the first end-of-rush time;

Detecting whether at least one piece of order-grabbing information is received before the first order-finishing end time;

If the at least one order rush information is received before the first order rush end time, updating the order rush end time of the order to be allocated according to the received at least one order rush information;

If no order rush information is received before the first order rush end time, the order rush end time of the to-be-allocated order is determined as the first order rush end time.

Determining a second time for rush order end according to the first information for rush order received before the first time for rush order end;

Update the end-of-rush time of the pending order to the earliest end time of the first end-of-rush time and the second end-of-rush time;

Optionally, updating the order end time of the order to be allocated according to the new order end information received before the updated order end time includes:

Determine the end time of the current rush order according to the new rush order information received before the updated rush order end time;

Updating the end-of-rush time of the order to be allocated to the updated end-of-rush time and the earliest end time of the current end-of-rush time.

Optionally, the end time of the first rush order, the end time of the second rush order, and the end time of the current rush order are determined based on any one or more of the following:

The degree of matching between the order rush information received this time and the information of the order to be allocated;

The quantity of received order rush information before the order rush information is received this time;

Before the order rush information is received this time, the degree of matching between the received order rush information and the information of the order to be allocated.

Optionally, the matching degree is determined based on any one or more of the following parameters:

User evaluation, the distance between the position in the order-buying information and the position in the information of the order to be allocated, and whether the type of service available in the order-buying information includes the information specified in the information of the order to be allocated A time difference between a service type, an estimated service start time in the order-buying information, and a service start time specified in the information of the order to be allocated.

Optionally, allocating the to-be-allocated order at the moment when the order-rushing end of the to-be-allocated order includes:

Counting the received order rush information from the time of sending the information of the order to be allocated to the end time of the order rush of the order to be allocated;

Determining, as the target rush order information, the rush order information that has the highest matching degree between the received rush order information and the information of the order to be allocated;

Allocating the to-be-allocated order to a sending end of the target preemption order information.

Determining, as the target rush order information, the last rush order information received before the rush order end time of the order to be allocated;

A second aspect of the embodiments of the present disclosure provides an order distribution device, where the device includes:

A sending module for sending information of an order to be allocated;

A receiving module, configured to receive order rush information for the order to be allocated;

A determining module, configured to determine, according to the order rush information, the time for rush order end of the order to be allocated;

An allocation module is configured to allocate the to-be-allocated order at the moment when the order-to-be-sold order ends.

Optionally, the end-of-rush time of the order to be allocated is initialized to a preset time; the determining module includes:

A first detection sub-module, configured to detect whether order grab information is received before the preset time;

A first update sub-module, configured to update the end-of-order time of the order to be allocated according to the received at least one order-grasping information if at least one order-grabbing information is received before the preset time;

The determining module is further configured to:

Optionally, the first update submodule is configured to:

Optionally, the determining module includes:

A first determining sub-module, configured to determine the end time of the first order rush according to the received first order rush information;

An initialization sub-module, configured to initialize the end-of-rush time of the order to be allocated to the first end-of-rush time;

A second detecting sub-module, configured to detect whether at least one piece of order-receiving information is received before the first order-ending end time;

A second update sub-module, configured to, if the at least one order grabbing information is received before the first order grabbing end time, rush ordering the to-be-allocated order according to the received at least one order grabbing information Update at the end time;

A second determining sub-module is configured to determine, as the first order rush end time, the order rush end time of the order to be allocated if no order rush information is received before the first order rush end time.

Optionally, the second update sub-module is configured to:

Optionally, the update submodule is configured to:

Optionally, the end time of the first rush order, the end time of the second rush order, and the end time of the current rush order are all determined based on any one or more of the following:

Optionally, the allocation module includes:

A statistics sub-module, configured to collect statistics of the order rush information that has been received from the time when the information about the order to be allocated is sent to the time when the order rush is finished;

A third determining submodule, configured to determine, as the target order rush information, the order rush information that has the highest matching degree between the received order rush information and the information of the order to be allocated;

A first allocation submodule is configured to allocate the to-be-allocated order to a sending end of the target order grabbing information.

Optionally, the allocation module includes:

A fourth determining submodule, configured to determine, as the target rush order information, the last rush order information received before the rush order end time of the order to be allocated;

A second allocation submodule is configured to allocate the to-be-allocated order to a sending end of the target order grabbing information.

A third aspect of the embodiments of the present disclosure provides a server, including:

processor;

A storage medium for storing processor-executable instructions;

The processor is configured to:

Send information on orders to be allocated;

Receiving the order rush information for the order to be allocated;

A fourth aspect of the present disclosure provides a computer-readable storage medium having stored thereon computer program instructions that, when executed by a processor, implement the steps of the method described in the first aspect of the present disclosure.

By adopting the above technical solution, according to the order-buying information for the orders to be allocated, the order-buying end time of the orders to be allocated is determined, instead of setting the order-buying end time of the orders to be allocated to a fixed time. Because order allocation is performed at the end time of the order rush determined according to the order rush information, the time of order allocation is affected by the order rush information for the order to be allocated, and is no longer a fixed time, so the order allocation method is more Flexible, increasing the flexibility of order allocation.

And, because the order rush information for the order to be allocated is an important factor reflecting the actual order rush process, the order allocation method is used to determine the end time of the order rush based on the order rush information for the order to be allocated, which is fixed than in related technologies. The time is more reasonable, so that order allocation is realized at a reasonable point in time, which avoids unnecessary waiting time for service personnel participating in order rush and improves the efficiency of order allocation.

Other features and advantages of the present disclosure will be described in detail in the detailed description section that follows.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings are used to provide a further understanding of the present disclosure, and constitute a part of the description. Together with the following specific embodiments, the drawings are used to explain the present disclosure, but do not constitute a limitation on the present disclosure.

FIG. 1 is a schematic diagram of an implementation environment involved in an order allocation method according to an embodiment of the present disclosure.

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

FIG. 3 is a schematic diagram of an order allocation method according to an embodiment of the present disclosure.

FIG. 4 is another schematic diagram of an order allocation method according to an embodiment of the present disclosure.

FIG. 5 is a schematic diagram of an order distribution device according to an embodiment of the present disclosure.

FIG. 6 is a block diagram of a server according to an example of the embodiment of the present disclosure.

detailed description

Hereinafter, specific embodiments of the present disclosure will be described in detail with reference to the drawings. It should be understood that the specific embodiments described herein are only used to illustrate and explain the disclosure, and are not intended to limit the disclosure.

Before describing the order allocation method provided by the embodiment of the present disclosure, the implementation environment involved in the order allocation method provided by the embodiment of the present disclosure is described first. FIG. 1 is a schematic diagram of an implementation environment involved in an order allocation method according to an embodiment of the present disclosure. As shown in FIG. 1, the implementation environment includes a server 100 and clients 200. The number of clients 200 may be one or more. FIG. 1 takes three clients as an example.

The client 200 is in communication connection with the server 100, and the communication connection may be wired or wireless. Both the server 100 and the client 200 may access a wireless network based on a communication standard, such as a WiFi, 2G, or 3G network, or a combination thereof. Alternatively, the server 100 and the client 200 may each be configured with a near field communication (NFC) module to facilitate short-range communication. For example, short-range communications can also be implemented based on radio frequency identification (RFID) technology, infrared data association (IrDA) technology, ultra-wideband (UWB) technology, Bluetooth (BT) technology, and other technologies.

The client 200 may be a mobile phone, a computer, a digital broadcasting terminal, a messaging device, a game console, a tablet device, a medical device, a fitness device, a personal digital assistant, and the like.

The order allocation method provided by the embodiment of the present disclosure is described below. The order allocation method provided by the embodiment of the present disclosure is applied to a server, such as the server 100 in FIG. 1. FIG. 2 is a flowchart of an order allocation method according to an embodiment of the present disclosure. As shown in FIG. 2, the method includes the following steps.

Step S11: Send the information of the order to be allocated.

Step S12: Receive order rush information for the order to be allocated.

Step S13: Determine the end time of the order rush for the order to be allocated according to the order rush information.

Step S14: Allocating the to-be-allocated order at the moment when the pre-order of the to-be-allocated order is completed.

In the embodiment of the present disclosure, when a user needs to obtain a certain service, he places an order through the network, and then generates an order to be allocated. The order to be distributed is transmitted to the server via the network. When the server detects the order to be allocated, the server sends information about the order to be allocated to one or more clients that are communicatively connected with the server.

The server can broadcast the information of the order to be distributed to one or more clients in communication with it, that is, broadcast the information of the order to be distributed to one or more clients in communication with it, or it can also send the order to be allocated. The information is sent to one or more clients connected to it. How to send the information of the order to be allocated is not specifically limited in the embodiment of the present disclosure.

In order to provide users with efficient and high-quality services, the server can send information about the orders to be distributed to multiple clients, so that as many service personnel as possible can participate in the order rush, and then select the appropriate service personnel to provide services to the users.

After the server sends the information of the order to be allocated, the client receives the information of the order to be allocated. If the service personnel using the client wants to grab the order, they can send the order grabbing information through the client they use. In this way, the server receives the order rush information for the order to be allocated. For brevity of description, the "rush order information for the order to be allocated" is hereinafter referred to as "rush order information".

Then, the server determines, based on the order rush information, the end time of the rush order for the order to be allocated. Different from setting the end-of-rush time of the order to be allocated to a fixed time, the embodiment of the present disclosure proposes that the order-rushing information will affect the end-time of the order-to-be-allocated order, and the order-rushing information is used to determine the order-rushing order Considerations for end time. For example, at least one of the number of order grabbing information, the degree of matching between the order grabbing information and the order to be allocated, and the time when the server receives the order grabbing information will all determine the end time of the order grabbing of the order to be allocated.

For example, the end-of-rush time of each order to be allocated is generally set to 15 minutes after the sending time of sending the information of the order to be allocated by default. That is, the order is allocated 15 minutes after the server sends the information of the order to be allocated. Regardless of how well the order-receiving information received by the server within 15 minutes matches the information of the order to be allocated, and no matter how many order-receiving information the server receives within 15 minutes, the server must place the order at the end of 15 minutes distribution.

With the order allocation method provided by the embodiment of the present disclosure, the server dynamically determines the end time of the order rush based on the received order rush information. If the received rush order information has a high degree of matching with the order to be allocated, the end time of the rush order of the order to be allocated can be determined as an earlier time (for example: earlier than 15 minutes), and then the order is allocated in advance. Improve the efficiency of order allocation, and shorten the waiting time of service personnel involved in order rush.

Or, if the server sends the information of the order to be allocated, the quantity of the order-receiving information received within a short time (for example, less than 15 minutes) reaches a preset amount. According to the preset number of order rushing information, it is sufficient to reasonably determine a time (for example, a time earlier than 15 minutes) as the order rushing end time of the order to be allocated. Then the server can allocate the order in advance, improve the efficiency of order allocation, and shorten the waiting time of the service personnel participating in the order grab.

By adopting the above technical solution, based on the order grabbing information for the orders to be allocated, the end timing of the order grabbing of the orders to be allocated is dynamically determined, instead of setting the order grabbing end time of the orders to be allocated to a fixed time. Because order allocation is performed at the end time of the order rush determined according to the order rush information, the time of order allocation is affected by the order rush information for the order to be allocated, and is no longer a fixed time, so the order allocation method is more Flexible, increasing the flexibility of order allocation.

In addition, because the order rush information for orders to be allocated is an important factor reflecting the actual order rush process, the end time of order rush determined based on the order rush information for orders to be allocated is more reasonable than the fixed end time Order distribution is realized at a reasonable time, avoiding unnecessary waiting time of service personnel participating in order grabbing, and improving the efficiency of order distribution.

In the embodiment of the present disclosure, step S13 includes and is not limited to the following two implementations.

In a first implementation manner, the end-of-rush time of the order to be allocated is initialized to a preset time; step S13 includes the following steps: detecting whether the order-rushing information is received before the preset time; if Receiving the order rushing information before the preset time, updating the order rushing end time of the order to be allocated based on the order rushing information, and determining the order rushing end time of the pending order as an update The time when the order-buying ends; if the information about order-buying is not received before the preset time, determining the time when the order-buying ends for the order to be allocated is the preset time.

In the first embodiment, the server initializes the end-of-rush time of the order to be allocated to the preset time while sending the information of the order to be allocated in step S11. That is, the server presets a waiting time, and assigns the order at the latest when the waiting time arrives. In this example, the server can dynamically adjust the end-of-rush time of the order to be allocated according to the order-rushing information received before the preset time. The order-rushing information received by the server after the preset time does not affect the order to be allocated The determination of the end time of the rush order.

In the actual order grabbing process, it may happen that after the server sends the order grabbing information, the order grabbers do not want to participate in the order grabbing, and therefore do not send the order grabbing information through the client, resulting in the server not receiving the preset time. Order information. In this case, the end-of-rush time of the order to be allocated is determined as the preset time. The server then allocates the order at a preset time.

Of course, in the actual order grabbing process, it may also happen that after the server sends the order grabbing information, one or more order grabbers want to participate in the order grabbing, and therefore all send out the order grabbing information through the client, causing the server to pre-order It is assumed that one or more orders are received before the time. In this case, the server updates the order end time of the order to be allocated according to the received order order information, and then determines the order end time of the order to be allocated as the updated order end time. That is, if the server receives the order rushing information before the preset time, the order rushing end time of the order to be allocated may no longer be the preset time, but the updated command rushing end time.

Wherein, the server updates the time when the order end of the order to be allocated is updated according to the one or more order rush information received before the preset time, including the following steps: according to the first order rush information received before the preset time To determine the first time for closing the order; update the time for closing the order to be allocated to the earliest time between the first time for closing the order and the earliest preset time; repeatedly according to the updated order The new order rush information received before the end time, and updating the order rush end time of the order to be allocated until no new order rush information is received before the updated order rush end time; and The order end time of the order to be allocated is determined as the final updated order end time.

Wherein, repeatedly updating the order end time of the to-be-allocated order based on the new order end information received before the updated order end time includes: before the last order end time after the last update. The received new rush order information determines the current rush order end time; and updates the rush order end time of the pending order to the last updated rush order end time and the current rush order end time The earliest time to end.

In the embodiment of the present disclosure, in a case where the server receives one or more order grabbing information before a preset time, firstly, the first order grabbing end time is determined according to the first order grabbing information received before the preset time. Then, compare the first time of closing the order with a preset time, and use the earliest end time of the two as the updated time of closing the order. This completes the first update of the end-of-rush time for orders to be allocated.

Then, if the server receives the order rush information for the second time before the end of the rush order after the first update, it continues to determine the second rush order end time according to the second received order rush information. Then, compare the second time of closing the order and the time of closing the order after the first update, and take the earliest end of the two as the updated time of closing the order. This completes the second update of the order end time for orders to be allocated. By analogy, the rush order end time of the allocation order is updated multiple times until no rush order information is received before the last update rush order end time.

Among them, the last updated order end time is determined according to the following method: after each completion of the update of the order end time of the order to be allocated, it is detected whether a new order is received before this updated order end time. If the new order snatch information is received before the updated order snatch end time, continue to update the order snatch order end time; if before the updated order snatch end time If no new order rush information is received, the end time of the latest rush order is the end time of the latest rush order. In this case, the update of the order end time of the order to be allocated is ended, and the order end time of the order to be allocated is determined as the last order update end time. Finally, the server allocates the order at the end of the last order grab after the last update.

By way of example, FIG. 3 is a schematic diagram of order allocation in the embodiment of the present disclosure. As shown in FIG. 3, the server sends the order allocation information at time t0, the preset time is t0 ', and the server receives the order rush information A for the first time before the preset time t0'. Therefore, the server determines the first order end time t1 'based on the order order information A. Then compare the first order end time t1 'with the preset time t0'. The earlier end time is the first order end time t1 '. Therefore, the first order end time of the order to be allocated is updated for the first time. The order end time of the order to be allocated is updated to the first order end time t1 '.

Thereafter, the server detects whether or not order-receiving information has been received before the order-finishing end time t1 'after the first update. As shown in FIG. 3, the server receives new order-buying information B before the first-order-buying end time t1 'after the first update. Therefore, the server determines the second time to end the order t2 'based on the order rush information B. Then compare the second rush order end time t2 'with the first rush order end time t1'. The earlier end time is the first rush order end time t1 ', so the second rush order end time for the order to be allocated is performed for the second time. Update, the end time of the order rush for the order to be allocated is maintained as the first end time of the rush order t1 '.

After that, the server detects whether the order-receiving information is received before the second update order end time t1 '. As shown in FIG. 3, the server receives a new order before the second update order end time t1'. Order information C. Therefore, based on the order rush information C, the server determines that the third time when the rush order ends is t3 '. Then, compare the third time for closing the order t3 'with the first time for closing the order t1'. The earlier end time is the third time for closing the order t3 '. Update, update the end-of-rush time of the order to be allocated from the first end-of-rush time t1 'to the third end-of-rush time t3'.

Thereafter, the server detects whether the order-receiving information is received before the third-order-request end time t3 '. As shown in FIG. 3, the server does not receive the order-reward before the third-order-request end time t3'. Therefore, the update of the end-of-rush time of the order to be allocated is ended, the end-of-rush time of the order to be allocated is determined as t3 ', and finally, the server allocates the order at time t3'.

In the second embodiment, step S13 includes the following steps:

Determine the end time of the first order rush according to the first order rush information received;

Detecting whether new order rushing information is received before the first order rushing end time;

If new order grabbing information is received before the first order grabbing end time, updating the order bidding end time of the order to be allocated according to the new order grabbing information, and updating the The end time of order rush is determined as the updated end time of rush order;

If no new order rush information is received before the first order rush end time, the order rush end time of the to-be-allocated order is determined as the first order rush end time.

In the second embodiment, initialization is performed at the end of the rush order to be allocated according to the rush order information received for the first time. Specifically, the server determines the first end time of order rushing based on the first time the order rush information is received, and then initializes the end time of order rush to be allocated to the first end time of order rush. Similar to the preset time in the first embodiment, the server allocates orders at the latest at the end time of the first rush order. The server only determines the end-of-order time of the order to be allocated based on the order-receipt information received before the first end-of-order time. The order-receipt information received by the server after the first end-of-order time does not affect the order Confirmation of the end time of order grab.

The difference from the first embodiment is that the end time of the order rush for the order to be allocated is initialized to a time related to the order rush information received by the server for the first time. The information has a high degree of matching, so the end-of-rush time of the order to be allocated can be initialized to an earlier end time (for example, a time earlier than a preset time), thereby laying a foundation for order allocation in advance.

Similar to the first embodiment, if the server does not receive the order rush information before the first order rush end time, the server determines the order rush end time of the order to be allocated as the first order rush end time. The server then allocates the order at the end of the first rush order. That is, if the server receives only one order grabbing information after sending the information of the order to be allocated, it determines an order grabbing end time based on the order grabbing information, and then determines the order grabbing end time based on the order grabbing information. To make an order assignment.

If the server receives the rush order information before the first rush order end time, that is, after receiving the rush order information for the first time, the server also receives the rush order information one or more times. In this case, the server updates the rush order end time of the assigned order according to the rush order information received for the first time before the first rush order end time (that is, the second rush order information received by the server), and then updates The order end time of the order to be allocated is determined as the updated order end time. That is to say, if the server receives the order rush information before the first rush order end time, the rush order end time of the order to be allocated may no longer be the first rush order end time, but an updated rush order end time.

Wherein, the server updates the time when the order-rushing end of the order to be allocated is received according to the information that is received before the time when the first order-finding ends, including:

Determining the second end-of-rush order time according to the first-end-rush order information received before the first end-of-rush time;

Repeat the following steps:

Determining whether to receive the re-order information before the updated rush-order end time,

Updating the end-of-rush time of the to-be-allocated order according to the received-rush order information,

Until no updated order information is received before the updated said order end time;

The end-of-rush time of the order to be allocated is determined as the updated end-of-rush time.

The updating of the end-of-rush time of the order to be allocated is updated according to the re-locking information received again, which has been described in the first embodiment, and is not repeated here.

Similar to the first embodiment, in the case where the server receives one or more order grabbing information before the first order end time, first according to the first order receiving information (that is, the server) The second time the order is received) to determine the end time of the second order. Then, compare the second rush order end time with the first rush order end time, and take the earliest end time of the two as the updated rush order end time. This completes the first update of the end-of-rush time for orders to be allocated.

Then, if the server receives the order-buying information for the third time before the second-order-buying-end time after the second update, the server continues to determine the third order-buying-end time based on the received order-buying information for the third time. Then, compare the third time of closing the order with the second time of closing the order, and take the earliest time of the two as the updated time of closing the order. This completes the second update of the order end time for orders to be allocated. By analogy, the rush order end time of the allocation order is updated multiple times until no rush order information is received before the last update rush order end time. Wherein, the method for determining the end time of the last order update after the last update has been described in the first embodiment, and is not repeated here.

For example, FIG. 4 is another schematic diagram of order allocation in the embodiment of the present disclosure. As shown in FIG. 4, the server sends information about the order to be allocated at time t0, and the server receives the order rush information for the first time at time t1: order rush information A. Therefore, the server determines that the first order rush end time is based on the order rush information A. t1 '. Then, the end-of-rush time of the order to be allocated is initialized to the first end-of-rush time t1 '.

Thereafter, the server detects whether the order-receiving information is received before the first order-finishing end time t1 '. As shown in FIG. 4, the server receives the order-receiving information for the first time before the first order-finishing end time t1' (that is, the server second The received order rush information) is the order rush information B. Therefore, the server determines that the second order rush end time is t2 'according to the order rush information B. Then, the second order end time t2 'is compared with the first order end time t1', and the earlier end time is t1 ', so the first order end time of the order to be allocated is updated. Since the time for the end of the order rush at this time is already t1 ', the time for the end of the order rush to keep the order to be allocated does not change to t1'.

Thereafter, the server detects whether the order-receiving information is received before the first-order-request-end time t1 ', as shown in FIG. 4, and the server receives the third order before the first-order-requisition-end time t1' after the first update. The obtained order rush information is the order rush information C. Therefore, based on the order rush information C, the server determines that the third end time of the rush order is t3 '. Then compare the third end time of order rushing t3 'with the first end time of order rushing t1', the earlier end time is t3 ', so the second end time of order closing of the order to be allocated is updated for the second time, and the order to be allocated is updated. The end time of order grabbing was updated from t1 'to t3'.

Thereafter, the server detects whether the order-receiving information is received before the second-order-request end time t3 '. As shown in FIG. 4, the server does not receive the order-reward before the second-order-request end time t3'. Therefore, the update of the end-of-rush time of the order to be allocated is ended, the end-of-rush time of the order to be allocated is determined as t3 ', and finally, the server allocates the order at time t3'.

With reference to the above various implementations, in the embodiment of the present disclosure, the first time when the order is completed, the second time when the order is completed, and the current time when the order is completed are determined according to the following methods:

Determined according to the degree of matching between the order grab information and the information of the order to be allocated; or

It is determined according to the quantity of the order grabbing information received before the order grabbing information is received this time; or

It is determined according to the matching degree between the received order rush information and the information of the order to be allocated before the order rush information is received this time.

Among them, the matching degree is determined by at least the following parameters:

1) In the embodiment of the present disclosure, the end time of the rush order may be determined according to the matching degree between the rush order information and the information of the order to be allocated. The higher the degree of match between the order rush information and the information of the order to be allocated, the sooner the determined end time of the rush order ends. First, the matching degree between the order rush information and the information of the order to be allocated is initialized to zero, and then the order rush information is compared with the corresponding information item in the information of the order to be allocated. The greater the degree of matching, the less it is reduced or kept at zero. The information of the order to be allocated includes information items: location, specified service type, and specified service start time. The information items included in the order rush information are: location, available service types, and estimated service start time.

In addition, the degree of matching can also be determined in combination with user evaluation, which refers to the evaluation of the services provided by the users who have accepted the service to the order-seekers. If the user evaluation is high, the matching degree of the order rushing information sent by the client using the client increases; if the user evaluation is low, the matching degree of the order rushing information sent by the client using the client decreases.

Similarly, the matching degree can also be determined in combination with the credit level, which is determined according to the number and frequency of order grabbing personnel participating in the order grabbing after cancelling the order grabbing information by using the client. If the credit level is high, the matching degree of the order-robbing information sent by the client using the client is increased; when the credit level is low, the matching degree of the order-buying information sent by the client by the client is reduced.

2) In the embodiment of the present disclosure, the end time of the current rush order may also be determined according to the quantity of rush order information that has been received before the current rush order information. For the first-time order grabbing information received by the server, the end time of the first one-time order grabbing can be determined according to the matching degree between the information and the order to be allocated. Having received an order rush message, it can be determined that the second rush order end time is a time earlier than the first rush order end time; similarly, for the third rush order information received by the server, since two With regard to the order rush information, it can be determined that the third rush order end time is a time earlier than the second rush order end time.

In this way, the greater the amount of order-grabbing information that has been received before the received order-grabbing information this time, it means that more order-picking personnel have participated in the order-picking, and the rationality of order allocation has gradually improved. Order allocation is carried out as soon as possible, and the end time of the current rush order is determined to be a time that is gradually earlier than the last rush time. The timing of the end of order rush is advanced. In this way, the server can allocate orders as early as possible, on the one hand, it ensures the rationality of order allocation, and on the other hand, it improves the efficiency of order allocation.

3) In the embodiment of the present disclosure, the end time of the current rush order may also be determined according to the matching degree between the received rush order information and the information of the order to be allocated before the current rush order information is received. Before the order rush information is received this time, the higher the matching degree between the received order rush information and the information of the order to be allocated, the earlier the end of this order rush time. Because before the receipt of the order rush information, the higher the degree of matching between the received order rush information and the information of the order to be allocated, it means that there are already order rush personnel who are suitable for receiving orders to participate in the order rush. The waiting time of order-seekers, order allocation is made as soon as possible, and the end-of-scheduled order time is determined to be a time that is gradually earlier than the last order-scheduled end time, and then the method for updating the order-scheduled end-time is treated as described above The update is made to advance the end of the snap-in order for the order to be allocated. In this way, the server can allocate the order as soon as possible, on the one hand, it shortens the waiting time of the order-takers who are suitable for receiving orders, and on the other hand, improves the efficiency of order allocation.

In combination with the above embodiments, step S14 includes and is not limited to the following two embodiments:

In a first embodiment, the received order rush information is counted from the sending time of the information of the order to be allocated to the end time of the order rush of the order to be allocated; Among the order rush information, the order rush information that has the highest degree of matching with the information of the order to be allocated is determined as the target rush order information; and the order to be allocated is allocated to a sender of the target rush order information.

In a second implementation manner, the latest order grabbing information received before the end of the order grabbing order of the pending order is determined as the target order grabbing information; the pending order order is assigned to the target order grabbing order. The sender of the information.

In the embodiment of the present disclosure, the allocation of the order to be allocated may be determined from the information about the order to be allocated from the time of sending the information of the order to be allocated to the end time of the order rush. The order matching information with the highest matching degree is then allocated to the sending end of the order to be allocated to the order matching information with the highest matching degree. Alternatively, before the end time of the pending order to be allocated is determined, the server finally receives the order-buying information, and then allocates the order to be allocated to the sender of the last received order-buying information.

For example, taking FIG. 4 as an example, at time t3 ′, the matching with the information of the order to be allocated is determined according to the matching degree of the order rushing information A, the order rushing information B, and the order rushing information C respectively with the information of the order to be allocated. The highest degree is the order rush information A, and the server allocates the order to be allocated to the sender of the order rush information A, that is, the terminal A. Alternatively, at time t3 ', the server determines that the last order-receiving information received before time t3' is order-receiving information C, and the server directly allocates the order to be allocated to the sender of order-receiving information C, that is, terminal C.

An embodiment of the present disclosure further provides an order distribution device, which is applied to a server. FIG. 5 is a schematic diagram of an order distribution device according to an embodiment of the present disclosure. As shown in FIG. 5, the apparatus 500 includes:

A sending module 501, configured to send information of an order to be allocated;

A receiving module 502, configured to receive order rush information for the order to be allocated;

A determining module 503, configured to determine, according to the order rush information, the time when the rush order ends of the order to be allocated;

An allocating module 504 is configured to allocate the to-be-allocated order at the moment when the pre-order of the to-be-allocated order is completed.

The determining module is further configured to:

Optionally, the first update submodule is configured to:

Optionally, the determining module includes:

Optionally, the second update sub-module is configured to:

Optionally, the update submodule is configured to:

Optionally, the allocation module includes:

Regarding the device in the above embodiment, the specific manner in which each module performs operations has been described in detail in the embodiment of the method, and will not be described in detail here.

FIG. 6 is a block diagram of a server according to an example of the embodiment of the present disclosure. Referring to FIG. 6, the server 100 includes processors 1122, the number of which may be one or more, and a storage medium 1132 for storing a computer program executable by the processor 1122. The computer program stored in the storage medium 1132 may include one or more modules each corresponding to a set of instructions. In addition, the processor 1122 may be configured to execute the computer program to perform the above-mentioned order allocation method.

In addition, the server 100 may further include a power supply component 1126 and a communication component 1150. The power supply component 1126 may be configured to perform power management of the server 100. The communication component 1150 may be configured to implement communication of the server 100, for example, wired or wireless communication. . In addition, the server 100 may further include an input / output (I / O) interface 1158. The server 100 can operate based on an operating system stored in the memory 1132, such as Windows ServerTM, Mac OSXTM, UnixTM, LinuxTM, and the like.

In another exemplary embodiment, a computer-readable storage medium including program instructions is provided, and the program instructions implement the steps of the foregoing order allocation method when executed by a processor. For example, the computer-readable storage medium may be the above-mentioned memory 1132 including program instructions, and the above-mentioned program instructions may be executed by the processor 1122 of the server 100 to complete the above-mentioned order allocation method.

The preferred embodiments of the present disclosure have been described in detail above with reference to the accompanying drawings. However, the present disclosure is not limited to the specific details in the above embodiments. Within the scope of the technical concept of the present disclosure, various simple modifications can be made to the technical solutions of the present disclosure. These simple variations all belong to the protection scope of the present disclosure. In addition, it should be noted that the specific technical features described in the above specific embodiments can be combined in any suitable manner without contradiction. In order to avoid unnecessary repetition, the present disclosure provides various possible features. The combination is not explained separately.

In addition, various embodiments of the present disclosure can also be arbitrarily combined, as long as it does not violate the idea of the present disclosure, it should also be regarded as the content disclosed in the present disclosure.

Claims

An order allocation method includes:

Send information on orders to be allocated;

Receiving the order rush information for the order to be allocated;

Determine, according to the order rush information, the end time of the rush order of the order to be allocated;

Allocating the to-be-allocated order at the moment when the pre-order of the to-be-allocated order is completed.
The method according to claim 1, characterized in that determining the end time of the order rush based on the order rush information comprises:

Initialize the end-of-rush time of the order to be allocated as a preset time;

Detecting whether the order grabbing information is received before the preset time;

If at least one order rushing information is received before the preset time, updating the order rushing end time of the order to be allocated according to the received at least one order rushing information;

If the order rush information is not received before the preset time, then the order rush end time of the order to be allocated is determined as the preset time.
The method according to claim 2, characterized in that updating the time when the order rush end of the order to be allocated is updated according to the received at least one order rush information includes:

Determine the first end time of the order rush according to the first order rush information received before the preset time;

Update the end-of-rush time of the order to be allocated to the first end-of-rush time and the earliest end of the preset time;

Repeatedly updating the order end time of the pending order according to the new order order information received before the updated order end time, until no new order is received before the updated order end time Order information so far.
The method according to claim 1, characterized in that determining the end time of the order rush based on the order rush information comprises:

Determine the end time of the first rush order according to the received first rush order information;

Initializing the end-of-rush time of the pending order as the first end-of-rush time;

Detecting whether at least one piece of order-grabbing information is received before the first order-finishing end time;

If the at least one order rush information is received before the first order rush end time, updating the order rush end time of the order to be allocated according to the received at least one order rush information;

If no order rush information is received before the first order rush end time, the order rush end time of the to-be-allocated order is determined as the first order rush end time.
The method according to claim 4, characterized in that updating the time when the order end of the order to be allocated is updated according to the received at least one order ordering information comprises:

Determining a second time for rush order end according to the first information for rush order received before the first time for rush order end;

Update the end-of-rush time of the pending order to the earliest end time of the first end-of-rush time and the second end-of-rush time;

Repeatedly updating the order end time of the pending order according to the new order order information received before the updated order end time, until no new order is received before the updated order end time Order information so far.
The method according to claim 3 or 5, characterized in that, based on the new order grabbing information received before the updated order end time, the order end time of the order to be allocated is updated, include:

Determine the end time of the current rush order according to the new rush order information received before the updated rush order end time;

Updating the end-of-rush time of the order to be allocated to the updated end-of-rush time and the earliest end time of the current end-of-rush time.
The method according to any one of claims 3 to 6, characterized in that the first time for rushing to end the order, the second time for rushing to end the order, and the time for this time for rushing to end the order are based on any one of the following Or more identified:

The degree of matching between the order rush information received this time and the information of the order to be allocated;

The quantity of received order rush information before the order rush information is received this time;

Before the order rush information is received this time, the degree of matching between the received order rush information and the information of the order to be allocated.
The method according to claim 7, wherein the matching degree is determined based on any one or more of the following parameters:

User evaluation, the distance between the position in the order-buying information and the position in the information of the order to be allocated, and whether the type of service available in the order-buying information includes the information specified in the information of the order to be allocated A time difference between a service type, an estimated service start time in the order-buying information, and a service start time specified in the information of the order to be allocated.
The method according to claim 1, wherein the allocation of the to-be-allocated order at the end time of the preemption order of the to-be-allocated order comprises:

Counting the received order rush information from the time of sending the information of the order to be allocated to the end time of the order rush of the order to be allocated;

Determining, as the target rush order information, the rush order information that has the highest matching degree between the received rush order information and the information of the order to be allocated;

Allocating the to-be-allocated order to a sending end of the target preemption order information.
The method according to claim 1, wherein the allocation of the to-be-allocated order at the end time of the preemption order of the to-be-allocated order comprises:

Determining, as the target rush order information, the last rush order information received before the rush order end time of the order to be allocated;

Allocating the to-be-allocated order to a sending end of the target preemption order information.
An order distribution device includes:

A sending module for sending information of an order to be allocated;

A receiving module, configured to receive order rush information for the order to be allocated;

A determining module, configured to determine, according to the order rush information, the time for rush order end of the order to be allocated;

An allocation module is configured to allocate the to-be-allocated order at the moment when the order-to-be-sold order ends.
A server including:

processor;

A storage medium for storing processor-executable instructions;

Wherein, the processor is prompted by the executable instructions:

Send information on orders to be allocated;

Receiving the order rush information for the order to be allocated;

Determine, according to the order rush information, the end time of the rush order of the order to be allocated;

Allocating the to-be-allocated order at the moment when the pre-order of the to-be-allocated order is completed.
A computer-readable storage medium having computer program instructions stored thereon, characterized in that when the program instructions are executed by a processor, the steps of the method according to any one of claims 1 to 10 are implemented.