A method, device, electronic device and storage medium for determining success rate of group order

By dividing geographical areas in the online ride-hailing platform and matching orders, the success rate of orders is calculated, and the problem of difficult orders for orders is solved in different regions is solved, and efficient use of resources and improvement of user experience is achieved.

CN114897263BActive Publication Date: 2024-11-22NANJING LINGXING TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210644275.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-06-08
Publication Date
2024-11-22
Estimated Expiration
2042-06-08

AI Technical Summary

Technical Problem

It is difficult for the existing technology to effectively carry out the order-publishing business of riding orders in different geographical areas, resulting in the inability to efficiently utilize resources and poor user experience.

Method used

By dividing geographical areas, determining the order set of each area based on the riding order data, and performing order matching operations, calculating the order success rate of each area, so as to carry out targeted order trading.

Benefits of technology

It improves the pertinence and accuracy of the order-publishing business, optimizes resource allocation, and improves user experience and order-publishing success rate.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114897263B_ABST
    Figure CN114897263B_ABST
Patent Text Reader

Abstract

The present application provides a method, device, electronic device and storage medium for determining the success rate of group buying, which relates to the field of online car-hailing technology. The method divides a set geographical range into multiple geographical areas, determines order sets in multiple geographical areas, performs group buying matching operations on order sets between different geographical areas, and determines the group buying success rate corresponding to each geographical area. According to the group buying success rates corresponding to different geographical areas, the geographical areas that are more suitable for carrying out the group buying business of ride orders can be more accurately located, so that the group buying business of ride orders can be carried out in a more targeted manner.
Need to check novelty before this filing date? Find Prior Art

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 determining the success rate of a group-order. 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 car on the online ride-hailing platform to facilitate travel. As more and more people use online ride-hailing, during the peak travel period, the number of online ride-hailing platforms is difficult to guarantee that each user will be assigned an online ride-hailing car, and users do not have a lot of time to wait for the online ride-hailing platform to allocate an online ride-hailing car. In this case, the group-hailing service allows users who are on the way to take an online ride-hailing car, so that the limited number of online ride-hailing cars can provide services to more users.

[0003] However, not all geographical areas are suitable for developing the group-buying business for ride orders. How to develop the group-buying business for ride orders in a targeted manner is an issue that needs to be addressed urgently. 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 determining the success rate of group buying, which can predict the success rate of group buying corresponding to different geographical areas and carry out the business of group buying of ride orders in a targeted manner.

[0005] In a first aspect, an embodiment of the present application provides a method for determining a success rate of a group order, the method comprising:

[0006] Divide the set geographical range into multiple geographical areas, and determine the order set corresponding to each geographical area according to the ride order data within the geographical range; wherein the first order set corresponding to the first geographical area includes ride orders whose service vehicles are located within the first geographical area at the specified time; the first geographical area is any one of the multiple geographical areas;

[0007] Performing a group order matching operation on the ride orders in each order set and the ride orders in the corresponding candidate group order set, and determining the number of group orderable orders in each order set respectively; wherein the candidate group order set corresponding to the first order set is an order set that meets a set distance condition with the first order set;

[0008] According to the number of orders that can be grouped in each order set, the grouping success rate of the geographical area corresponding to each order set is determined respectively.

[0009] The present application provides a method for determining the success rate of group buying. By determining order sets of multiple geographical areas and group buying matching operations between order sets, the group buying success rate corresponding to each geographical area is determined. According to the group buying success rates corresponding to different geographical areas, the geographical areas that are more suitable for carrying out the group buying business of ride orders can be more accurately located, and the group buying business of ride orders can be carried out in a more targeted manner.

[0010] In a possible implementation, dividing the set geographical range into a plurality of geographical areas includes:

[0011] Acquiring ride order data within the geographical range; the ride order data is historical ride order data within a set time period;

[0012] Determine, based on the ride order data, the distribution density of service vehicles for the ride order within the geographical range at the specified time;

[0013] Based on the distribution density, the geographical range is divided into a plurality of geographical areas.

[0014] In a possible implementation manner, the set distance condition includes that the distance between the center points of the two geographical areas is less than or equal to the set distance; and the candidate group order set corresponding to the first order set is determined in the following manner:

[0015] Determine a center point of each geographical area, and respectively determine a distance between the center point of each geographical area and a center point of the first geographical area corresponding to the first order set;

[0016] The order set corresponding to the geographical area whose distance is less than or equal to the set distance is used as the candidate group order set corresponding to the first order set.

[0017] The above method divides the geographical areas and fits the ride orders from different locations in one geographical area to the center point of the geographical area. When determining the number of orders that can be grouped in each order set, the ride orders from different locations are processed through the center point of the geographical area, which greatly reduces the amount of calculation in the group order matching operation.

[0018] In a possible implementation manner, the ride order data includes time information and vehicle driving track information of each ride order; the number of orders that can be combined in the first order set is determined by:

[0019] According to the time information and vehicle driving trajectory information of each ride order, in the candidate order-sharing set corresponding to the first order set, respectively determine the ride orders that can be combined corresponding to each ride order in the first order set, and add the ride orders that can be combined to the order-sharing set of the first order set;

[0020] The number of orders that can be combined in the first order set is determined based on the number of ride orders in the groupable order set of the first order set and the number of ride orders in the first order set.

[0021] In a possible implementation, determining, in the candidate group order set corresponding to the first order set according to the time information and the vehicle driving trajectory information of each ride order, the groupable ride orders corresponding to each ride order in the first order set respectively include:

[0022] Take each ride order in the first order set as the first ride order in turn, and perform the following operations on the first ride order:

[0023] According to the time information of each ride order, in the candidate ride order set corresponding to the first order set, determine the ride orders to be combined that meet the set time condition with the first ride order;

[0024] According to the vehicle driving trajectory information of each ride order, each ride order to be combined is matched with the first ride order, and the ride order to be combined that matches the first ride order is used as the ride order that can be combined corresponding to the first ride order.

[0025] In a possible implementation manner, the set time condition includes that time information of the ride order overlaps with a time interval of the first ride order that can be grouped; and determining, according to the time information of each ride order, a ride order to be grouped that meets the set time condition with the first ride order in a candidate grouping set corresponding to the first order set, includes:

[0026] Based on the designated time and the set duration, determining a time interval during which the first ride order can be combined;

[0027] Comparing the time information of each ride order in the candidate ride order set with the available ride order time interval of the first ride order;

[0028] The ride orders whose time information overlaps with the time interval that can be combined with the first ride order are used as the ride orders to be combined with the first ride order.

[0029] In a possible implementation, the step of performing a group-matching operation on each ride order to be grouped with the first ride order according to the vehicle driving trajectory information of each ride order, and using the ride order to be grouped that matches the first ride order as the groupable ride order corresponding to the first ride order includes:

[0030] Based on the vehicle driving trajectory information of the first ride order, determine the first regional trajectory information corresponding to the first ride order; the first regional trajectory information includes each intermediate geographical area passed by the service vehicle of the first ride order;

[0031] For each ride order to be grouped, perform the following operations:

[0032] If each intermediate geographical area in the first area trajectory information meets the set matching conditions with the end geographical area of ​​the first ride order and the starting geographical area of ​​the ride order to be combined, the ride order to be combined will be used as the combineable ride order corresponding to the first ride order; the end geographical area of ​​the first ride order is the geographical area to which the order end point in the vehicle driving trajectory information of the first ride order belongs; the starting geographical area of ​​the ride order to be combined is the geographical area to which the order starting point in the vehicle driving trajectory information of the ride order to be combined belongs.

[0033] In a possible implementation, the set matching conditions include: the angle between the first line and the horizontal line is less than or equal to the set first angle, and the angle between the second line and the fourth line is less than or equal to the set second angle, and the angle between the third line and the horizontal line is greater than the first angle; the first line is a line between the center point of the first intermediate geographical area and the center point of the starting geographical area of ​​the ride order to be combined; the second line is a line between the center point of the first intermediate geographical area and the center point of the ending geographical area of ​​the first ride order; the third line is a line between the center point of the ending geographical area of ​​the first ride order and the center point of the starting geographical area of ​​the ride order to be combined; the fourth line is a line between the center point of the starting geographical area of ​​the ride order to be combined and the center point of the ending geographical area of ​​the ride order to be combined;

[0034] The first intermediate geographical area is any intermediate geographical area in the first area trajectory information.

[0035] In a possible implementation manner, the group order success rate of the first geographical area corresponding to the first order set is determined in the following manner:

[0036] The ratio of the sum of the number of orders that can be grouped in the first order set and the number of ride orders in the first order set to the sum of the number of ride orders in the candidate grouping set and the number of ride orders in the first order set is taken as the grouping success rate of the first geographical area.

[0037] In a possible implementation, after performing a group order matching operation on the ride orders in each order set and the ride orders in the corresponding candidate group order set, the method further includes:

[0038] For each pair of order groups consisting of two matching ride orders, a carpooling parameter of each pair of order groups is determined to obtain a plurality of carpooling parameters.

[0039] A carpooling parameter threshold is determined based on an average value of the multiple carpooling parameters; the carpooling parameter threshold is used to determine whether two ride orders to be matched can be grouped in the process of providing grouping services.

[0040] The above method can determine the carpooling parameter threshold before launching the carpooling service, so as to determine whether two carpooling orders to be matched can be matched during the process of providing the carpooling service after launching the carpooling service.

[0041] In a possible implementation manner, the ride order data includes an order end point of each ride order; the ride sharing parameter of the first ride shareable order pair is determined in the following manner, and the first ride shareable order pair is any ride shareable order pair:

[0042] Determine the estimated driving trajectory information of the first service vehicle based on the order end points of the two ride orders included in the first order pair that can be combined; the first service vehicle refers to the vehicle that serves the two ride orders included in the first order pair that can be combined;

[0043] Determine the carpooling parameters of the first carpoolable order pair based on the estimated driving trajectory information of the first service vehicle.

[0044] In a possible implementation manner, the first order pair that can be combined includes a second ride order and a third ride order; and determining the estimated driving trajectory information of the first service vehicle based on the order end points of the two ride orders included in the first order pair that can be combined includes:

[0045] If the angle between the fifth connecting line and the horizontal line is less than or equal to the set first angle, the estimated driving trajectory information of the first service vehicle is determined to be the first estimated trajectory; the fifth connecting line is a connecting line between the center point of the geographical area to which the order end point of the second ride order belongs and the center point of the geographical area to which the order end point of the third ride order belongs; the first estimated trajectory means that the service vehicle of the first order-matching pair first passes through the order end point of the second ride order and then passes through the order end point of the third ride order;

[0046] If the angle between the fifth line and the horizontal line is greater than the first angle, the estimated driving trajectory information of the first service vehicle is determined to be the second estimated trajectory; the second estimated trajectory means that the service vehicle of the first groupable order pair first passes through the order end point of the third ride order, and then passes through the order end point of the second ride order.

[0047] In a possible implementation manner, the ride order data includes vehicle driving trajectory information of each ride order; the first ride order pair that can be combined includes a second ride order and a third ride order; and determining the estimated driving trajectory information of the first service vehicle based on the order end points of the two ride orders included in the first ride order pair that can be combined includes:

[0048] Based on the vehicle driving trajectory information of the second ride order and the vehicle driving trajectory information of the third ride order, determining a plurality of vehicle driving trajectories including the order end point of the second ride order and the order end point of the third ride order;

[0049] The driving trajectory of the vehicle with the shortest driving distance is used as the estimated driving trajectory information of the first service vehicle.

[0050] In a possible implementation manner, the carpooling parameter includes a carpooling coefficient; and determining the carpooling parameter of the first carpoolable order pair according to the estimated driving trajectory information of the first service vehicle includes:

[0051] When users of two ride orders included in the first shareable order pair ride together in the first service vehicle, the ratio of the distance traveled by the first service vehicle to the distance traveled corresponding to the estimated driving trajectory information is used as the shareholding coefficient of the first shareable order pair.

[0052] In a possible implementation manner, the carpooling parameters of the first carpoolable order pair include a detour ratio of the second carpooling order, a detour ratio of the third carpooling order, a redundant time of the second carpooling order, and a redundant time of the third carpooling order; and determining the carpooling parameters of the first carpoolable order pair according to the estimated driving trajectory information of the first service vehicle includes:

[0053] If the estimated driving trajectory information of the first service vehicle is the first estimated trajectory, the ratio of the distance from the position of the first service vehicle at the specified time to the end point of the ride order of the second ride order in the first estimated trajectory to the distance from the position of the first service vehicle at the specified time to the end point of the ride order of the second ride order is used as the detour ratio of the second ride order; the ratio of the driving distance corresponding to the first estimated trajectory to the sum of the distance from the position of the first service vehicle at the specified time to the starting point of the ride order of the third ride order and the distance from the starting point of the ride order of the third ride order to the end point of the ride order of the third ride order is used as the detour ratio of the third ride order. Detour ratio; taking the ratio of the time corresponding to the distance from the position of the first service vehicle at the specified time to the end point of the ride order of the second ride order in the first estimated trajectory to the order duration of the distance from the position of the first service vehicle at the specified time to the end point of the ride order of the second ride order as the redundant duration of the second ride order; taking the ratio of the time corresponding to the driving distance corresponding to the first estimated trajectory to the sum of the distance from the position of the first service vehicle at the specified time to the ride order starting point of the third ride order and the distance from the ride order starting point of the third ride order to the ride order ending point of the third ride order as the redundant duration of the third ride order;

[0054] If the estimated driving trajectory information of the first service vehicle is the second estimated trajectory, the ratio of the distance of the second estimated trajectory to the distance from the position of the first service vehicle at the specified time to the end point of the ride order of the second ride order is used as the detour ratio of the second ride order; the detour ratio of the third ride order is a set value; the ratio of the time corresponding to the distance of the second estimated trajectory to the order duration corresponding to the distance from the position of the first service vehicle at the specified time to the end point of the ride order of the second ride order is used as the redundant duration of the second ride order; the redundant duration of the third ride order is a set value.

[0055] In a second aspect, the present application provides a device for determining a success rate of a group order, the device comprising:

[0056] a division unit, configured to divide a set geographical range into a plurality of geographical areas, and determine an order set corresponding to each geographical area according to the ride order data within the geographical range; wherein a first order set corresponding to a first geographical area includes ride orders whose service vehicles are located within the first geographical area at a specified time; and the first geographical area is any one of the plurality of geographical areas;

[0057] A group order matching unit is used to perform a group order matching operation on the ride orders in each order set with the ride orders in the corresponding candidate group order set, and determine the number of group orderable orders in each order set respectively; wherein the candidate group order set corresponding to the first order set is an order set that meets a set distance condition with the first order set;

[0058] The first determination unit is used to determine the order grouping success rate of the geographical area corresponding to each order set according to the number of orders that can be grouped in each order set.

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

[0060] A second determination unit is used to determine the carpooling parameters of each carpooling order pair consisting of two matching ride orders, to obtain a plurality of carpooling parameters;

[0061] A carpooling parameter threshold is determined based on an average value of the multiple carpooling parameters; the carpooling parameter threshold is used to determine whether two ride orders to be matched can be grouped in the process of providing grouping services.

[0062] 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 determining the success rate of group buying in the first aspect is implemented.

[0063] 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, any one of the methods described in the first aspect, a method for determining a success rate of group buying, is implemented.

[0064] The technical effects brought about by any one of the implementation methods in the second to fourth aspects can refer to the technical effects brought about by the corresponding implementation method in the first aspect, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0065] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. 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 creative labor.

[0066] Figure 1 A flowchart of a method for determining a success rate of a group order provided in an embodiment of the present application;

[0067] Figure 2This is one of the schematic diagrams of a process of placing an order provided in an embodiment of the present application;

[0068] Figure 3 The second schematic diagram of a process of group buying provided in an embodiment of the present application;

[0069] Figure 4 A third schematic diagram of a process of group buying provided in an embodiment of the present application;

[0070] Figure 5 A flowchart of another method for determining the success rate of a group order provided in an embodiment of the present application;

[0071] Figure 6 One of the schematic diagrams for determining estimated driving trajectory information provided in an embodiment of the present application;

[0072] Figure 7 A second schematic diagram of determining estimated driving trajectory information provided in an embodiment of the present application;

[0073] Figure 8 A schematic diagram of first estimated trajectory information provided in an embodiment of the present application;

[0074] Fig. 9 A schematic diagram of second estimated trajectory information provided in an embodiment of the present application;

[0075] Fig.10 A schematic diagram of the structure of a device for determining a success rate of a group order provided in an embodiment of the present application;

[0076] Fig.11 A schematic diagram of the structure of another device for determining the success rate of group buying provided in an embodiment of the present application;

[0077] Fig.12 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0078] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application will be further described in detail below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present application.

[0079] 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 inherent to these processes, methods, products or devices.

[0080] In order to carry out the group order business of ride orders in a more targeted manner, an embodiment of the present application provides a method for predicting the success rate of group order, which divides a set geographical range into multiple geographical areas, and determines the order sets corresponding to each geographical area based on the ride order data within the geographical range, wherein a first order set corresponding to a first geographical area includes ride orders whose service vehicles are located within the first geographical area at a specified time, and the first geographical area is any one of the multiple geographical areas. The ride orders in each order set are matched with the ride orders in the corresponding candidate group order set, and the number of groupable orders of each order set is determined, wherein the candidate group order set corresponding to the first order set is an order set that meets the set distance condition with the first order set, and the success rate of group order for the geographical area corresponding to each order set is determined based on the number of groupable orders of each order set.

[0081] Through the method of the present application, order sets of multiple geographical areas can be determined, and order sets between different geographical areas can be matched to obtain the number of orders that can be grouped in each order set. The grouping success rate corresponding to each geographical area can be calculated. According to the grouping success rates corresponding to different geographical areas, the geographical areas that are more suitable for carrying out the ride order grouping business can be more accurately located, and the ride order grouping business can be carried out in a more targeted manner.

[0082] Figure 1 The flowchart of a method for predicting the success rate of a group order provided by an embodiment of the present application is shown, and the method for predicting the success rate of a group order can be applied to a server. Figure 1 As shown, the method for predicting the success rate of group buying provided in the embodiment of the present application includes the following steps:

[0083] Step S101: Divide the set geographical range into multiple geographical areas, and determine the order set corresponding to each geographical area based on the ride order data within the geographical range.

[0084] In a possible embodiment, before launching the ride order grouping business, the success rate of grouping within a certain geographical range needs to be predicted, and the server will obtain the ride order data within the geographical range, which are historical ride order data within a set time period. The server divides the set geographical range into multiple geographical areas based on the acquired ride order data, and determines the order set corresponding to each geographical area based on the ride order data within the geographical range. The set geographical range can be a city or a region. Taking the geographical range of selecting a city in an electronic map as an example, when selecting the geographical range, a city with more ride orders can be selected.

[0085] Exemplarily, the method of dividing the set geographical range into multiple geographical areas is as follows:

[0086] According to the ride order data, at a specified time, the distribution density of service vehicles for the ride order within the geographical scope is determined, and based on the distribution density, the geographical scope is divided into multiple geographical areas.

[0087] The ride order data includes time information, vehicle driving trajectory information, and the latitude and longitude information of the service vehicle. The time information is understood as the user's demand time. When the user places a ride order, the user specifies the time to use the vehicle. The online ride-hailing platform allocates the service vehicle to the user according to the user's demand time when the user places the order. The vehicle driving trajectory information includes the driving distance of the service vehicle, the order starting point, the order ending point, and the time point corresponding to the entire vehicle driving trajectory information.

[0088] The greater the distribution density of service vehicles within the geographical scope, the higher the accuracy of dividing geographical areas, and the more geographical areas are divided; the smaller the distribution density of service vehicles within the geographical scope, the lower the accuracy of dividing geographical areas, and the fewer geographical areas are divided. Through this division method, it can be ensured that after the geographical scope is divided into multiple geographical areas, the number of ride orders in each geographical area is not much different, and the final determined carpooling success rate is more accurate.

[0089] In the embodiment of the present application, the geographical area obtained by division can be a triangular geographical area, a quadrilateral geographical area, a hexagonal geographical area, etc., and the following description takes a hexagonal geographical area as an example. In one embodiment, the set geographical range is divided by the above-mentioned method of dividing the geographical area to obtain a plurality of hexagonal geographical areas of equal area, and the area of ​​each hexagonal geographical area can be 0.22km 2 about.

[0090] The order set corresponding to each geographical area can be determined in the following manner: each geographical area is sequentially taken as the first geographical area, and for the first geographical area, if the position of the service vehicle is located in the first geographical area at the specified time, the ride orders on the service vehicle at this time are taken as the ride orders in the first order set corresponding to the first geographical area. The above-mentioned specified time can also be a very short period of time. For example, within a specified period of 3 seconds, the position of the service vehicle will not change much. At this time, the position of the service vehicle is located in the first geographical area, and the ride orders on the service vehicle can be taken as the ride orders in the first order set.

[0091] The location of the service vehicle of a ride order can be determined by the latitude and longitude information of the service vehicle. For example, if the location coordinates of the service vehicle of a ride order at a specified time are (118.803434, 32.032938), after dividing the set geographical range, the ride order falls into the hexagonal geographical area numbered 613343945537093631, and the location coordinates of the center point of the hexagonal geographical area are (118.803883, 32.029966).

[0092] In the above manner, the order set of the domain corresponding to each hexagonal geographical area can be determined.

[0093] Step S102: performing a group order matching operation on the ride orders in each order set and the ride orders in the corresponding candidate group order set, and determining the number of group orderable orders in each order set.

[0094] The process of matching the ride orders in each of the above-mentioned order sets with the ride orders in the corresponding candidate order set can be illustrated by taking the first order set and the ride orders in the candidate order set corresponding to the first order set as an example.

[0095] In a possible embodiment, the candidate group order set corresponding to the first order set can be determined in the following manner: determine the center point of each geographic area, and respectively determine the distance between the center point of each geographic area and the center point of the first geographic area corresponding to the first order set, and take the order sets corresponding to the geographic areas whose distances are less than or equal to the set distance as the candidate group order set corresponding to the first order set.

[0096] Considering that if the distance between the center point of the geographical area corresponding to the candidate group order set and the center point of the first geographical area corresponding to the first order set is large, it may be greater than the distance that the service vehicle directly delivers the ride orders in the first order set to the end point of their corresponding ride orders, then if a carpooling operation is performed, taking a detour too far for the ride orders in the first order set will bring a bad riding experience to its users. Therefore, by setting a distance condition to limit the distance between the center point of the geographical area corresponding to the first order set and the center point of the geographical area corresponding to its corresponding candidate group order set, it is ensured that users of ride orders that already exist on the service vehicle's vehicle will not take a detour too far and will not waste too much time, thereby improving the user's riding experience.

[0097] After determining the candidate group order set corresponding to the first order set, the number of groupable orders of the first order set can be determined in the following manner: according to the time information and vehicle driving trajectory information of each ride order, in the candidate group order set corresponding to the first order set, the groupable ride orders corresponding to each ride order in the first order set are determined respectively, and the groupable ride orders are added to the groupable orders set of the first order set, and the number of groupable orders of the first order set is determined according to the number of ride orders in the groupable orders set of the first order set and the number of ride orders in the first order set. Among them, the time information of the ride order and the vehicle driving trajectory information are both data in the ride order data.

[0098] In the above process of determining the ride orders that can be combined corresponding to each ride order in the first order set, the same operation can be performed on each ride order in the first order set. Exemplarily, each ride order in the first order set is sequentially taken as the first ride order. Taking the first ride order as an example, the process of determining the ride orders that can be combined for the first ride order is as follows:

[0099] According to the time information of each ride order, in the candidate group order set corresponding to the first order set, the ride orders to be grouped that meet the set time conditions with the first ride order are determined; according to the vehicle driving trajectory information of each ride order, each ride order to be grouped is matched with the first ride order; the ride orders to be grouped that match the first ride order are used as the ride orders that can be grouped corresponding to the first ride order.

[0100] Specifically, the process of determining the ride orders that can be combined with the first ride order includes the following two steps:

[0101] Step 1: From the candidate group order set corresponding to the first order set, determine the ride order to be grouped that meets the set time condition with the first ride order. The set time condition includes that the time information of the ride order overlaps with the group order available time interval of the first ride order.

[0102] The specific implementation method is as follows: based on the specified time and the set duration, determine the time interval for the first ride order that can be grouped together, compare the time information of each ride order in the candidate group-ordering set with the time interval for the first ride order that can be grouped together, and select the ride orders whose time information overlaps with the time interval for the first ride order as the ride orders to be grouped together with the first ride order.

[0103] Exemplarily, taking the time point in the current driving trajectory information as the designated time t, setting the duration as T, the available order-sharing time interval is [tT, t+T], where T can be 10 minutes or 5 minutes. Taking T=10 minutes as an example, the available order-sharing interval is [t-10, t+10]. In the process of combining the first ride order with each ride order in the candidate order-sharing set, the user demand time specified when placing each ride order in the candidate order-sharing set is determined. If the time information is within the available order-sharing time interval, it can be used as the ride order to be combined with the first ride order.

[0104] By setting the time condition, each ride order in the candidate group order set corresponding to the first ride order can be screened. The time condition is set so that when the first ride order is matched with another ride order, the service vehicle will not waste too much time of the user of the first ride order when picking up the user of the other ride order, thus ensuring the user's riding experience. Before launching the ride order group order business, it is necessary to fully consider how to ensure the riding experience of the user of the first ride order.

[0105] Step 2: According to the vehicle driving trajectory information of each ride order, each ride order to be grouped is matched with the first ride order, and the ride order to be grouped that matches the first ride order is used as the ride order that can be grouped corresponding to the first ride order.

[0106] The specific implementation method is as follows: based on the vehicle driving trajectory information of the first ride order, determine the first regional trajectory information corresponding to the first ride order. If each intermediate geographical area in the first regional trajectory information satisfies the set matching conditions with the ending geographical area of ​​the first ride order and the starting geographical area of ​​the ride order to be shared, the ride order to be shared is used as the ride order that can be shared corresponding to the first ride order.

[0107] The first area trajectory information includes each intermediate geographical area that the service vehicle of the first ride order passes through. The end geographical area of ​​the first ride order is the geographical area to which the order end point in the vehicle driving trajectory information of the first ride order belongs. The starting geographical area of ​​the ride order to be combined is the geographical area to which the order start point in the vehicle driving trajectory information of the ride order to be combined belongs. The intermediate geographical area can be understood as the geographical area corresponding to the passing point of the vehicle driving trajectory information.

[0108] The matching conditions set in step 2 may include three conditions, and all three conditions need to be met in the process of matching the first ride order with the ride order to be shared.

[0109] The matching conditions are as follows:

[0110] The first condition: the angle between the first connecting line and the horizontal line is less than or equal to the set first angle. The first connecting line is the connecting line between the center point of the first intermediate geographical area and the center point of the starting geographical area of ​​the ride order to be shared. The first intermediate geographical area is any intermediate geographical area in the first area trajectory information.

[0111] The center point of the geographical area corresponding to the starting point of the first ride order is set as point A, the center point of the ending geographical area of ​​the first ride order is set as point B, the center point of the starting geographical area of ​​the ride order to be grouped is set as point C, the center point of the ending geographical area of ​​the ride order to be grouped is set as point D, and the center point of the first intermediate geographical area is set as point E.

[0112] Figure 2 The vehicle driving trajectory information of the ride order to be grouped and the vehicle driving trajectory information of the first ride order are specified in the two vehicle driving trajectory information, and the center point of the geographical area corresponding to the starting point of the first ride order is marked as point A, the center point of the ending geographical area of ​​the first ride order is point B, the center point of the starting geographical area of ​​the ride order to be grouped is point C, the center point of the ending geographical area of ​​the ride order to be grouped is point D, and the center point of the first intermediate geographical area is point E.

[0113] The first angle is 90 degrees, for example. Figure 2 As shown. Then the angle between the first connecting line CE and the horizontal line starting from E and going to the right is α, and the angle α should be less than or equal to 90 degrees.

[0114] The first condition mentioned above is to ensure that if the ride order to be combined is successfully combined with the first ride order, when the service vehicle arrives at the order starting point of the ride order to be combined to receive the user of the combined ride order, the service vehicle will not have already driven to the first intermediate geographical area and need to turn around to go to the order starting point of the ride order to be combined, so as to reduce the possibility of taking a detour.

[0115] The second condition: the angle between the second connecting line and the fourth connecting line is less than or equal to the set second angle. The second connecting line is the connecting line between the center point of the first intermediate geographical area and the center point of the ending geographical area of ​​the first ride order; the fourth connecting line is the connecting line between the center point of the starting geographical area of ​​the ride order to be shared and the center point of the ending geographical area of ​​the ride order to be shared.

[0116] The second angle is 60 degrees, for example. Figure 3 As shown. The second connecting line EB and the fourth connecting line CD pass through Figure 3 In the manner shown, the angle between the parallel line of the second connecting line EB and the fourth connecting line CD is β, and the angle β should be less than or equal to 60 degrees.

[0117] The second condition mentioned above further limits the service vehicle to picking up users of group ride orders along the way while sending the user of the first ride order to the order end point. When the angle between the second line EB and the fourth line CD is less than or equal to 60 degrees, the first ride order and the ride order to be grouped are considered to be along the way.

[0118] The third condition: the angle between the third connecting line and the horizontal line is greater than the first angle. The third connecting line is a connecting line between the center point of the ending geographical area of ​​the first ride order and the center point of the starting geographical area of ​​the ride order to be shared.

[0119] The first angle is 90 degrees, for example. Figure 4 As shown. The angle between the third connecting line CB and the horizontal line drawn to the right from B is γ, then the angle γ should be greater than 90 degrees.

[0120] The third condition mentioned above is to ensure that the service vehicle will not be matched with a waiting ride order when it is about to reach the destination of the first ride order, and finally matched successfully, thereby affecting the riding experience of the user of the first ride order.

[0121] By setting the matching conditions as described above, the ride orders that can be grouped and that correspond to the first ride order can be selected from the ride orders to be grouped that meet the set matching conditions.

[0122] Through the above steps 1 and 2, the ride orders that can be grouped and corresponding to each ride order in the first order set can be determined.

[0123] By dividing the geographical areas, the ride orders originally from different locations in one geographical area are all fitted to the center point of the geographical area. When determining the number of orders that can be grouped in each order set, the ride orders from different locations are processed through the center point of the geographical area, which greatly reduces the amount of calculation during the group-order matching operation.

[0124] After determining the ride orders that can be grouped corresponding to each ride order in the first order set, all the ride orders that can be grouped are grouped into a group of orders that can be grouped, and the number of orders that can be grouped in the first order set can be determined eventually. In the process of determining the number of orders that can be grouped, each ride order in the group of orders that can be grouped in the first order set is counted only once, and will not be counted repeatedly. For example, if a ride order that can be grouped can be matched with multiple ride orders in the first order set, the ride order that can be grouped is counted only once when the group of orders that can be grouped is formed.

[0125] For example, if each ride order in the first order set has a ride order that can be combined, the number of ride orders that can be combined in the first order set is the sum of the number of ride orders in the groupable order set of the first order set and the number of ride orders in the first order set. If there are 3 ride orders in the first order set that cannot be combined and matched with any ride orders in any candidate grouping set when performing a grouping operation with the candidate grouping set corresponding to the first order set, the number of ride orders that can be combined in the first order set is the sum of the number of ride orders in the groupable order set of the first order set and the number of ride orders in the first order set, minus 3.

[0126] The number of orders that can be combined into one order corresponding to the first order set is determined in the above manner, and the number of orders that can be combined into one order for each order set can be determined in a similar manner.

[0127] Step S103: According to the number of orders that can be grouped in each order set, determine the grouping success rate of the geographical area corresponding to each order set.

[0128] In a possible embodiment, the group order success rate of the geographical area corresponding to each order set can be explained by taking the group order success rate of the geographical area corresponding to the first order set as an example.

[0129] The method for determining the group order success rate of the geographical area corresponding to the first order set is as follows:

[0130] The ratio of the sum of the number of orders that can be grouped in the first order set and the number of ride orders in the first order set to the sum of the number of ride orders in the candidate grouped order set and the number of ride orders in the first order set is taken as the grouped order success rate in the first geographical area.

[0131] The order grouping success rate of the geographical area corresponding to each order set can be determined in a similar manner, which will not be elaborated here.

[0132] After determining the group buying success rate of the geographical area corresponding to each order set through the above method, we can carry out ride order group buying business in places with higher group buying success rates according to the differences in group buying success rates between different geographical areas, and choose not to carry out ride order group buying business in places with extremely low group buying success rates.

[0133] In a possible implementation, the ride orders in each order set are matched with the ride orders in the corresponding candidate share order set. After the shareable ride orders corresponding to each order set have been determined, the present application also provides a flow chart for determining the share order parameter threshold, such as Figure 5 As shown, the steps are as follows:

[0134] Step S501: for each carpooling order pair consisting of two matching ride orders, carpooling parameters of each carpooling order pair are determined respectively to obtain a plurality of carpooling parameters.

[0135] In a possible embodiment, any one of the order pairs that can be combined is used as the first order that can be combined, and the carpooling parameters of the first order pair that can be combined are determined in the following manner:

[0136] Based on the order end points of the two ride orders included in the first groupable order pair, the estimated driving trajectory information of the first service vehicle is determined, and according to the estimated driving trajectory information of the first service vehicle, the carpooling parameters of the first groupable order pair are determined.

[0137] The first service vehicle refers to a vehicle that serves two ride orders included in the first shareable order pair. The first shareable order pair includes a second ride order and a third ride order, and the second ride order is the ride order received first by the service vehicle, and the third ride order is the shareable ride order received later by the service vehicle.

[0138] The above method of determining the estimated driving trajectory of the first service vehicle is as follows: There are two specific cases:

[0139] Case 1: If the angle between the fifth connecting line and the horizontal line is less than or equal to the set first angle, the estimated driving trajectory information of the first service vehicle is determined to be the first estimated trajectory.

[0140] The fifth line is a line connecting the center point of the geographical area to which the order end point of the second ride order belongs and the center point of the geographical area to which the order end point of the third ride order belongs. The first estimated trajectory means that the service vehicle of the first order-matching order pair first passes through the order end point of the second ride order and then passes through the order end point of the third ride order.

[0141] For example, Figure 6The vehicle driving trajectory information of the second ride order and the vehicle driving trajectory information of the third ride order are indicated in FIG. The first angle is 90 degrees as an example. Figure 6 As shown, the center point of the end geographical area of ​​the second ride order is set as point X, and the center point of the end geographical area of ​​the third ride order is set as point Y. Then the angle between the fifth connecting line XY and the horizontal line starting from point X and going to the right is δ, and the angle δ should be less than or equal to 90 degrees.

[0142] Case 2: If the angle between the fifth connecting line and the horizontal line is greater than the first angle, the estimated driving trajectory information of the first service vehicle is determined to be the second estimated trajectory.

[0143] Among them, the second estimated trajectory means that the service vehicle of the first shareable order pair first passes through the order end point of the third ride order, and then passes through the order end point of the second ride order.

[0144] For example, the first angle is 90 degrees. Figure 7 As shown, the center point of the end geographical area of ​​the second ride order is set to point X, and the center point of the end geographical area of ​​the third ride order is set to point Y. Then the angle between the fifth connecting line XY and the horizontal line starting from point X to the right is ε, and the angle ε should be greater than 90 degrees.

[0145] After determining the estimated driving trajectory information of the first service vehicle, the carpooling parameters of the first carpoolable order pair may be determined based on the estimated driving trajectory information of the first service vehicle.

[0146] The carpooling parameters of the first carpoolable order pair include: a carpooling coefficient, a detour ratio of the second carpooling order, a detour ratio of the third carpooling order, a redundant time of the second carpooling order, and a redundant time of the third carpooling order.

[0147] The order start point of the second ride order is set to M, the order end point of the second ride order is set to X, the order start point of the third ride order is set to N, and the order end point of the third ride order is set to Y. The position of the service vehicle at the specified time can be set to point K, and point K is used as the position where the service vehicle receives the third ride order.

[0148] After determining the estimated trajectory of the first service vehicle, it is necessary to determine the carpooling parameters. It is only necessary to calculate the corresponding carpooling parameters according to the estimated trajectory determined by the first service vehicle. There are two ways to determine the carpooling parameters:

[0149] Case 1: If the estimated driving trajectory information of the first service vehicle is determined to be the first estimated trajectory, the carpooling parameters are determined based on the first estimated trajectory, and the specific method is as follows:

[0150] In this case, the first service vehicle starts from point K and first goes to the starting point of the third ride order to receive the user of the third ride order. Then the first service vehicle first delivers the user of the second ride order and then the user of the third ride order. The first estimated trajectory is as follows: Figure 8 As shown in the bold part, the distance corresponding to KN+NX+XY is the first estimated trajectory of the first service vehicle.

[0151] Carpooling coefficient = NX / (KN+NX+XY). NX represents the distance traveled by the first service vehicle from the order start point of the third ride order to the order end point of the second ride order. This distance is the distance traveled by the second ride order and the third ride order together in the first service vehicle. KN+NX+XY represents the distance traveled corresponding to the first estimated trajectory. Among them, the carpooling coefficient is the ratio of the distance traveled by the first service vehicle to the distance traveled corresponding to the estimated driving trajectory information when the users of two ride orders ride together in the first service vehicle. The second ride order and the third ride order can only be considered a pair of orders that can be shared when the first service vehicle receives the third ride order.

[0152] The detour ratio of the second ride order = (KN + NX) / KX, (KN + NX) is the distance from the position of the first service vehicle at the specified time to the end point of the ride order of the second ride order in the first estimated trajectory. KX is the distance from the position of the first service vehicle at the specified time to the end point of the ride order of the second ride order.

[0153] The redundant time of the second ride order = eta(KN+NX) / eta(KX), where eta(KN+NX) represents the time spent by the first service vehicle in the KN+NX section, and eta(KX) represents the time spent by the first service vehicle in the KX section.

[0154] The detour ratio of the third ride order = (KN+NX+XY) / (KN+NY), where (KN+NX+XY) is the driving distance corresponding to the first estimated trajectory, and (KN+NY) represents the sum of the distance from the position of the first service vehicle at the specified time to the starting point of the ride order of the shareable ride order and the distance from the starting point of the ride order of the shareable ride order to the end point of the ride order of the shareable ride order.

[0155] The redundant time of the third ride order = eta(KN+NX+XY) / eta(KN+NY), where eta(KN+NX+XY) represents the time spent by the first service vehicle on the distance (KN+NX+XY), and eta(KN+NY) represents the time spent by the first service vehicle on the distance (KN+NY).

[0156] Case 2: If the estimated driving trajectory information of the first service vehicle is determined to be the second estimated trajectory, the carpooling parameters are determined based on the second estimated trajectory, and the specific method is as follows:

[0157] In this case, the first service vehicle receives the third ride order from point K and goes to the order starting point of the third ride order to pick up the user of the third ride order. Then the first service vehicle first delivers the user of the third ride order and then the user of the second ride order. The second estimated trajectory under case 2 is as follows: Fig. 9 The bold black part is shown in the figure.

[0158] Then the carpooling coefficient = NY / (KN+NY+YX), where NY represents the distance traveled by the first service vehicle from the order start point of the third ride order to the order end point of the third ride order, which is the distance traveled by the user of the second ride order and the user of the third ride order together in the first service vehicle. (KN+NY+YX) represents the distance traveled by the first service vehicle according to the second estimated trajectory.

[0159] The detour ratio of the second ride order = (KN+NY+YX) / KX, where KX represents the distance from the position of the first service vehicle at a specified time to the end point of the ride order of the second ride order.

[0160] The redundant time of the second ride order = eta(KN+NY+YX) / eta(KX), where eta(KN+NY+YX) represents the time it takes for the first service vehicle to travel the distance (KN+NY+YX). eta(KX) represents the time it takes for the first service vehicle to travel the distance KX.

[0161] After receiving the third ride order, the first service vehicle directly delivers the user of the third ride order to the order end point of the third ride order, so the detour ratio of the third ride order is 1. Similarly, the redundant time of the third ride order is 1.

[0162] After determining the carpooling parameters of the first order that can be grouped together in the above manner, the carpooling parameters of each pair of orders that can be grouped together can be determined, and a plurality of carpooling parameters are obtained, and step S502 is then executed.

[0163] Step S502: Determine a carpooling parameter threshold value according to an average value of a plurality of carpooling parameters.

[0164] Among them, the carpooling parameter threshold is used to determine whether two ride orders to be matched can be grouped in the process of providing grouping services.

[0165] By determining the carpooling parameter threshold in the above manner, in the geographical area where carpooling orders are carried out, the carpooling parameters determined during the use of the carpooling service can be compared with the carpooling parameter threshold, and whether carpooling is possible can be determined through more accurate parameter values.

[0166] It should be noted that the method for determining the estimated driving trajectory information of the first service vehicle may also include: based on the vehicle driving trajectory information of the second ride order and the vehicle driving trajectory information of the third ride order, determining multiple vehicle driving trajectories including the order end point of the second ride order and the order end point of the third ride order, and using the vehicle driving trajectory with the shortest driving distance as the estimated driving trajectory information of the first service vehicle.

[0167] After the server determines that the second ride order and the third ride order can be combined, it determines the vehicle driving trajectory of the service vehicle with the shortest driving distance in the process of picking up and dropping off users of the second ride order and users of the third ride order from the vehicle driving trajectory information of the second ride order and the vehicle driving trajectory information of the third ride order.

[0168] Furthermore, according to the above method, after the ride order grouping business is launched, the number of service vehicles can be dispatched in advance according to the grouping success rate between each geographical area, as well as the user's willingness to group and the driver's willingness to accept grouping orders. For example, if the proportion of users' willingness to group in two geographical areas is roughly the same, then in the two geographical areas, the geographical area with a higher grouping success rate can deploy more service vehicles willing to accept grouping orders.

[0169] Based on the same inventive concept, an embodiment of the present invention also provides a structural schematic diagram of a device for determining a success rate of a group order, such as Fig.10 As shown, the device for determining the success rate of group ordering includes:

[0170] The division unit 1001 is used to divide the set geographical range into multiple geographical areas, and determine the order set corresponding to each geographical area according to the ride order data within the geographical range; wherein the first order set corresponding to the first geographical area includes the ride orders whose service vehicles are located within the first geographical area at the specified time; the first geographical area is any one of the multiple geographical areas;

[0171] The group order matching unit 1002 is used to perform a group order matching operation on the ride orders in each order set and the ride orders in the corresponding candidate group order set, and respectively determine the number of group orderable orders of each order set; wherein the candidate group order set corresponding to the first order set is an order set that meets a set distance condition with the first order set;

[0172] The first determining unit 1003 is used to determine the order grouping success rate of the geographical area corresponding to each order set according to the number of orders that can be grouped in each order set.

[0173] In one possible implementation, Fig.11 A schematic diagram of the structure of another device for determining the success rate of a group order provided in an embodiment of the present application is shown. The device for determining the success rate of a group order also includes:

[0174] The second determining unit 1101 is used to determine the carpooling parameters of each carpooling order pair consisting of two matching ride orders, to obtain a plurality of carpooling parameters;

[0175] A carpooling parameter threshold is determined based on an average value of multiple carpooling parameters; the carpooling parameter threshold is used to determine whether two ride orders to be matched can be grouped in the process of providing grouping services.

[0176] The embodiment of the present application also provides an electronic device, which includes at least a memory and a processor for storing data, wherein, for the processor for data processing, when executing the processing, a microprocessor, a CPU, a GPU (Graphics Processing Unit), a DSP or an FPGA can be used. For the memory, an operation instruction is stored in the memory, and the operation instruction can be a computer executable code, and each step in the process of the method for determining the success rate of group ordering in the embodiment of the present application is implemented by the operation instruction.

[0177] Fig.12 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application. Fig.12 As shown, the electronic device 1200 includes a memory 1201, a processor 1202, a data acquisition module 1203 and a bus 1204. The memory 1201, the processor 1202 and the data acquisition module 1203 are all connected via the bus 1204, and the bus 1204 is used to transmit data between the memory 1201, the processor 1202 and the data acquisition module 1203.

[0178] Among them, the memory 1201 can be used to store software programs and modules, and the processor 1202 executes various functional applications and data processing of the electronic device 1200 by running the software programs and modules stored in the memory 1201, such as the method for determining the success rate of group ordering provided in the embodiment of the present application. The memory 1201 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, at least one application application, etc.; the data storage area may store data created according to the use of the electronic device 1200, etc. In addition, the memory 1201 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0179] The processor 1202 is the control center of the electronic device 1200, and uses the bus 1204 and various interfaces and lines to connect each part of the entire electronic device 1200, and executes various functions of the electronic device 1200 and processes data by running or executing software programs and / or modules stored in the memory 1201, and calling data stored in the memory 1201. Optionally, the processor 1202 may include one or more processing units, such as a CPU, a GPU (Graphics Processing Unit), a digital processing unit, etc.

[0180] 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 method for determining the success rate of group buying recorded in any embodiment of the present application.

[0181] In some possible implementations, each aspect of the method for determining the success rate of a group order provided in the present application may also be implemented in the form of a program product, which includes a 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 method for determining the success rate of a group order 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 1 The process of the method for determining the success rate of group buying in steps S101 to S103 is shown.

[0182] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may 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 may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0183] 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 box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes 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.

[0184] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate 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 A function specified in one or more boxes.

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

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

Claims

1. A method for determining the success rate of group buying, characterized in that: The method comprises: Divide the set geographical range into multiple geographical areas, and determine the order set corresponding to each geographical area according to the ride order data within the geographical range; Perform a group order matching operation on the ride orders in each order set and the ride orders in the corresponding candidate group order set, and determine the number of group orderable orders in each order set; According to the number of orders that can be grouped in each order set, determine the grouping success rate of the geographical area corresponding to each order set; A first set of orders corresponding to a first geographical area among the plurality of geographical areas includes ride orders where a location of a service vehicle is within the first geographical area at a specified time; The group order success rate of the first geographical area corresponding to the first order set is determined in the following manner: The ratio of the sum of the number of orders that can be grouped in the first order set and the number of ride orders in the first order set to the sum of the number of ride orders in the candidate grouped order set and the number of ride orders in the first order set is used as the grouped order success rate in the first geographical area; After performing a group order matching operation on the ride orders in each order set and the ride orders in the corresponding candidate group order set, the method further includes: For each groupable order pair consisting of two mutually matching ride orders, the following operations are respectively performed: based on the order end points of the two ride orders included in the groupable order pair, estimated driving trajectory information of vehicles served by the two ride orders included in the groupable order pair is determined, and according to the estimated driving trajectory information, a carpooling parameter of the groupable order pair is determined; Determine a carpooling parameter threshold value according to the obtained average values ​​of the multiple carpooling parameters; the carpooling parameter threshold value is used to determine whether two ride orders to be matched can be grouped in the process of providing grouping service; The candidate order set corresponding to the first order set is determined in the following way: Determine the center point of each geographic area, and respectively determine the distance between the center point of each geographic area and the center point of the first geographic area corresponding to the first order set; The order set corresponding to the geographical area whose distance is less than or equal to the set distance is used as the candidate group order set corresponding to the first order set.

2. The method according to claim 1, characterized in that The set geographical range is divided into multiple geographical areas, including: Acquiring ride order data within the geographical range; the ride order data is historical ride order data within a set time period; Determine, based on the ride order data, the distribution density of service vehicles for the ride order within the geographical range at a specified time; Based on the distribution density, the geographical range is divided into a plurality of geographical areas.

3. The method according to claim 1, characterized in that The ride order data includes the time information and vehicle driving track information of each ride order; the number of orders that can be combined in the first order set is determined by: According to the time information and vehicle driving trajectory information of each ride order, in the candidate order-sharing set corresponding to the first order set, respectively determine the ride orders that can be combined corresponding to each ride order in the first order set, and add the ride orders that can be combined to the order-sharing set of the first order set; The number of orders that can be combined in the first order set is determined based on the number of ride orders in the groupable order set of the first order set and the number of ride orders in the first order set.

4. The method according to claim 3, characterized in that The method of determining, in the candidate order-sharing set corresponding to the first order set according to the time information and the vehicle driving trajectory information of each order, respectively the order-sharing orders corresponding to each order in the first order set, comprises: Take each ride order in the first order set as the first ride order in turn, and perform the following operations on the first ride order: According to the time information of each ride order, in the candidate group order set corresponding to the first order set, a ride order to be grouped that meets a set time condition with the first ride order is determined; the set time condition includes that the time information of the ride order overlaps with the group orderable time interval of the first ride order; According to the vehicle driving trajectory information of each ride order, each ride order to be combined is matched with the first ride order, and the ride order to be combined that matches the first ride order is used as the ride order that can be combined corresponding to the first ride order.

5. A device for determining the success rate of group buying, characterized in that: The device comprises: A division unit, used to divide the set geographical range into a plurality of geographical areas, and determine the order set corresponding to each geographical area according to the ride order data within the geographical range; A group order matching unit, used to perform a group order matching operation on the ride orders in each order set with the ride orders in the corresponding candidate group order set, and determine the number of group orderable orders in each order set respectively; A first determining unit, configured to determine, according to the number of orders that can be combined in each order set, a group order success rate in the geographical area corresponding to each order set; A first set of orders corresponding to a first geographical area among the plurality of geographical areas includes ride orders where a location of a service vehicle is within the first geographical area at a specified time; The group order success rate of the first geographical area corresponding to the first order set is determined in the following manner: The ratio of the sum of the number of orders that can be grouped in the first order set and the number of ride orders in the first order set to the sum of the number of ride orders in the candidate grouped order set and the number of ride orders in the first order set is used as the grouped order success rate in the first geographical area; After the ride orders in each order set are matched with the ride orders in the corresponding candidate group order set, The second determining unit is used to perform the following operations for each groupable order pair consisting of two matching ride orders: determining estimated driving trajectory information of vehicles served by the two ride orders included in the groupable order pair based on the order end points of the two ride orders included in the groupable order pair, and determining the ride sharing parameters of the groupable order pair according to the estimated driving trajectory information; Determine a carpooling parameter threshold value according to the obtained average values ​​of the multiple carpooling parameters; the carpooling parameter threshold value is used to determine whether two ride orders to be matched can be grouped in the process of providing grouping service; The candidate order set corresponding to the first order set is determined in the following way: Determine the center point of each geographic area, and respectively determine the distance between the center point of each geographic area and the center point of the first geographic area corresponding to the first order set; The order set corresponding to the geographical area whose distance is less than or equal to the set distance is used as the candidate group order set corresponding to the first order set.

6. An electronic device, characterized in that: The invention 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 4 is implemented.

7. A computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 4 is implemented.