Method for processing carpooling order, electronic device and storage medium

Abstract

Embodiments of the present disclosure relate to a method for processing carpooling orders, an electronic device, and a storage medium. The method is applied to a first server and includes: obtaining event information associated with a carpooling order, where the carpooling order combines at least two carpooling sub-orders, and the event information includes location data and event data. The event information is provided by the first server and / or by a second server connected to the first server. The first server is a server of an aggregation service provider, and the second server is a server of an online car-hailing service provider; generating a candidate carpooling route based on the location data in the event information; and screening out a target carpooling route from the candidate carpooling routes based on the location data and event data in the event information and a preset route screening condition. In at least one embodiment of the present disclosure, by applying the method for processing carpooling orders on the server of the aggregation service provider, the problem that the aggregation service provider cannot provide carpooling services is solved, and the travel efficiency is improved.

Description

Technical Field

[0001] The present disclosure relates to the field of Internet application technologies, and particularly to a method for processing carpooling orders, an electronic device, and a storage medium. Background Art

[0002] With the development of Internet technologies, online car-hailing has gradually become an important way for users to travel, bringing great convenience to users' travel. At the same time, a large number of online car-hailing service providers have emerged in the travel industry.

[0003] With the development of the travel industry, a type of aggregation service provider has emerged in the industry. This aggregation service provider can aggregate the online car-hailing resources of multiple online car-hailing service providers to provide travel services for its users, enabling users to no longer need to download, install, and register multiple online car-hailing software, improving the convenience of user use. After receiving a taxi order triggered by a passenger from the client, the aggregation service provider provides the order information of the taxi order to multiple online car-hailing service providers. After receiving the order information of the taxi order, the online car-hailing service provider recalls available online cars and feeds back the available online cars to the aggregation service provider. The aggregation service provider binds the order to the online car provided by the online car-hailing service provider with the fastest feedback speed.

[0004] By adopting the above method, although multiple vehicle types can be called simultaneously, which can help users get a car faster to a certain extent, there is still a problem that the supply of online cars is insufficient during difficult car-hailing situations, such as during peak travel hours, and it cannot meet the car-hailing needs of all users. Summary of the Invention

[0005] To solve the above technical problems or at least partially solve the above technical problems, embodiments of the present disclosure provide a method for processing carpooling orders, an electronic device, and a storage medium.

[0006] In a first aspect, an embodiment of the present disclosure provides a method for processing carpooling orders, which is applied to a first server and includes:

[0007] Obtain event information associated with a carpooling order. The carpooling order combines at least two carpool sub-orders. The event information includes location data and event data. The event information is provided by the first server and / or by a second server connected to the first server. The first server is the server of the aggregation service provider, and the second server is the server of the online car-hailing service provider;

[0008] Generate a candidate carpool route based on the location data in the event information;

[0009] Screen out a target carpool route from the candidate carpool routes based on the location data and event data in the event information, and a preset route screening condition.

[0010] In a second aspect, embodiments of the present disclosure provide a method for processing a carpooling order, which is applied to a first user device and includes:

[0011] Receiving a sub - order for carpooling triggered by a user based on a online car - hailing interface;

[0012] Sending a carpooling request to a first server, where the carpooling request includes location data of the carpooling sub - order, so that the first server filters out a target carpooling route according to any of the methods provided in the first aspect and determines the online car - hailing vehicle corresponding to the target carpooling route;

[0013] Receiving a carpooling success notification feedback from the first server, where the carpooling success notification includes the online car - hailing vehicle corresponding to the target carpooling route.

[0014] In a third aspect, embodiments of the present disclosure provide a method for processing a carpooling order, which is applied to a second server and includes:

[0015] Receiving an online car - hailing recommendation request sent by the first server;

[0016] Sending an online car - hailing vehicle to the first server, where the feedback online car - hailing vehicle is bound to at least one carpooling sub - order, so that the first server filters out a target carpooling route according to any of the methods provided in the first aspect and determines the online car - hailing vehicle corresponding to the target carpooling route;

[0017] Receiving a carpooling order notification message sent by the first server, where the carpooling order notification message includes the determined target carpooling route and the corresponding online car - hailing vehicle;

[0018] Sending the target carpooling route to the second user device of the corresponding online car - hailing vehicle.

[0019] In a fourth aspect, embodiments of the present disclosure provide a method for processing a carpooling order, which is applied to a second user device and includes:

[0020] Receiving the target carpooling route sent by the second server, where the target carpooling route is filtered out by the first server according to any of the methods provided in the first aspect after the second server sends an online car - hailing vehicle bound to at least one carpooling sub - order to the first server.

[0021] In a fifth aspect, embodiments of the present disclosure provide a device for processing a carpooling order, including:

[0022] An information acquisition module, configured to acquire event information associated with a carpooling order, where the carpooling order combines at least two carpooling sub - orders, the event information includes location data and event data, and the order information is provided by the first server and / or by a second server connected to the first server, the first server is a server of an aggregation service provider, and the second server is a server of an online car - hailing service provider;

[0023] A candidate route generation module, configured to generate a candidate carpooling route based on the location data in the event information;

[0024] A screening module, configured to screen out a target carpooling route from the candidate carpooling routes based on the location data and event data in the event information, and a preset route screening condition.

[0025] In a sixth aspect, an embodiment of the present disclosure provides a carpooling order processing device, which is applied to a first user device and includes:

[0026] A carpooling sub-order receiving module, configured to receive a carpooling sub-order triggered by a user based on a network car-hailing interface;

[0027] A carpooling request sending module, configured to send a carpooling request to a first server, where the carpooling request includes the location data of the carpooling sub-order, so that the first server screens out a target carpooling route according to any one of the devices provided in the fifth aspect, and determines a network car corresponding to the target carpooling route;

[0028] A carpooling notification receiving module, configured to receive a carpooling success notification fed back by the first server, where the carpooling success notification includes the network car corresponding to the target carpooling route.

[0029] In a seventh aspect, an embodiment of the present disclosure provides a carpooling order processing device, which is applied to a second server and includes:

[0030] A recommendation request receiving module, configured to receive a network car-hailing recommendation request sent by the first server;

[0031] A network car feedback module, configured to feedback a network car to the first server, where the feedback network car is bound with at least one carpooling sub-order, so that the first server screens out a target carpooling route according to any one of the devices provided in the fifth aspect, and determines a network car corresponding to the target carpooling route;

[0032] A notification message receiving module, configured to receive a carpooling order notification message sent by the first server, where the carpooling order notification message includes the determined target carpooling route and the corresponding network car;

[0033] A carpooling route sending module, configured to send the target carpooling route to a second user device of the corresponding network car.

[0034] In an eighth aspect, an embodiment of the present disclosure provides a carpooling order processing device, which is applied to a second user device and includes:

[0035] The carpooling route receiving module is used to receive the target carpooling route sent by the second server. The target carpooling route is obtained by screening by any one of the devices provided in the fifth aspect of the first server after the second server feeds back an online car-hailing route bound with at least one carpooling sub-order to the first server.

[0036] In the ninth aspect, an embodiment of the present disclosure further provides an electronic device, comprising: a processor; a memory for storing instructions executable by the processor; the processor for reading the executable instructions from the memory and executing the executable instructions to implement any of the methods for processing carpooling orders provided in the embodiments of the present disclosure.

[0037] In a tenth aspect, an embodiment of the present disclosure further provides a computer-readable storage medium, wherein the storage medium stores a computer program, and the computer program is used to execute any of the methods for processing carpooling orders provided in the embodiments of the present disclosure.

[0038] The embodiments of the present disclosure provide a method, apparatus, device, and storage medium for processing a carpooling order. The method is applied to a first server and includes: obtaining event information associated with a carpooling order, the carpooling order merging at least two carpooling sub-orders, the event information including location data and event data, the event information provided by the first server and / or provided by a second server connected to the first server, the first server being a server of an aggregation service provider, and the second server being a server of an online car-hailing service provider; generating candidate carpooling routes based on the location data in the event information; and screening a target carpooling route from the candidate carpooling routes based on the location data and event data in the event information, as well as pre-set route screening conditions. In at least one embodiment of the present disclosure, the method for processing a carpooling order is executed by the server of an aggregation service provider, solving the problem that it is difficult to get a taxi under the aggregated car-hailing mode, such as during travel peaks, and that the demand for taxis from all users cannot be met due to insufficient supply of online car-hailing services. A route determination scheme for carpooling orders under the aggregated car-hailing mode is proposed for the first time, thereby improving the utilization rate of online car-hailing services, facilitating meeting the demand for taxis during travel peaks when it is difficult to get a taxi, and improving user travel efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] The above and other features, advantages, and aspects of the various embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and that the originals and elements are not necessarily drawn to scale.

[0040] Figure 1 This is a service flow chart of providing carpooling services based on an aggregation service provider in an embodiment of the present disclosure.

[0041] Figure 2For implementing Figure 1 The system architecture diagram of the service process described above;

[0042] Figure 3 The flowchart of a carpooling order processing method provided by an embodiment of the present disclosure;

[0043] Figure 4 For Figure 3 The detailed flowchart of S11 in the method shown;

[0044] Figure 5 For Figure 3 The detailed flowchart of S12 in the method shown;

[0045] Figure 6 The scenario diagram of a carpooling order provided by an embodiment of the present disclosure;

[0046] Figure 7 For Figure 3 The detailed flowchart of S13 in the method shown;

[0047] Figure 8 For Figure 7 The detailed flowchart of S131 in the method shown;

[0048] Figure 9 For Figure 7 The detailed flowchart of S132 in the method shown;

[0049] Figure 10 The flowchart of another carpooling order processing method provided by an embodiment of the present disclosure;

[0050] Figure 11 The flowchart of yet another carpooling order processing method provided by an embodiment of the present disclosure;

[0051] Figure 12 The flowchart of yet another carpooling order processing method provided by an embodiment of the present disclosure;

[0052] Figure 13 The flowchart of yet another carpooling order processing method provided by an embodiment of the present disclosure;

[0053] Figure 14 The flowchart of yet another carpooling order processing method provided by an embodiment of the present disclosure;

[0054] Figure 15 The schematic diagram of the generation process of a carpooling order provided by an embodiment of the present disclosure;

[0055] Figure 16 The structural schematic diagram of a carpooling order processing device provided by an embodiment of the present disclosure;

[0056] Figure 17 A structural schematic diagram of another carpooling order processing device provided by an embodiment of the present disclosure;

[0057] Figure 18 A structural schematic diagram of yet another carpooling order processing device provided by an embodiment of the present disclosure;

[0058] Figure 19 A structural schematic diagram of yet another carpooling order processing device provided by an embodiment of the present disclosure;

[0059] Figure 20 A structural schematic diagram of an electronic device provided by an embodiment of the present disclosure. Detailed implementation manners

[0060] The embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although some embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. On the contrary, these embodiments are provided to more thoroughly and completely understand the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not used to limit the protection scope of the present disclosure.

[0061] It should be understood that the steps recorded in the method embodiments of the present disclosure can be executed in different orders and / or executed in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this regard.

[0062] The term "including" and its variants used herein are open-ended, that is, "including but not limited to". The term "based on" is "at least partially based on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.

[0063] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order of functions performed by these devices, modules or units or their interdependent relationships.

[0064] It should be noted that the modifications of "one" and "multiple" mentioned in the present disclosure are illustrative rather than restrictive. Those skilled in the art should understand that unless otherwise clearly stated in the context, it should be understood as "one or more".

[0065] In related technologies, aggregators can offer aggregated ride-hailing services, allowing users who request a ride to simultaneously call multiple different models from multiple online ride-hailing service providers with a single click on their first user device. This improves the success rate of matching users with vehicles, helps users book rides more quickly, and shortens wait times. Ride-hailing users can be those who have a ride need themselves or those who request a ride for others who have a ride need, without limitation. However, during peak travel times, there may still be a shortage of online ride-hailing services, making it impossible to meet the needs of all users.

[0066] In response to the above problems, the technical solutions provided by the embodiments of the present disclosure implement a method for processing ride-sharing orders through the server of an aggregation service provider, thereby realizing a ride-sharing service under an aggregated ride-hailing model, solving the problem that when it is difficult to get a ride, such as during travel peaks, the ride-hailing needs of all users cannot be met due to insufficient supply of online ride-hailing vehicles. The embodiments of the present disclosure propose for the first time a route determination solution for ride-sharing orders under an aggregated ride-hailing model, which enables the same online ride-hailing vehicle to be booked by at least two different users through ride-sharing, thereby improving the utilization rate of online ride-hailing vehicles and meeting the ride-hailing needs of users during travel peaks when it is difficult to get a ride, thereby improving user travel efficiency. The method is described below in conjunction with specific embodiments.

[0067] Figure 1 This is a service flow chart of providing carpooling services based on an aggregation service provider in an embodiment of the present disclosure. Figure 2 For a realization Figure 1 The system architecture diagram of the service process described above. Figure 1 and Figure 2 As shown, an aggregator can aggregate the ride-hailing resources of multiple ride-hailing service providers and provide carpooling services to the users of the aggregator. During implementation, a user triggers a carpooling sub-order using their first user device. Information about the carpooling sub-order is sent to the first server corresponding to the aggregator. Upon receiving the information about the carpooling sub-order, the aggregator obtains event information associated with the carpooling order. The event information is provided by the aggregator's first server and / or a second server of the ride-hailing service provider connected to the first server. Subsequently, the aggregator's server generates candidate carpooling routes based on the location data in the event information and selects a target carpooling route from the candidate carpooling routes based on the location data and event data in the event information, as well as pre-set route screening conditions.

[0068] After the target carpooling route is determined, the first server sends a carpooling order notification message to the second server of the online car-hailing service provider corresponding to the target carpooling route. The carpooling order notification message includes the determined target carpooling route. The second server can send the target carpooling route to the second user device corresponding to the online car-hailing service through a dispatching message or other means. Moreover, the first server can send a carpooling success notification to the first user device corresponding to the user through a pick-up message or other means to remind the user to arrive at the target starting position on time.

[0069] Embodiments of the present disclosure provide a method for processing carpooling orders, which can be implemented by the mutual cooperation of user devices and servers in a system architecture as shown in Figure 2 In the system architecture, the first user device is an electronic device held by a user with a carpooling demand, such as a mobile phone, etc. And a passenger-side application or mini-program can be installed on the first user device. The user triggers a sub-car-pooling order by operating the interface of the application or mini-program. The second user device is an electronic device held by an online car-hailing service that can provide carpooling services, such as a mobile phone or an in-vehicle intelligent terminal, etc. And an online car-hailing service-side application or mini-program is installed on the second user device. The above-mentioned application or mini-program is only an example and can also be in other forms. Embodiments of the present disclosure do not limit this. Figure 2 In the solution provided by the embodiments of the present disclosure, first, the user triggers a sub-car-pooling order based on the online car-hailing service interface. The first user device sends the information of the sub-car-pooling order to the first server, and the first server obtains event information associated with the carpooling order, and the event information is provided by the first server and / or the second server. Further, the first server generates candidate carpooling routes based on the event information, and filters out the target carpooling route in combination with pre-set route screening conditions. Further, the first server sends a carpooling order notification message to the second server, and the second server sends the target carpooling route to the second user device based on the carpooling order notification message. Moreover, the first server sends a carpooling success notification to the first user device. Exemplarily, the second server can send an order dispatching notification message to the second user device. After receiving the order dispatching notification message, the second user device displays the associated sub-car-pooling order on the online car-hailing service interface, including information such as the user of the sub-car-pooling order, the starting position, the ending position, and the route. Exemplarily, the first server can send a pick-up message to the first user device. After receiving the pick-up message, the first user device displays the information of the sub-car-pooling order on the online car-hailing service interface, including information such as the starting position, the ending position, the route, and the online car-hailing service of the sub-car-pooling order.

[0070] Next, for

[0071] each device in Figure 2 will be explained and described respectively in the corresponding method embodiments.

[0072] Figure 3 The figure is a schematic flowchart of a method for processing a carpooling order provided by an embodiment of the present disclosure, which can be applicable to scenarios where it is difficult to hail a taxi, such as peak travel hours, to implement a carpooling service based on the server of an aggregation service provider and determine the route of a carpooling order. The method for processing a carpooling order is applied to a first server and can be executed by a processing device for carpooling orders. The device can be implemented by software and / or hardware and can be integrated into any electronic device with computing capabilities, such as a terminal, specifically including a smart phone, a personal digital assistant, a tablet computer, a wearable device with a display screen, a laptop computer, etc.

[0073] As Figure 3 shown, the main steps of the method for processing a carpooling order provided by an embodiment of the present disclosure are as follows:

[0074] S11. Obtain event information associated with the carpooling order.

[0075] In an embodiment of the present disclosure, a carpooling order combines at least two carpooling sub-orders. Specifically, a carpooling sub-order is initiated by a user based on a first user device. That is, when the user triggers a carpooling sub-order based on the first user device, the first user device sends the information of the carpooling sub-order to the first server. Correspondingly, after receiving the information of the carpooling sub-order, the first server recognizes the carpooling demand of the user and triggers a carpooling order to aggregate the carpooling sub-orders.

[0076] In an embodiment of the present disclosure, the number of carpooling sub-orders in the same carpooling order is equal to or less than an order threshold, so as to ensure that in the process of executing the method for processing a carpooling order, the data processing volume in the same carpooling order will not be too large, thereby ensuring a relatively fast data processing speed and further ensuring a relatively fast response speed.

[0077] Exemplarily, the order threshold can be 8 orders, or any value set by the user or developer, or a value automatically generated by the first server based on the user's car usage demand during the current period, which is not limited herein.

[0078] In an embodiment of the present disclosure, the event information includes location data and event data. Since the first server is connected to the second server and there is information exchange between the first server and the second server, the event information can be provided separately by the first server or the second server, or provided by both the first server and the second server. Among them, the first server is the server of the aggregation service provider, and the second server is the server of the online car-hailing service provider.

[0079] Exemplarily, when the event information is provided by the first server, the first server can directly call the event information associated with the carpool order locally. When the event information is provided by the second server, the first server can send an information call instruction to the second server; based on the received information call instruction, the second server sends the event information associated with the corresponding carpool order to the first server; correspondingly, the first server receives the event information associated with the carpool order sent by the second server. When the event information is jointly provided by the first server and the second server, the partial event information provided by the first server can be directly called locally on the first server, and the partial event information provided by the second server can be sent to the first server by the second server based on the corresponding information call instruction, and is received by the first server. In this way, the acquisition of the event information associated with the carpool order can be completed.

[0080] In other embodiments, other methods known to those skilled in the art can also be used to obtain the event information associated with the carpool order, which will not be elaborated or limited herein.

[0081] In the embodiments of the present disclosure, by obtaining the event information provided by the first server and / or the second server connected to the first server, specifically, obtaining the location data and time data, it provides a data basis for generating candidate carpool routes and screening out target carpool routes in subsequent steps.

[0082] S12. Generate candidate carpool routes based on the location data in the event information.

[0083] In the embodiments of the present disclosure, when there are at least two carpool sub-orders aggregated in the carpool order, the corresponding carpool route needs to pass through the starting positions and ending positions of the at least two carpool sub-orders to complete each carpool sub-order.

[0084] At the same time, combine the starting positions and ending positions of each carpool sub-order in sequence and perform route planning to form multiple carpool routes. In subsequent steps, route screening is required to determine the target carpool route.

[0085] Based on this, candidate carpool routes can be generated based on the location data in the time information, preparing for route screening in subsequent steps.

[0086] S13. Screen out the target carpool route from the candidate carpool routes based on the location data and event data in the event information, and the preset route screening conditions.

[0087] In the embodiments of the present disclosure, based on the location data and time data in the time information, screen out the candidate carpool routes that meet the preset route screening conditions from the candidate carpool routes to obtain the target carpool route.

[0088] Exemplarily, the preset route screening conditions may include that the candidate carpooling route does not pass through the restricted area; correspondingly, the candidate carpooling routes passing through the restricted area are screened out, and the target carpooling route is further screened out from other candidate carpooling routes.

[0089] Exemplarily, the route screening step may further include a primary screening (i.e., rough screening) and a secondary screening (i.e., fine screening), which will be described in detail later.

[0090] In the embodiments of the present disclosure, first, event information associated with the carpooling order is obtained. The carpooling order combines at least two sub - carpooling orders. The event information includes location data and event data. The event information is provided by the first server and / or by the second server connected to the first server. The first server is the server of the aggregation service provider, and the second server is the server of the online car - hailing service provider. Then, candidate carpooling routes are generated based on the location data in the event information. Furthermore, based on the location data and event data in the event information, and the preset route screening conditions, the target carpooling route is screened out from the candidate carpooling routes. In the embodiments of the present disclosure, a carpooling scheme in the aggregated car - hailing mode is provided, and a method for processing carpooling orders in the aggregated car - hailing mode is provided. By obtaining the event information associated with the carpooling order and generating candidate carpooling routes based on the location data in the event information, and then screening out the target carpooling route from the candidate carpooling routes based on the location data and event data in the time information, it can effectively provide carpooling routes in the aggregated mode, improve the dispatching efficiency of the car - hailing platform in the aggregated service, improve the utilization rate of online car - hailing vehicles, increase the success probability of users' car - hailing, meet the car - using needs in case of difficult car - hailing such as during peak travel hours, and improve the travel efficiency of users.

[0091] Figure 4 For Figure 3 the detailed flowchart of S11 in the shown method, which shows an implementation manner of obtaining the event information associated with the carpooling order.

[0092] As Figure 4 shown, in a possible implementation manner, obtaining the event information associated with the carpooling order may specifically include the following steps.

[0093] S111. Receive the carpooling request sent by the first user device.

[0094] In the embodiments of the present disclosure, when the user triggers a sub - carpooling order on the first user device, the first user device generates a carpooling request based on the user's operation and sends it to the first server. Correspondingly, the first server receives the carpooling request. Among them, the carpooling request includes the location data of the sub - carpooling order. Exemplarily, the location data may be input by the user or generated by the first user device based on the positioning information, and this is not limited herein.

[0095] S112. Send a ride-hailing recommendation request to at least one second server.

[0096] In the embodiments of the present disclosure, after receiving a carpooling request, the first server sends a ride-hailing recommendation request to at least one second server; correspondingly, at least one second server that receives the ride-hailing recommendation request feeds back the recommended ride-hailing vehicles to the first server. Among them, the ride-hailing recommendation request includes at least partial location data, so that the second server can screen for ride-hailing vehicles within a preset distance (such as 2 km) near the location corresponding to the location data carried in the ride-hailing recommendation request, and use the screened ride-hailing vehicles as the recommended ride-hailing vehicles and feed them back to the first server. In this way, it is beneficial to ensure that the distance between the recommended ride-hailing vehicles and at least some of the users is short, and it is beneficial to reduce the waiting time of at least some users.

[0097] Exemplarily, the first server may send a ride-hailing recommendation request to one, two, three or more second servers, which is not limited herein.

[0098] Exemplarily, the ride-hailing recommendation request may include the starting location data of one, two or more carpool sub-orders, which is not limited herein.

[0099] S113. Receive the ride-hailing vehicles fed back by the second server.

[0100] In the embodiments of the present disclosure, after the second server feeds back the recommended ride-hailing vehicles to the first server, correspondingly, the first server receives the fed-back ride-hailing vehicles, and the fed-back ride-hailing vehicles are bound with at least one carpool sub-order. Exemplarily, the fed-back ride-hailing vehicles are bound with the carpool orders of one, two or more aggregated carpool sub-orders, which is not limited herein.

[0101] In the embodiments of the present disclosure, by setting that the fed-back ride-hailing vehicles are bound with at least one carpool sub-order, carpooling can be continued on the basis of the carpool orders that have been bound with at least one carpool sub-order, which is beneficial to improving the utilization efficiency of ride-hailing vehicles, thereby increasing the available vehicles, and further increasing the probability of successful carpooling for users and improving the travel efficiency of users.

[0102] S114. Obtain the event data of the carpool orders bound to the fed-back ride-hailing vehicles, and the location data of the carpool sub-orders that have been bound.

[0103] In the embodiments of the present disclosure, after receiving the fed-back ride-hailing vehicles, the first server further obtains the event data of the carpool orders bound to the fed-back ride-hailing vehicles and the location data of the carpool sub-orders, providing a data basis for subsequent generation of candidate carpool routes and route screening.

[0104] In a possible implementation, the carpool order includes an order of a passenger who has not boarded and an order of a passenger who has boarded. The location data includes the current location of the online car-hailing vehicle, the starting location and the ending location of the order of the passenger who has not boarded, and the ending location of the order of the passenger who has boarded.

[0105] In the embodiments of the present disclosure, the order of a passenger who has boarded includes a carpool order, and the order of a passenger who has not boarded includes an order that has been bound but the passenger has not boarded and the carpool order to be aggregated into the carpool time.

[0106] Among them, the location data includes the current location of the online car-hailing vehicle, the starting location and the ending location of the order of the passenger who has not boarded, and the ending location of the order of the passenger who has boarded, so as to generate a carpool route, that is, to determine the pick-up and drop-off order to send the user corresponding to the order of the passenger who has boarded to his / her ending location, and pick up and drop off the users corresponding to the orders of the passengers who have not boarded.

[0107] Based on this, Figure 5 shows a refined process of generating a candidate carpool route based on the location data in the event information, that is, Figure 5 is Figure 3 a schematic diagram of the refined process of S12 in the method shown.

[0108] As Figure 5 shown, generating a candidate carpool route based on the location data in the event information may specifically include:

[0109] S121. Based on the current location of the online car-hailing vehicle, the starting location and the ending location of the order of the passenger who has not boarded, and the ending location of the order of the passenger who has boarded, perform permutation and combination to generate alternative carpool routes.

[0110] S122. Select candidate carpool routes from the alternative carpool routes based on the ride order requirement and / or the carpooling requirement.

[0111] In the embodiments of the present disclosure, first, alternative carpool routes are generated based on the above location data, and then candidate carpool routes are selected from the alternative carpool routes based on at least one of the ride order requirement and the carpooling requirement.

[0112] Exemplarily, the ride order requirement may include that the starting location of the same order of the passenger who has not boarded is prior to the ending location, thereby filtering out the alternative carpool routes in which the starting location and the ending location of the same carpool order are inverted. That is, for the same carpool order, the candidate carpool route needs to reach its starting location first and then its ending location.

[0113] Exemplarily, the carpooling requirement may include the existence of a carpooling distance, thereby filtering out the alternative carpool routes without a carpooling distance, so as to improve the traffic operation efficiency.

[0114] Exemplarily, Figure 6A scenario schematic diagram of a carpooling order provided by an embodiment of the present disclosure is used to exemplarily illustrate the method for processing the candidate carpooling route.

[0115] As Figure 6 shown, the carpooling order combines at least two or three sub-carpooling orders. Among them, the starting position of sub-carpooling order 1 is A, the ending position is A', the starting position of sub-carpooling order 2 is B, the ending position is B', and the starting position of sub-carpooling order 3 is C, the ending position is C'; and the position P where sub-carpooling order 2 is received and the current position P' of the vehicle are shown. Also, the user corresponding to sub-carpooling order 1 gets on the car at the starting position A, that is, the vehicle has left from point A; the online car-hailing service receives the dispatching message of sub-carpooling order 2 at position P, and the current position of the online car-hailing service is P'. At this moment, the first server receives a carpooling request for sub-carpooling order 3.

[0116] Among them, the user corresponding to sub-carpooling order 1 gets on the car at point A, and the user corresponding to sub-carpooling order 2 gets on the car at point B, and the remaining passing points have not been traveled.

[0117] Based on this, first, based on the location data, generate optional carpooling routes, that is, generate all permutations for the un-traveled passing points (including the starting position or ending position of the sub-carpooling order). That is, based on C, A', C' and B', generate all permutations of the pick-up and drop-off order, a total of 24, that is, generate 24 optional carpooling routes, as follows:

[0118] A'->B'->C->C'

[0119] A'->B'->C'->C

[0120] A'->C->B'->C'

[0121] A'->C->C'->B'

[0122] A'->C'->B'->C

[0123] A'->C'->C->B'

[0124] B'->A'->C->C'

[0125] B'->A'->C'->C

[0126] B'->C->A'->C'

[0127] B'->C->C'->A'

[0128] B'->C'->A'->C

[0129] B'->C'->C->A'

[0130] C->A'->B'->C'

[0131] C -> A' -> C' -> B'

[0132] C -> B' -> A' -> C'

[0133] C -> B' -> C' -> A'

[0134] C -> C' -> A' -> B'

[0135] C -> C' -> B' -> A'

[0136] C' -> A' -> B' -> C

[0137] C' -> A' -> C -> B'

[0138] C' -> B' -> A' -> C

[0139] C' -> B' -> C -> A'

[0140] C' -> C -> A' -> B'

[0141] C' -> C -> B' -> A'

[0142] After that, when completing the carpooling order, it is necessary to first reach the starting position of the carpooling order and then reach the ending position of the carpooling order. Therefore, based on the requirement of the riding order, the pick-up and drop-off driving orders with the reversed order of the starting position and the ending position are filtered out, and the remaining 12 optional carpooling routes are as follows:

[0143] A' -> B' -> C -> C'

[0144] A' -> C -> B' -> C'

[0145] A' -> C -> C' -> B'

[0146] B' -> A' -> C -> C'

[0147] B' -> C -> A' -> C'

[0148] B' -> C -> C' -> A'

[0149] C -> A' -> B' -> C'

[0150] C -> A' -> C' -> B'

[0151] C -> B' -> A' -> C'

[0152] C -> B' -> C' -> A'

[0153] C -> C' -> A' -> B'

[0154] C -> C' -> B' -> A'

[0155] Subsequently, to improve traffic operation efficiency, there should be a shared ride distance between different carpooling orders. Therefore, based on the shared ride requirement, the pick-up and drop-off driving sequences without a shared ride distance are filtered, and 10 optional carpooling routes remain as follows:

[0156] A' -> C -> B' -> C'

[0157] A' -> C -> C' -> B'

[0158] B' -> C -> A' -> C'

[0159] B' -> C -> C' -> A'

[0160] C -> A' -> B' -> C'

[0161] C -> A' -> C' -> B'

[0162] C -> B' -> A' -> C'

[0163] C -> B' -> C' -> A'

[0164] C -> C' -> A' -> B'

[0165] C -> C' -> B' -> A'

[0166] The above 10 optional carpooling routes are the carpooling routes that finally enter the route screening, that is, after generating the optional carpooling routes, the candidate carpooling routes are selected based on the ride order requirement and the shared ride requirement.

[0167] In other embodiments, candidate carpooling routes can also be selected from the optional carpooling routes based on the ride order requirement or the shared ride requirement, which is not limited herein.

[0168] Figure 7 For Figure 3 the detailed process schematic diagram of S13 in the shown method, which shows a way to screen out the target carpooling route from the candidate carpooling routes.

[0169] As Figure 7 shown, in a possible embodiment, based on the location data and event data in the event information, and the preset route screening conditions, the target carpooling route is screened out from the candidate carpooling routes, which may specifically include the following steps.

[0170] S131. Based on the location data in the event information and the preset first type of route screening conditions, determine the candidate carpooling routes after the first screening from the candidate carpooling routes.

[0171] S132. Determine the candidate carpooling routes after the second screening from the candidate carpooling routes after the first screening based on the location data and event data in the event information, and the preset second type of route screening conditions.

[0172] S133. Select a target carpooling route from the candidate carpooling routes after the second screening.

[0173] In the embodiments of the present disclosure, the first type of route screening conditions includes a space screening condition, which can perform a rough screening based on the location data in the event information, and determine the candidate carpooling routes that meet the space requirements from the candidate carpooling routes, that is, determine the candidate carpooling routes after the first screening. The second type of route screening conditions includes at least one of a space screening condition, a mileage screening condition, a time screening condition, and a price screening condition, which can perform a fine screening based on the location data and event data in the event information, and determine the candidate carpooling routes after the second screening that meet at least one of the space requirements, mileage requirements, time requirements, and price requirements from the candidate carpooling routes after the first screening. Further, select a target carpooling route from the candidate carpooling routes after the second screening, so that the target carpooling route can meet the user's car usage requirements while reducing the user's waiting time, and not excessively increase the distance and time of the bound carpooling sub-orders. While improving the user's travel efficiency, ensure that the users corresponding to the on-board orders and the non-on-board orders all have a good user experience.

[0174] In other embodiments, it is also possible to first perform a rough screening based on the event data, and then perform a fine screening in combination with the location data, which is not limited here.

[0175] In other embodiments, it is also possible to determine the time data corresponding to the location data based on the empirical value or in combination with the real-time traffic conditions, etc., and screen the candidate carpooling routes in combination with the time data, including rough screening and / or fine screening, to obtain the target carpooling route, which is not limited here.

[0176] Further, the first type of route screening conditions includes at least one of a threshold for the number of pick-up and drop-off times, a threshold for the order angle, a first detour distance ratio threshold, a first pick-up distance threshold, and a first carpooling distance threshold.

[0177] In the embodiments of the present disclosure, the threshold for the number of pick-up and drop-off times is used to limit the number of pick-up and drop-off times experienced by each carpooling sub-order in the carpooling order. The number of pick-up and drop-off times experienced by each carpooling sub-order needs to be less than the threshold for the number of pick-up and drop-off times, so that the users corresponding to each carpooling sub-order do not experience too many parking waits, and while improving the user's travel efficiency, ensure that the user has a good travel experience.

[0178] Exemplarily, the threshold of the number of pick-up and drop-off times can be 5 times or 4 times, or any other arbitrary number value set by the user or developer, as long as the above requirements are met, and it is not limited here.

[0179] In the embodiments of the present disclosure, the order angle threshold is used to define the order angle between any two sub-ride-sharing orders in a ride-sharing order. The order angle between any two sub-ride-sharing orders needs to be less than the order angle threshold, so that each ride-sharing route segment corresponding to each sub-ride-sharing order will not reciprocate and will not detour too much, thereby shortening the time for the user to reach the destination and improving the travel efficiency.

[0180] Exemplarily, the order angle threshold can be 60°, or any other arbitrary angle value set by the user or developer, as long as the above requirements are met, and it is not limited here.

[0181] In the embodiments of the present disclosure, the first detour distance ratio threshold is used to define the first detour distance ratio of each sub-ride-sharing order. The first detour distance ratio of each sub-ride-sharing order needs to be less than the first detour distance ratio threshold, so that each order will not detour too much, thereby reducing the detour time of each user and improving the travel efficiency of the user.

[0182] Exemplarily, the first detour distance ratio threshold can be 1.3, or any other arbitrary numerical value set by the user or developer, as long as the above requirements are met, and it is not limited here.

[0183] In the embodiments of the present disclosure, the first pick-up distance threshold is used to define the first pick-up distance of each sub-ride-sharing order. The first pick-up distance of each sub-ride-sharing order needs to be less than the first pick-up distance threshold, so as to reduce the waiting time of each ride-sharing user and improve the travel efficiency of the user.

[0184] Exemplarily, the first pick-up distance threshold can be 3600 meters, or any other arbitrary distance value set by the user or developer, as long as the above requirements are met, and it is not limited here.

[0185] In the embodiments of the present disclosure, the first shared ride distance threshold is used to define the first shared ride distance of each sub-ride-sharing order. The first shared ride distance of each sub-ride-sharing order needs to be greater than the first shared ride distance threshold, so as to improve the utilization rate of online car-hailing, enable the sharing of online car-hailing to meet the travel needs of users, and thus contribute to improving the travel efficiency of users.

[0186] Exemplarily, the first threshold can be 300 meters, or any other arbitrary distance value set by the user or developer, as long as the above requirements are met, and it is not limited here.

[0187] Based on this, Figure 8 A way of performing a first screening in combination with the first type of route screening conditions is shown, that is Figure 8 is Figure 7Schematic diagram of the refinement process of S131 in the shown method.

[0188] As Figure 8 shown, based on the location data in the event information and the preset first - type route screening conditions, the candidate carpooling routes after the first - round screening are determined from the candidate carpooling routes, which specifically include the following steps:

[0189] S1311: Based on the location data in the event information, determine the number of pick - up and drop - off experiences of each carpool sub - order, the order angle between any two carpool sub - orders, and at least one of the first detour distance ratio, the first pick - up distance, and the first shared - ride distance of each carpool sub - order;

[0190] S1312: Based on the number of pick - up and drop - off experiences of each carpool sub - order, the order angle between any two carpool sub - orders, and at least one of the first detour distance ratio, the first pick - up distance, and the first shared - ride distance of each carpool sub - order, and the preset first - type route screening conditions, determine the candidate carpooling routes after the first - round screening from the candidate carpooling routes.

[0191] In the embodiments of the present disclosure, based on the location data in the event information, the number of pick - up and drop - off experiences of each carpool sub - order, the order angle between any two carpool sub - orders, and at least one of the first detour distance ratio, the first pick - up distance, and the first shared - ride distance of each carpool sub - order can be determined. Furthermore, in combination with the preset first - type route screening conditions, a rough screening can be performed on the candidate carpooling routes to determine the candidate carpooling routes after the first - round screening, preparing for the subsequent fine screening.

[0192] In the embodiments of the present disclosure, each starting position corresponds to one pick - up, and each ending position corresponds to one drop - off. Based on the location data in the event information, to determine the number of pick - up and drop - off experiences of each carpool sub - order, specifically: based on the location data in the event information, count the sum of the starting positions and ending positions passed by each carpool sub - order, then the corresponding number of pick - up and drop - off experiences of each carpool sub - order can be obtained. Or, the number of pick - up and drop - off experiences of each carpool sub - order can be directly obtained based on the event data or the itinerary data, and this is not limited herein.

[0193] In the embodiments of the present disclosure, the line connecting the starting position and the ending position of each carpool sub - order is the direction of the carpool sub - order, and the order angle between any two carpool sub - orders is the angle between the corresponding directions of the two carpool sub - orders. Thus, based on the location data in the event information, the order angle between any two carpool sub - orders can be determined.

[0194] In the embodiments of the present disclosure, the detour distance is generated due to carpooling. The first detour distance ratio may be the ratio of the estimated distance in the case of not carpooling to the actual distance in the case of carpooling. The estimated distance and the actual distance are respectively the route lengths between the starting position and the ending position of the carpool sub-order in the two cases. Thus, the first detour distance ratio can be determined based on the position data in the event information.

[0195] In the embodiments of the present disclosure, the first pick-up distance is the distance between the current position of the online car-hailing vehicle and the starting position of the order that has not been picked up yet, and the first carpooling distance is the sum of the route distances that each carpool sub-order coincides with other carpool sub-orders. Thus, the first pick-up distance and the first carpooling distance can be determined based on the position data in the event information.

[0196] Further, based on the position data in the event information, determine the number of pick-up and drop-off experiences of each carpool sub-order, the order angle between any two carpool sub-orders, and at least one of the first detour distance ratio, the first pick-up distance, and the first carpooling distance of each carpool sub-order, including:

[0197] Based on the position data of the event information, determine the number of pick-up and drop-off experiences of each carpool sub-order, the order angle between any two carpool sub-orders, and at least one of the first detour distance ratio, the first pick-up distance, and the first carpooling distance of each carpool sub-order according to the spherical distance algorithm.

[0198] In the embodiments of the present disclosure, according to the starting position and the ending position of each carpool sub-order, directly perform length calculation or angle calculation on the sphere using longitude and latitude coordinates, and then the order angle between any two carpool sub-orders, and at least one of the first detour distance ratio, the first pick-up distance, and the first carpooling distance of each carpool sub-order can be obtained. The position data used in the calculation process is as described above and will not be elaborated here.

[0199] In a possible implementation manner, the event data further includes the traveled trajectory points, the estimated pick-up and drop-off distance of each carpool sub-order, and the second type of route screening conditions includes at least one of a second detour distance ratio threshold, a second pick-up distance threshold, a second carpooling distance threshold, a detour time ratio threshold, a pick-up time threshold, an order remaining pick-up and drop-off distance ratio threshold, and a pick-up time change threshold.

[0200] In the embodiments of the present disclosure, the traveled trajectory points can be obtained corresponding to the online car-hailing ID or the vehicle ID. Combining the above, the traveled trajectory points can be the data stored on the first server and can be distinguished according to the online car-hailing ID or according to the vehicle ID. Usually, the online car-hailing ID and the vehicle ID are unified. After determining the online car-hailing ID or the vehicle ID, the corresponding traveled trajectory points can be directly associated and called.

[0201] Exemplarily, in combination with the above, the traveled track points can be called locally by the first server, or can be sent by the second server to the first server based on the information request of the first server, which is not limited herein.

[0202] In the embodiments of the present disclosure, the estimated pick-up and drop-off distance of each shared car order is the distance between the starting position and the ending position of each shared car order. Exemplarily, the estimated pick-up and drop-off distance of each shared car order can be estimated by the second server and sent to the first server; or can be obtained by the first server through local data processing, which is not limited herein.

[0203] In the embodiments of the present disclosure, the second detour distance ratio threshold is used to limit the second detour distance ratio of each shared car order, and the second detour distance ratio of each shared car order needs to be less than the second detour distance ratio threshold, so that each order will not detour too much, thereby reducing the detour time of each user and improving the travel efficiency of the user.

[0204] Exemplarily, the second detour distance ratio threshold can be 1.3, or any other value set by the user or developer, as long as the above requirements are met, which is not limited herein.

[0205] In the embodiments of the present disclosure, the second pick-up distance threshold is used to limit the second pick-up distance of each shared car order, and the second pick-up distance of each shared car order needs to be less than the second pick-up distance threshold, so as to reduce the waiting time of each shared order user and improve the travel efficiency of the user.

[0206] Exemplarily, the second pick-up distance threshold can be 3600 meters, or any other distance value set by the user or developer, as long as the above requirements are met, which is not limited herein.

[0207] In the embodiments of the present disclosure, the second carpooling distance threshold is used to limit the second carpooling distance of each shared car order, and the second carpooling distance of each shared car order needs to be greater than the second carpooling distance threshold, so as to improve the utilization rate of online car-hailing, so that the carpooling of online car-hailing can meet the travel needs of users, and thus is conducive to improving the travel efficiency of users.

[0208] Exemplarily, the second carpooling distance threshold can be 500 meters, or any other distance value set by the user or developer, as long as the above requirements are met, which is not limited herein.

[0209] In the embodiments of the present disclosure, the detour time ratio threshold is used to limit the detour time ratio of each shared car order, and the detour time ratio of each shared car order needs to be less than the detour time ratio threshold, so that the detour time of each shared car order is less, thereby reducing the detour time of each user, saving the travel time of the user, and improving the travel efficiency of the user.

[0210] Exemplarily, the detour time ratio threshold can be 1.3, or any other value set by the user or developer, as long as the above requirements are met, and it is not limited here.

[0211] In the embodiments of the present disclosure, the pick-up time threshold is used to limit the pick-up time of each shared car order. The pick-up time of each shared car order needs to be less than the pick-up time threshold to reduce the waiting time with the user, thereby improving the travel efficiency of the user.

[0212] Exemplarily, the pick-up time threshold can be 600 seconds, or any other time value set by the user or developer, as long as the above requirements are met, and it is not limited here.

[0213] In the embodiments of the present disclosure, the remaining delivery distance ratio threshold of the order is used to limit the remaining delivery distance ratio of each shared car order. The remaining delivery distance ratio of each shared car order needs to be greater than the remaining delivery distance ratio threshold to ensure that the route is not changed near the end position, thereby saving the user's riding time and improving the travel efficiency of the user.

[0214] Exemplarily, the remaining delivery distance ratio threshold of the order can be 20%, or any other value set by the user or developer, as long as the above requirements are met, and it is not limited here.

[0215] In the embodiments of the present disclosure, the pick-up time change threshold is used to limit the pick-up time change of the shared car order in the pick-up state. The pick-up time change of the shared car order needs to be no greater than the pick-up time change threshold to avoid excessively increasing the waiting time of the user, thereby helping to save the user's travel time and improve the travel efficiency of the user.

[0216] Exemplarily, the pick-up time change threshold can be 2 minutes, or any other time value set by the user or developer, as long as the above requirements are met, and it is not limited here.

[0217] Based on this, Figure 9 shows a way to perform secondary screening in combination with the second type of route screening conditions, that is, Figure 9 is Figure 7 a detailed process schematic diagram of S132 in the method shown.

[0218] As Figure 9 shown, based on the position data and event data in the event information, and the second type of route screening conditions preset, the candidate shared car routes after secondary screening are determined from the candidate shared car routes after primary screening, which specifically includes the following steps:

[0219] S1321. Determine at least one of the second detour distance ratio, the second pick-up distance, the second carpooling distance, the detour time ratio, the pick-up time, the remaining drop-off distance ratio of the carpool order, and the change in pick-up time for each carpool order based on the location data and event data in the event information.

[0220] S1322. Determine the candidate carpool routes after the second screening from the candidate carpool routes after the first screening based on at least one of the second detour distance ratio, the second pick-up distance, the second carpooling distance, the detour time ratio, the pick-up time, the remaining drop-off distance ratio of the carpool order, and the change in pick-up time for each carpool order, and the preset second type of route screening conditions.

[0221] In the embodiments of the present disclosure, based on the location data and event data in the event information, at least one of the second detour distance ratio, the second pick-up distance, the second carpooling distance, the detour time ratio, the pick-up time, the remaining drop-off distance ratio of the carpool order, and the change in pick-up time for each carpool order can be determined. Furthermore, in combination with the preset second type of route screening conditions, a fine screening can be performed on the candidate carpool routes after the first screening to determine the candidate carpool routes after the second screening, so as to prepare for selecting the target carpool route subsequently.

[0222] In a possible implementation manner, a Location Based Service (LBS) algorithm is used to determine at least one of the second detour distance ratio, the second pick-up distance, the second carpooling distance, the detour time ratio, the pick-up time, the remaining drop-off distance ratio of the carpool order, and the change in pick-up time for each carpool order.

[0223] In the embodiments of the present disclosure, the LBS algorithm can use various types of positioning technologies to obtain the current location of the positioning device, and provide information resources and basic services to the positioning device through the mobile Internet. By using the LBS algorithm, the current location of the positioning device can be determined, thereby obtaining location information. Further, based on the paths between different locations, the corresponding route distances can be determined. For example, based on the current location of the online car-hailing vehicle and the starting location of the carpool order, the second pick-up distance can be determined. Another example is that based on the current location of the online car-hailing vehicle and the ending locations of each bound and drop-off state carpool orders, the remaining drop-off distance of the corresponding carpool order can be determined. Another example is that based on the starting and ending locations of the corresponding paths of multiple carpool orders in the carpool route on the online car-hailing vehicle at the same time, the second carpooling distance can be determined. Further, by comparing the distances before and after the successful carpooling, the corresponding ratios can be obtained. For example, the second detour distance ratio and the remaining drop-off distance ratio of the order can be obtained. In the following text, in combination with Figure 6An exemplary description will be given; further, based on the obtained distance ratio, the time ratio can be obtained by dividing the distance by the corresponding speed. The speed in this paragraph can be the average speed determined based on the real-time road conditions, the current real-time speed of the online car-hailing vehicle, the historical statistical speed of vehicles on the current road section at the current time period, or other speed values. For example, the detour time ratio can be obtained by dividing the detour distance ratio by the corresponding speed. Another example is that for a shared ride sub-order in the pick-up state, the change in pick-up time can be obtained by dividing the change in pick-up distance by the corresponding speed.

[0224] In the embodiments of the present disclosure, based on the location data in the shared ride order, the path trajectory between two relevant locations is determined, so that the corresponding route distance can be obtained. Further, the distance ratios before and after the successful sharing of the ride can be determined, that is, the second detour distance ratio and the remaining delivery distance ratio of the order can be obtained; and the distance between the current location of the online car-hailing vehicle and the starting point location of the shared ride sub-order can be determined, that is, the second pick-up distance can be obtained; and the driving distance of the vehicle with multiple shared ride sub-orders on the online car-hailing vehicle in the shared ride route can be determined, that is, the second co-riding distance can be obtained. On this basis, in combination with other relevant information affecting the vehicle speed such as road condition information, the detour time ratio and the change in pick-up time can be determined.

[0225] Exemplarily, in combination with Figure 6 , an exemplary description will be given of the calculation methods of the second detour distance ratio, the second pick-up distance, the second co-riding distance, the detour time ratio, the pick-up time, the remaining delivery distance ratio of the order, and the change in pick-up time for each shared ride sub-order.

[0226] Exemplarily, the second detour distance ratio is calculated as follows:

[0227] Shared ride sub-order 1: (The delivered distance AP'+P'C+CB+BA') / The estimated delivery distance AA' of shared ride sub-order 1; where, the delivered distance AP' can be obtained by calling the LBS algorithm in combination with the itinerary ID and the waypoints of the shared ride route, and P'C+CB+BA' can be obtained by calling the LBS algorithm; the estimated delivery distance AA' of shared ride sub-order 1 can be obtained based on event data. Exemplarily, the estimated delivery distance can be determined based on location data when the user places an order, and then stored as a kind of event data in the first server or the second server, and can be aggregated into a shared ride order in the first server. At this time, the estimated delivery distance is a kind of event data, which can be provided by the second server or determined by the first server through local data processing. In the following text, the estimated delivery distances of shared ride sub-order 2 and shared ride sub-order 3 can be obtained in the same way, and the corresponding positions will not be elaborated.

[0228] Shared ride order 2: (BA'+A'C'+C'B') / Estimated driving distance BB' of shared ride order 2; where BA'+A'C'+C'B' can be obtained by calling the LBS algorithm; the estimated driving distance BB' of shared ride order 2 can be obtained based on event data, provided by the second server or determined by the first server through local data processing.

[0229] Shared ride order 3: (CB+BA'+A'C') / Estimated driving distance CC' of shared ride order 3; where CB+BA'+A'C' can be obtained by calling the LBS algorithm; the estimated driving distance CC' of shared ride order 3 can be obtained based on event data, provided by the second server or determined by the first server through local data processing.

[0230] Exemplarily, the calculation method of the detour time ratio is to replace the distance in the above second detour distance ratio calculation method with the corresponding time, that is, the corresponding detour time ratio is obtained by combining road condition information on the basis of the above second detour distance ratio. Among them, the road condition information can be real-time road condition information, or road condition information determined based on historical statistics, or road condition information determined based on empirical values, which will not be elaborated here.

[0231] Exemplarily, the second pick-up distance is calculated as follows:

[0232] Shared ride order 2: PP'+P'C+CB; where PP' can be obtained by calling the LBS algorithm by combining the trip ID with the passing points, and P'C+CB can be obtained by calling the LBS algorithm.

[0233] Shared ride order 3, P'C; which can be obtained by calling the LBS algorithm.

[0234] Exemplarily, the calculation method of the pick-up time is to replace the distance in the above second pick-up distance calculation method with the corresponding time, and the replacement can be combined with real-time traffic conditions or empirical values, which will not be elaborated here.

[0235] Exemplarily, the second shared ride distance is the driving distance of the vehicle with two or more shared ride orders in the car at the same time, and is calculated as follows:

[0236] Shared ride order 1: CB+BA'; which can be obtained by calling the LBS algorithm.

[0237] Shared ride order 2: BA'+A'C'; which can be obtained by calling the LBS algorithm.

[0238] Shared ride order 3: CB+BA'+A'C'; which can be obtained by calling the LBS algorithm.

[0239] Exemplarily, the remaining driving distance ratio of the order is calculated as follows:

[0240] Carpooling order 1: remaining delivery distance 1 / total delivery distance 1;

[0241] Among them, the remaining delivery distance of the order is 1: P'B+BA'; it can be obtained by calling the LBS algorithm.

[0242] Total ride-sharing distance 1: AP' + P'B + BA'; AP' can be obtained by calling LBS using the trip ID and the route points before the successful carpooling.

[0243] Carpooling order 2: remaining delivery distance 2 / total delivery distance 2;

[0244] Among them, the remaining delivery distance of the order is 2: BA'+A'C'+C'B'; it can be obtained by calling the LBS algorithm.

[0245] Total delivery distance 2: BA'+A'C'+C'B'; which can be obtained by calling the LBS algorithm.

[0246] For example, the change in pick-up time is calculated as follows:

[0247] For carpooling sub-order 2 in the pick-up state: its pick-up time changes to: (time corresponding to P'C) + (time corresponding to CB) - (time corresponding to P'B).

[0248] In other implementations, other methods known to those skilled in the art may be used for calculation, which is not limited here.

[0249] In one possible implementation, the event data also includes the incurred online ride-hailing fees, the upcoming online ride-hailing fees, and the passenger's estimated fees for each carpooling sub-order. The second type of route screening conditions also include: a preset billing ratio threshold.

[0250] In the disclosed embodiment, the incurred online car-hailing fees are the fees corresponding to the road sections that have been passed, the to-be-incurred online car-hailing fees are the fees corresponding to the road sections to be passed, and the passenger estimated fees for each carpooling sub-order are the estimated fees corresponding to each carpooling sub-order after the carpooling is successful; all of which can be obtained based on event data, can be provided by the second server, or obtained by local data processing on the first server, and are not limited here.

[0251] In the embodiment of the present disclosure, the preset billing ratio threshold is used to limit the billing ratio of carpooling orders. The billing ratio of carpooling orders needs to be less than the preset billing ratio threshold to avoid incurring additional fees, thereby improving the user's travel efficiency without increasing the user's travel costs.

[0252] For example, the preset billing ratio threshold may be 1 so as not to add additional fees.

[0253] Figure 10Schematic flowchart of another method for processing carpooling orders provided by embodiments of the present disclosure, showing the step flow of a method for processing carpooling orders including a fee screening step.

[0254] As Figure 10 shown, the method may include the following steps:

[0255] S211. Receive a carpooling request sent by a first user device.

[0256] S212. Send a ride-hailing recommendation request to at least one second server.

[0257] S213. Receive the ride-hailing vehicle feedback from the second server.

[0258] S214. Obtain the event data of the carpooling order bound to the feedback ride-hailing vehicle, and the location data of the carpool sub-orders that have been bound.

[0259] So far, the acquisition of event information associated with the carpooling order is completed.

[0260] S221. Based on the current location of the ride-hailing vehicle, the starting and ending locations of the unboarded orders, and the ending locations of the boarded orders, perform permutations and combinations to generate optional carpooling routes.

[0261] S222. Select candidate carpooling routes from the optional carpooling routes based on the boarding order requirements and / or the carpooling requirements.

[0262] So far, the generation of candidate carpooling routes based on the location data in the event information is completed.

[0263] S2311. Based on the location data of the event information, determine, according to the spherical distance algorithm, the number of pick-up and drop-off experiences of each carpool sub-order, the order angle between any two carpool sub-orders, and at least one of the first detour distance ratio, the first pick-up distance, and the first carpooling distance of each carpool sub-order.

[0264] S2312. Based on the number of pick-up and drop-off experiences of each carpool sub-order, the order angle between any two carpool sub-orders, and at least one of the first detour distance ratio, the first pick-up distance, and the first carpooling distance of each carpool sub-order, and a preset first type of route screening condition, determine the candidate carpooling routes after the first screening from the candidate carpooling routes.

[0265] So far, the determination of the candidate carpooling routes after the first screening from the candidate carpooling routes based on the location data in the event information and the preset first type of route screening condition is completed.

[0266] S2321. Determine at least one of the second detour distance ratio, the second pick-up distance, the second carpooling distance, the detour time ratio, the pick-up time, the remaining delivery distance ratio of the order, and the change in pick-up time for each carpool order based on the location data and event data in the event information.

[0267] S2322. Determine the candidate carpool routes after the second screening from the candidate carpool routes after the first screening based on at least one of the second detour distance ratio, the second pick-up distance, the second carpooling distance, the detour time ratio, the pick-up time, the remaining delivery distance ratio of the order, and the change in pick-up time for each carpool order, and the preset second type of route screening conditions.

[0268] Thus, the candidate carpool routes after the second screening are determined from the candidate carpool routes after the first screening based on the location data and event data in the event information and the preset second type of route screening conditions.

[0269] S2331. Determine the billing ratio of the carpool order according to the event data, where the billing ratio is the ratio of the sum of the incurred online car-hailing fees and the incurred online car-hailing fees to the cumulative value of the estimated fares of the passengers associated with each carpool order.

[0270] S2332. Determine the target carpool route from the candidate carpool routes after the second screening based on the billing ratio of the carpool order and the preset billing ratio threshold.

[0271] Thus, the selection of the target carpool route from the candidate carpool routes after the second screening is completed.

[0272] Therefore, the selection of the target carpool route from the candidate carpool routes after the second screening includes:

[0273] Determine the billing ratio of the carpool order according to the event data, where the billing ratio is the ratio of the sum of the incurred online car-hailing fees and the incurred online car-hailing fees to the cumulative value of the estimated fares of the passengers associated with each carpool order;

[0274] Determine the target carpool route from the candidate carpool routes after the second screening based on the billing ratio of the carpool order and the preset billing ratio threshold.

[0275] In the embodiments of the present disclosure, the billing ratio can be calculated by the following formula:

[0276] (Incurred online car-hailing fees + Incurred online car-hailing fees) / ∑ Estimated fares of passengers associated with carpool orders.

[0277] In other embodiments, the billing ratio can also be calculated by the following formula:

[0278] Total billing of multiple carpool orders on the second service provider side / Sum of passenger flat fares.

[0279] Thus, after determining the charging ratio of the carpooling order, and then in combination with a preset charging ratio threshold, cost screening can be performed from the candidate carpooling routes after secondary screening to determine a carpooling route whose charging ratio is less than the preset charging ratio threshold, which is the target carpooling route.

[0280] In a possible implementation manner, the method further includes:

[0281] Sending an estimated cost request to a second server, where the estimated cost request includes the candidate carpooling routes after secondary screening;

[0282] Receiving the to-be-occurred online car-hailing costs of the candidate carpooling routes after secondary screening fed back by the second server.

[0283] In an embodiment of the present disclosure, the information request sent by the first server to the second server is an estimated cost request, and the estimated cost request includes the candidate carpooling routes after secondary screening; correspondingly, the second server feeds back the to-be-occurred online car-hailing costs of the candidate carpooling routes after secondary screening to the first server in response to the received estimated cost request; the first server receives the to-be-occurred online car-hailing costs of the candidate carpooling routes after secondary screening to perform subsequent calculation and screening of the cost ratio.

[0284] In an embodiment of the present disclosure, only the to-be-occurred online car-hailing costs of the candidate carpooling routes after secondary screening are requested, which reduces the data transmission volume between the first server and the second server, and reduces the data processing volume of the first server for cost calculation and screening, which is beneficial to improving the data transmission and processing efficiency, and further improving the response speed.

[0285] In a possible implementation manner, the method further includes:

[0286] Sending a carpooling order notification message to the second server, where the carpooling order notification message includes the determined target carpooling route, so that the second server sends the target carpooling route to the online car-hailing service.

[0287] Combined with the above, when the second server feeds back the recommended online car-hailing services to the first server, there may be at least one second server feeding back online car-hailing services to the first server, one second server may feed back at least one online car-hailing service to the first server, and one online car-hailing service may correspond to multiple candidate carpooling routes; and there is one target carpooling route determined based on route screening. When there are multiple target carpooling routes determined based on route screening conditions, other screening conditions may also be set to determine the corresponding online car-hailing service, or determine the online car-hailing service provider corresponding to the second server.

[0288] Subsequently, the first server sends a carpool order notification message to the second server, where the carpool order notification message includes the determined target carpool route. Correspondingly, after receiving the carpool order notification message, the second server sends the target carpool route to the corresponding second user device, and the second user device displays the target carpool route and relevant information of other carpool orders through the online car-hailing interface, such as the total number of carpool sub-orders, the starting positions, ending positions, and passenger identification information of each carpool sub-order, etc., so that the online car-hailing can pick up and drop off users quickly based on the displayed information.

[0289] Figure 11 It is a schematic flowchart of another method for processing a carpool order provided by an embodiment of the present disclosure, showing a method flow including input and output processes.

[0290] As Figure 11 shown, the method includes the following steps:

[0291] Input information;

[0292] Route determination process of the carpool order;

[0293] Return available routes.

[0294] Among them, the input information may include event information associated with the carpool order, which can be input into the processing device of the carpool order in the first server to generate candidate carpool routes, and the final carpool route is determined through screening. Exemplarily, the input information mainly includes: location data and event data. The location data may include the starting position, ending position of the carpool sub-order and the corresponding ride task, and the current position of the online car-hailing. The event data may include distance data, time data, cost data, the current order status, and the online car-hailing ID, which is not limited here.

[0295] Among them, the route determination process of the carpool order includes: route permutation and combination, rough screening, route planning for the route combinations after rough screening, fine screening based on the route planning, calculating the billing ratio for the route combinations after fine screening, and screening based on the billing ratio.

[0296] Among them, the route permutation and combination may include: generating the pick-up and drop-off order based on the starting position, ending position of the carpool sub-order and the current position of the online car-hailing through full permutation. Exemplarily, it can be: based on the current position of the online car-hailing, the starting position and ending position of the order that has not been boarded, and the ending position of the order that has already been boarded, performing permutation and combination to generate optional carpool routes, and selecting candidate carpool routes therefrom based on the ride order requirement and / or the carpooling requirement; it can also be: based on the current position of the online car-hailing, the starting position and ending position of the order that has not been boarded, and the ending position of the order that has already been boarded, performing permutation and combination under the condition of meeting the ride order requirement and / or the carpooling requirement to generate candidate carpool routes, which is not limited here.

[0297] Exemplarily, a carpooling order may include two unboarded orders, such as carpooling sub-order 1 and carpooling sub-order 2. Among them, the starting location of carpooling sub-order 1 is E, the ending location is F, the starting location of carpooling sub-order 2 is G, the ending location is H, and the current location of the online car-hailing vehicle is H. By permutation and combination, and making selections in combination with the requirements of the riding order and the requirements of shared rides, 4 candidate carpooling routes can be determined as follows:

[0298] 1): H->E->G->F->H

[0299] 2): H->E->G->H->F

[0300] 3): H->G->E->F->H

[0301] 4): H->G->E->H->F

[0302] In the subsequent process, the target carpooling route will be determined by screening from these candidate carpooling routes.

[0303] Among them, the rough screening may include: by calculating the spherical distance and the order angle between any two carpooling sub-orders, calculating the geometric information (i.e., spatial data) of each order after carpooling, and combining the first type of route screening conditions to filter out the candidate carpooling routes that do not meet the spatial requirements, and obtaining the candidate carpooling routes after the first screening.

[0304] Among them, the fine screening may include: by route calculation of the navigation, filtering the route according to the navigation data. Exemplarily, it may include: based on the location data and event data in the event information, and the second type of route screening conditions, selecting the candidate carpooling routes after the second screening from the candidate carpooling routes after the first screening.

[0305] Among them, after the fine screening, the charging ratio of the selected route is calculated, and screening is performed based on the charging ratio. Exemplarily, it may include: based on the calculated charging ratio and the preset charging ratio threshold, determining the target carpooling route from the candidate carpooling routes after the second screening.

[0306] Among them, when there are multiple available routes determined from the candidate carpooling routes after the second screening, further screening can also be performed by combining other strategies. For example, restricted driving screening can be performed. Exemplarily, it can be requested that the second server calculate whether it passes through a restricted driving area; if it passes through a restricted driving area, it is filtered. Another example is that when multiple available routes are the routes of different online car-hailing vehicles, route selection can be further performed based on the actual and preset online car-hailing vehicle screening conditions. Another example is that the thresholds in the route screening conditions of the rough screening and the fine screening can be optimized to reduce the number of available routes and make the target carpooling route be one.

[0307] After the above screening process, the finally remaining routes are available routes, and the available routes are fed back to the first user device and the second server, and the second server further distributes the available routes to the second user device.

[0308] An embodiment of the present disclosure also provides a method for processing a carpooling order, which is applied to a first user device.

[0309] Figure 12 It is a schematic flowchart of another method for processing a carpooling order provided by an embodiment of the present disclosure, showing the process steps of a method for processing a carpooling order applied to a first user device.

[0310] As Figure 12 shown, the method for processing the carpooling order includes:

[0311] S301. Receive a carpooling sub-order triggered by a user based on a online car-hailing interface.

[0312] In an embodiment of the present disclosure, after the user triggers a carpooling sub-order based on the online car-hailing interface of the first user device; correspondingly, the first user device receives the carpooling sub-order.

[0313] S302. Send a carpooling request to a first server.

[0314] In an embodiment of the present disclosure, the carpooling request includes location data of the carpooling sub-order, so that the first server screens out a target carpooling route according to any one of the above-mentioned methods for processing a carpooling order applied to the first server, and determines an online car-hailing vehicle corresponding to the target carpooling route.

[0315] Wherein, when the first server generates a carpooling order, the online car-hailing vehicle is bound to the carpooling sub-order, so that when generating the target carpooling route of the carpooling sub-order, the online car-hailing vehicle corresponding to the target carpooling route can be determined, thereby determining the online car-hailing vehicle corresponding to the carpooling sub-order.

[0316] S303. Receive a carpooling success notification fed back by the first server.

[0317] In an embodiment of the present disclosure, after the first server feeds back a carpooling success notification to the first user; correspondingly, the first user device receives the carpooling success notification. The carpooling success notification includes the online car-hailing vehicle corresponding to the target carpooling route, so that the first user device can display the target carpooling route and the corresponding online car-hailing vehicle to the user, facilitating mutual confirmation between the two parties to improve carpooling safety.

[0318] Exemplarily, after the first user device receives the carpooling success notification, it can display the target carpooling route and online car-hailing information to the user. The online car-hailing information may include online car-hailing identification information, the current location of the online car-hailing vehicle, and the estimated arrival time, etc. It can also display information such as the number of sub-orders for carpooling and the estimated time to reach the end position to the user, which is not limited here.

[0319] Thus, in a possible implementation manner, the method may further include:

[0320] Based on the online car-hailing interface of the first user device, display the order receiving message to the user.

[0321] The embodiments of the present disclosure also provide a method for processing carpooling orders, which is applied to a second server and may include responding to an information request feedback event information of a first server, and receiving a carpooling order notification message and sending it to the corresponding second user device.

[0322] Figure 13 FIG. is a schematic flowchart of another method for processing carpooling orders provided by the embodiments of the present disclosure, showing the flow steps of the method for processing carpooling orders applied to the second server.

[0323] As Figure 13 shown, the method for processing carpooling orders includes:

[0324] S401. Receive an online car-hailing recommendation request sent by the first server.

[0325] In the embodiments of the present disclosure, after the first server sends an online car-hailing recommendation request to the second server, correspondingly, the second server receives the online car-hailing recommendation request.

[0326] S402. Feedback an online car-hailing vehicle to the first server.

[0327] In the embodiments of the present disclosure, the second server feeds back an online car-hailing vehicle that can provide carpooling services to the first server. Specifically, the online car-hailing vehicle fed back is bound with at least one sub-order for carpooling, so that the first server can screen out the target carpooling route according to any one of the methods for processing carpooling orders applied to the first server in the above embodiments, and determine the online car-hailing vehicle corresponding to the target carpooling route.

[0328] S403. Receive a carpooling order notification message sent by the first server.

[0329] In the embodiments of the present disclosure, after the first server determines the target carpooling route, the first server sends a carpooling order notification message to the second server; correspondingly, the second server receives the carpooling order notification message. Among them, the carpooling order notification message includes the determined target carpooling route and the corresponding online car-hailing vehicle.

[0330] S404. Send the target carpooling route to the second user device of the corresponding online car-hailing service.

[0331] In an embodiment of the present disclosure, after receiving the carpooling order notification message, the second server sends the target carpooling route to the actual second user device corresponding thereto, that is, dispatches an order.

[0332] In addition, the second server may also send user-related information to the second user device of the corresponding online car-hailing service, so as to confirm information when picking up the user and ensure the accuracy of the pick-up and drop-off service.

[0333] In a possible implementation manner, the method may further include:

[0334] Receiving a request for estimated cost sent by the first server;

[0335] Sending the to-be-occurred online car-hailing service cost of the candidate carpooling route after secondary screening to the first server.

[0336] In an embodiment of the present disclosure, the first server also responds to the received request for estimated cost and feeds back relevant cost information to the first server, so that the first server selects a candidate carpooling route that meets the cost requirement in combination with the relevant cost information.

[0337] An embodiment of the present disclosure also provides a method for processing a carpooling order, which is applied to a second user device.

[0338] Figure 14 FIG. is a schematic flowchart of yet another method for processing a carpooling order provided by an embodiment of the present disclosure, showing the flow steps of the method for processing a carpooling order applied to a second user device.

[0339] As Figure 14 shown, the method for processing a carpooling order includes:

[0340] S501. Receive the target carpooling route sent by the second server.

[0341] In an embodiment of the present disclosure, the target carpooling route is obtained by the first server according to any one of the methods for processing a carpooling order applied to the first server in the above embodiments after the first server feeds back an online car-hailing service bound with at least one sub carpooling order to the first server.

[0342] In a possible implementation manner, the method may further include:

[0343] S502. Based on the online car-hailing service interface, display the target carpooling route to the online car-hailing service driver.

[0344] In the embodiments of the present disclosure, the second user device displays the target carpooling route based on the online car-hailing interface, so that the online car-hailing driver can timely know the order dispatch information such as the target carpooling route and user information, and adjust the driving route in a timely manner.

[0345] Figure 15 FIG. is a schematic diagram of the generation process of a carpooling order provided by the embodiments of the present disclosure, showing the information interaction process of each device during the generation process of the carpooling order.

[0346] As Figure 15 shown, the generation process of the carpooling order includes:

[0347] S01. Trigger a sub carpooling order.

[0348] That is, the user triggers a sub carpooling order based on the online car-hailing interface of the first user device.

[0349] S02. Send a carpooling request.

[0350] That is, the first user device generates a carpooling request based on the sub carpooling order and sends the carpooling request to the first server.

[0351] S03. Send an information request.

[0352] That is, the first server sends an information request to the second server.

[0353] S04. Feedback event information.

[0354] That is, the second server feedbacks event information in response to the information request.

[0355] S05. Obtain the target carpooling route based on the event information.

[0356] That is, the first server generates a candidate carpooling route based on the received event information, and obtains the target carpooling route after route screening.

[0357] S06. Send a carpooling success notification.

[0358] That is, the first server sends the carpooling success notification to the first user device.

[0359] S07. Display the route and the online car-hailing service.

[0360] That is, the first user device displays the target carpooling route and the relevant information of the corresponding online car-hailing service and driver to the user based on the online car-hailing interface.

[0361] S08. Send a carpooling order notification message.

[0362] That is, the first server sends the carpooling order notification message to the second server.

[0363] S09. Send the target carpooling route.

[0364] That is, the second server sends the target carpooling route to the second user device and sends the information of the corresponding user.

[0365] S10. Display the route and the user.

[0366] That is, the second user device displays the relevant information of the route and the user to the online car-hailing driver based on the online car-hailing interface.

[0367] In the embodiments of the present disclosure, the information request may include an online car-hailing recommendation request. Correspondingly, the event information includes the feedback online car-hailing. Further, the information request may further include an estimated cost request. Correspondingly, the event information includes the to-be-occurred online car-hailing cost of the candidate carpooling route after secondary screening.

[0368] In the embodiments of the present disclosure, S06 and S07 may be executed prior to S08 - S10, may be executed in parallel with them, or may be executed later, which is not limited herein.

[0369] In other embodiments, when the event information is provided by the first server, the interaction of the information request and the event information between the first server and the second server may be omitted in this process, so as to improve the data processing speed and the response speed.

[0370] Figure 16 The figure is a schematic structural diagram of a carpooling order processing device provided by an embodiment of the present disclosure, which can be applicable to scenarios where it is difficult to take a taxi, such as during peak travel hours, to implement the situation of determining the route of a carpooling order based on the server of an aggregation service provider. The carpooling order processing device can be implemented by software and / or hardware and can be integrated on any electronic device with computing capabilities, such as a terminal, specifically including a smart phone, a personal digital assistant, a tablet computer, a wearable device with a display screen, a laptop computer, etc.

[0371] As Figure 16 shown, the carpooling order processing device 600 applied to the first server provided in this embodiment mainly includes: an information acquisition module 601, a candidate route generation module 602, and a screening module 603.

[0372] Among them, the information acquisition module 601 is configured to acquire event information associated with a carpooling order. The carpooling order combines at least two carpooling sub-orders. The event information includes location data and event data. The order information is provided by the first server and / or by a second server connected to the first server. The first server is the server of an aggregation service provider, and the second server is the server of an online car-hailing service provider; the candidate route generation module 602 is configured to generate a candidate carpooling route based on the location data in the event information; the screening module 603 is configured to screen out a target carpooling route from the candidate carpooling routes based on the location data and event data in the event information, and a preset route screening condition.

[0373] In a possible implementation, the information acquisition module 601 is configured to acquire event information associated with a carpooling order, specifically including:

[0374] Receiving a carpooling request sent by a first user device, where the carpooling request includes the location data of the carpooling sub-order; sending an online car-hailing recommendation request to at least one second server, where the online car-hailing recommendation request includes at least part of the location data; receiving the online car-hailing vehicles fed back by the second server, and the fed-back online car-hailing vehicles are bound with at least one carpooling sub-order; acquiring the event data of the carpooling order bound by the fed-back online car-hailing vehicle, and the location data of the already-bound carpooling sub-order.

[0375] In a possible implementation, the carpooling sub-order includes an unboarded order and a boarded order. The location data includes the current location of the online car-hailing vehicle, the starting location and the ending location of the unboarded order, and the ending location of the boarded order.

[0376] Based on this, the candidate route generation module 602 is configured to generate a candidate carpooling route based on the location data in the event information, specifically including:

[0377] Performing permutation and combination based on the current location of the online car-hailing vehicle, the starting location and the ending location of the unboarded order, and the ending location of the boarded order to generate optional carpooling routes; selecting candidate carpooling routes from the optional carpooling routes based on the riding order requirement and / or the carpooling requirement.

[0378] In a possible implementation, the screening module 603 is configured to screen out a target carpooling route from the candidate carpooling routes based on the location data and event data in the event information, and a preset route screening condition, specifically including:

[0379] Determine the candidate carpooling routes after the first screening from the candidate carpooling routes based on the location data in the event information and the preset first - type route screening conditions; determine the candidate carpooling routes after the second screening from the candidate carpooling routes after the first screening based on the location data and event data in the event information and the preset second - type route screening conditions; select the target carpooling route from the candidate carpooling routes after the second screening.

[0380] In a possible implementation, the first - type route screening conditions include at least one of the number - of - pick - up - and - drop - off threshold, order - angle threshold, first detour - distance ratio threshold, first pick - up distance threshold, and first carpooling - distance threshold.

[0381] Based on this, the screening module 603 is used to determine the candidate carpooling routes after the first screening from the candidate carpooling routes based on the location data in the event information and the preset first - type route screening conditions, specifically including:

[0382] Based on the location data in the event information, determine the number of pick - up - and - drop - off experiences of each carpool sub - order, the order angle between any two carpool sub - orders, and at least one of the first detour - distance ratio, first pick - up distance, and first carpooling - distance of each carpool sub - order; based on the number of pick - up - and - drop - off experiences of each carpool sub - order, the order angle between any two carpool sub - orders, and at least one of the first detour - distance ratio, first pick - up distance, and first carpooling - distance of each carpool sub - order, and the preset first - type route screening conditions, determine the candidate carpooling routes after the first screening from the candidate carpooling routes.

[0383] In a possible implementation, the screening module 603 is used to determine the number of pick - up - and - drop - off experiences of each carpool sub - order, the order angle between any two carpool sub - orders, and at least one of the first detour - distance ratio, first pick - up distance, and first carpooling - distance of each carpool sub - order based on the location data in the event information, specifically including:

[0384] Based on the location data of the event information, determine the number of pick - up - and - drop - off experiences of each carpool sub - order, the order angle between any two carpool sub - orders, and at least one of the first detour - distance ratio, first pick - up distance, and first carpooling - distance of each carpool sub - order according to the spherical - distance algorithm.

[0385] In a possible implementation, the event data further includes the traveled track points, the estimated pick - up - and - drop - off distance of each carpool sub - order, and the second - type route screening conditions include at least one of the second detour - distance ratio threshold, second pick - up distance threshold, second carpooling - distance threshold, detour - time ratio threshold, pick - up - time threshold, order - remaining - pick - up - and - drop - off - distance ratio threshold, and pick - up - time change threshold.

[0386] Based on this, the screening module 603 is configured to determine the candidate carpooling routes after secondary screening from the candidate carpooling routes after primary screening based on the location data and event data in the event information, and the second type of route screening conditions preset, specifically including:

[0387] Based on the location data and event data in the event information, determine at least one of the second detour distance ratio, the second pick-up distance, the second carpooling distance, the detour time ratio, the pick-up time, the remaining delivery distance ratio of the order, and the change in pick-up time for each carpooling sub-order; based on at least one of the second detour distance ratio, the second pick-up distance, the second carpooling distance, the detour time ratio, the pick-up time, the remaining delivery distance ratio of the order, and the change in pick-up time for each carpooling sub-order, and the second type of route screening conditions preset, determine the candidate carpooling routes after secondary screening from the candidate carpooling routes after primary screening.

[0388] In a possible implementation, a location-based service algorithm is used to determine at least one of the second detour distance ratio, the second pick-up distance, the second carpooling distance, the detour time ratio, the pick-up time, the remaining delivery distance ratio of the order, and the change in pick-up time for each carpooling sub-order.

[0389] In a possible implementation, the event data further includes the incurred online car-hailing fees, the to-be-incurred online car-hailing fees, and the estimated passenger fees for each carpooling sub-order, and the second type of route screening conditions further includes: a preset billing ratio threshold.

[0390] Based on this, the screening module 603 is configured to select a target carpooling route from the candidate carpooling routes after secondary screening, specifically including:

[0391] Determine the billing ratio of the carpooling order according to the event data, where the billing ratio is the ratio of the sum of the incurred online car-hailing fees and the to-be-incurred online car-hailing fees to the cumulative value of the estimated passenger fees associated with each carpooling sub-order; based on the billing ratio of the carpooling order and the preset billing ratio threshold, determine the target carpooling route from the candidate carpooling routes after secondary screening.

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

[0393] A request sending module, configured to send an estimated fee request to the second server, where the estimated fee request includes the candidate carpooling routes after secondary screening;

[0394] An information receiving module, configured to receive the to-be-incurred online car-hailing fees of the candidate carpooling routes after secondary screening feedback by the second server.

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

[0396] The message sending module is used to send a carpooling order notification message to the second server, where the carpooling order notification message includes the determined target carpooling route, so that the second server sends the target carpooling route to the online car-hailing service.

[0397] The carpool order processing device provided in the embodiments of the present disclosure can execute any carpool order processing method provided in the embodiments of the present disclosure, and has the corresponding functional modules and beneficial effects of the execution method. For any content not fully described in the embodiments of the device of the present disclosure, reference can be made to the description of any method embodiment of the present disclosure.

[0398] The embodiment of the present disclosure also provides a device for processing a carpooling order, which is applied to a first user device.

[0399] Figure 17 A structural diagram of another apparatus for processing a carpooling order provided in an embodiment of the present disclosure shows the structure of the apparatus for processing a carpooling order applied to a first user device.

[0400] like Figure 17 As shown, the carpooling order processing device 610 provided in this embodiment and applied to the first user equipment includes: a carpooling sub-order receiving module 611, a carpooling request sending module 612 and a carpooling notification receiving module 613.

[0401] Among them, the carpooling sub-order receiving module 611 is used to receive the carpooling sub-order triggered by the user based on the online car-hailing interface; the carpooling request sending module 612 is used to send a carpooling request to the first server, and the carpooling request includes the location data of the carpooling sub-order, so that the first server can filter out the target carpooling route according to any one of the devices applied to the first server in the above-mentioned embodiment, and determine the online car-hailing corresponding to the target carpooling route; the carpooling notification receiving module 613 is used to receive the carpooling success notification feedback from the first server, and the carpooling success notification includes the online car-hailing corresponding to the target carpooling route.

[0402] In one possible embodiment, the device may further include:

[0403] The order information display module is used to display a successful carpooling notification to the user based on the online car-hailing interface. For example, it may include the target carpooling route, online car-hailing related information, the estimated arrival time of the online car-hailing vehicle at the starting location, and other messages.

[0404] The disclosed embodiment also provides a device for processing a carpooling order, which is applied to a second server.

[0405] Figure 18 A structural diagram of another device for processing carpooling orders provided in an embodiment of the present disclosure shows the structure of the device for processing carpooling orders applied to a second server.

[0406] likeFigure 18 As shown in the figure, the carpool order processing device 620 applied to the second server provided in this embodiment includes: a recommendation request receiving module 621, a online car-hailing feedback module 622, a notification message receiving module 623, and a carpool route sending module 624.

[0407] Among them, the recommendation request receiving module 621 is configured to receive the online car-hailing recommendation request sent by the first server; the online car-hailing feedback module 622 is configured to feedback the online car-hailing to the first server, and at least one carpool sub-order is bound to the feedback online car-hailing, so that the first server filters out the target carpool route according to any one of the devices provided in the fifth aspect, and determines the online car-hailing corresponding to the target carpool route; the notification message receiving module 623 is configured to receive the carpool order notification message sent by the first server, and the carpool order notification message includes the determined target carpool route and the corresponding online car-hailing; the carpool route sending module 624 is configured to send the target carpool route to the second user device of the corresponding online car-hailing.

[0408] In a possible implementation manner, the device may further include:

[0409] An estimated cost request receiving module, configured to receive the estimated cost request sent by the first server;

[0410] A cost information feedback module, configured to, in response to the estimated cost request, feedback the to-be-occurred online car-hailing cost of the candidate carpool route after secondary screening to the first server.

[0411] The embodiments of the present disclosure also provide a carpool order processing device applied to the second user device.

[0412] Figure 19 FIG. shows the structural schematic diagram of another carpool order processing device provided by the embodiments of the present disclosure, showing the structure of the carpool order processing device applied to the second user device.

[0413] As Figure 19 shown, the carpool order processing device 630 applied to the second user device provided in this embodiment includes: a carpool route receiving module 631, configured to receive the target carpool route sent by the second server, and the target carpool route is filtered out by any one of the devices provided in the fifth aspect of the first server after the second server feedbacks the online car-hailing bound with at least one carpool sub-order.

[0414] In a possible implementation manner, the device may further include: a dispatching message display module 632, configured to display the target carpool route to the online car-hailing driver based on the online car-hailing interface.

[0415] Figure 20A schematic structural diagram of an electronic device provided by an embodiment of the present disclosure, which is used to exemplarily illustrate the electronic device for implementing the method for processing any carpooling order in the embodiment of the present disclosure, and should not be construed as a specific limitation on the embodiment of the present disclosure.

[0416] As Figure 20 shown, the electronic device 700 may include a processor (such as a CPU, a graphics processor, etc.) 701, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 702 or the program loaded from the storage device 708 into the random access memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the electronic device 700 are also stored. The processor 701, the ROM 702, and the RAM 703 are connected to each other through the bus 704. The input / output (I / O) interface 705 is also connected to the bus 704.

[0417] Generally, the following devices may be connected to the I / O interface 705: an input device 706 including, for example, a touch screen, a touchpad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 707 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 708 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 709. The communication device 709 may allow the electronic device 700 to communicate with other devices wirelessly or wiredly to exchange data. Although the electronic device 700 with various devices is shown, it should be understood that it is not required to implement or include all the shown devices. More or fewer devices may be alternatively implemented or included.

[0418] Specifically, according to the embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a non-transitory computer-readable medium, and the computer program includes program codes for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication device 709, or installed from the storage device 708, or installed from the ROM 702. When the computer program is executed by the processor 701, the functions defined in the method for processing any carpooling order provided by the embodiment of the present disclosure can be executed.

[0419] It should be noted that the above-mentioned computer-readable medium in the present disclosure may be a computer-readable signal medium, a computer-readable storage medium, or any combination of the two. A computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present disclosure, a computer-readable storage medium may be any tangible medium that contains or stores a program, and this program can be used by or in combination with an instruction execution system, apparatus, or device. In the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries computer-readable program code. Such a propagated data signal may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, and this computer-readable signal medium can send, propagate, or transmit a program for use by or in combination with an instruction execution system, apparatus, or device. The program code contained on a computer-readable medium can be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0420] In some embodiments, the client and the server can communicate using any currently known or future-developed network protocol such as HTTP (HyperText Transfer Protocol), and can be interconnected with digital data communication in any form or medium (for example, a communication network). Examples of communication networks include local area networks ("LAN"), wide area networks ("WAN"), the Internet (for example, the Internet), and end-to-end networks (for example, ad hoc end-to-end networks), as well as any currently known or future-developed networks.

[0421] The above-mentioned computer-readable medium may be included in the above-mentioned electronic device; or it may exist separately and not be assembled into the electronic device.

[0422] The above-mentioned computer-readable medium carries one or more programs, and when the above-mentioned one or more programs are executed by the electronic device, the electronic device is caused to:

[0423] Obtain event information associated with a carpooling order; wherein, the carpooling order combines at least two carpooling sub-orders, the event information includes location data and event data, and the event information is provided by a first server and / or by a second server connected to the first server. The first server is the server of an aggregation service provider, and the second server is the server of an online car-hailing service provider; generate a candidate carpooling route based on the location data in the event information; screen out a target carpooling route from the candidate carpooling routes based on the location data and event data in the event information, and a preset route screening condition.

[0424] Alternatively, the above computer-readable medium carries one or more programs, and when the above one or more programs are executed by the electronic device, the electronic device is caused to:

[0425] Receive a carpooling sub-order triggered by the user based on the online car-hailing interface;

[0426] Send a carpooling request to the first server, where the carpooling request includes the location data of the carpooling sub-order, so that the first server screens out a target carpooling route according to any of the methods applied to the first server, and determines the online car-hailing vehicle corresponding to the target carpooling route;

[0427] Receive a carpooling success notification feedback from the first server, where the carpooling success notification includes the online car-hailing vehicle corresponding to the target carpooling route.

[0428] Alternatively, the above computer-readable medium carries one or more programs, and when the above one or more programs are executed by the electronic device, the electronic device is caused to:

[0429] Receive an online car-hailing recommendation request sent by the first server;

[0430] Feedback an online car-hailing vehicle to the first server, where the feedback online car-hailing vehicle is bound with at least one carpooling sub-order, so that the first server screens out a target carpooling route according to any of the methods applied to the first server, and determines the online car-hailing vehicle corresponding to the target carpooling route;

[0431] Receive a carpooling order notification message sent by the first server, where the carpooling order notification message includes the determined target carpooling route and the corresponding online car-hailing vehicle;

[0432] Send the target carpooling route to the second user device of the corresponding online car-hailing vehicle.

[0433] Alternatively, the above computer-readable medium carries one or more programs, and when the above one or more programs are executed by the electronic device, the electronic device is caused to:

[0434] Receive the target carpooling route sent by the second server, which is filtered by the first server according to any one of the methods applied to the first server after the second server feeds back a network car-hailing vehicle bound with at least one carpooling sub-order to the first server.

[0435] In the embodiments of the present disclosure, computer program code for performing the operations of the present disclosure can be written in one or more programming languages or combinations thereof. The above programming languages include, but are not limited to, object-oriented programming languages such as Java, Smalltalk, C++, and also include conventional procedural programming languages such as the "C" language or similar programming languages. The program code can be executed entirely on the computer, partially on the computer, executed as an independent software package, partially on the computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer can be connected to the computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (for example, by using an Internet service provider to connect through the Internet).

[0436] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagram may represent a module, a program segment, or a part of code that contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than marked in the accompanying drawings. For example, two consecutive blocks shown may actually be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, and the combination of blocks in the block diagram and / or flowchart, can be implemented by a dedicated hardware-based system for performing the specified functions or operations, or can be implemented by a combination of dedicated hardware and computer instructions.

[0437] The units involved in the embodiments of the present disclosure can be implemented in software or in hardware. Among them, the name of the unit does not constitute a limitation to the unit itself in some cases.

[0438] The functions described above in this document can be performed, at least in part, by one or more hardware logic components. By way of example and not limitation, the types of hardware logic components that may be used include: Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), Systems on Chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.

[0439] In the context of this disclosure, a computer-readable medium can be a tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device. A computer-readable medium can be either a computer-readable signal medium or a computer-readable storage medium. A computer-readable medium can include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of a computer-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a Read-Only Memory (ROM), an Erasable Programmable Read-Only Memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0440] The above description is only a preferred embodiment of the present disclosure and an illustration of the applied technical principles. Those skilled in the art should understand that the scope of the disclosure involved in the present disclosure is not limited to the technical solutions formed by the specific combination of the above technical features, and should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosure concept. For example, the technical solutions formed by mutually replacing the above features with the (but not limited to) technical features having similar functions disclosed in the present disclosure.

[0441] Moreover, although the operations are depicted in a particular order, this should not be construed as requiring that the operations be performed in the particular order shown or in sequential order. In certain circumstances, multitasking and parallel processing may be advantageous. Likewise, although several specific implementation details are included in the foregoing discussion, these should not be construed as limiting the scope of the present disclosure. Certain features described in the context of separate embodiments can also be implemented combinatorially in a single embodiment. Conversely, the various features described in the context of a single embodiment can also be implemented separately or in any suitable sub-combination in multiple embodiments.

[0442] Although the subject matter has been described in language specific to structural features and / or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. On the contrary, the specific features and acts described above are merely example forms of implementing the claims.

Claims

1. A method for processing a carpooling order, applied to a first server, comprising: Obtaining event information associated with the carpooling order, where the carpooling order combines at least two carpooling sub-orders, and the event information includes location data and event data. The event information is provided by the first server and / or by a second server connected to the first server. The first server is the server of an aggregation service provider, and the second server is the server of an online car-hailing service provider; Generating a candidate carpooling route based on the location data in the event information; Filtering out a target carpooling route from the candidate carpooling routes based on the location data and event data in the event information and a preset route filtering condition, where the event data includes the event data of at least one carpooling sub-order bound to the online car-hailing vehicle feedback by the second server; Among them, the obtaining of the event information associated with the carpooling order includes: Receiving a carpooling request sent by a first user device, where the carpooling request includes the location data of the carpooling sub-order; Sending an online car-hailing recommendation request to at least one second server, where the online car-hailing recommendation request includes at least part of the location data; Receiving the online car-hailing vehicle feedback by the second server, and the feedback online car-hailing vehicle binds at least one carpooling sub-order; Obtaining the event data of the carpooling order bound to the feedback online car-hailing vehicle and the location data of the already bound carpooling sub-orders.

2. The method according to claim 1, wherein The carpooling sub-orders include unboarded orders and boarded orders, and the location data includes the current location of the online car-hailing vehicle, the starting and ending locations of the unboarded orders, and the ending location of the boarded orders; The generating of the candidate carpooling route based on the location data in the event information includes: Generating optional carpooling routes through permutation and combination based on the current location of the online car-hailing vehicle, the starting and ending locations of the unboarded orders, and the ending location of the boarded orders; Selecting candidate carpooling routes from the optional carpooling routes based on the riding order requirement and / or the carpooling requirement.

3. The method according to claim 2, wherein, Filtering out a target carpooling route from the candidate carpooling routes based on the location data and event data in the event information and a preset route filtering condition includes: Determining the candidate carpooling routes after the first screening from the candidate carpooling routes based on the location data in the event information and a preset first type of route filtering condition; Determining the candidate carpooling routes after the second screening from the candidate carpooling routes after the first screening based on the location data and event data in the event information and a preset second type of route filtering condition; Selecting a target carpooling route from the candidate carpooling routes after the second screening.

4. The method according to claim 3, wherein The first type of route filtering condition includes at least one of a threshold for the number of pick-up and drop-off times, a threshold for the order angle, a first detour distance ratio threshold, a first pick-up distance threshold, and a first carpooling distance threshold; The determining of the candidate carpooling routes after the first screening from the candidate carpooling routes based on the location data in the event information and a preset first type of route filtering condition includes: Based on the location data in the event information, determine the number of pick-up and drop-off experiences for each carpool order, the order angle between any two carpool orders, and at least one of the first detour distance ratio, the first pick-up distance, and the first shared ride distance for each carpool order; Based on the number of pick-up and drop-off experiences for each carpool order, the order angle between any two carpool orders, and at least one of the first detour distance ratio, the first pick-up distance, and the first shared ride distance for each carpool order, and a preset first type of route screening condition, determine the candidate carpool routes after the first screening from the candidate carpool routes.

5. The method according to claim 4, wherein The determining, based on the location data in the event information, the number of pick-up and drop-off experiences for each carpool order, the order angle between any two carpool orders, and at least one of the first detour distance ratio, the first pick-up distance, and the first shared ride distance for each carpool order, includes: Based on the location data of the event information, determine the number of pick-up and drop-off experiences for each carpool order, the order angle between any two carpool orders, and at least one of the first detour distance ratio, the first pick-up distance, and the first shared ride distance for each carpool order according to the spherical distance algorithm.

6. The method according to claim 3, wherein The event data further includes the traveled trajectory points, the estimated pick-up and drop-off distance for each carpool order, and the second type of route screening condition includes at least one of a second detour distance ratio threshold, a second pick-up distance threshold, a second shared ride distance threshold, a detour time ratio threshold, a pick-up time threshold, an order remaining pick-up and drop-off distance ratio threshold, and a pick-up time change threshold; the determining, based on the location data and the event data in the event information, and a preset second type of route screening condition, the candidate carpool routes after the second screening from the candidate carpool routes after the first screening, includes: Based on the location data and the event data in the event information, determine at least one of the second detour distance ratio, the second pick-up distance, the second shared ride distance, the detour time ratio, the pick-up time, the order remaining pick-up and drop-off distance ratio, and the pick-up time change for each carpool order; Based on at least one of the second detour distance ratio, the second pick-up distance, the second shared ride distance, the detour time ratio, the pick-up time, the order remaining pick-up and drop-off distance ratio, and the pick-up time change for each carpool order, and a preset second type of route screening condition, determine the candidate carpool routes after the second screening from the candidate carpool routes after the first screening.

7. The method according to claim 3, wherein The event data further includes the incurred online car-hailing fees, the to-be-incurred online car-hailing fees, and the estimated passenger fees for each carpool order, and the second type of route screening condition further includes: a preset billing ratio threshold; The selecting a target carpool route from the candidate carpool routes after the second screening includes: Determine the billing ratio of the carpool order according to the event data, where the billing ratio is the ratio of the sum of the incurred online car-hailing fees and the to-be-incurred online car-hailing fees to the cumulative value of the estimated passenger fees associated with each carpool order; Based on the billing ratio of the carpool order and the preset billing ratio threshold, determine the target carpool route from the candidate carpool routes after the second screening.

8. The method according to claim 7, wherein Further includes: Send an estimated cost request to the second server, where the estimated cost request includes the candidate carpooling routes after the second screening; Receive the upcoming online car-hailing costs of the candidate carpooling routes after the second screening feedback by the second server.

9. A method for processing a carpooling order, applied to a first user device, includes: Receive a carpooling sub-order triggered by a user based on an online car-hailing interface; Send a carpooling request to the first server, where the carpooling request includes the location data of the carpooling sub-order, so that the first server screens out a target carpooling route according to the method of any one of claims 1-8, and determines the online car-hailing corresponding to the target carpooling route; Receive a carpooling success notification feedback by the first server, where the carpooling success notification includes the online car-hailing corresponding to the target carpooling route.

10. A method for processing a carpooling order, applied to a second server, includes: Receive an online car-hailing recommendation request sent by the first server; Feedback an online car-hailing to the first server, where the feedback online car-hailing is bound with at least one carpooling sub-order, so that the first server screens out a target carpooling route according to the method of any one of claims 1-8, and determines the online car-hailing corresponding to the target carpooling route; Receive a carpooling order notification message sent by the first server, where the carpooling order notification message includes the determined target carpooling route and the corresponding online car-hailing; Send the target carpooling route to the second user device of the corresponding online car-hailing.

11. A method for processing a carpooling order, applied to a second user device, includes: Receive the target carpooling route sent by the second server, where the target carpooling route is screened out by the first server according to the method of any one of claims 1-8 after the second server feedbacks an online car-hailing bound with at least one carpooling sub-order to the first server.

12. An electronic device, includes: A processor; A memory for storing the executable instructions of the processor; The processor is configured to read the executable instructions from the memory and execute the executable instructions to implement the method for processing a carpooling order of any one of claims 1-8.

13. A computer-readable storage medium, where the storage medium stores a computer program, and the computer program is used to execute the method for processing a carpooling order of any one of claims 1-8.

Images