A transparent order-taking method for online car-hailing with drivers queuing

Abstract

The present invention belongs to the field of online car-hailing, and specifically discloses a method for transparently accepting orders for online car-hailing with drivers queuing, comprising the following steps: S1: separating the relationship between driver service quality and order acceptance strategy. The driver service quality is independent of the order acceptance strategy, which can enhance the driver's trust in the platform's dispatching of orders. The online car-hailing platform sets the driver's service quality only in relation to the commission ratio and driver reward, and has nothing to do with the order acceptance strategy. Specifically, if the driver's service quality is good, the online car-hailing platform's commission ratio is low, and the driver can participate in higher-level driver reward activities. The present invention dispatches orders through driver queues in a single area and surrounding areas, has a simple algorithm model and high execution efficiency, and at the same time eliminates the relationship between order judgment and driver service quality, prompting drivers to improve service quality. Compared with existing technical methods, the present invention enhances driver satisfaction and trust in the online car-hailing platform.

Description

Technical Field

[0001] The present invention relates to the field of online car-hailing, and in particular to a method for transparently accepting orders for online car-hailing with drivers queuing. Background Art

[0002] In the field of online ride-hailing, passengers call online ride-hailing cars through apps, and the online ride-hailing platform matches nearby drivers. If there are drivers nearby, the platform notifies the driver to accept the order. The online ride-hailing platform will assign service points to the driver based on the driver's service level, and determine the driver to pick up the ride based on comprehensive factors such as service points and order-pickup distance. Some drivers have low order rates for a long time due to service points, order-pickup distance, and unfair scheduling algorithms, which makes drivers believe that order acceptance is not transparent, and drivers cannot know whether there are passengers nearby. They lack trust in the online ride-hailing platform, which leads to dissatisfaction and complaints.

[0003] Based on this, the present invention discloses a method for transparently accepting orders for online ride-hailing vehicles with drivers queuing to solve the problem of online ride-hailing drivers accepting orders. The method can accept orders transparently and improve the driver's satisfaction. Summary of the invention

[0004] The purpose of the present invention is to provide a method for transparently accepting orders for online ride-hailing vehicles with drivers queuing, so as to solve the problems raised in the above-mentioned background technology.

[0005] To achieve the above object, the present invention provides the following technical solution: a method for transparently accepting orders for online car-hailing vehicles with drivers queuing, comprising the following steps:

[0006] S1: Separating the relationship between driver service quality and order-taking strategy. The fact that driver service quality is independent of order-taking strategy can improve drivers’ trust in the platform’s dispatching. The online ride-hailing platform sets the driver’s service quality only in relation to the commission ratio and driver rewards, and has nothing to do with the order-taking strategy. Specifically, if the driver’s service quality is good, the online ride-hailing platform’s commission ratio is low, and the driver can participate in higher-level driver reward activities.

[0007] S2: Divide the order-receiving areas and establish order-receiving queues. Divide the city into regular hexagonal grids of equal size, where each hexagon is surrounded by 6 hexagons. For each area x, establish an order-receiving queue Q(x). The set of neighboring areas of area x is denoted as L(x). For a fixed area, its neighbor set is unchanged. Set the rules for drivers to join the queue, the rules for drivers to leave the queue, the rules for drivers to view the current area, and the rules for drivers to view the surrounding areas.

[0008] S3: Driver queue order acceptance rules. Passenger a initiates a taxi order. According to the starting point of a’s order, find the grid number x where the starting point is located, check whether there is a driver in Q(x). If there is a driver, remove the first driver in the queue. The first driver in the queue Q(x) is recorded as F(x), and assign the driver to the passenger.

[0009] S4: Rules for drivers to queue for orders in adjacent areas. If there is no corresponding driver in the queue Q(x) to which the grid number x where passenger a is located belongs, then select the first driver F(y) in each adjacent area y from the 6 adjacent areas of the set L(x) of adjacent areas of x. There are at most 6 drivers. Check the location of these drivers from the passenger's starting point and select the nearest driver as the dispatch driver. The last found area is p, and the driver is F(p). Driver F(p) is removed from the queue Q(p), and p is the dispatch driver who meets the conditions.

[0010] Preferably, in step S1, the driver's commission rate and the level of activities that can be participated in are updated once a week to motivate the driver to work hard to improve the service level.

[0011] Preferably, in step S2, the driver joins the queue rule: when the driver enters area x, he is added to the end of queue Q(x); the driver leaves the queue rule: when the driver leaves area x and enters area y, he is first removed from queue Q(x) and then added to the end of queue Q(y). The driver can see the current position of the order in area y. If the driver returns the car and stops accepting orders, he will be removed from the queue in the area where the driver is located.

[0012] Preferably, in step S2, the driver checks the current area rule so that the driver can see the position where he is in the first order to receive the order, as well as the area number; the driver checks the surrounding area situation rule so that the driver can see the number of drivers queuing in the 6 adjacent areas in L(x). If there are too many drivers queuing and the waiting time for the order is long, the driver can independently judge whether to switch areas.

[0013] Preferably, in step S4, the area p and driver F(p) finally found need to satisfy the following conditions: 1. p∈L(x); 3. distance(F(p), F(a))≤distance(F(y), F(a)); distance is the function for calculating the distance between the passenger and the driver.

[0014] Compared with the prior art, the beneficial effects of the present invention are: the present invention dispatches orders through driver queues in a single area and surrounding areas, has a simple algorithm model and high execution efficiency, and at the same time eliminates the relationship between order judgment and driver service quality, prompting drivers to improve service quality. Compared with existing technical methods, it improves drivers' satisfaction and trust in the online car-hailing platform. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1 is a flow chart of the present invention;

[0016] Figure 2 This is a regular hexagonal grid diagram that divides the city according to the present invention. DETAILED DESCRIPTION

[0017] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0018] like Figure 1 The present invention provides a method for transparently accepting online car-hailing orders with drivers queuing, comprising the following steps:

[0019] S1: Separate the relationship between driver service quality and order-taking strategy. The independence of driver service quality and order-taking strategy can improve the driver's trust in the platform's dispatching. The online ride-hailing platform sets the driver's service quality only in relation to the commission rate and driver rewards, and has nothing to do with the order-taking strategy. Specifically, if the driver's service quality is good, the online ride-hailing platform's commission rate is low, and the driver can participate in higher-level driver reward activities. The driver's commission rate and the level of activities that can be participated in are updated once a week to encourage drivers to work hard to improve their service level.

[0020] S2: Divide the order-accepting area and establish the order-accepting queue. Divide the city into regular hexagonal grids of equal size, where each hexagon is surrounded by 6 hexagons, such as Figure 2 As shown, the hexagon around grid number 1 is 2-7. For each area x, establish an order queue Q(x); the neighbor area set of area x is recorded as L(x). For a fixed area, its neighbor set is unchanged. Set the rules for drivers to join the queue, the rules for drivers to leave the queue, the rules for drivers to view the current area, and the rules for drivers to view the surrounding areas.

[0021] The driver joins the queue rule when entering area x, and is added to the end of queue Q(x); the driver leaves the queue rule when leaving area x and entering area y, and is first removed from queue Q(x) and then added to the end of queue Q(y). The driver can see the number of drivers currently accepting orders in area y. If the driver stops the car and stops accepting orders, he will be removed from the queue in the area where the driver is located; the driver checks the current area rule that the driver can see the number of drivers currently accepting orders and the area number; the driver checks the surrounding area rule that the driver can see the number of drivers queuing in the six adjacent areas in L(x). If there are too many drivers queuing and the waiting time is long, the driver can decide whether to switch areas on his own.

[0022] S3: Driver queue order acceptance rules. Passenger a initiates a taxi order. According to the starting point of a’s order, find the grid number x where the starting point is located, check whether there is a driver in Q(x). If there is a driver, remove the first driver in the queue. The first driver in the queue Q(x) is recorded as F(x), and assign the driver to the passenger.

[0023] S4: Rules for drivers to receive orders in adjacent areas of queues. If there is no corresponding driver in the queue Q(x) to which the grid number x of passenger a belongs, then select the first driver F(y) of each adjacent area y from the 6 adjacent areas of the set of adjacent areas L(x) of x. There are at most 6 drivers. Check the location of these drivers from the passenger's starting point and select the nearest driver as the dispatch driver. The last found area is p and the driver is F(p). The last found area p and driver F(p) need to meet the following conditions: 1. p∈L(x); 2. 3. distance(F(p), F(a))≤distance(F(y), F(a)); distance is the function for calculating the distance between the passenger and the driver. Driver F(p) is removed from the queue Q(p), and p is the driver who meets the conditions for dispatching.

[0024] The present invention provides a method for transparently accepting orders for online ride-hailing vehicles with drivers queuing to solve the problem of transparent dispatching orders for drivers. The method dispatches orders through driver queues in a single area and surrounding areas, has a simple algorithm model and high execution efficiency, and at the same time eliminates the relationship between order judgment and driver service quality, thereby prompting drivers to improve their service quality. Compared with existing technical methods, the method improves drivers' satisfaction and trust in the online ride-hailing platform.

[0025] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.

Claims

1. A method for transparently accepting online car-hailing orders with drivers queuing, characterized in that: The following steps are involved: S1: Separating the relationship between driver service quality and order-taking strategy. The fact that driver service quality is independent of order-taking strategy can improve drivers’ trust in the platform’s dispatching. The online ride-hailing platform sets the driver’s service quality only in relation to the commission ratio and driver rewards, and has nothing to do with the order-taking strategy. Specifically, if the driver’s service quality is good, the online ride-hailing platform’s commission ratio is low, and the driver can participate in higher-level driver reward activities. S2: Divide the order-receiving areas and establish order-receiving queues. Divide the city into regular hexagonal grids of equal size, where each hexagon is surrounded by 6 hexagons. For each area x, establish an order-receiving queue Q(x). The set of neighboring areas of area x is denoted as L(x). For a fixed area, its neighbor set is unchanged. Set the rules for drivers to join the queue, the rules for drivers to leave the queue, the rules for drivers to view the current area, and the rules for drivers to view the surrounding areas. S3: Driver queue order acceptance rules. Passenger a initiates a taxi order. According to the starting point of a’s order, find the grid number x where the starting point is located, check whether there is a driver in Q(x). If there is a driver, remove the first driver in the queue. The first driver in the queue Q(x) is recorded as F(x), and assign the driver to the passenger. S4: Rules for drivers to queue for orders in adjacent areas. If there is no corresponding driver in the queue Q(x) to which the grid number x where passenger a is located belongs, then select the first driver F(y) in each adjacent area y from the 6 adjacent areas of the set L(x) of adjacent areas of x. There are at most 6 drivers. Check the location of these drivers from the passenger's starting point and select the nearest driver as the dispatch driver. The last found area is p, and the driver is F(p). Driver F(p) is removed from the queue Q(p), and p is the dispatch driver who meets the conditions.

2. A method for transparently accepting online car-hailing orders with drivers queuing according to claim 1, characterized in that: In the step S1, the driver's commission rate and the level of activities he or she can participate in are updated once a week to encourage the driver to work hard to improve his or her service level.

3. A method for transparently accepting online car-hailing orders with drivers queuing according to claim 1, characterized in that: In step S2, the driver joins the queue rule: when the driver enters area x, he is added to the end of queue Q(x); the driver leaves the queue rule: when the driver leaves area x and enters area y, he is first removed from queue Q(x) and then added to the end of queue Q(y). The driver can see the current position of the order in area y. If the driver returns the car and stops accepting orders, he will be removed from the queue in the area where the driver is located.

4. A method for transparently accepting online car-hailing orders with drivers queuing according to claim 1, characterized in that: In step S2, the driver checks the current area rule so that the driver can see the position where he is in the first order and the area number; the driver checks the surrounding area situation rule so that the driver can see the number of drivers queuing in the 6 adjacent areas in L(x). If there are too many drivers queuing and the waiting time is long, the driver can decide whether to switch areas independently.

5. The method for transparently accepting online car-hailing orders with drivers queuing according to claim 1, characterized in that: In step S4, the area p and driver F(p) finally found need to satisfy the following conditions:

1. p∈L(x); 2.

3. distance(F(p), F(a))≤distance(F(y), F(a)); distance is the function for calculating the distance between the passenger and the driver.

Images