Method and system for reducing interference of channel repeated order reservation on driver

Abstract

The invention is suitable for the technical field of online car-hailing, and provides a method and system for reducing interference of channel repeated order reservation on drivers, and the method comprises the following steps: obtaining the basic feature information of an order, taking the basic feature information as a key, and querying redis; inquiring through an INCR instruction of redis, and judging whether a return value is greater than 1 or not; if not, it is indicated that there is no order with repeated basic features, the expiration time is set to be N seconds for the key of the basic feature information in redis, the order is sent normally, and N is a fixed value; if yes, indicating that orders with repeated basic characteristics exist, and calculating delay order sending time t = (value-1) * delay interval time; and putting the orders corresponding to the basic feature information and the delayed order sending time t into a delay queue. According to the invention, the occupation of channel repeated orders in the reservation order on transport capacity is reduced, and the transport capacity utilization rate is improved.

Description

Technical Field

[0001] The present invention relates to the technical field of online car-hailing, and in particular to a method and system for reducing interference to drivers caused by repeated reservation orders from channels. Background Art

[0002] There are many sources of online car-hailing orders from channel providers, such as Amap and Baidu Maps. When channel providers place orders with transport providers, they will place multiple orders with different order numbers at the same time to ensure that their orders can obtain more transport provider capacity to the maximum extent, so that channel providers can compare and select driver capacity that is more beneficial to them. Currently, transport providers judge duplicate orders based on order numbers. If the order number is the same, duplicate dispatch is prohibited within a short period of time. This judgment has the following disadvantages: 1. Not all duplicate orders can be covered by order number identification; 2. Multiple duplicate order information is pushed to drivers at the same time, which results in a poor driver experience; 3. Dispatching multiple duplicate orders at the same time will occupy the driver's capacity and cause waste. Therefore, it is necessary to provide a method and system to reduce the interference of duplicate channel reservation orders on drivers, aiming to solve the above problems. Summary of the invention

[0003] In view of the deficiencies in the prior art, the purpose of the present invention is to provide a method and system for reducing the interference of repeated channel reservation orders on drivers, so as to solve the problems existing in the above-mentioned background technology.

[0004] The present invention is implemented as follows: a method for reducing interference of repeated channel booking orders on drivers, the method comprising the following steps:

[0005] Obtain the basic characteristic information of the order, and use the basic characteristic information as the key to query redis;

[0006] Use the redis INCR command to check whether the return value is greater than 1;

[0007] If no, it means there is no order with repeated basic features, then the expiration time of the key of the basic feature information in redis is set to N seconds, and the order is dispatched normally, where N is a fixed value;

[0008] If yes, it means there are orders with repeated basic features, and the next step is executed;

[0009] Calculate the delayed dispatch time t = (value-1) × delay interval time;

[0010] Put the order corresponding to the basic characteristic information together with the delayed order dispatching time t into the delay queue;

[0011] Control the number of consumers in the delay queue. When there are consumers consuming orders in the delay queue, call the order dispatching process from the initial step.

[0012] As a further solution of the present invention: the redis is a high-performance cache container based on memory storage; the INCR instruction is used to increase the value of a key by 1. If the key does not exist, the value of the key will be set to 0 first, and then the INCR operation will be performed, and then the value after the operation will be returned.

[0013] As a further solution of the present invention: the step of calculating the delayed dispatching time t=(value-1)×delay interval time specifically includes:

[0014] Calculate the delayed dispatch time t = (value-1) × delay interval time, and determine the calculated delayed dispatch time t;

[0015] Determine whether the calculated delayed dispatch time t is greater than the maximum delay time. If not, the delayed dispatch time is t; if yes, the delayed dispatch time is the maximum delay time.

[0016] As a further solution of the present invention: the delay interval time is 15 seconds, the maximum delay time is 60 seconds, and the expiration time is 10 seconds.

[0017] Another object of the present invention is to provide a system for reducing interference to drivers caused by repeated booking orders from channels, the system comprising:

[0018] The basic feature information module is used to obtain the basic feature information of the order and use the basic feature information as a key to query redis;

[0019] INCR instruction query module, used to query through the INCR instruction of redis and determine whether the return value is greater than 1; if not, it means that there is no order with repeated basic features, then the expiration time of the key of the basic feature information in redis is set to N seconds, and the order is dispatched normally, N is a fixed value; if yes, it means that there is an order with repeated basic features, and the steps in the delayed dispatch time module are executed;

[0020] The delayed dispatch time module is used to calculate the delayed dispatch time t = (value-1) × delay interval time;

[0021] A delay queue adding module, used to put the order corresponding to the basic characteristic information together with the delayed order dispatching time t into the delay queue;

[0022] The order dispatching process calling module is used to control the number of consumers in the delay queue. When there are consumers consuming orders in the delay queue, the order dispatching process is called from the basic feature information module.

[0023] As a further solution of the present invention: the delayed dispatch time module includes:

[0024] A delay time calculation unit is used to calculate the delayed dispatch time t = (value-1) × delay interval time, and determine the calculated delayed dispatch time t;

[0025] The delay time determination unit is used to determine whether the calculated delayed dispatch time t is greater than the maximum delay time. If not, the delayed dispatch time is taken as t; if yes, the delayed dispatch time is taken as the maximum delay time.

[0026] Compared with the prior art, the present invention has the following beneficial effects:

[0027] The present invention obtains the basic characteristic information of the order, and uses the basic characteristic information as the key to query redis; through the redis INCR instruction query, it is determined whether the return value value is greater than 1; if it is, it means that there are orders with repeated basic characteristics, and the delayed dispatch time t = (value-1) × delay interval time is calculated; the order corresponding to the basic characteristic information is placed in the delay queue together with the delayed dispatch time t. In this way, it is achieved to reduce the occupation of transportation capacity by repeated orders in the channel in the reservation order, improve the utilization rate of transportation capacity, reduce the adverse effects of repeated orders on drivers, and improve the driver experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] Figure 1 A flowchart of a method for reducing interference to drivers caused by duplicate booking orders from channels.

[0029] Figure 2 A flowchart for calculating delayed dispatch time in a method for reducing interference to drivers caused by repeated channel reservation orders.

[0030] Figure 3 This is a schematic diagram of the structure of a system that reduces the interference of duplicate channel booking orders on drivers. DETAILED DESCRIPTION

[0031] In order to make the purpose, technical solution and advantages of the present invention clearer, the present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0032] The specific implementation of the present invention is described in detail below in conjunction with specific embodiments.

[0033] like Figure 1 As shown, an embodiment of the present invention provides a method for reducing interference of repeated channel booking orders to drivers, and the method includes the following steps:

[0034] S100, obtaining basic characteristic information of the order, and using the basic characteristic information as a key to query redis;

[0035] S200, query through the INCR instruction of redis to determine whether the return value value is greater than 1; if not, it means that there is no order with repeated basic characteristics, then set the expiration time of the key of the basic characteristic information in redis to N seconds, and dispatch the order normally, N is a fixed value; if yes, it means that there is an order with repeated basic characteristics, and execute the next step;

[0036] S300, calculating the delayed dispatching time t = (value-1) × delay interval time;

[0037] S400, placing the order corresponding to the basic characteristic information together with the delayed order dispatching time t into a delay queue;

[0038] S500, controlling the number of consumers in the delay queue, and when there are consumers consuming orders in the delay queue, calling the order dispatching process from the initial step.

[0039] In the embodiment of the present invention, although the order numbers of repeated orders are different, their basic characteristic information is still the same, so the present invention is a method that can determine whether it is a repeated order by the basic characteristics of the order, and the basic characteristic information includes: the reserved boarding and alighting address, the reserved car time, the order time, the reserved car model, and the reserved passenger's mobile phone number. Redis in the embodiment of the present invention is a high-performance cache container based on memory storage; the INCR instruction is used to increase the value of the key by 1. If the key does not exist, the key value will be set to 0 first, and then the INCR operation will be performed, and then the value after the operation will be returned.

[0040] like Figure 2 As shown, as a preferred embodiment of the present invention, the step of calculating the delayed dispatch time t=(value-1)×delay interval time specifically includes:

[0041] S301, calculating the delayed dispatching time t=(value-1)×delay interval time, and determining the calculated delayed dispatching time t;

[0042] S302, determine whether the calculated delayed dispatch time t is greater than the maximum delay time. If not, the delayed dispatch time is taken as t; if yes, the delayed dispatch time is taken as the maximum delay time.

[0043] In the embodiment of the present invention, the delay interval is 15 seconds, the maximum delay time is 60 seconds, and the expiration time N is 10 seconds. In this way, within 10 seconds, if there is an order with the same basic characteristics that is repeatedly dispatched, the subsequent order will be placed in the delay queue and delayed for 15 seconds before dispatching. For each additional order with repeated basic characteristics dispatched within 10 seconds, the delay time will double, that is, the first repeated order dispatch is delayed by 15 seconds, the second repeated order is delayed by 30 seconds, and so on, and 60 seconds is the maximum delay time (the time can be adjusted according to the situation). At the same time, the number of consumers in the delay queue is controlled so that the orders with repeated basic characteristics enter a slow dispatching scene. In this way, there is only one order for repeated basic characteristics in dispatching within a certain time period, that is, there is only one order with the same basic characteristics pushed to the driver within a certain period of time. In this way, while reducing the capacity occupied by repeated orders, the driver experience can also be improved; and because the reservation order is a reservation for the passenger to use the car in the future, entering the slow dispatching scene can also ensure that the order continues to be dispatched to a certain extent. In this way, the capacity occupied by duplicate orders from channels in appointment lists can be reduced, the utilization rate of transport capacity can be improved, the adverse effects of duplicate orders on drivers can be reduced, and the driver experience can be improved.

[0044] like Figure 3 As shown, an embodiment of the present invention further provides a system for reducing interference of repeated channel booking orders to drivers, the system comprising:

[0045] The basic feature information module 100 is used to obtain the basic feature information of the order and use the basic feature information as a key to query redis;

[0046] INCR instruction query module 200, used to query through the INCR instruction of redis and determine whether the return value value is greater than 1; if not, it means that there is no order with repeated basic features, then the expiration time of the key of the basic feature information in redis is set to N seconds, and the order is dispatched normally, N is a fixed value; if yes, it means that there is an order with repeated basic features, and the steps in the delayed dispatch time module 300 are executed;

[0047] The delayed dispatching time module 300 is used to calculate the delayed dispatching time t=(value-1)×delay interval time;

[0048] A delay queue adding module 400 is used to put the order corresponding to the basic characteristic information together with the delayed order dispatching time t into the delay queue;

[0049] The order dispatching process calling module 500 is used to control the number of consumers in the delay queue. When there are consumers who consume orders in the delay queue, the order dispatching process is called from the basic feature information module 100.

[0050] As a preferred embodiment of the present invention, the delayed dispatching time module 300 includes:

[0051] A delay time calculation unit is used to calculate the delayed dispatch time t = (value-1) × delay interval time, and determine the calculated delayed dispatch time t;

[0052] The delay time determination unit is used to determine whether the calculated delayed dispatch time t is greater than the maximum delay time. If not, the delayed dispatch time is taken as t; if yes, the delayed dispatch time is taken as the maximum delay time.

[0053] The above only describes in detail the preferred embodiments of the present invention, which is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

[0054] It should be understood that, although each step in the flow chart of each embodiment of the present invention is shown in sequence according to the indication of the arrow, these steps are not necessarily performed in sequence according to the order indicated by the arrow. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be performed in other orders. Moreover, at least a portion of the steps in each embodiment may include a plurality of sub-steps or a plurality of stages, and these sub-steps or stages are not necessarily performed at the same time, but can be performed at different times, and the execution order of these sub-steps or stages is not necessarily performed in sequence, but can be performed in turn or alternately with at least a portion of other steps or sub-steps or stages of other steps.

[0055] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the program can be stored in a non-volatile computer-readable storage medium. When the program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

[0056] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the disclosure in the specification and examples. This application is intended to cover any variations, uses or adaptations of the present disclosure, which follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present disclosure are indicated by the claims.

Claims

1. A method for reducing interference to drivers caused by repeated booking orders from channels, characterized in that: The method comprises the following steps: Obtain the basic characteristic information of the order, and use the basic characteristic information as the key to query redis; Use the INCR command of redis to query and determine whether the return value is greater than 1; if not, it means there is no order with repeated basic features, then set the expiration time of the key of the basic feature information in redis to N seconds, and dispatch the order normally, where N is a fixed value; if yes, it means there is an order with repeated basic features, and execute the next step; Calculate the delayed dispatch time t = (value-1) × delay interval time; Put the order corresponding to the basic characteristic information together with the delayed order dispatching time t into the delay queue; Control the number of consumers in the delay queue. When there are consumers consuming orders in the delay queue, call the order dispatching process from the initial step.

2. The method for reducing interference to drivers caused by repeated channel booking orders according to claim 1, characterized in that: The redis is a high-performance cache container based on memory storage; the INCR instruction is used to increase the value of a key by 1. If the key does not exist, the value of the key will be set to 0 first, and then the INCR operation will be performed, and then the value after the operation will be returned.

3. The method for reducing interference to drivers caused by repeated channel booking orders according to claim 1, characterized in that: The step of calculating the delayed dispatching time t=(value-1)×delay interval time specifically includes: Calculate the delayed dispatch time t = (value-1) × delay interval time, and determine the calculated delayed dispatch time t; Determine whether the calculated delayed dispatch time t is greater than the maximum delay time. If not, the delayed dispatch time is t; if yes, the delayed dispatch time is the maximum delay time.

4. The method for reducing interference to drivers caused by repeated channel booking orders according to claim 3, characterized in that: The delay interval is 15 seconds, the maximum delay is 60 seconds, and the expiration time is 10 seconds.

5. A system for reducing interference to drivers caused by repeated booking orders from channels, characterized in that: The system comprises: The basic feature information module is used to obtain the basic feature information of the order and use the basic feature information as a key to query redis; INCR instruction query module, used to query through the INCR instruction of redis and determine whether the return value is greater than 1; if not, it means that there is no order with repeated basic features, then the expiration time of the key of the basic feature information in redis is set to N seconds, and the order is dispatched normally, N is a fixed value; if yes, it means that there is an order with repeated basic features, and the steps in the delayed dispatch time module are executed; The delayed dispatch time module is used to calculate the delayed dispatch time t = (value-1) × delay interval time; A delay queue adding module, used to put the order corresponding to the basic characteristic information together with the delayed order dispatching time t into the delay queue; The order dispatching process calling module is used to control the number of consumers in the delay queue. When there are consumers consuming orders in the delay queue, the order dispatching process is called from the basic feature information module.

6. The system for reducing interference to drivers caused by repeated channel booking orders according to claim 5, characterized in that: The delayed dispatch time module includes: A delay time calculation unit is used to calculate the delayed dispatch time t = (value-1) × delay interval time, and determine the calculated delayed dispatch time t; The delay time determination unit is used to determine whether the calculated delayed dispatch time t is greater than the maximum delay time. If not, the delayed dispatch time is taken as t; if yes, the delayed dispatch time is taken as the maximum delay time.

Images