Method, device, electronic device and storage medium for processing online car-hailing orders

Abstract

The present application provides a method, device, electronic device, and storage medium for processing online ride-hailing orders, relating to the field of online ride-hailing technology. In the process of matching ride orders with pick-up vehicles, if at least two ride orders are determined to be matched to the same pick-up vehicle, a target ride order is determined from the at least two ride orders based on the order waiting time and pick-up time of the at least two ride orders, and the target ride order is dispatched to the pick-up vehicle. Based on the order waiting time and pick-up time, ride resources can be reasonably allocated to users of the ride orders, ensuring that users can board the ride in a timely manner while conserving online ride-hailing platform resources.

Description

Technical Field

[0001] The present application relates to the field of online car-hailing technology, and in particular to a method, device, electronic device and storage medium for processing online car-hailing orders. Background Art

[0002] With the development of technology, online ride-hailing has played an important role in people's daily travel. People generally choose to book a vehicle on the online ride-hailing platform to facilitate their travel.

[0003] As more and more people use online ride-hailing services, the limitation on the number of online ride-hailing services and the influence of various objective factors in the pick-up process inevitably lead to a waste of resources on the online ride-hailing platform. How to ensure that users can get a ride in time while saving the resources of the online ride-hailing platform is an urgent problem to be solved. Summary of the Invention

[0004] In order to solve the problems in the prior art, the embodiments of the present application provide a method, device, electronic device and storage medium for processing online car-hailing orders, which can reasonably allocate ride resources for passengers, ensure that users can get rides in time, and save online car-hailing platform resources.

[0005] In a first aspect, an embodiment of the present application provides a method for processing an online ride-hailing order, the method comprising:

[0006] In the process of matching ride orders with pick-up vehicles, if it is determined that at least two ride orders are matched with the same pick-up vehicle, a target ride order is determined from the at least two ride orders based on the order waiting times and pick-up times of the at least two ride orders; wherein the pick-up time of the ride order is the time it takes for the pick-up vehicle to travel from the current location to the location where the ride order was placed; and the order waiting time of the ride order is the time from the time the ride order was placed to the current time.

[0007] The target ride order is dispatched to the pick-up vehicle.

[0008] In one possible implementation, if the at least two ride orders meet a first preset condition, it is determined that the at least two ride orders can be matched to the same pick-up vehicle; the first preset condition is that the pick-up distance is less than or equal to the preset distance, and the pick-up time is less than or equal to the first preset time; the pick-up distance of the ride order is the distance from the current location of the pick-up vehicle to the order location of the ride order.

[0009] In one possible implementation, the at least two ride orders include a first ride order and a second ride order; and determining a target ride order from the at least two ride orders based on order waiting times and pick-up times of the at least two ride orders includes:

[0010] If the absolute value of the order waiting time difference is greater than or equal to a first difference threshold, and the order waiting time of the first ride order is greater than the order waiting time of the second ride order, the first ride order is used as the target ride order; the order waiting time difference is the difference between the order waiting time of the first ride order and the order waiting time of the second ride order;

[0011] If the absolute value of the difference in order waiting time is greater than or equal to a first difference threshold, and the order waiting time of the first ride order is less than the order waiting time of the second ride order, then the second ride order is used as the target ride order;

[0012] If the absolute value of the difference in order waiting time is less than the first difference threshold, the target ride order is determined based on the pick-up waiting time of the first ride order and the second ride order; wherein, the pick-up waiting time of the ride order is the sum of the pick-up time of the ride order and the order waiting time of the ride order.

[0013] In one possible implementation, determining the target ride order based on the pickup waiting time of the first ride order and the second ride order includes:

[0014] If the waiting time for picking up the first ride order is greater than the second preset time, and the waiting time for picking up the second ride order is less than or equal to the second preset time, the second ride order will be used as the target ride order.

[0015] In one possible implementation, determining the target ride order based on the pickup waiting time of the first ride order and the second ride order includes:

[0016] If the pick-up waiting time for the first ride order and the pick-up waiting time for the second ride order are both greater than the second preset time, the target ride order is determined based on the pick-up distances and pick-up times corresponding to the first ride order and the second ride order; the pick-up distance of the ride order is the distance from the current location of the pick-up vehicle to the order location of the ride order.

[0017] In one possible implementation, determining the target ride order based on the pickup waiting time of the first ride order and the second ride order includes:

[0018] If the waiting time for picking up the first ride order and the waiting time for picking up the second ride order are both less than or equal to the second preset time, and the difference in the waiting time of the orders is greater than the second difference threshold, then the first ride order will be used as the target ride order.

[0019] In one possible implementation, determining the target ride order based on the pickup waiting time of the first ride order and the second ride order includes:

[0020] If the pick-up waiting time for the first ride order and the pick-up waiting time for the second ride order are both less than or equal to the second preset time, and the difference in the order waiting time is less than or equal to the second difference threshold, then the target ride order is determined based on the pick-up distances and pick-up times corresponding to the first ride order and the second ride order; the pick-up distance of the ride order is the distance from the current location of the pick-up vehicle to the order location of the ride order.

[0021] In one possible implementation, determining a target ride order from the at least two ride orders based on the order waiting times and pick-up times of the at least two ride orders includes:

[0022] Determining target probability values ​​for the at least two ride orders based on order waiting times, pick-up times, and pick-up distances of the at least two ride orders; the target probability values ​​for the ride orders represent a degree of matching between the ride orders and the pick-up vehicles;

[0023] The ride order with the largest target probability value is used as the target ride order.

[0024] In a second aspect, an embodiment of the present application provides a device for processing online ride-hailing orders, the device comprising:

[0025] a determination unit for determining, in a process of matching ride orders with pick-up vehicles, a target ride order from the at least two ride orders based on order waiting times and pick-up times of the at least two ride orders if it is determined that at least two ride orders are matched with the same pick-up vehicle; wherein the pick-up time of the ride order is the time it takes for the pick-up vehicle to travel from a current location to a location where the ride order was placed; and the order waiting time of the ride order is the time from when the ride order was placed to the current time;

[0026] The first dispatching unit is used to dispatch the target ride order to the pick-up vehicle.

[0027] In a possible implementation, the device further includes:

[0028] The second dispatching unit is used to determine that at least two ride orders can be dispatched to the same pick-up vehicle if the at least two ride orders meet a first preset condition; the first preset condition is that the pick-up distance is less than or equal to the preset distance, and the pick-up time is less than or equal to the first preset time; the pick-up distance of the ride order is the distance from the current location of the pick-up vehicle to the order location of the ride order.

[0029] In a possible implementation manner, the determining unit is further configured to:

[0030] If the absolute value of the order waiting time difference is greater than or equal to a first difference threshold, and the order waiting time of the first ride order is greater than the order waiting time of the second ride order, the first ride order is used as the target ride order; the order waiting time difference is the difference between the order waiting time of the first ride order and the order waiting time of the second ride order;

[0031] If the absolute value of the difference in order waiting time is greater than or equal to a first difference threshold, and the order waiting time of the first ride order is less than the order waiting time of the second ride order, then the second ride order is used as the target ride order;

[0032] If the absolute value of the difference in order waiting time is less than the first difference threshold, the target ride order is determined based on the pick-up waiting time of the first ride order and the second ride order; wherein, the pick-up waiting time of the ride order is the sum of the pick-up time of the ride order and the order waiting time of the ride order.

[0033] In a possible implementation manner, the determining unit is further configured to:

[0034] If the waiting time for picking up the first ride order is greater than the second preset time, and the waiting time for picking up the second ride order is less than or equal to the second preset time, the second ride order will be used as the target ride order.

[0035] In a possible implementation manner, the determining unit is further configured to:

[0036] If the pick-up waiting time of the first ride order and the pick-up waiting time of the second ride order are both greater than the second preset time, the target ride order is determined based on the pick-up distance and pick-up time corresponding to the first ride order and the second ride order.

[0037] In a possible implementation manner, the determining unit is further configured to:

[0038] If the waiting time for picking up the first ride order and the waiting time for picking up the second ride order are both less than or equal to the second preset time, and the difference in the waiting time of the orders is greater than the second difference threshold, then the first ride order will be used as the target ride order.

[0039] In a possible implementation manner, the determining unit is further configured to:

[0040] If the pick-up waiting time for the first ride order and the pick-up waiting time for the second ride order are both less than or equal to the second preset time, and the difference in the order waiting times is less than or equal to the second difference threshold, then the target ride order is determined based on the pick-up distances and pick-up times corresponding to the first ride order and the second ride order.

[0041] In a possible implementation manner, the determining unit is further configured to:

[0042] Determining target probability values ​​for the at least two ride orders based on order waiting times, pick-up times, and pick-up distances of the at least two ride orders; the target probability values ​​for the ride orders represent a degree of matching between the ride orders and the pick-up vehicles;

[0043] The ride order with the largest target probability value is used as the target ride order.

[0044] In a third aspect, an embodiment of the present application provides an electronic device comprising a memory and a processor, wherein the memory contains a computer program that can run on the processor. When the computer program is executed by the processor, the method described in any one of the methods for processing an online car-hailing order in the first aspect is implemented.

[0045] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, in which a computer program is stored. When the computer program is executed by a processor, it implements any one of the methods described in the first aspect of a method for processing an online car-hailing order.

[0046] An embodiment of the present application provides a method for processing online ride-hailing orders. When it is determined that at least two ride orders are matched to the same pick-up vehicle, ride resources can be reasonably allocated to the riders based on the order waiting time and the pick-up time, ensuring that the users can get the vehicle in time and saving online ride-hailing platform resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0048] Figure 1 An application scenario diagram of a method for processing an online ride-hailing order provided in an embodiment of the present application;

[0049] Figure 2 A flowchart of a method for processing an online ride-hailing order provided in an embodiment of the present application;

[0050] Figure 3 A flowchart of another method for processing an online ride-hailing order provided in an embodiment of the present application;

[0051] Figure 4 A schematic diagram of the structure of an online car-hailing order processing device provided in an embodiment of the present application;

[0052] Figure 5 A schematic diagram of the structure of another online car-hailing order processing device provided in an embodiment of the present application;

[0053] Figure 6 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0054] To make the objectives, technical solutions, and advantages of this application more clear, this application will be further described in detail below with reference to the accompanying drawings. Obviously, the embodiments described are only some of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making any creative efforts are within the scope of protection of this application.

[0055] It should be noted that the terms "including" and "having" and their variations involved in the documents of this application are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or are inherent to these processes, methods, products or devices.

[0056] In our daily lives, ride-hailing has become an indispensable part of our daily commute. However, due to the limited number of ride-hailing vehicles on these platforms, during peak hours, there may be a shortage of ride-hailing vehicles, leading to the need to dispatch multiple orders simultaneously. This inevitably wastes resources due to the limited number of ride-hailing vehicles and various factors in the ride-hailing process.

[0057] Based on the above problems, an embodiment of the present application provides a method for processing online ride-hailing orders. If the server determines that at least two ride orders are matched to the same pick-up vehicle during the process of matching ride orders for ride orders, the target ride order is determined from the at least two ride orders based on the order waiting time and pick-up time of the at least two ride orders. Among them, the pick-up time of the ride order is the time it takes for the pick-up vehicle to arrive at the order location of the ride order from the current location. The order waiting time of the ride order is the time from the order time of the ride order to the current time, and the target ride order is dispatched to the pick-up vehicle. Based on this, ride resources can be reasonably allocated to users of ride orders according to the order waiting time and pick-up time, ensuring that users can get the ride in time and saving online ride-hailing platform resources.

[0058] After introducing the design concepts of the embodiments of this application, the following briefly introduces the application scenarios to which the technical solutions of the embodiments of this application can be applied. It should be noted that the application scenarios introduced below are only used to illustrate the embodiments of this application and are not limiting. In specific implementations, the technical solutions provided by the embodiments of this application can be flexibly applied according to actual needs.

[0059] like Figure 1 As shown, it is a schematic diagram of an application scenario of the online car-hailing order processing method provided by the embodiment of the present application. The application scenario includes a user terminal 10, a server 20 and a vehicle terminal 30. Figure 1 As shown, the user terminal 10 and the vehicle terminal 30 are connected to the server 20 via a communication network, wherein the server 20 can be connected to multiple user terminals 10 and multiple vehicle terminals 30 respectively. A passenger initiates a ride order through the user terminal 10. The user terminal 10 sends the order information of the passenger's ride order to the server 20. The vehicle terminal 30 also sends the location information of the online-hailing vehicle and the order acceptance status to the server 20. Based on the received location information and order acceptance status of the online-hailing vehicle, the server 20 can make a judgment based on the received order information and the location information and order acceptance status reported by the vehicle, and distribute the ride order to the vehicle terminals 30 of multiple vehicles via the communication network. The driver can accept the order through the vehicle terminal 30. After receiving the driver's order acceptance operation, the vehicle terminal 30 sends the order acceptance information to the server 20 via the communication network, and the server 20 can then send the order dispatch information to the user terminal 10.

[0060] It should be noted that Figure 1 The installation position of the vehicle terminal 30 in the figure is for example only. The specific positions of the two in the figure are not fixed positions in the actual vehicle. The vehicle terminal 30 can also be located in other locations in the vehicle, such as the vehicle terminal 30 is installed at the door, between the front seats, etc.

[0061] like Figure 2 As shown, a flow chart of a method for processing an online car-hailing order provided by an embodiment of the present application is provided. The method for processing an online car-hailing order can be applied to an electronic device, which can be Figure 1 Server 20 in Figure 2 As shown, the online car-hailing order processing method includes the following steps:

[0062] Step S201: In the process of matching ride orders with pick-up vehicles, if it is determined that at least two ride orders are matched to the same pick-up vehicle, a target ride order is determined from the at least two ride orders based on the order waiting time and pick-up time of the at least two ride orders.

[0063] Among them, the order waiting time for the ride order is the length of time from the time the ride order is placed to the current time.

[0064] In some embodiments, during the operation of an online ride-hailing platform, the server constantly receives a large number of ride requests and matches these requests with suitable pickup vehicles. The server may match pickup vehicles to ride requests based on the pickup distance and pickup duration. If the ride request and the vehicle meet the following first pre-set condition, the vehicle may be selected as the pickup vehicle for the ride request, or in other words, the ride request may be determined to be matched with the pickup vehicle.

[0065] The first preset condition is that the pick-up distance is less than or equal to the preset distance, and the pick-up time is less than or equal to the first preset time. The pick-up distance is the distance from the current location to the location where the ride order was placed; the pick-up time is the time it takes for the vehicle to reach the location where the ride order was placed.

[0066] In one embodiment, it can be understood that when the pick-up distance and the pick-up time of the ride order and the pick-up vehicle are very short, it means that the ride order is matched with the pick-up vehicle.

[0067] If there are at least two ride requests near the same pickup vehicle, and each of the ride requests meets the first pre-set condition, it can be determined that both ride requests can be matched with the pickup vehicle. In this case, the target ride request can be determined from the at least two ride requests based on their respective wait times and pickup times.

[0068] The following example illustrates determining a target ride order from two ride orders. In this embodiment of the present application, the two ride orders may be ride orders from users with defined attributes. For example, the users with defined attributes may be VIP users of the ride-hailing platform or users who enjoy VIP user benefits, thereby protecting VIP user rights; for example, users whose points meet a defined value can redeem their points for VIP user benefits.

[0069] If there are two orders on the online ride-hailing platform that can be dispatched to the same vehicle, based on the above consideration of reducing the waste of online ride-hailing platform resources, these two ride orders can be screened, and the target ride order can be determined from the two ride orders based on the order waiting time and pick-up time of the two ride orders.

[0070] For example, if the preset distance is 2 kilometers and the first preset duration is 10 minutes, then if there are two ride orders and the pick-up vehicle is both within 2 kilometers, and the pick-up vehicle takes less than 10 minutes to reach the order location of both ride orders from the current location, then the two ride orders can be matched with the same pick-up vehicle. At this time, the pick-up vehicle meets the first preset condition for both ride orders. In this case, one of the two ride orders needs to be selected as the target ride order.

[0071] Based on the above embodiment, after determining that two ride orders can be matched with the same pick-up vehicle, the server can determine a target ride order from the two ride orders based on the order waiting time and pick-up time of the two ride orders. The specific determination method for which of the two ride orders is to prioritize as the target ride order is as follows:

[0072] In one possible embodiment, the two ride orders may be referred to as a first ride order and a second ride order. The order waiting time difference is the difference between the order waiting time of the first ride order and the order waiting time of the second ride order. If the absolute value of the order waiting time difference is greater than or equal to a first difference threshold, and the order waiting time of the first ride order is greater than the order waiting time of the second ride order, the first ride order is selected as the target ride order.

[0073] For example, if the waiting time for the first ride order is 10 minutes and the waiting time for the second ride order is 6 minutes, the difference in waiting time is 4 minutes, and the first difference threshold is 3 minutes. If the difference in waiting time is greater than 3 minutes, and the waiting time for the first ride order is longer than that for the second ride order, it means that the waiting time for the first ride order is significantly longer than that for the second ride order. In this case, the first ride order is prioritized as the target order.

[0074] In another possible embodiment, if the absolute value of the difference in order waiting time is greater than or equal to the first difference threshold, and the order waiting time of the first ride order is less than the order waiting time of the second ride order, the second ride order will be used as the target ride order.

[0075] For example, if the waiting time for the first ride order is 6 minutes and the waiting time for the second ride order is 10 minutes, the difference in waiting time is 4 minutes, and the first difference threshold is 3 minutes. If the difference in waiting time is greater than 3 minutes, and the waiting time for the first ride order is shorter than the waiting time for the second ride order, it means that the waiting time for the second ride order is much longer than that for the first ride order. In this case, the second ride order is prioritized as the target order.

[0076] In another possible embodiment, if the absolute value of the difference in order waiting time is less than a first difference threshold, the target ride order is determined based on the pick-up waiting time of the first ride order and the second ride order.

[0077] Among them, the pick-up waiting time for the ride order is the sum of the pick-up time for the ride order and the order waiting time for the ride order.

[0078] For example, taking the case where the waiting time for the first ride order is 10 minutes and the waiting time for the second ride order is 8 minutes, the difference in order waiting time is 2 minutes, and the first difference threshold is 3 minutes. At this time, the difference in order waiting time is less than 3 minutes, and the target ride order needs to be determined based on the waiting time for pick-up of the first ride order and the second ride order.

[0079] Specifically, based on the waiting time for pickup of the first and second ride orders, the target ride order is determined in the following situations:

[0080] The first case: if the waiting time for picking up the first ride order is greater than the second preset time, and the waiting time for picking up the second ride order is less than or equal to the second preset time, the second ride order will be used as the target ride order.

[0081] For example, in the above embodiment, the pick-up time for the first ride order is 10 minutes, the waiting time for the first ride order is 10 minutes, and the pick-up time for the second ride order is 10 minutes, and the waiting time for the second ride order is 8 minutes. Therefore, the waiting time for the first ride order is 20 minutes, and the waiting time for the second ride order is 18 minutes. If the second preset time is 19 minutes, then 20 minutes > 19 minutes > 18 minutes, and the second ride order is selected as the target ride order.

[0082] In the process of dispatching ride orders on the online ride-hailing platform, compensation can be provided for ride orders whose waiting time for pickup reaches a certain length of time. The second preset time length here can be the time length threshold that satisfies the compensation for ride orders. For example, compensation can be provided by issuing coupons or other compensation methods. The following uses the example of compensation by issuing coupons as an example. In the above embodiment, for the first ride order and the second ride order, the first ride order needs to issue a coupon, while the second ride order does not need to issue a coupon. In order to avoid wasting the resources of the online ride-hailing platform, the ride order that does not need to issue a coupon is given priority as the target ride order.

[0083] The second situation: If the pick-up waiting time of the first ride order and the pick-up waiting time of the second ride order are both greater than the second preset time, the target ride order is determined based on the pick-up distances and pick-up times corresponding to the first ride order and the second ride order.

[0084] For example, the waiting time for pick-up of the first ride order is 20 minutes, and the waiting time for pick-up of the second ride order is 18 minutes. If the second preset time is 17 minutes, the waiting time for pick-up of the two ride orders is greater than the second preset time. If the second preset time is taken as the time length threshold for issuing coupons, it means that the first ride order and the second ride order are both in a state where coupons need to be issued. Based on the pick-up distances and pick-up times corresponding to the first ride order and the second ride order, the target ride order can be determined.

[0085] The third case: if the waiting time for pick-up of the first ride order and the waiting time for pick-up of the second ride order are both less than or equal to the second preset time, and the difference in the order waiting time is greater than the second difference threshold, the first ride order will be used as the target ride order.

[0086] For example, the first ride order has a 10-minute wait time, while the second ride order has an 8-minute wait time. The pickup times for both orders are 10 minutes. Therefore, the first ride order has a 20-minute wait time, while the second ride order has an 18-minute wait time. If the second preset time is 25 minutes, the pickup times for both orders are less than the second preset time. If the second preset time is the threshold for meeting the coupon issuance time requirement, this indicates that neither order meets the coupon issuance criteria, and the difference in wait times is 2 minutes. If the second difference threshold is 10 seconds, the difference in wait times is greater than the second difference threshold. If the difference in wait times between the two orders is less than the first difference threshold, and neither order requires a coupon, the order with the longer wait time is prioritized as the target order. This prioritizes the user with the longer wait time, ensuring timely boarding.

[0087] The fourth case: If the pick-up waiting time for the first ride order and the pick-up waiting time for the second ride order are both less than or equal to the second preset time, and the difference in the order waiting time is less than or equal to the second difference threshold, then the target ride order is determined based on the pick-up distances and pick-up times corresponding to the first ride order and the second ride order.

[0088] For example, the waiting time for the first ride order is 10 minutes, and the waiting time for the second ride order is 9 minutes and 55 seconds. The pick-up time for both the first and second ride orders is 10 minutes. Then, the pick-up waiting time for the first ride order is 20 minutes, and the pick-up waiting time for the second ride order is 19 minutes and 55 seconds. If the second preset time is 25 minutes, the pick-up waiting time for both ride orders is less than the second preset time. If the second preset time is used as the time threshold for coupon issuance, this means that neither ride order meets the coupon issuance standard, and the difference in the order waiting time is 5 seconds. If the second difference threshold is 10 seconds, the difference in the order waiting time is less than the second difference threshold. In this case, the target ride order can be determined based on the pick-up distance and pick-up time corresponding to the first and second ride orders.

[0089] Based on the above content, the target ride order can be determined in various situations, and then step S202 is performed.

[0090] Step S202: dispatch the target ride order to the pick-up vehicle.

[0091] In the online car-hailing order processing method in the embodiment of the present application, after determining that at least two ride orders are matched to the same pick-up vehicle, the ride orders can be screened based on the order waiting time and pick-up time of the at least two ride orders, and the target ride order can be determined, and then the target ride order can be dispatched to the pick-up vehicle. Taking various situations into consideration can ensure that users can get on the vehicle in a timely manner and that the resources of the online car-hailing platform are not wasted.

[0092] In other embodiments, the target ride order may be determined and dispatched to the pick-up vehicle by the following method:

[0093] After the server receives the ride order, it constructs the target probability value Q between the ride order and the pick-up vehicle by matching the weights. i D j , where i represents any one of at least two ride orders, hereinafter referred to as i-order; j represents the pick-up vehicle, hereinafter referred to as j-vehicle.

[0094] After determining the target probability, the final target ride order is determined based on the target probability. The order i with the highest target probability for vehicle j is the target ride order assigned to vehicle j.

[0095] The formula for determining the target probability value is as follows:

[0096]

[0097] Where i represents any one of at least two ride orders; j represents the pick-up vehicle; W ij represents the matching weight between order i and vehicle j; X ij Indicates that order i and vehicle j can be matched; m represents the number of operating vehicles in the online ride-hailing platform; n represents the number of ride orders in the online ride-hailing platform; X represents an n×m-dimensional matrix consisting only of 0s and 1s.

[0098] Targeting X ij The following constraints exist, and the specific constraint formulas are as follows:

[0099]

[0100]

[0101] The above two constraint formulas indicate that no matter how many ride orders can be dispatched to pick-up vehicles at the same time, a pick-up vehicle can only dispatch one ride order at the same time. If and only if order i can be dispatched to vehicle j, X ij is 1, otherwise X ij0. When the above constraints exist, the same pick-up vehicle cannot receive two ride orders at the same time within the same time period, and the target ride order needs to be determined from at least two ride orders.

[0102] In the process of calculating the target probability value, X ij It is only a prerequisite constraint. When there are at least two ride orders that can be matched to the same pick-up vehicle, based on the matching weight W between at least two ride orders and pick-up vehicle j ij , determine the target probability value, and then determine the final target ride order based on the target probability value.

[0103] Matching weight W ij The pick-up time is determined by the pick-up distance, the order wait time, and the pick-up wait time. The pick-up wait time is the sum of the order wait time and the pick-up time.

[0104] The formula for calculating the matching weight is as follows:

[0105] W ij =W ij ′×F ij

[0106] Among them, W ij ′ represents the function expression determined based on the factors affecting the pick-up time and the pick-up distance, F ij Represents a function expression determined based on the influencing factors of order waiting time difference and pick-up waiting time.

[0107] Specifically,

[0108] W ij ′=Y ij (distance)×G ij (time)

[0109] Among them, Y ij (distance) represents the pick-up distance function, G ij (time) represents the pick-up time function.

[0110] Specifically,

[0111] F ij =max(D ij (t),K ij (t))

[0112] Among them, D ij (t) represents the function expression of the difference in waiting time between ride order i and other ride orders and the waiting time for pickup; K ij(t) represents the function expression based on the waiting time when the ride order i is matched with the pick-up vehicle j, and t represents the difference in the order waiting time.

[0113] Specifically, in D ij (t) and K ij The maximum value is selected as the factor affecting the matching weight.

[0114] Specifically,

[0115]

[0116]

[0117] Wherein, the pick-up waiting time O(i) is determined based on the sum of the order waiting time and the pick-up time; M represents the first difference threshold;

[0118] D1(t) indicates that when the absolute value of the difference in waiting time between ride order i and other ride orders is greater than or equal to the first difference threshold, D ij (t) corresponding function;

[0119] D2(t) indicates that the absolute value of the difference in waiting time between ride order i and other ride orders is less than the first difference threshold, and when ride order i matches pick-up vehicle j, the waiting time for pick-up is less than or equal to the second preset time, D ij (t) corresponding function;

[0120] K1(t) indicates that when the ride order i is matched with the pick-up vehicle j, the waiting time for pick-up is longer than the second preset time, K ij (t) corresponding function;

[0121] K2(t) indicates that when the ride order i matches the pick-up vehicle j, the waiting time for pick-up is less than or equal to the second preset time, K ij (t) corresponding function;

[0122] T represents the second preset time length.

[0123] In the above situation, based on the consideration of strengthening user stickiness of the online car-hailing platform, when the waiting time for pick-up is longer than the second preset time, the user can be given a certain amount of coupons as compensation to reduce user dissatisfaction.

[0124] Based on this, D2(t) can be understood as when the difference in waiting time between ride order i and other ride orders is less than the first difference threshold, and when ride order i matches pick-up vehicle j, the online ride-hailing platform does not need to issue coupons; K1(t) can be understood as when ride order i matches pick-up vehicle j, the online ride-hailing platform needs to issue coupons; K2(t) means that when ride order i matches pick-up vehicle j, the online ride-hailing platform does not need to issue coupons.

[0125] Based on the consideration of effective resource utilization of the online car-hailing platform, the following constraints can be set:

[0126] min(D1(t))×min(W ij ′)>max(D2(t))×max(W ij ′)

[0127] min(D1(t))×min(W ij ′)>max(K2(t))×max(W ij ′)

[0128] min(K2(t))×min(W ij ′)>max(K1(t))×max(W ij ′)

[0129] D2(t1)×min(W ij ′)>D2(t2)×max(W ij ′)(t1-t2>N)

[0130] Wherein, N represents the second difference threshold.

[0131] For example, there are two ride orders, ride order i and another ride order. Then t1 represents the waiting time for ride order i, and t2 represents the waiting time for the other ride order.

[0132] Under the premise that the ride order i and another ride order meet the first preset condition and can be assigned to the same pick-up vehicle j, the above constraints mean:

[0133] (1) When the absolute value of the waiting time difference t between ride order i and another ride order is greater than or equal to the first difference threshold, regardless of the other ride order’s W ij ′ takes any value, even if W of another ride order ij ′ is much larger than W of ride order i ij ′ value, the ride order i is also dispatched to the pick-up vehicle first.

[0134] (2) When the absolute value of the waiting time difference t between ride order i and another ride order is greater than or equal to the first difference threshold, ride order i will be dispatched to the pick-up vehicle first, regardless of whether the other ride order needs to issue a coupon.

[0135] (3) When the absolute value of the waiting time difference t between ride order i and another ride order is less than the first difference threshold, the ride order that does not require the issuance of coupons is dispatched to the pick-up vehicle before the ride order that requires the issuance of coupons.

[0136] (4) When the absolute value of the difference t between the waiting time of ride order i and another ride order is less than the first difference threshold, and neither of the two ride orders requires the issuance of coupons, the ride order with the longer waiting time will be given priority in dispatching to the pick-up vehicle.

[0137] Regarding (4), in the embodiment of the present application, ride orders with longer order waiting times are preferentially dispatched to pick-up vehicles. For the influencing factor of order waiting time, further settings can be made. By t1 representing the order waiting time of ride order i, and t2 representing the order waiting time of another ride order, if the value of t1-t2 is greater than the second difference threshold, ride orders with longer order waiting times are preferentially dispatched to pick-up vehicles. If the value of t1-t2 is less than or equal to the second difference threshold, it means that the difference in order waiting time is very small, and then the W in the matching weight can be used. ij The pick-up distance and pick-up time in the corresponding influencing factors determine how to dispatch the order.

[0138] When determining the target probability value, taking the case where the absolute value of the difference t between the waiting time of ride order i and the waiting time of other vehicles is greater than the first difference threshold, the minimum value of function D1(t) is multiplied by function W ij The target probability value obtained by the minimum value of ′ is greater than the maximum value of function D2(t) multiplied by the function W ij The target probability value obtained by the maximum value of ′, and the minimum value of the function D1(t) multiplied by the function W ij The target probability value obtained by the minimum value of ′ is greater than the maximum value of function K2(t) multiplied by the function W ij ′ is the target probability value obtained by taking the maximum value. Therefore, under the constraints based on the above constraints, if the waiting time of ride order i is longer, and the absolute value of the difference between the waiting time of ride order i and the waiting time of other vehicles is greater than or equal to the first difference threshold, then the target probability value of ride order i is greater than the target probability value of other ride orders, and ride order i can be determined to be the target ride order.

[0139] Optionally, when the absolute value of the difference t between the waiting time of ride order i and another ride order is less than the first difference threshold, if both ride orders need to issue coupons, then based on the W in the matching weight ij The pick-up distance and pick-up time in the corresponding influencing factors determine how to dispatch the order.

[0140] Targeting W ij ' function, set the following constraints:

[0141] Y ij (distance1)>Y ij (distance2)(distance1 <distance2)

[0142] G ij (time1)>G ij (time2)(time1 <time2)

[0143] min(G ij (time))>max(Y ij (distance)

[0144] The above constraints can be understood as follows: when the pick-up times are different, the vehicle with the shorter pick-up time is given priority; when the pick-up times are the same, the vehicle with the shorter pick-up distance is given priority.

[0145] In one possible embodiment, when based on F ij When the constraints in W cannot determine the target ride order, ij In the process of determining the target ride order based on the pick-up distance and pick-up time in the corresponding influencing factors ′, the specific factors are:

[0146] (1) When the pick-up distance of the first ride order is shorter than the pick-up distance of the second ride order, and the pick-up time of the first ride order is shorter than the pick-up time of the second ride order, the first ride order is the target ride order.

[0147] (2) When the pick-up distance of the first ride order is greater than the pick-up distance of the second ride order, and the pick-up time of the first ride order is less than the pick-up time of the second ride order, the first ride order is the target ride order.

[0148] (3) When the pick-up distance of the first ride order is shorter than the pick-up distance of the second ride order, and the pick-up time of the first ride order is longer than the pick-up time of the second ride order, the second ride order is the target ride order.

[0149] (4) When the pick-up distance of the first ride order is greater than the pick-up distance of the second ride order, and the pick-up time of the first ride order is greater than the pick-up time of the second ride order, the second ride order is the target ride order.

[0150] Determine the matching weight W through the function formula and constraints ij The target probability value of ride order i is determined based on the matching weight. Using the above method, the target probability value corresponding to each ride order can be determined. The ride order with the largest target probability value is selected as the target ride order, and the target ride order is dispatched.

[0151] The above-mentioned order dispatching algorithm can consider not only the pick-up time and distance but also the dispatching of ride orders to users based on the order waiting time and order pick-up time when there are too many ride orders and at least two ride orders can be matched to the same pick-up vehicle. It considers the problem from multiple dimensions and determines the final target ride order based on multiple influencing factors, so as to reasonably allocate ride resources to users of ride orders, ensure that users can get the ride in time, and save resources of the online car-hailing platform.

[0152] The embodiment of the present application provides a detailed method for processing online car-hailing orders, such as Figure 3 As shown, the online car-hailing order processing method includes the following steps:

[0153] Step S301: In the process of matching ride orders with pick-up vehicles, if it is determined that at least two ride orders are matched with the same pick-up vehicle.

[0154] Step S302: Determine whether the absolute value of the order waiting time difference is greater than or equal to a first difference threshold. If so, execute step S303; if not, execute step S304.

[0155] Step S303: The first ride order is used as the target ride order.

[0156] Step S304: Determine whether the waiting time for pick-up of the first ride order is greater than the second preset time, and determine whether the waiting time for pick-up of the second ride order is greater than the second preset time; if the waiting time for pick-up of the first ride order and the waiting time for pick-up of the second ride order are both greater than the second preset time, execute step S305; if the waiting time for pick-up of the first ride order is greater than the second preset time, and the waiting time for pick-up of the second ride order is less than or equal to the second preset time, execute step S306; if the waiting time for pick-up of the first ride order and the waiting time for pick-up of the second ride order are both less than or equal to the second preset time, execute step S307.

[0157] Step S305: Determine the target ride order based on the pick-up distances and pick-up times corresponding to the first ride order and the second ride order.

[0158] Step S306: The second ride order is used as the target ride order.

[0159] Step S307: Determine whether the order waiting time difference is greater than a second difference threshold. If so, execute step S308; if not, execute step S309.

[0160] Step S308: The first ride order is used as the target ride order.

[0161] Step S309: Determine the target ride order based on the pick-up distances and pick-up times corresponding to the first ride order and the second ride order.

[0162] Based on the same inventive concept, an embodiment of the present invention further provides a structural diagram of an online car-hailing order processing device, such as Figure 4 As shown, the online car-hailing order processing device includes:

[0163] The determining unit 401 is configured to determine a target ride order from the at least two ride orders based on the order waiting time and pick-up time of the at least two ride orders if it is determined that both of the at least two ride orders can be assigned to the same pick-up vehicle; wherein the pick-up time of the ride order is the time it takes for the pick-up vehicle to travel from the current location to the location where the ride order was placed; and the order waiting time of the ride order is the time from the time the ride order was placed to the current time.

[0164] The first dispatching unit 402 is used to dispatch the target ride order to the pick-up vehicle.

[0165] In a possible implementation, the determining unit 401 is further configured to:

[0166] If the absolute value of the order waiting time difference is greater than or equal to a first difference threshold, and the order waiting time of the first ride order is greater than the order waiting time of the second ride order, the first ride order is used as the target ride order; the order waiting time difference is the difference between the order waiting time of the first ride order and the order waiting time of the second ride order;

[0167] If the absolute value of the difference in order waiting time is greater than or equal to a first difference threshold, and the order waiting time of the first ride order is less than the order waiting time of the second ride order, then the second ride order is used as the target ride order;

[0168] If the absolute value of the difference in order waiting time is less than the first difference threshold, the target ride order is determined based on the pick-up waiting time of the first ride order and the second ride order; wherein, the pick-up waiting time of the ride order is the sum of the pick-up time of the ride order and the order waiting time of the ride order.

[0169] In a possible implementation, the determining unit 401 is further configured to:

[0170] If the waiting time for picking up the first ride order is greater than the second preset time, and the waiting time for picking up the second ride order is less than or equal to the second preset time, the second ride order will be used as the target ride order.

[0171] In a possible implementation, the determining unit 401 is further configured to:

[0172] If the pick-up waiting time for the first ride order and the pick-up waiting time for the second ride order are both greater than the second preset time, the target ride order is determined based on the pick-up distances and pick-up times corresponding to the first ride order and the second ride order.

[0173] In a possible implementation, the determining unit 401 is further configured to:

[0174] If the waiting time for picking up the first ride order and the waiting time for picking up the second ride order are both less than or equal to the second preset time, and the difference in the order waiting time is greater than the second difference threshold, the first ride order will be used as the target ride order.

[0175] In a possible implementation, the determining unit 401 is further configured to:

[0176] If the pick-up waiting time for the first ride order and the pick-up waiting time for the second ride order are both less than or equal to the second preset time, and the difference in the order waiting time is less than or equal to the second difference threshold, then the target ride order is determined based on the pick-up distances and pick-up times corresponding to the first ride order and the second ride order.

[0177] In a possible implementation manner, the determining unit is further configured to:

[0178] Determining target probability values ​​for the at least two ride orders based on order waiting times and pick-up times of the at least two ride orders; the target probability values ​​for the ride orders represent a degree of matching between the ride orders and the pick-up vehicles;

[0179] The ride order with the largest target probability value is taken as the target ride order.

[0180] In one possible implementation, Figure 5 A structural diagram of another online car-hailing order processing device provided in an embodiment of the present application is shown.

[0181] The online car-hailing order processing device also includes:

[0182] The second dispatching unit 501 is used to determine that at least two ride orders can be dispatched to the same pick-up vehicle if at least two ride orders meet a first preset condition; the first preset condition is that the pick-up distance is less than a preset distance and the pick-up time is less than a first preset time; the pick-up distance of the ride order is the distance from the current location of the pick-up vehicle to the order location of the ride order.

[0183] The present application also provides an electronic device comprising at least a memory for storing data and a processor. The processor for processing data may be implemented using a microprocessor, a CPU, a GPU (Graphics Processing Unit), a DSP, or an FPGA. The memory stores operating instructions, which may be computer-executable code, that implement the various steps in the process of the online ride-hailing order processing method described in the present application.

[0184] Figure 6 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application. Figure 6 As shown, electronic device 600 includes memory 601, processor 602, data acquisition module 603 and bus 604. The memory 601, processor 602 and data acquisition module 603 are connected via bus 604, which is used to transmit data between the memory 601, processor 602 and data acquisition module 603.

[0185] Among them, the memory 601 can be used to store software programs and modules. The processor 602 executes the software programs and modules stored in the memory 601 to execute various functional applications and data processing of the electronic device 600, such as the online car-hailing order processing method provided in the embodiment of the present application. The memory 601 can mainly include a program storage area and a data storage area. The program storage area can store an operating system, at least one application application, etc.; the data storage area can store data created based on the use of the electronic device 600, etc. In addition, the memory 601 can include a high-speed random access memory and can also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other volatile solid-state storage device.

[0186] The processor 602 is the control center of the electronic device 600. It connects the various parts of the entire electronic device 600 using the bus 604 and various interfaces and lines. It performs various functions of the electronic device 600 and processes data by running or executing software programs and / or modules stored in the memory 601 and calling data stored in the memory 601. Optionally, the processor 602 may include one or more processing units, such as a CPU, a GPU (Graphics Processing Unit), a digital processing unit, etc.

[0187] An embodiment of the present application also provides a computer-readable storage medium, which stores computer-executable instructions. When the computer program is executed by a processor, it can be used to implement the online car-hailing order processing method recorded in any embodiment of the present application.

[0188] In some possible implementations, various aspects of the online car-hailing order processing method provided in this application may also be implemented in the form of a program product, which includes program code. When the program product is run on a computer device, the program code is used to enable the computer device to execute the steps of the online car-hailing order processing method according to various exemplary embodiments of the present application described above in this specification. For example, the computer device may execute the following steps: Figure 2 The process of the online car-hailing order processing method of steps S201 to S202 is shown.

[0189] Those skilled in the art will appreciate that the embodiments of the present application can be provided as methods, systems, or computer program products. Therefore, the present application can adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0190] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the present application. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0191] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0192] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing the instructions executed on the computer or other programmable device for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 The steps for the function specified in one or more boxes.

[0193] Obviously, those skilled in the art may make various changes and modifications to this application without departing from the spirit and scope of this application. Thus, if these modifications and variations of this application fall within the scope of the claims of this application and their equivalents, this application is intended to include these modifications and variations.

Claims

1. A method for processing online car-hailing orders, characterized in that: The method comprises: Based on the pick-up times and pick-up distances between multiple vehicles and multiple ride orders, a matching pick-up vehicle is determined for each ride order; the pick-up time for a ride order is the time it takes for the vehicle to travel from its current location to the location where the ride order was placed; and the waiting time for a ride order is the time from the time the ride order was placed to the current time. If at least two ride orders are matched to the same pick-up vehicle, target probability values ​​for the at least two ride orders are determined based on the order waiting time, pick-up time, and pick-up distance of the at least two ride orders; and the ride order with the largest target probability value is used as the target ride order; wherein the target probability value of the ride order represents the degree of match between the ride order and the pick-up vehicle; dispatching the target ride order to the pick-up vehicle; The method further includes: if the at least two ride orders meet a first preset condition, determining that the at least two ride orders are matched to the same pick-up vehicle; the first preset condition is that the pick-up distance is less than or equal to a preset distance, and the pick-up duration is less than or equal to a first preset duration; the pick-up distance of the ride order is the distance from the current location of the pick-up vehicle to the location where the ride order was placed; The determining a target ride order from the at least two ride orders based on the order waiting times and the pick-up times of the at least two ride orders includes: If the absolute value of the order waiting time difference is greater than or equal to the first difference threshold, and the order waiting time of the first ride order is greater than the order waiting time of the second ride order, the first ride order will be used as the target ride order; the order waiting time difference is the difference between the order waiting time of the first ride order and the order waiting time of the second ride order; wherein, the at least two ride orders include the first ride order and the second ride order.

2. The method according to claim 1, characterized in that The determining a target ride order from the at least two ride orders based on the order waiting times and the pick-up times of the at least two ride orders includes: If the absolute value of the difference in order waiting time is greater than or equal to a first difference threshold, and the order waiting time of the first ride order is less than the order waiting time of the second ride order, then the second ride order is used as the target ride order; If the absolute value of the difference in order waiting time is less than the first difference threshold, the target ride order is determined based on the pick-up waiting time of the first ride order and the second ride order; wherein, the pick-up waiting time of the ride order is the sum of the pick-up time of the ride order and the order waiting time of the ride order.

3. The method according to claim 2, characterized in that The determining of the target ride order based on the pickup waiting time of the first ride order and the second ride order includes: If the waiting time for picking up the first ride order is greater than the second preset time, and the waiting time for picking up the second ride order is less than or equal to the second preset time, the second ride order will be used as the target ride order.

4. The method according to claim 2, characterized in that The determining of the target ride order based on the pickup waiting time of the first ride order and the second ride order includes: If the pick-up waiting time for the first ride order and the pick-up waiting time for the second ride order are both greater than the second preset time, the target ride order is determined based on the pick-up distances and pick-up times corresponding to the first ride order and the second ride order; the pick-up distance of the ride order is the distance from the current location of the pick-up vehicle to the order location of the ride order.

5. The method according to claim 2, characterized in that The determining of the target ride order based on the pickup waiting time of the first ride order and the second ride order includes: If the waiting time for picking up the first ride order and the waiting time for picking up the second ride order are both less than or equal to the second preset time, and the difference in the waiting time of the orders is greater than the second difference threshold, then the first ride order will be used as the target ride order.

6. The method according to claim 2, characterized in that The determining of the target ride order based on the pickup waiting time of the first ride order and the second ride order includes: If the pick-up waiting time for the first ride order and the pick-up waiting time for the second ride order are both less than or equal to the second preset time, and the difference in the order waiting time is less than or equal to the second difference threshold, then the target ride order is determined based on the pick-up distances and pick-up times corresponding to the first ride order and the second ride order; the pick-up distance of the ride order is the distance from the current location of the pick-up vehicle to the order location of the ride order.

7. A device for processing online car-hailing orders, characterized in that: The device comprises: a determination unit, configured to determine a pick-up vehicle that matches each ride order based on the pick-up times and pick-up distances between multiple vehicles and multiple ride orders; wherein the pick-up time for a ride order is the time it takes for a vehicle to travel from a current location to a location where the ride order was placed; and the order waiting time for a ride order is the time from when the ride order was placed to the current time; If at least two ride orders are matched to the same pick-up vehicle, target probability values ​​for the at least two ride orders are determined based on the order waiting time, pick-up time, and pick-up distance of the at least two ride orders; and the ride order with the largest target probability value is used as the target ride order; wherein the target probability value of the ride order represents the degree of match between the ride order and the pick-up vehicle; A first dispatching unit, configured to dispatch the target ride order to the pick-up vehicle; a second dispatching unit, configured to determine that the at least two ride orders can be dispatched to the same pick-up vehicle if the at least two ride orders satisfy a first preset condition; the first preset condition being that the pick-up distance is less than or equal to a preset distance, and the pick-up duration is less than or equal to a first preset duration; the pick-up distance of the ride order being the distance from the current location of the pick-up vehicle to the location where the ride order was placed; Executing the order waiting time and the pick-up time based on the at least two ride orders, and determining a target ride order from the at least two ride orders, the determining unit is specifically configured to: If the absolute value of the order waiting time difference is greater than or equal to the first difference threshold, and the order waiting time of the first ride order is greater than the order waiting time of the second ride order, the first ride order will be used as the target ride order; the order waiting time difference is the difference between the order waiting time of the first ride order and the order waiting time of the second ride order; wherein, the at least two ride orders include the first ride order and the second ride order.

8. An electronic device, characterized in that: The method comprises a memory and a processor, wherein the memory stores a computer program that can be run on the processor, and when the computer program is executed by the processor, the method according to any one of claims 1 to 6 is implemented.

9. A computer-readable storage medium storing a computer program, wherein: When the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

Images