WO2019237693A1 - 订单分配 - Google Patents
订单分配 Download PDFInfo
- Publication number
- WO2019237693A1 WO2019237693A1 PCT/CN2018/121210 CN2018121210W WO2019237693A1 WO 2019237693 A1 WO2019237693 A1 WO 2019237693A1 CN 2018121210 W CN2018121210 W CN 2018121210W WO 2019237693 A1 WO2019237693 A1 WO 2019237693A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- order
- rush
- information
- time
- allocated
- Prior art date
Links
- 238000000034 method Methods 0.000 claims abstract description 46
- 238000011156 evaluation Methods 0.000 claims description 9
- 238000004590 computer program Methods 0.000 claims description 5
- 238000004891 communication Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 10
- 238000005516 engineering process Methods 0.000 description 7
- 238000001514 detection method Methods 0.000 description 2
- 238000012790 confirmation Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
- G06Q30/0637—Approvals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/02—Reservations, e.g. for tickets, services or events
- G06Q10/025—Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Definitions
- the present disclosure relates to the field of information processing technology, and in particular, to the distribution of network orders.
- 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.
- the present disclosure provides an order allocation method, device, server, and storage medium.
- a first aspect of an embodiment of the present disclosure provides an order allocation method, where the method includes:
- determining the time when the order rush is completed based on the order rush information includes:
- the order rush end time of the order to be allocated is determined as the preset time.
- updating the order end time of the order to be allocated according to the received at least one order rush information includes:
- determining the end time of the order rush according to the received order rush information includes:
- the order rush end time of the to-be-allocated order is determined as the first order rush end time.
- updating the order end time of the order to be allocated according to the received at least one order rush information includes:
- 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:
- 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 matching degree is determined based on any one or more of the following parameters:
- 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.
- allocating the to-be-allocated order at the moment when the order-rushing end of the to-be-allocated order includes:
- allocating the to-be-allocated order at the moment when the order-rushing end of the to-be-allocated order includes:
- 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.
- 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:
- the order rush end time of the order to be allocated is determined as the preset time.
- the first update submodule is configured to:
- 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.
- the second update sub-module is configured to:
- the update submodule is configured to:
- 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:
- the matching degree is determined based on any one or more of the following parameters:
- 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 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.
- 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:
- a storage medium for storing processor-executable instructions
- the processor is configured to:
- 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.
- 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.
- 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.
- 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.
- FIG. 1 is a schematic diagram of an implementation environment involved in an order allocation method according to an embodiment of the present disclosure.
- 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.
- RFID radio frequency identification
- IrDA infrared data association
- UWB ultra-wideband
- Bluetooth Bluetooth
- 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.
- 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.
- a user when he 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.
- 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.
- 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.
- the client 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.
- the "rush order information for the order to be allocated" is hereinafter referred to as "rush order information”.
- the server determines, based on the order rush information, the end time of the rush order for the order to be allocated.
- 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.
- 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.
- 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.
- 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.
- a short time for example, less than 15 minutes
- 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.
- 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.
- step S13 includes and is not limited to the following two implementations.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- the server receives one or more order grabbing information before a preset time
- 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.
- 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.
- 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.
- 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.
- FIG. 3 is a schematic diagram of order allocation in the embodiment of the present disclosure.
- 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 '.
- the server detects whether or not order-receiving information has been received before the order-finishing end time t1 'after the first update.
- 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 '.
- 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'.
- 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'.
- step S13 includes the following steps:
- the order rush end time of the to-be-allocated order is determined as the first order rush end time.
- initialization is performed at the end of the rush order to be allocated according to the rush order information received for the first time.
- 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.
- 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.
- 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.
- 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.
- 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:
- 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.
- 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.
- 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.
- 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.
- FIG. 4 is another schematic diagram of order allocation in the embodiment of the present disclosure.
- 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 '.
- the server detects whether the order-receiving information is received before the first order-finishing end time t1 '.
- 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'.
- 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'.
- 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'.
- 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:
- the matching degree is determined by at least the following parameters:
- 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 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 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- step S14 includes and is not limited to the following two embodiments:
- 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.
- 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 is determined as the target order grabbing information; the pending order order is assigned to the target order grabbing order.
- 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.
- 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.
- 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.
- 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.
- 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 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 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:
- the order rush end time of the order to be allocated is determined as the preset time.
- the first update submodule is configured to:
- 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.
- the second update sub-module is configured to:
- the update submodule is configured to:
- 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 matching degree is determined based on any one or more of the following parameters:
- 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 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.
- 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.
- FIG. 6 is a block diagram of a server according to an example of the embodiment of the present disclosure.
- 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.
- the processor 1122 may be configured to execute the computer program to perform the above-mentioned order allocation method.
- 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.
- 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.
- 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.
- 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.
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Accounting & Taxation (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Finance (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- General Factory Administration (AREA)
Abstract
本公开涉及一种订单分配方法、装置、服务器以及存储介质。所述方法包括:发送待分配订单的信息;接收针对所述待分配订单的抢单信息;根据所述抢单信息,确定所述待分配订单的抢单结束时刻;在所述待分配订单的抢单结束时刻,对所述待分配订单进行分配。
Description
相关申请的交叉引用
本专利申请要求于2018年6月12日提交的、申请号为201810603020.6、发明名称为“订单分配方法、装置、服务器以及存储介质”的中国专利申请的优先权,该申请的全文以引用的方式并入本文中。
本公开涉及信息处理技术领域,具体地,涉及网络订单的分配。
随着互联网经济的发展,越来越多的用户选择通过网络获取自己所需的服务。在用户需要某项服务时,通过网络下单,相应地,服务提供商通过网络获取订单。在服务提供商获取到订单后,通过服务器将该订单分配给相应的服务人员,以使服务人员为用户提供服务。
可以针对待分配订单设置一个固定的抢单结束时刻,在该固定的时刻之前,服务人员可以抢单,在该固定的时刻,从所有参与抢单的服务人员中选择合适的服务人员,然后将该待分配订单分配给所选择的服务人员。以打车订单分配为例,在固定的时刻之前,司机可以抢单,在该固定的时刻,从所有参与抢单的司机中确定合适的司机,然后将打车订单分配给该司机。
发明内容
为克服相关技术中存在的问题,本公开提供一种订单分配方法、装置、服务器以及存储介质。
为了实现上述目的,本公开实施例第一方面提供一种订单分配方法,所述方法包括:
发送待分配订单的信息;
接收针对所述待分配订单的抢单信息;
根据所述抢单信息,确定所述待分配订单的抢单结束时刻;
在所述待分配订单的抢单结束时刻,对所述待分配订单进行分配。
可选地,根据所述抢单信息,确定所述待分配订单的抢单结束时刻,包括:
将所述待分配订单的抢单结束时刻初始化为预设时刻;
检测在所述预设时刻之前是否接收到抢单信息;
若在所述预设时刻之前接收到至少一个抢单信息,则根据接收到的所述至少一个抢单信息对所述待分配订单的抢单结束时刻进行更新;
若在所述预设时刻之前未接收到抢单信息,则将所述待分配订单的抢单结束时刻确定为所述预设时刻。
可选地,根据接收到的所述至少一个抢单信息对所述待分配订单的抢单结束时刻进行更新,包括:
根据在所述预设时刻之前接收到的第一个抢单信息,确定第一抢单结束时刻;
将所述待分配订单的抢单结束时刻更新为所述第一抢单结束时刻和所述预设时刻中最早结束的时刻;
反复根据在更新后的抢单结束时刻之前接收到的新的抢单信息,对所述待分配订单的抢单结束时刻进行更新,直到在所述更新后的抢单结束时刻之前未接收到新的抢单信息为止。
可选地,根据接收到的抢单信息,确定所述待分配订单的抢单结束时刻,包括:
根据接收到的第一个抢单信息,确定第一抢单结束时刻;
将所述待分配订单的抢单结束时刻初始化为所述第一抢单结束时刻;
检测在所述第一抢单结束时刻之前是否接收到至少一个抢单信息;
若在所述第一抢单结束时刻之前接收到所述至少一个抢单信息,则根据接收到的所述至少一个抢单信息对所述待分配订单的抢单结束时刻进行更新;
若在所述第一抢单结束时刻之前未接收到抢单信息,则将所述待分配订单的抢单结束时刻确定为所述第一抢单结束时刻。
可选地,根据接收到的所述至少一个抢单信息对所述待分配订单的抢单结束时刻进行更新,包括:
根据在所述第一抢单结束时刻之前接收到的第一个抢单信息,确定第二抢单结束时刻;
将所述待分配订单的抢单结束时刻更新为所述第一抢单结束时刻和所述第二抢单结束时刻中最早结束的时刻;
反复根据在更新后的抢单结束时刻之前接收到的新的抢单信息,对所述待分配订单的抢单结束时刻进行更新,直到在所述更新后的抢单结束时刻之前未接收到新的抢单信息为止。
可选地,根据在更新后的抢单结束时刻之前接收到的新的抢单信息,对所述待分配订单的抢单结束时刻进行更新,包括:
根据在所述更新后的抢单结束时刻之前接收到的新的抢单信息,确定本次抢单结束时刻;
将所述待分配订单的抢单结束时刻更新为所述更新后的抢单结束时刻和所述本次抢单结束时刻中最早结束的时刻。
可选地,所述第一抢单结束时刻、所述第二抢单结束时刻以及所述本次抢单结束时刻均是基于以下任意一项或多项确定的:
本次接收到的抢单信息与所述待分配订单的信息的匹配度;
在本次接收到所述抢单信息之前,已接收到的抢单信息的数量;
在本次接收到所述抢单信息之前,已接收到的抢单信息与所述待分配订单的信息的匹配度。
可选地,所述匹配度是基于以下任意一项或多项参数确定的:
用户评价、所述抢单信息中的位置与所述待分配订单的信息中的位置之间的距离、所述抢单信息中可提供的服务类型是否包括所述待分配订单的信息中指定的服务类型、所述抢单信息中预计的服务开始时间与所述待分配订单的信息中指定的服务开始时间之间的时间差。
可选地,在所述待分配订单的抢单结束时刻,对所述待分配订单进行分配,包括:
统计自所述待分配订单的信息的发送时刻至所述待分配订单的抢单结束时刻期间,已接收到的所述抢单信息;
将已接收到的所述抢单信息中与所述待分配订单的信息的匹配度最高的抢单信息,确定为目标抢单信息;
将所述待分配订单分配给所述目标抢单信息的发送端。
可选地,在所述待分配订单的抢单结束时刻,对所述待分配订单进行分配,包括:
将在所述待分配订单的抢单结束时刻之前最后一次接收到的抢单信息,确定为目标抢单信息;
将所述待分配订单分配给所述目标抢单信息的发送端。
本公开实施例第二方面提供一种订单分配装置,所述装置包括:
发送模块,用于发送待分配订单的信息;
接收模块,用于接收针对所述待分配订单的抢单信息;
确定模块,用于根据所述抢单信息,确定所述待分配订单的抢单结束时刻;
分配模块,用于在所述待分配订单的抢单结束时刻,对所述待分配订单进行分配。
可选地,所述待分配订单的抢单结束时刻被初始化为预设时刻;所述确定模块包括:
第一检测子模块,用于检测在所述预设时刻之前是否接收到抢单信息;
第一更新子模块,用于若在所述预设时刻之前接收到至少一个抢单信息,则根据接收到的所述至少一个抢单信息对所述待分配订单的抢单结束时刻进行更新;
所述确定模块还用于:
若在所述预设时刻之前未接收到抢单信息,则将所述待分配订单的抢单结束时刻确定为所述预设时刻。
可选地,所述第一更新子模块用于:
根据在所述预设时刻之前接收到的第一个抢单信息,确定第一抢单结束时刻;
将所述待分配订单的抢单结束时刻更新为所述第一抢单结束时刻和所述预设时刻中最早结束的时刻;
反复根据在更新后的抢单结束时刻之前接收到的新的抢单信息,对所述待分配订单 的抢单结束时刻进行更新,直到在所述更新后的抢单结束时刻之前未接收到新的抢单信息为止。
可选地,所述确定模块包括:
第一确定子模块,用于根据接收到的第一个抢单信息,确定第一抢单结束时刻;
初始化子模块,用于将所述待分配订单的抢单结束时刻初始化为所述第一抢单结束时刻;
第二检测子模块,用于检测在所述第一抢单结束时刻之前是否接收到至少一个抢单信息;
第二更新子模块,用于若在所述第一抢单结束时刻之前接收到所述至少一个抢单信息,则根据接收到的所述至少一个抢单信息对所述待分配订单的抢单结束时刻进行更新;
第二确定子模块,用于若在所述第一抢单结束时刻之前未接收到抢单信息,则将所述待分配订单的抢单结束时刻确定为所述第一抢单结束时刻。
可选地,所述第二更新子模块用于:
根据在所述第一抢单结束时刻之前接收到的第一个抢单信息,确定第二抢单结束时刻;
将所述待分配订单的抢单结束时刻更新为所述第一抢单结束时刻和所述第二抢单结束时刻中最早结束的时刻;
反复根据在更新后的抢单结束时刻之前接收到的新的抢单信息,对所述待分配订单的抢单结束时刻进行更新,直到在所述更新后的抢单结束时刻之前未接收到新的抢单信息为止。
可选地,所述更新子模块用于:
根据在所述更新后的抢单结束时刻之前接收到的新的抢单信息,确定本次抢单结束时刻;
将所述待分配订单的抢单结束时刻更新为所述更新后的抢单结束时刻和所述本次抢单结束时刻中最早结束的时刻。
可选地,所述第一抢单结束时刻、所述第二抢单结束时刻以及所述本次抢单结束时 刻均是基于以下任意一项或多项确定的:
本次接收到的抢单信息与所述待分配订单的信息的匹配度;
在本次接收到所述抢单信息之前,已接收到的抢单信息的数量;
在本次接收到所述抢单信息之前,已接收到的抢单信息与所述待分配订单的信息的匹配度。
可选地,所述匹配度是基于以下任意一项或多项参数确定的:
用户评价、所述抢单信息中的位置与所述待分配订单的信息中的位置之间的距离、所述抢单信息中可提供的服务类型是否包括所述待分配订单的信息中指定的服务类型、所述抢单信息中预计的服务开始时间与所述待分配订单的信息中指定的服务开始时间之间的时间差。
可选地,所述分配模块包括:
统计子模块,用于统计自所述待分配订单的信息的发送时刻至所述待分配订单的抢单结束时刻期间,已接收到的所述抢单信息;
第三确定子模块,用于将已接收到的所述抢单信息中与所述待分配订单的信息的匹配度最高的抢单信息,确定为目标抢单信息;
第一分配子模块,用于将所述待分配订单分配给所述目标抢单信息的发送端。
可选地,所述分配模块包括:
第四确定子模块,用于将在所述待分配订单的抢单结束时刻之前最后一次接收到的抢单信息,确定为目标抢单信息;
第二分配子模块,用于将所述待分配订单分配给所述目标抢单信息的发送端。
本公开实施例第三方面提供一种服务器,包括:
处理器;
用于存储处理器可执行指令的存储介质;
其中,所述处理器,用于:
发送待分配订单的信息;
接收针对所述待分配订单的抢单信息;
根据所述抢单信息,确定所述待分配订单的抢单结束时刻;
在所述待分配订单的抢单结束时刻,对所述待分配订单进行分配。
本公开第四方面提供一种计算机可读存储介质,其上存储有计算机程序指令,所述程序指令被处理器执行时实现本公开第一方面所述方法的步骤。
采用上述技术方案,根据针对待分配订单的抢单信息,确定待分配订单的抢单结束时刻,而不是将待分配订单的抢单结束时刻设置为固定的时刻。由于在根据抢单信息而确定的抢单结束时刻,进行订单分配,所以进行订单分配的时间点受针对待分配订单的抢单信息的影响,不再是固定的时刻,因而该订单分配方法更加灵活,提高了订单分配的灵活性。
并且,由于针对待分配订单的抢单信息是反映实际抢单过程的重要因素,所以采用该订单分配方法,根据针对待分配订单的抢单信息而确定的抢单结束时刻,比相关技术中固定的时刻更加合理,进而实现了在合理的时间点进行订单分配,避免了参与抢单的服务人员不必要的等待时间,提高了订单分配的效率。
本公开的其他特征和优点将在随后的具体实施方式部分予以详细说明。
附图是用来提供对本公开的进一步理解,并且构成说明书的一部分,与下面的具体实施方式一起用于解释本公开,但并不构成对本公开的限制。
图1是本公开实施例提供的订单分配方法涉及的实施环境的示意图。
图2是本公开实施例提供的一种订单分配方法的流程图。
图3是本公开实施例提供的一种订单分配方法的示意图。
图4是本公开实施例提供的一种订单分配方法的另一示意图。
图5是本公开实施例提供的一种订单分配装置的示意图。
图6本公开实施例示例提供的一种服务器的框图。
以下结合附图对本公开的具体实施方式进行详细说明。应当理解的是,此处所描述的具体实施方式仅用于说明和解释本公开,并不用于限制本公开。
在对本公开实施例提供的订单分配方法进行说明之前,首先对本公开实施例提供的订单分配方法涉及的实施环境进行说明。图1是本公开实施例提供的订单分配方法涉及的实施环境的示意图。如图1所示,该实施环境包括服务器100和客户端200,客户端200的数量可以是一个或多个,图1以客户端的数量是3个为例。
客户端200与服务器100通信连接,该通信连接可以是有线的或无线的。服务器100和客户端200可以均接入基于通信标准的无线网络,如WiFi、2G或3G网络,或它们的组合。或者,服务器100和客户端200可以均配置近场通信(NFC)模块,以促进短程通信。例如,还可基于射频识别(RFID)技术,红外数据协会(IrDA)技术,超宽带(UWB)技术,蓝牙(BT)技术和其他技术来实现短程通信。
客户端200可以是移动电话,计算机,数字广播终端,消息收发设备,游戏控制台,平板设备,医疗设备,健身设备,个人数字助理等。
以下对本公开实施例提供的订单分配方法进行说明。本公开实施例提供的订单分配方法应用于服务器,例如图1中的服务器100。图2是本公开实施例提供的一种订单分配方法的流程图。如图2所示,该方法包括以下步骤。
步骤S11:发送待分配订单的信息。
步骤S12:接收针对所述待分配订单的抢单信息。
步骤S13:根据所述抢单信息,确定所述待分配订单的抢单结束时刻。
步骤S14:在所述待分配订单的抢单结束时刻,对所述待分配订单进行分配。
本公开实施例中,用户在需要获取某项服务时,通过网络下单,进而产生一个待分配订单。该待分配订单通过网络被传输给服务器。服务器在检测到该待分配订单时,向与该服务器通信连接的一个或多个客户端发送待分配订单的信息。
服务器可以广播的方式向与其通信连接的一个或多个客户端发送待分配订单的信息,即,将待分配订单的信息广播给与其通信连接的一个或多个客户端,也可以将待分配订单的信息分别发送给与其通信连接的一个或多个客户端。具体如何发送待分配订单的信息,本公开实施例不做具体限定。
为了向用户提供高效高质的服务,服务器可以向多个客户端发送待分配订单的信息,以使得尽量多的服务人员参与抢单,进而选择合适的服务人员为用户提供服务。
在服务器发送待分配订单的信息之后,客户端接收到该待分配订单的信息。使用客户端的服务人员如果想要抢单,可以通过自己所使用的客户端发送抢单信息。如此,服务器接收到针对待分配订单的抢单信息。为描述简洁,下文将“针对待分配订单的抢单信息”简称为“抢单信息”。
然后,服务器根据抢单信息,确定待分配订单的抢单结束时刻。不同于将待分配订单的抢单结束时刻设置为固定的时刻,本公开实施例提出,抢单信息将影响待分配订单的抢单结束时刻,并将抢单信息作为确定待分配订单的抢单结束时刻的考虑因素。示例地,抢单信息的数量、抢单信息与待分配订单的匹配度以及服务器接收到抢单信息的时刻中至少一者,都将决定待分配订单的抢单结束时刻。
示例地,通常将每个待分配订单的抢单结束时刻默认设置为自发送待分配订单的信息的发送时刻起经过15分钟。也就是说,在服务器发送待分配订单的信息之后经过15分钟就进行订单分配。无论服务器在15分钟内接收到的抢单信息与待分配订单的信息的匹配度如何,也无论服务器在15分钟内接收到多少个抢单信息,服务器都必须在15分钟后的结束时刻进行订单分配。
而采用本公开实施例提供的订单分配方法,服务器根据接收到的抢单信息,动态地确定待分配订单的抢单结束时刻。如果接收到的抢单信息与待分配订单的匹配度较高,则可以将待分配订单的抢单结束时刻确定为一个较早的时刻(例如:早于15分钟),进而提前进行订单分配,提高订单分配效率,缩短参与抢单的服务人员的等待时间。
或者,如果服务器在发送待分配订单的信息之后,在较短时间(例如:短于15分钟)内接收到的抢单信息的数量达到预设数量。根据预设数量个抢单信息,足以合理地确定出一个时刻(例如:早于15分钟的一个时刻)作为待分配订单的抢单结束时刻。则服务器可以提前进行订单分配,提高订单分配效率,缩短参与抢单的服务人员的等待时间。
采用上述技术方案,根据针对待分配订单的抢单信息,动态地确定待分配订单的抢单结束时刻,而不是将待分配订单的抢单结束时刻设置为固定的时刻。由于在根据抢单信息而确定的抢单结束时刻,进行订单分配,所以进行订单分配的时间点受针对待分配订单的抢单信息的影响,不再是固定的时刻,因而该订单分配方法更加灵活,提高了订单分配的灵活性。
并且,由于针对待分配订单的抢单信息是反映实际抢单过程的重要因素,因此根据针对待分配订单的抢单信息而确定的抢单结束时刻,比固定的抢单结束时刻更加合理,进而实现了在合理的时间点进行订单分配,避免了参与抢单的服务人员不必要的等待时间,提高了订单分配的效率。
本公开实施例中,步骤S13有且不限于以下两种实施方式。
在第一种实施方式中,所述待分配订单的抢单结束时刻被初始化为预设时刻;步骤S13包括以下步骤:检测在所述预设时刻之前是否接收到所述抢单信息;若在所述预设时刻之前接收到所述抢单信息,则基于所述抢单信息对所述待分配订单的抢单结束时刻进行更新,并将所述待分配订单的抢单结束时刻确定为更新后的抢单结束时刻;若在所述预设时刻之前未接收到所述抢单信息,则将所述待分配订单的抢单结束时刻确定为所述预设时刻。
在第一种实施方式中,服务器在步骤S11发送待分配订单的信息的同时,将待分配订单的抢单结束时刻初始化为预设时刻。也就是说,服务器预设一段等待时间,最晚在该等待时间到达时进行订单分配。在本示例中,服务器可根据在预设时刻之前接收到的抢单信息,动态地调整待分配订单的抢单结束时刻,服务器在预设时刻之后接收到的抢单信息不会影响待分配订单的抢单结束时刻的确定。
在实际抢单过程中,可能出现的情况是:服务器发送抢单信息之后,抢单人员均不想参与抢单,因而均未通过客户端发出抢单信息,导致服务器在预设时刻之前未接收到抢单信息。在此情况下,将待分配订单的抢单结束时刻确定为预设时刻。然后服务器在预设时刻进行订单分配。
当然,在实际抢单过程中,还可能出现的情况是:服务器发送抢单信息之后,一个或多个抢单人员均想参与抢单,因而均通过客户端发出抢单信息,导致服务器在预设时刻之前接收到一个或多个抢单信息。在此情况下,服务器依次根据接收到的各个抢单信息,对待分配订单的抢单结束时刻进行更新,然后将待分配订单的抢单结束时刻确定为更新后的抢单结束时刻。也就是说,如果服务器在预设时刻之前接收到抢单信息,则待分配订单的抢单结束时刻可能不再为预设时刻,而是更新后的抢单结束时刻。
其中,服务器根据在预设时刻之前接收到的一个或多个抢单信息,对待分配订单的抢单结束时刻进行更新,包括以下步骤:根据在所述预设时刻之前首次接收到的抢单信息,确定第一抢单结束时刻;将所述待分配订单的抢单结束时刻更新为所述第一抢单结 束时刻和所述预设时刻中最早结束的时刻;反复根据在更新后的抢单结束时刻之前接收到的新的抢单信息,对所述待分配订单的抢单结束时刻进行更新,直到在更新后的抢单结束时刻之前未接收到新的抢单信息为止;并将所述待分配订单的抢单结束时刻确定为最终的更新后的抢单结束时刻。
其中,反复根据在更新后的抢单结束时刻之前接收到的新的抢单信息,对所述待分配订单的抢单结束时刻进行更新,包括:根据在上一次更新后的抢单结束时刻之前接收到的新的抢单信息,确定本次抢单结束时刻;将所述待分配订单的抢单结束时刻更新为所述上一次更新后的抢单结束时刻和所述本次抢单结束时刻中最早结束的时刻。
本公开实施例中,针对服务器在预设时刻之前接收到一个或多个抢单信息的情况,首先根据在预设时刻之前首次接收到的抢单信息,确定第一抢单结束时刻。然后将第一抢单结束时刻与预设时刻相比,将两者中最早结束的时刻作为更新后的抢单结束时刻。以此完成对待分配订单的抢单结束时刻的第一次更新。
接着,如果在第一次更新后的抢单结束时刻之前,服务器第二次接收到抢单信息,则继续根据第二次接收到的抢单信息,确定第二抢单结束时刻。然后将第二抢单结束时刻与第一次更新后的抢单结束时刻相比,将两者中最早结束的时刻作为更新后的抢单结束时刻。以此完成对待分配订单的抢单结束时刻的第二次更新。以此类推,对待分配订单的抢单结束时刻进行多次更新,直到在最后一次更新后的抢单结束时刻之前未接收到抢单信息为止。
其中,最后一次更新后的抢单结束时刻是按照以下方法确定的:在每次完成对待分配订单的抢单结束时刻的更新之后,检测在本次更新后的抢单结束时刻之前是否接收到新的抢单信息;如果在本次更新后的抢单结束时刻之前接收到了新的抢单信息,则继续对待分配订单的抢单结束时刻进行更新;如果在本次更新后的抢单结束时刻之前未接收到新的抢单信息,则本次更新后的抢单结束时刻即为最后一次更新后的抢单结束时刻。在此情况下,结束对待分配订单的抢单结束时刻的更新,并将待分配订单的抢单结束时刻确定为最后一次更新后的抢单结束时刻。最后,服务器在最后一次更新后的抢单结束时刻,进行订单分配。
示例地,图3是本公开实施例中订单分配的示意图。如图3所示,服务器在t0时刻发送待分配订单信息,预设时刻为t0’,服务器在预设时刻t0’之前首次接收到抢单信息A。因此,服务器根据抢单信息A,确定第一抢单结束时刻t1’。然后将第一抢单结束时刻t1’与预设时刻t0’相比,较早结束的时刻是第一抢单结束时刻t1’,因此对待分配订单 的抢单结束时刻进行第一次更新,将待分配订单的抢单结束时刻更新为第一抢单结束时刻t1’。
此后,服务器检测在第一次更新后的抢单结束时刻t1’之前是否接收到抢单信息。如图3所示,服务器在第一次更新后的抢单结束时刻t1’之前接收到新的抢单信息B。因此,服务器根据抢单信息B,确定第二抢单结束时刻t2’。然后将第二抢单结束时刻t2’与第一抢单结束时刻t1’相比,较早结束的时刻是第一抢单结束时刻t1’,因此对待分配订单的抢单结束时刻进行第二次更新,将待分配订单的抢单结束时刻保持为第一抢单结束时刻t1’。
此后,服务器检测在第二次更新后的抢单结束时刻t1’之前是否接收到抢单信息,如图3所示,服务器在第二次更新后的抢单结束时刻t1’之前接收到新的抢单信息C。因此,服务器根据抢单信息C,确定第三抢单结束时刻是t3’。然后将第三抢单结束时刻t3’与第一抢单结束时刻t1’相比,较早结束的时刻是第三抢单结束时刻t3’,因此对待分配订单的抢单结束时刻进行第三次更新,将待分配订单的抢单结束时刻从第一抢单结束时刻t1’更新为第三抢单结束时刻t3’。
此后,服务器检测在第三次更新后的抢单结束时刻t3’之前是否接收到抢单信息,如图3所示,服务器在第三次更新后的抢单结束时刻t3’之前未接收到抢单信息,因此,结束对待分配订单的抢单结束时刻的更新,将待分配订单的抢单结束时刻确定为t3’,最后,服务器在t3’时刻进行订单分配。
在第二种实施方式中,步骤S13包括以下步骤:
根据首次接收到的所述抢单信息,确定第一抢单结束时刻;
将所述待分配订单的抢单结束时刻初始化为所述第一抢单结束时刻;
检测在所述第一抢单结束时刻之前是否接收到新的抢单信息;
若在所述第一抢单结束时刻之前接收到新的抢单信息,则根据所述新的抢单信息对所述待分配订单的抢单结束时刻进行更新,并将所述待分配订单的抢单结束时刻确定为更新后的抢单结束时刻;
若在所述第一抢单结束时刻之前未接收到新的抢单信息,则将所述待分配订单的抢单结束时刻确定为所述第一抢单结束时刻。
在第二种实施方式中,根据第一次接收到的抢单信息,对待分配订单的抢单结束时 刻进行初始化。具体地,服务器根据第一次接收到的抢单信息,确定第一抢单结束时刻,然后将待分配订单的抢单结束时刻初始化为第一抢单结束时刻。与第一种实施方式中的预设时刻类似,服务器最晚在第一抢单结束时刻进行订单分配。服务器仅根据在第一抢单结束时刻之前接收到的抢单信息,确定待分配订单的抢单结束时刻,服务器在第一抢单结束时刻之后接收到的抢单信息不会影响待分配订单的抢单结束时刻的确定。
与第一种实施方式的不同之处在于,待分配订单的抢单结束时刻被初始化为一个与服务器首次接收到的抢单信息相关的时刻,如果服务器首次接收到的抢单信息与待分配订单信息的匹配度较高,则可以将待分配订单的抢单结束时刻初始化为一个较早结束的时刻(例如:一个早于预设时刻的时刻),进而为提前进行订单分配奠定基础。
与第一种实施方式类似,如果服务器在第一抢单结束时刻之前未接收到抢单信息,则将待分配订单的抢单结束时刻确定为第一抢单结束时刻。然后服务器在第一抢单结束时刻进行订单分配。也就是说,如果服务器在发送待分配订单的信息之后,仅接收到一个抢单信息,则根据该抢单信息确定一个抢单结束时刻,然后在根据该抢单信息而确定的抢单结束时刻,进行订单分配。
如果服务器在第一抢单结束时刻之前接收到抢单信息,也就是说,服务器在首次接收到抢单信息之后,还接收到抢单信息一次或多次。在此情况下,服务器根据在第一抢单结束时刻之前首次接收到的抢单信息(也即服务器第二次接收到的抢单信息),对待分配订单的抢单结束时刻进行更新,然后将待分配订单的抢单结束时刻确定为更新后的抢单结束时刻。也就是说,如果服务器在第一抢单结束时刻之前接收到抢单信息,则待分配订单的抢单结束时刻可能不再为第一抢单结束时刻,而是更新后的抢单结束时刻。
其中,服务器根据在第一抢单结束时刻之前接收到所述抢单信息,对待分配订单的抢单结束时刻进行更新,包括:
根据在所述第一抢单结束时刻之前首次接收到的抢单信息,确定第二抢单结束时刻;
将所述待分配订单的抢单结束时刻更新为所述第一抢单结束时刻和所述第二抢单结束时刻中最早结束的时刻;
反复执行以下步骤:
确定在更新后的所述抢单结束时刻前是否再次接收到抢单信息,
根据再次接收到的抢单信息,对所述待分配订单的抢单结束时刻进行更新,
直到在更新后的所述抢单结束时刻之前未接收到抢单信息为止;
将所述待分配订单的抢单结束时刻确定为更新后的所述抢单结束时刻。
其中,根据再次接收到的抢单信息,对所述待分配订单的抢单结束时刻进行更新,已在第一种实施方式中进行说明,在此不再赘述。
与第一种实施方式类似,针对服务器在第一抢单结束时刻之前接收到一个或多个抢单信息的情况,首先根据在第一抢单结束时刻之前首次接收到的抢单信息(即服务器第二次接收到的抢单信息),确定第二抢单结束时刻。然后将第二抢单结束时刻与第一抢单结束时刻相比,将两者中最早结束的时刻作为更新后的抢单结束时刻。以此完成对待分配订单的抢单结束时刻的第一次更新。
接着,如果在第二次更新后的抢单结束时刻之前服务器第三次接收到抢单信息,则继续根据第三次接收到的抢单信息,确定第三抢单结束时刻。然后将第三抢单结束时刻与第二抢单结束时刻相比,将两者中最早结束的时刻作为更新后的抢单结束时刻。以此完成对待分配订单的抢单结束时刻的第二次更新。以此类推,对待分配订单的抢单结束时刻进行多次更新,直到在最后一次更新后的抢单结束时刻之前未接收到抢单信息为止。其中,最后一次更新后的抢单结束时刻的确定方法已在第一种实施方式中说明,在此就不再赘述。
示例地,图4是本公开实施例中订单分配的另一示意图。如图4所示,服务器在t0时刻发送待分配订单的信息,服务器在t1时刻首次接收到抢单信息:抢单信息A,因此,服务器根据抢单信息A,确定第一抢单结束时刻是t1’。然后将待分配订单的抢单结束时刻初始化为第一抢单结束时刻t1’。
此后,服务器检测在第一抢单结束时刻t1’之前是否接收到抢单信息,如图4所示,服务器在第一抢单结束时刻t1’之前首次接收到的抢单信息(即服务器第二次接收到的抢单信息)是抢单信息B,因此,服务器根据抢单信息B,确定第二抢单结束时刻是t2’。然后将第二抢单结束时刻t2’与第一抢单结束时刻t1’相比,较早结束的时刻是t1’,因此对待分配订单的抢单结束时刻进行第一次更新。由于此时的抢单结束时刻已经为t1’,因此保持该待分配订单的抢单结束时刻不变为t1’。
此后,服务器检测在第一次更新后的抢单结束时刻t1’之前是否接收到抢单信息,如图4所示,服务器在第一次更新后的抢单结束时刻t1’之前第三次接收到的抢单信息是抢单信息C,因此,服务器根据抢单信息C,确定第三抢单结束时刻是t3’。然后将第三 抢单结束时刻t3’与第一抢单结束时刻t1’相比,较早结束的时刻是t3’,因此对待分配订单的抢单结束时刻进行第二次更新,将待分配订单的抢单结束时刻从t1’更新为t3’。
此后,服务器检测在第二次更新后的抢单结束时刻t3’之前是否接收到抢单信息,如图4所示,服务器在第二次更新后的抢单结束时刻t3’之前未接收到抢单信息,因此,结束对待分配订单的抢单结束时刻的更新,将待分配订单的抢单结束时刻确定为t3’,最后,服务器在t3’时刻进行订单分配。
结合以上各个实施方式,本公开实施例中,第一抢单结束时刻、第二抢单结束时刻以及本次抢单结束时刻均是按照以下方法确定的:
根据所述抢单信息与所述待分配订单的信息的匹配度确定;或
根据在本次接收到所述抢单信息之前,已接收到的所述抢单信息的数量确定;或
根据在本次接收到所述抢单信息之前,已接收到的所述抢单信息与所述待分配订单的信息的匹配度确定。
其中,匹配度至少由以下参数确定:
用户评价、所述抢单信息中的位置与所述待分配订单的信息中的位置之间的距离、所述抢单信息中可提供的服务类型是否包括所述待分配订单的信息中指定的服务类型、所述抢单信息中预计的服务开始时间与所述待分配订单的信息中指定的服务开始时间之间的时间差。
1)本公开实施例中,可以根据抢单信息与待分配订单的信息的匹配度,确定抢单结束时刻。抢单信息与待分配订单的信息的匹配度越高,确定出的抢单结束时刻越早结束。首先,将抢单信息与待分配订单的信息的匹配度初始化为零,然后将抢单信息与待分配订单的信息中的相应信息项进行比较,差异越小,则匹配度越增加;差异越大,匹配度越减少或保持为零。其中,待分配订单的信息包括的信息项为:位置、指定的服务类型、指定的服务开始时间,抢单信息包括的信息项为:位置、可提供的服务类型、预计的服务开始时间。
此外,还可以结合用户评价确定匹配度,用户评价是指已接受服务的用户对参与抢单的抢单人员提供的服务所做出的评价。用户评价高,则该抢单人员使用客户端发出的抢单信息的匹配度增加;用户评价低,则该抢单人员使用客户端发出的抢单信息的匹配度减少。
类似地,还可以结合信用等级确定匹配度,信用等级是根据参与抢单的抢单人员在使用客户端发出抢单信息后又取消抢单的次数和频率确定的。信用等级高,则该抢单人员使用客户端发出的抢单信息的匹配度增加;信用等级低,则该抢单人员使用客户端发出的抢单信息的匹配度减少。
2)本公开实施例中,还可以根据本次接收到的抢单信息之前已接收到的抢单信息的数量,确定本次抢单结束时刻。对于服务器第一次接收到的抢单信息,可以根据该抢单信息与待分配订单的信息的匹配度,确定第一抢单结束时刻;对于服务器第二次接收到的抢单信息,由于之前已接收到一个抢单信息,可以确定第二抢单结束时刻为比第一抢单结束时刻提前的一个时刻;同理,对于服务器第三次接收到的抢单信息,由于之前已接收到两个抢单信息,可以确定第三抢单结束时刻为比第二抢单结束时刻提前的一个时刻。
采用这样的方式,在本次接收到的抢单信息之前已接收到的抢单信息的数量越多,则说明有越多的抢单人员已经参与抢单,订单分配的合理性逐渐提升,为了尽快进行订单分配,将本次抢单结束时刻确定为相比上一次抢单结束时刻逐渐提前的一个时刻,然后按照上述对待分配订单的抢单结束时刻的更新方法进行更新,使得待分配订单的抢单结束时刻提前,如此,服务器可以尽早进行订单分配,一方面保证了订单分配的合理性,另一方面也提高了订单分配效率。
3)本公开实施例中,还可以根据在本次接收到抢单信息之前,已接收到的抢单信息与待分配订单的信息的匹配度,确定本次抢单结束时刻。在本次接收到抢单信息之前,已接收到的抢单信息与待分配订单的信息的匹配度越高,本次抢单结束时刻越提前。因为在本次接收到抢单信息之前,已接收到的抢单信息与待分配订单的信息的匹配度越高,则说明已有适合接单的抢单人员参与抢单,为了减少适合接单的抢单人员的等待时间,尽快进行订单分配,将本次抢单结束时刻确定为相比上一次抢单结束时刻逐渐提前的一个时刻,然后按照上述对待分配订单的抢单结束时刻的更新方法进行更新,使得待分配订单的抢单结束时刻提前,如此,服务器可以尽早进行订单分配,一方面缩短了适合接单的抢单人员的等待时间,另一方面提高了订单分配效率。
结合以上各个实施方式,步骤S14有且不限于以下两种实施方式:
在第一种实施方式中,统计自所述待分配订单的信息的发送时刻至所述待分配订单的抢单结束时刻期间,已接收到的所述抢单信息;将已接收到的所述抢单信息中与所述待分配订单的信息匹配度最高的抢单信息,确定为目标抢单信息;将所述待分配订单分 配给所述目标抢单信息的发送端。
在第二种实施方式中,将在所述待分配订单的抢单结束时刻之前最后一次接收到的抢单信息,确定为目标抢单信息;将所述待分配订单分配给所述目标抢单信息的发送端。
本公开实施例中,对待分配订单的分配,可以从自待分配订单的信息的发送时刻至待分配订单的抢单结束时刻期间,已接收到的抢单信息中确定与待分配订单的信息的匹配度最高的抢单信息,然后将待分配订单分配给该匹配度最高的抢单信息的发送端。或者,确定在待分配的抢单结束时刻之前,服务器最后接收到的抢单信息,然后将待分配订单分配给该最后接收到的抢单信息的发送端。
示例地,以图4为例,在t3’时刻时,根据抢单信息A、抢单信息B以及抢单信息C分别与待分配订单的信息的匹配度,确定与待分配订单的信息的匹配度最高的是抢单信息A,则服务器将待分配订单分配给抢单信息A的发送端,即终端A。或者,在t3’时刻时,服务器确定在t3’时刻之前最后一次接收到的抢单信息是抢单信息C,则服务器直接将待分配订单分配给抢单信息C的发送端,即终端C。
本公开实施例还提供一种订单分配装置,应用于服务器。图5是本公开实施例提供的订单分配装置的示意图。如图5所示,该装置500包括:
发送模块501,用于发送待分配订单的信息;
接收模块502,用于接收针对所述待分配订单的抢单信息;
确定模块503,用于根据所述抢单信息,确定所述待分配订单的抢单结束时刻;
分配模块504,用于在所述待分配订单的抢单结束时刻,对所述待分配订单进行分配。
可选地,所述待分配订单的抢单结束时刻被初始化为预设时刻;所述确定模块包括:
第一检测子模块,用于检测在所述预设时刻之前是否接收到抢单信息;
第一更新子模块,用于若在所述预设时刻之前接收到至少一个抢单信息,则根据接收到的所述至少一个抢单信息对所述待分配订单的抢单结束时刻进行更新;
所述确定模块还用于:
若在所述预设时刻之前未接收到抢单信息,则将所述待分配订单的抢单结束时刻确定为所述预设时刻。
可选地,所述第一更新子模块用于:
根据在所述预设时刻之前接收到的第一个抢单信息,确定第一抢单结束时刻;
将所述待分配订单的抢单结束时刻更新为所述第一抢单结束时刻和所述预设时刻中最早结束的时刻;
反复根据在更新后的抢单结束时刻之前接收到的新的抢单信息,对所述待分配订单的抢单结束时刻进行更新,直到在所述更新后的抢单结束时刻之前未接收到新的抢单信息为止。
可选地,所述确定模块包括:
第一确定子模块,用于根据接收到的第一个抢单信息,确定第一抢单结束时刻;
初始化子模块,用于将所述待分配订单的抢单结束时刻初始化为所述第一抢单结束时刻;
第二检测子模块,用于检测在所述第一抢单结束时刻之前是否接收到至少一个抢单信息;
第二更新子模块,用于若在所述第一抢单结束时刻之前接收到所述至少一个抢单信息,则根据接收到的所述至少一个抢单信息对所述待分配订单的抢单结束时刻进行更新;
第二确定子模块,用于若在所述第一抢单结束时刻之前未接收到抢单信息,则将所述待分配订单的抢单结束时刻确定为所述第一抢单结束时刻。
可选地,所述第二更新子模块用于:
根据在所述第一抢单结束时刻之前接收到的第一个抢单信息,确定第二抢单结束时刻;
将所述待分配订单的抢单结束时刻更新为所述第一抢单结束时刻和所述第二抢单结束时刻中最早结束的时刻;
反复根据在更新后的抢单结束时刻之前接收到的新的抢单信息,对所述待分配订单的抢单结束时刻进行更新,直到在所述更新后的抢单结束时刻之前未接收到新的抢单信息为止。
可选地,所述更新子模块用于:
根据在所述更新后的抢单结束时刻之前接收到的新的抢单信息,确定本次抢单结束时刻;
将所述待分配订单的抢单结束时刻更新为所述更新后的抢单结束时刻和所述本次抢单结束时刻中最早结束的时刻。
可选地,所述第一抢单结束时刻、所述第二抢单结束时刻以及所述本次抢单结束时刻均是基于以下任意一项或多项确定的:
本次接收到的抢单信息与所述待分配订单的信息的匹配度;
在本次接收到所述抢单信息之前,已接收到的抢单信息的数量;
在本次接收到所述抢单信息之前,已接收到的抢单信息与所述待分配订单的信息的匹配度。
可选地,所述匹配度是基于以下任意一项或多项参数确定的:
用户评价、所述抢单信息中的位置与所述待分配订单的信息中的位置之间的距离、所述抢单信息中可提供的服务类型是否包括所述待分配订单的信息中指定的服务类型、所述抢单信息中预计的服务开始时间与所述待分配订单的信息中指定的服务开始时间之间的时间差。
可选地,所述分配模块包括:
统计子模块,用于统计自所述待分配订单的信息的发送时刻至所述待分配订单的抢单结束时刻期间,已接收到的所述抢单信息;
第三确定子模块,用于将已接收到的所述抢单信息中与所述待分配订单的信息的匹配度最高的抢单信息,确定为目标抢单信息;
第一分配子模块,用于将所述待分配订单分配给所述目标抢单信息的发送端。
可选地,所述分配模块包括:
第四确定子模块,用于将在所述待分配订单的抢单结束时刻之前最后一次接收到的抢单信息,确定为目标抢单信息;
第二分配子模块,用于将所述待分配订单分配给所述目标抢单信息的发送端。
关于上述实施例中的装置,其中各个模块执行操作的具体方式已经在有关该方法的实施例中进行了详细描述,此处将不做详细阐述说明。
图6本公开实施例示例提供的一种服务器的框图。参照图6,服务器100包括处理器1122,其数量可以为一个或多个,以及存储介质1132,用于存储可由处理器1122执行的计算机程序。存储介质1132中存储的计算机程序可以包括一个或一个以上的每一个对应于一组指令的模块。此外,处理器1122可以被配置为执行该计算机程序,以执行上述的订单分配方法。
另外,服务器100还可以包括电源组件1126和通信组件1150,该电源组件1126可以被配置为执行服务器100的电源管理,该通信组件1150可以被配置为实现服务器100的通信,例如,有线或无线通信。此外,该服务器100还可以包括输入/输出(I/O)接口1158。服务器100可以操作基于存储在存储器1132的操作***,例如Windows ServerTM,Mac OS XTM,UnixTM,LinuxTM等等。
在另一示例性实施例中,还提供了一种包括程序指令的计算机可读存储介质,该程序指令被处理器执行时实现上述的订单分配方法的步骤。例如,该计算机可读存储介质可以为上述包括程序指令的存储器1132,上述程序指令可由服务器100的处理器1122执行以完成上述的订单分配方法。
以上结合附图详细描述了本公开的优选实施方式,但是,本公开并不限于上述实施方式中的具体细节,在本公开的技术构思范围内,可以对本公开的技术方案进行多种简单变型,这些简单变型均属于本公开的保护范围。另外需要说明的是,在上述具体实施方式中所描述的各个具体技术特征,在不矛盾的情况下,可以通过任何合适的方式进行组合,为了避免不必要的重复,本公开对各种可能的组合方式不再另行说明。
此外,本公开的各种不同的实施方式之间也可以进行任意组合,只要其不违背本公开的思想,其同样应当视为本公开所公开的内容。
Claims (13)
- 一种订单分配方法,包括:发送待分配订单的信息;接收针对所述待分配订单的抢单信息;根据所述抢单信息,确定所述待分配订单的抢单结束时刻;在所述待分配订单的抢单结束时刻,对所述待分配订单进行分配。
- 根据权利要求1所述的方法,其特征在于,根据所述抢单信息,确定所述待分配订单的抢单结束时刻,包括:将所述待分配订单的抢单结束时刻初始化为预设时刻;检测在所述预设时刻之前是否接收到抢单信息;若在所述预设时刻之前接收到至少一个抢单信息,则根据接收到的所述至少一个抢单信息对所述待分配订单的抢单结束时刻进行更新;若在所述预设时刻之前未接收到抢单信息,则将所述待分配订单的抢单结束时刻确定为所述预设时刻。
- 根据权利要求2所述的方法,其特征在于,根据接收到的所述至少一个抢单信息对所述待分配订单的抢单结束时刻进行更新,包括:根据在所述预设时刻之前接收到的第一个抢单信息,确定第一抢单结束时刻;将所述待分配订单的抢单结束时刻更新为所述第一抢单结束时刻和所述预设时刻中最早结束的时刻;反复根据在更新后的抢单结束时刻之前接收到的新的抢单信息,对所述待分配订单的抢单结束时刻进行更新,直到在所述更新后的抢单结束时刻之前未接收到新的抢单信息为止。
- 根据权利要求1所述的方法,其特征在于,根据所述抢单信息,确定所述待分配订单的抢单结束时刻,包括:根据接收到的第一个抢单信息,确定第一抢单结束时刻;将所述待分配订单的抢单结束时刻初始化为所述第一抢单结束时刻;检测在所述第一抢单结束时刻之前是否接收到至少一个抢单信息;若在所述第一抢单结束时刻之前接收到所述至少一个抢单信息,则根据接收到的所述至少一个抢单信息对所述待分配订单的抢单结束时刻进行更新;若在所述第一抢单结束时刻之前未接收到抢单信息,则将所述待分配订单的抢单结束时刻确定为所述第一抢单结束时刻。
- 根据权利要求4所述的方法,其特征在于,根据接收到的所述至少一个抢单信息对所述待分配订单的抢单结束时刻进行更新,包括:根据在所述第一抢单结束时刻之前接收到的第一个抢单信息,确定第二抢单结束时刻;将所述待分配订单的抢单结束时刻更新为所述第一抢单结束时刻和所述第二抢单结束时刻中最早结束的时刻;反复根据在更新后的抢单结束时刻之前接收到的新的抢单信息,对所述待分配订单的抢单结束时刻进行更新,直到在所述更新后的抢单结束时刻之前未接收到新的抢单信息为止。
- 根据权利要求3或5所述的方法,其特征在于,根据在所述更新后的抢单结束时刻之前接收到的新的抢单信息,对所述待分配订单的抢单结束时刻进行更新,包括:根据在所述更新后的抢单结束时刻之前接收到的新的抢单信息,确定本次抢单结束时刻;将所述待分配订单的抢单结束时刻更新为所述更新后的抢单结束时刻和所述本次抢单结束时刻中最早结束的时刻。
- 根据权利要求3-6任一所述的方法,其特征在于,所述第一抢单结束时刻、所述第二抢单结束时刻以及所述本次抢单结束时刻均是基于以下任意一项或多项确定的:本次接收到的抢单信息与所述待分配订单的信息的匹配度;在本次接收到所述抢单信息之前,已接收到的抢单信息的数量;在本次接收到所述抢单信息之前,已接收到的抢单信息与所述待分配订单的信息的匹配度。
- 根据权利要求7所述的方法,其特征在于,所述匹配度是基于以下任意一项或多项参数确定的:用户评价、所述抢单信息中的位置与所述待分配订单的信息中的位置之间的距离、所述抢单信息中可提供的服务类型是否包括所述待分配订单的信息中指定的服务类型、所述抢单信息中预计的服务开始时间与所述待分配订单的信息中指定的服务开始时间之间的时间差。
- 根据权利要求1所述的方法,其特征在于,在所述待分配订单的抢单结束时刻,对所述待分配订单进行分配,包括:统计自所述待分配订单的信息的发送时刻至所述待分配订单的抢单结束时刻期间,已接收到的所述抢单信息;将已接收到的所述抢单信息中与所述待分配订单的信息的匹配度最高的抢单信息,确定为目标抢单信息;将所述待分配订单分配给所述目标抢单信息的发送端。
- 根据权利要求1所述的方法,其特征在于,在所述待分配订单的抢单结束时刻,对所述待分配订单进行分配,包括:将在所述待分配订单的抢单结束时刻之前最后一次接收到的抢单信息,确定为目标抢单信息;将所述待分配订单分配给所述目标抢单信息的发送端。
- 一种订单分配装置,包括:发送模块,用于发送待分配订单的信息;接收模块,用于接收针对所述待分配订单的抢单信息;确定模块,用于根据所述抢单信息,确定所述待分配订单的抢单结束时刻;分配模块,用于在所述待分配订单的抢单结束时刻,对所述待分配订单进行分配。
- 一种服务器,包括:处理器;用于存储处理器可执行指令的存储介质;其中,所述处理器被所述可执行指令促使:发送待分配订单的信息;接收针对所述待分配订单的抢单信息;根据所述抢单信息,确定所述待分配订单的抢单结束时刻;在所述待分配订单的抢单结束时刻,对所述待分配订单进行分配。
- 一种计算机可读存储介质,其上存储有计算机程序指令,其特征在于,所述程序指令被处理器执行时实现权利要求1至10任一项所述方法的步骤。
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810603020.6 | 2018-06-12 | ||
CN201810603020.6A CN109118032B (zh) | 2018-06-12 | 2018-06-12 | 订单分配方法、装置、服务器以及存储介质 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2019237693A1 true WO2019237693A1 (zh) | 2019-12-19 |
Family
ID=64821871
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2018/121210 WO2019237693A1 (zh) | 2018-06-12 | 2018-12-14 | 订单分配 |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN109118032B (zh) |
WO (1) | WO2019237693A1 (zh) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111260253A (zh) * | 2019-11-29 | 2020-06-09 | 平安银行股份有限公司 | 信息发送方法、装置、计算机设备及存储介质 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105139228A (zh) * | 2015-08-20 | 2015-12-09 | 北京嘀嘀无限科技发展有限公司 | 一种订单分配的方法及装置 |
CN106296086A (zh) * | 2016-08-04 | 2017-01-04 | 温泉 | 一种商家参与配送员抢单的方法及*** |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080059273A1 (en) * | 2006-02-21 | 2008-03-06 | Dynamic Intelligence Inc. | Strategic planning |
CN104183118B (zh) * | 2014-08-19 | 2016-08-24 | 北京嘀嘀无限科技发展有限公司 | 基于拍卖模式获得乘客最优接驾司机的派单*** |
CN105117842A (zh) * | 2015-08-20 | 2015-12-02 | 北京嘀嘀无限科技发展有限公司 | 订单推送方法及装置 |
CN107767197B (zh) * | 2016-08-16 | 2021-06-04 | 北京嘀嘀无限科技发展有限公司 | 一种订单分配的方法及服务器 |
-
2018
- 2018-06-12 CN CN201810603020.6A patent/CN109118032B/zh active Active
- 2018-12-14 WO PCT/CN2018/121210 patent/WO2019237693A1/zh active Application Filing
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105139228A (zh) * | 2015-08-20 | 2015-12-09 | 北京嘀嘀无限科技发展有限公司 | 一种订单分配的方法及装置 |
CN106296086A (zh) * | 2016-08-04 | 2017-01-04 | 温泉 | 一种商家参与配送员抢单的方法及*** |
Also Published As
Publication number | Publication date |
---|---|
CN109118032A (zh) | 2019-01-01 |
CN109118032B (zh) | 2024-07-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11880752B2 (en) | Systems and methods for objective-based scoring using machine learning techniques | |
US20210282068A1 (en) | Wireless beacon devices for use in managing transportation service terminals | |
CN106781663B (zh) | 用于处理停车位预约信息的***和方法 | |
US12039070B2 (en) | Systems and methods for dynamic queue control using machine learning techniques | |
US9940171B2 (en) | Iterative and hierarchical processing of request partitions | |
JP2020181596A (ja) | 範囲の限られた送信によるサービス提供者の挙動の決定 | |
US20210110417A1 (en) | Dynamic bidding determination using machine-learning models | |
US20140156514A1 (en) | Mobile Payment Method, Device and System for Server and Client | |
JP2023544509A (ja) | バッチにおいてホームデバイスを設定する方法及びデバイス | |
WO2019237693A1 (zh) | 订单分配 | |
TWI811558B (zh) | 資訊處理方法、裝置、設備及電腦可讀存儲介質 | |
CN104809239A (zh) | 一种仪器预约登记的方法及其管理平台 | |
WO2018195872A1 (zh) | 上行资源获取方法、装置及计算机可读存储介质 | |
US8855693B2 (en) | Method and apparatus for controlling wireless devices | |
US9854035B2 (en) | Maintaining state synchronization of an application between computing devices as well as maintaining state synchronization of common information between different applications without requiring periodic synchronization | |
KR101815159B1 (ko) | 환자 이송을 위한 배정 시스템 및 그 방법 | |
CN107734634B (zh) | 传感器注册方法、装置及*** | |
CA2985186C (en) | Method and apparatus for selecting a service instance | |
WO2018205095A1 (zh) | 资源配置的方法及装置 | |
JP2015226178A (ja) | 無線lan通信システムおよび無線lan通信方法 | |
US12003596B2 (en) | Location-based task execution for enhanced data access | |
KR101621691B1 (ko) | 비콘 장치의 식별자 설정 방법 | |
CN105874772A (zh) | Ktv内手机提醒方法及*** | |
CN117540980A (zh) | 订单分配方法、订单分配结果展示方法、装置 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 18922913 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 18922913 Country of ref document: EP Kind code of ref document: A1 |