CN110910202B - An order processing method and device - Google Patents

Abstract

The embodiment of the invention provides an order processing method and device. The method comprises the following steps: receiving taxi appointment orders of at least two clients, and determining a first path distance, wherein the first path distance is the shortest car sharing path distance combining the taxi appointment orders; acquiring target paths of the taxi appointment order, and determining a second path distance, wherein the second path distance is the sum of the path distances of each target path; determining a carpooling parameter according to the first path distance and the second path distance; the carpooling parameter is the ratio of the difference value between the first path distance and the second path distance to the longest path in the target paths; and if the car sharing parameters meet the preset numerical value requirements, combining each car booking order into a target order. The embodiment of the invention solves the problem that in the prior art, the network appointment platform only compares the starting point and the ending point in the car sharing process and has limitation.

Description

An order processing method and device

technical field

The present invention relates to the field of Internet technologies, and in particular, to an order processing method and device.

Background technique

In recent years, with the rapid development of the mobile Internet industry, new forms of industry integrating traditional transportation and the Internet have flourished, making online car-hailing services (referred to as online car-hailing) as an important way for users to travel. To meet the needs of users in different travel scenarios, the scale of users continues to grow steadily, and it quickly occupies a large number of user markets in a short period of time, and it also brings great convenience for users to travel.

In the field of online car-hailing, carpooling, as a combined travel method, on the one hand, can bring convenience to users, reduce the cost of passengers, and on the other hand, can reasonably allocate vehicle resources. Therefore, carpooling has gained a certain extent. User's approval. However, in the prior art, in the car-sharing process, the car-hailing platform usually only compares the similarity of the trips, that is, only compares whether the start and end points of the trips of two car-sharing users are close; then, only consider whether the start and end points are close. Proximity is not fully applicable to all scenarios. For example, there is a situation where the starting point and the ending point are close, but the itinerary is not related.

Therefore, only comparing the start and end points has certain limitations.

SUMMARY OF THE INVENTION

The embodiments of the present invention provide an order processing method and device to solve the problem of limitation in the prior art that the online car-hailing platform only compares the starting point and the ending point in the process of carpooling.

On the one hand, an embodiment of the present invention provides an order processing method, the method includes:

Receive car-hailing orders from at least two clients, and determine a first path distance, where the first path distance is the shortest carpooling path distance obtained by combining each of the car-hailing orders;

Obtain the target path of the car-hailing order, and determine a second path distance, where the second path distance is the sum of the path distances of each of the target paths;

A carpooling parameter is determined according to the first path distance and the second path distance; wherein the carpooling parameter is the difference between the first path distance and the second path distance, and the target path The ratio between the longest paths in ;

If the carpooling parameters meet the preset value requirements, each of the car-hailing orders is merged into a target order.

On the other hand, an embodiment of the present invention also provides a taxi application processing device, which is applied to a server, and the device includes:

an order receiving module, configured to receive car-hailing orders from at least two clients, and determine a first path distance, where the first path distance is the shortest carpooling path distance obtained by merging each of the car-hailing orders;

A distance determination module, configured to obtain the target path of the car-hailing order, and determine a second path distance, where the second path distance is the sum of the path distances of each of the target paths;

A parameter determination module, configured to determine carpooling parameters according to the first path distance and the second path distance; wherein the carpooling parameter is the difference between the first path distance and the second path distance , and the ratio between the longest path in the target path;

An order merging module, configured to merge each of the car-hailing orders into a target order if the car-pooling parameters meet preset numerical requirements.

In another aspect, an embodiment of the present invention also provides an electronic device, the electronic device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the computer program when the processor executes the computer program. The steps in the order processing method described above.

In another aspect, an embodiment of the present invention also provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps in the above-mentioned order processing method are implemented .

In the embodiment of the present invention, a first path distance is determined by receiving car-hailing orders from at least two clients; a target path of the car-hailing orders is obtained, and a second path distance is determined; The second path distance is to determine carpooling parameters; if the carpooling parameters meet the preset value requirements, each of the car-hailing orders is merged into a target order, and the carpooling parameters are used to characterize the matching degree of the orders, so as to avoid orders with lower matching degrees from being Combined, even resulting in a longer total mileage.

Description of drawings

In order to illustrate the technical solutions of the embodiments of the present invention more clearly, the following briefly introduces the drawings that are used in the description of the embodiments of the present invention. Obviously, the drawings in the following description are only some embodiments of the present invention. , for those of ordinary skill in the art, other drawings can also be obtained from these drawings without creative labor.

1 is a flowchart of steps of an order processing method provided by an embodiment of the present invention;

FIG. 2 is one of scene diagrams of an example of an embodiment of the present invention;

FIG. 3 is the second example scene diagram of the embodiment of the present invention;

FIG. 4 is a third example scene diagram of an embodiment of the present invention;

5 is a structural block diagram of an apparatus for processing a taxi application provided by an embodiment of the present invention;

FIG. 6 is a structural block diagram of an electronic device provided by an embodiment of the present invention.

Detailed ways

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, but not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

It is to be understood that reference throughout the specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic associated with the embodiment is included in at least one embodiment of the present invention. Thus, appearances of "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily necessarily referring to the same embodiment. Furthermore, the particular features, structures or characteristics may be combined in any suitable manner in one or more embodiments.

In various embodiments of the present invention, it should be understood that the size of the sequence numbers of the following processes does not mean the sequence of execution, and the execution sequence of each process should be determined by its functions and internal logic, rather than the implementation of the present invention The implementation of the examples constitutes no limitation.

Referring to FIG. 1 , an embodiment of the present invention provides an order processing method. Preferably, the present invention is applied to a car-hailing server or a car-hailing platform. The server or car-hailing platform communicates with a client and receives a car-hailing order from the client. , and deploy vehicles for ride-hailing orders.

The method includes:

Step 101: Receive car-hailing orders from at least two clients, and determine a first path distance, where the first path distance is the shortest carpooling path distance obtained by combining each of the car-hailing orders.

Among them, the server can preset an order dispatch cycle, and the order dispatch cycle can be in minutes or seconds; in each dispatch cycle, the received car-hailing orders are summarized, and the orders that can be carpooled are screened out.

It is understandable that the client can provide carpooling options when the user places an order, or ask the user whether to accept the carpooling; if the user actively selects the carpooling option or reports to the client to accept the carpooling, the client sends a carpooling instruction with a preset carpooling instruction to the server. ride-hailing orders.

After receiving the car-hailing order with the preset car-pooling instructions, the server determines the mergeable orders that meet the car-pooling rules, and then determines the car-pooling route after combining the orders. The car-pooling route should include the start and end points of the itinerary in each agreed order. Finally, the shortest carpool path distance of the shortest path in the carpool path is determined.

In the embodiment of the present invention, the combined car-hailing orders may be two or more.

Step 102: Obtain the target path of the car-hailing order, and determine a second path distance, where the second path distance is the sum of the path distances of each of the target paths.

The server obtains the target path of each car-hailing order, and then sums the distances of the target paths of all the car-hailing orders to obtain the second path distance.

For example, if the target path of car-hailing order A is D(A) and the target path of car-hailing order B is D(B), the second path distance is D(A)+D(B).

It is understandable that there may be multiple optional paths in the itinerary of each car-hailing order, and the target path is one of the optional paths.

Step 103: Determine carpooling parameters according to the first path distance and the second path distance; wherein the carpooling parameter is the difference between the first path distance and the second path distance, which is the difference between the first path distance and the second path distance. The ratio between the longest paths among the stated target paths.

Among them, the carpooling parameter represents the ratio between the path distance (ie mileage, for vehicles) saved by the carpooling path and the longest path, and the carpooling parameter represents the matching degree of the order; the carpooling parameter is the distance between the first path and the longest path. The difference between the distances of the second path and the ratio between the longest path in the target path; for example, taking two car-hailing orders as an example, the target path of the car-hailing order A is D(A ), the target path of car-hailing order B is D(B), and the car-pooling path after merging car-sharing order A and car-sharing order B is D(A+B), then the car-pooling parameters are as follows:

Among them, P is the carpooling parameter, MAX[D(A), D(B)] is the longest path (distance) in the target path; the difference between the first path distance and the second path distance is The path distance saved by carpooling; by comparing the ratio between the path distance saved by carpooling and the longest path, it is judged whether the effect of saving mileage by carpooling is obvious.

Step 104, if the carpooling parameters meet the preset value requirements, combine each car-hailing order into a target order.

Wherein, if the carpooling parameter meets the preset numerical requirements, for example, it is greater than a preset threshold, the preset threshold may be 10% or other positive numbers, and the larger the carpooling parameter is, the more meaningful the mileage saved by carpooling is; The car-hailing orders are combined into a target order, that is, a carpooling order; if the car-hailing orders are all issued by passengers, the orders will be dispatched; if there is an order issued by the driver in the car-hailing order, that is, a ride , the order is dispatched to the driver's client.

It can be understood that for users with short path distances, that is, users whose target path is not the longest path, the ratio of the saved path distance to the user's path must be greater than the P value, and the saving degree must be higher than that of the longest path. Therefore, in this embodiment of the present invention, the carpooling parameter is calculated with the longest path as a reference.

In this way, in the process of carpooling, the server not only considers the starting point and end point of the journey in the car-hailing order, but also considers the saving degree of the saved mileage relative to the longest route; if the saving degree is greater, the orders can be combined; Very small, even if the carpooling parameter is a negative value, for the user, the carpooling path is longer and takes longer, so there is no need to merge.

In the prior art, the carpooling process only considers the starting point and the ending point. There are usually more than two paths between the starting point and the ending point. Sometimes the starting point and the ending point between the two orders are relatively close, but the paths are not the same. At this time, the orders are blindly merged. It is not suitable for users, and even the total mileage will be longer after the combination. Therefore, only comparing the starting point and the ending point has certain defects.

As an example, with regard to the carpooling parameters representing the matching degree, please refer to FIG. 2 to FIG. 4 , FIG. 2 is Example 1, FIG. 3 is Example 2, and FIG. 4 is Example 3;

See Table 1 below. Table 1 is the path distance of each example, with the unit of 10 kilometers as an example;

Table 1:

As shown in Example 1 in Figure 2, if P<0, the two car-hailing orders do not match, and D(A+B) extends the mileage relative to both D(A) and D(B).

As shown in Example 2 in Figure 3, P=50%, two car-hailing orders match; as shown in Example 3 in Figure 4, P=30%, two car-hailing orders match.

In the embodiment of the present invention, the first path distance is determined by receiving car-hailing orders from at least two clients; the target path of the car-hailing orders is obtained, and the second path distance is determined; Second, the path distance is used to determine the carpooling parameters; if the carpooling parameters meet the preset value requirements, each car-hailing order is merged into a target order, and the matching degree of the orders is represented by the carpooling parameters, so as to avoid orders with a low matching degree from being merged , even resulting in a longer total mileage; the embodiment of the present invention solves the problem of limitation in the prior art that the online car-hailing platform only compares the starting point and the ending point in the process of carpooling.

Optionally, in the embodiment of the present invention, the step of obtaining the target path of the car-hailing order and determining the second path distance includes:

Determine whether there is a target path that makes the second path distance greater than the first path distance in the optional paths of each car-hailing order:

If so, determine the second path distance according to the target path;

If not, it is determined that the car-hailing order does not meet the carpooling requirements.

Among them, the itinerary of each car-hailing order may have multiple optional paths, and the target path is one of the optional paths; for example, for car-hailing order A, its optional paths include A1, A2, and A3; Vehicle order B, its optional paths include B1 and B2;

The second path distance is D(A)+D(B), the server determines whether there is at least one path A0 in the optional paths of the car-hailing order A, and whether there is at least one path B0 in the optional paths of the car-hailing order B, satisfying D(A0)+D(B0) is greater than the first path distance D(A+B).

If it exists, it is determined that the car-hailing order can be merged, and the subsequent process is performed to determine the second path distance;

Otherwise, it is determined that the car-hailing order does not meet the carpooling requirements, and the process ends.

Optionally, in this embodiment of the present invention, the step of determining the first path distance includes:

determining a carpooling route for merging each of the car-hailing orders, the carpooling route includes a starting point part and an ending part in sequence, the starting point part includes the starting point of the carpooling trip in each of the car-hailing orders; the ending point part includes the end point of the carpool trip in each said ride-hailing order;

A shortest carpool path distance among the carpool paths is determined.

Among them, the starting points of the carpooling trips of all car-hailing orders are firstly divided into a set, that is, the starting point part; then all the end points are divided into a set, which is the end-point part; for example, for car-hailing order A and car-hailing order B; According to the starting point and ending point of the car-hailing order A, and the starting point and ending point of the car-hailing order B, select one point from the starting point of A and the starting point of B as the starting point, and the other one as the successor point; then from the ending point of A and the ending point of B Select one point as the third point and the other as the end point, and calculate the plan according to the shortest path search plan of GPS navigation on the electronic map. There are several paths for carpooling:

Path 1: A starting point → B starting point → A ending point → B ending point;

Path 2: A starting point → B starting point → B ending point → A ending point;

Path 3: B starting point → A starting point → A ending point → B ending point;

Path 4: B start point → A start point → B end point → A end point;

Then filter the distance of a shortest path from the above four paths as the shortest carpooling path distance.

Optionally, in this embodiment of the present invention, the distance of the shortest carpooling path includes each of the starting points and each of the end points, and does not pass through the starting point and/or the end point repeatedly, that is, the shortest carpooling path should include each of the starting points and/or the ending points. each start point and each end point, and the entire trip does not repeat each start point or end point in sequence.

Among them, when judging whether the two rides can be matched, the time and distance are the concrete manifestations of the efficiency of one trip. By first assuming that the two trips can be combined, and calculating the shortest path, and then comparing the two trips with the separate paths of the two trips. Compare.

In the embodiment of the present invention, the first path distance is determined by receiving car-hailing orders from at least two clients; the target path of the car-hailing orders is obtained, and the second path distance is determined; Second, the path distance is used to determine the carpooling parameters; if the carpooling parameters meet the preset value requirements, each car-hailing order is merged into a target order, and the matching degree of the orders is represented by the carpooling parameters, so as to avoid orders with a low matching degree from being merged , even resulting in longer total mileage.

The order processing method provided by the embodiment of the present invention is described above on the server side, and the order processing apparatus provided by the embodiment of the present invention will be described below with reference to the accompanying drawings.

Referring to FIG. 5, an embodiment of the present invention provides an order processing apparatus, and the apparatus includes:

The order receiving module 501 is configured to receive car-hailing orders from at least two clients, and determine a first path distance, where the first path distance is the shortest carpooling path distance obtained by combining each of the car-hailing orders.

Among them, the server can preset an order dispatch cycle, and the order dispatch cycle can be in minutes or seconds; in each dispatch cycle, the received car-hailing orders are summarized, and the orders that can be carpooled are screened out.

It is understandable that the client can provide carpooling options when the user places an order, or ask the user whether to accept the carpooling; if the user actively selects the carpooling option or reports to the client to accept the carpooling, the client sends a carpooling instruction with a preset carpooling instruction to the server. ride-hailing orders.

After receiving the car-hailing order with the preset car-pooling instructions, the server determines the mergeable orders that meet the car-pooling rules, and then determines the car-pooling route after combining the orders. The car-pooling route should include the start and end points of the itinerary in each agreed order. Finally, the shortest carpool path distance of the shortest path in the carpool path is determined.

In the embodiment of the present invention, the combined car-hailing orders may be two or more.

The distance determination module 502 is configured to acquire the target path of the car-hailing order, and determine a second path distance, where the second path distance is the sum of the path distances of each of the target paths.

The server obtains the target path of each car-hailing order, and then sums the distances of the target paths of all the car-hailing orders to obtain the second path distance.

For example, if the target path of car-hailing order A is D(A) and the target path of car-hailing order B is D(B), the second path distance is D(A)+D(B).

It is understandable that there may be multiple optional paths in the itinerary of each car-hailing order, and the target path is one of the optional paths.

A parameter determination module 503, configured to determine carpooling parameters according to the first path distance and the second path distance; wherein the carpooling parameter is the difference between the first path distance and the second path distance value, the ratio of the longest path among the target paths.

Among them, the carpooling parameter represents the ratio between the path distance (ie mileage, for vehicles) saved by the carpooling path and the longest path, and the carpooling parameter represents the matching degree of the order; the carpooling parameter is the distance between the first path and the longest path. The difference between the distances of the second path and the ratio between the longest path in the target path; for example, taking two car-hailing orders as an example, the target path of the car-hailing order A is D(A ), the target path of car-hailing order B is D(B), and the car-pooling path after merging car-sharing order A and car-sharing order B is D(A+B), then the car-pooling parameters are as follows:

Among them, P is the carpooling parameter, MAX[D(A), D(B)] is the longest path (distance) in the target path; the difference between the first path distance and the second path distance is The path distance saved by carpooling; by comparing the ratio between the path distance saved by carpooling and the longest path, it is judged whether the effect of saving mileage by carpooling is obvious.

The order merging module 504 is configured to merge each car-hailing order into a target order if the car-pooling parameter meets a preset value requirement.

Wherein, if the carpooling parameter meets the preset numerical requirements, for example, it is greater than a preset threshold, the preset threshold may be 10% or other positive numbers, and the larger the carpooling parameter is, the more meaningful the mileage saved by carpooling is; The car-hailing orders are combined into a target order, that is, a carpooling order; if the car-hailing orders are all issued by passengers, the orders will be dispatched; if there is an order issued by the driver in the car-hailing order, that is, a ride , the order is dispatched to the driver's client.

It can be understood that for users with short path distances, that is, users whose target path is not the longest path, the ratio of the saved path distance to the user's path must be greater than the P value, and the saving degree must be higher than that of the longest path. Therefore, in this embodiment of the present invention, the carpooling parameter is calculated with the longest path as a reference.

In this way, in the process of carpooling, the server not only considers the starting point and end point of the journey in the car-hailing order, but also considers the saving degree of the saved mileage relative to the longest route; if the saving degree is greater, the orders can be combined; Very small, even if the carpooling parameter is a negative value, for the user, the carpooling path is longer and takes longer, so there is no need to merge.

In the prior art, the carpooling process only considers the starting point and the ending point. There are usually more than two paths between the starting point and the ending point. Sometimes the starting point and the ending point between the two orders are relatively close, but the paths are not the same. At this time, the orders are blindly merged. It is not suitable for users, and even the total mileage will be longer after the combination. Therefore, only comparing the starting point and the ending point has certain defects.

Optionally, in this embodiment of the present invention, the distance determining module 502 includes:

A judging submodule for judging whether there is a target path that makes the distance of the second path greater than the distance of the first path in the optional paths of each car-hailing order:

If so, determine the second path distance according to the target path;

If not, it is determined that the car-hailing order does not meet the carpooling requirements.

Optionally, in this embodiment of the present invention, the order receiving module 501 includes:

A route determination submodule, configured to determine a carpooling route that combines each of the car-hailing orders, the carpooling route sequentially includes a starting point part and an end-point part, and the starting point part includes the value of the carpooling trip in each of the car-hailing orders the starting point; the ending point portion includes the ending point of the carpool trip in each of the ride-hailing orders;

The distance determination submodule is used for determining the shortest carpooling route distance in the carpooling route.

Optionally, in this embodiment of the present invention, the distance of the shortest carpooling path includes each of the starting points and each of the ending points, and the starting points and/or ending points are not repeatedly passed.

Optionally, in the embodiment of the present invention, the car-hailing order carries a preset car-pooling instruction.

The apparatus for processing a taxi application provided in the embodiment of the present invention can implement each process implemented by the apparatus for processing a taxi application in the method embodiments of FIG. 1 to FIG. 4 . In order to avoid repetition, details are not repeated here.

In the embodiment of the present invention, the order receiving module 501 receives car-hailing orders from at least two clients, and determines the first path distance; the distance determining module 502 obtains the target path of the car-hailing orders, and determines the second path distance; parameter determination The module 503 determines carpooling parameters according to the first path distance and the second path distance; if the carpooling parameters meet the preset value requirements, the order merging module 504 merges each of the car-hailing orders into a target order, through The carpooling parameters represent the matching degree of the orders, so that orders with a lower matching degree are prevented from being merged, and even the total mileage is longer; the embodiment of the present invention solves the problem in the prior art that the online car-hailing platform only compares the starting point in the process of carpooling and endpoints, with limitations.

On the other hand, an embodiment of the present invention also provides an electronic device, including a memory, a processor, a bus, and a computer program stored in the memory and running on the processor, where the processor implements the above-mentioned program when the processor executes the program Steps in an order processing method.

For example, FIG. 6 shows a schematic diagram of the physical structure of an electronic device.

As shown in FIG. 6 , the electronic device may include: a processor (processor) 610, a communication interface (Communications Interface) 620, a memory (memory) 630 and a communication bus 640, wherein the processor 610, the communication interface 620, and the memory 630 pass through The communication bus 640 accomplishes the mutual communication. The processor 610 may invoke logic instructions in the memory 630 to perform the following methods:

Receive car-hailing orders from at least two clients, and determine a first path distance, where the first path distance is the shortest carpooling path distance that combines each of the car-hailing orders;

Obtain the target path of the car-hailing order, and determine a second path distance, where the second path distance is the sum of the path distances of each of the target paths;

A carpooling parameter is determined according to the first path distance and the second path distance; wherein the carpooling parameter is the difference between the first path distance and the second path distance, and the target path The ratio between the longest paths in ;

If the carpooling parameters meet the preset value requirements, each of the car-hailing orders is merged into a target order.

In addition, the above-mentioned logic instructions in the memory 630 may be implemented in the form of software functional units and may be stored in a computer-readable storage medium when sold or used as an independent product. Based on such understanding, the technical solution of the present invention can be embodied in the form of a software product in essence, or the part that contributes to the prior art or the part of the technical solution. The computer software product is stored in a storage medium, including Several instructions are used to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes: U disk, removable hard disk, Read-Only Memory (ROM, Read-Only Memory), Random Access Memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program codes .

In yet another aspect, an embodiment of the present invention also provides a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, is implemented to execute the order processing methods provided by the foregoing embodiments, for example, including:

Receive car-hailing orders from at least two clients, and determine a first path distance, where the first path distance is the shortest carpooling path distance obtained by combining each of the car-hailing orders;

Obtain the target path of the car-hailing order, and determine a second path distance, where the second path distance is the sum of the path distances of each of the target paths;

A carpooling parameter is determined according to the first path distance and the second path distance; wherein the carpooling parameter is the difference between the first path distance and the second path distance, and the target path The ratio between the longest paths in ;

If the carpooling parameters meet the preset value requirements, each of the car-hailing orders is merged into a target order.

The device embodiments described above are only illustrative, wherein the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in One place, or it can be distributed over multiple network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution in this embodiment. Those of ordinary skill in the art can understand and implement it without creative effort.

From the description of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, and certainly can also be implemented by hardware. Based on this understanding, the above-mentioned technical solutions can be embodied in the form of software products in essence or the parts that make contributions to the prior art, and the computer software products can be stored in computer-readable storage media, such as ROM/RAM, magnetic A disc, an optical disc, etc., includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform the methods described in various embodiments or some parts of the embodiments.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, but not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that it can still be The technical solutions described in the foregoing embodiments are modified, or some technical features thereof are equivalently replaced; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims (8)

1. An order processing method, wherein the method comprises: Receive car-hailing orders from at least two clients, and determine a first path distance, where the first path distance is the shortest carpooling path distance obtained by combining each of the car-hailing orders; Obtain the target path of the car-hailing order, and determine a second path distance, where the second path distance is the sum of the path distances of each of the target paths; A carpooling parameter is determined according to the first path distance and the second path distance; wherein the carpooling parameter is the difference between the first path distance and the second path distance, and the target path The ratio between the longest paths in ; If the carpooling parameters meet the preset value requirements, combine each car-hailing order into a target order; The step of obtaining the target path of the car-hailing order and determining the second path distance includes: Determine whether there is a target path that makes the second path distance greater than the first path distance in the optional paths of each car-hailing order: If so, determine the second path distance according to the target path; If not, it is determined that the car-hailing order does not meet the carpooling requirements. 2. The order processing method according to claim 1, wherein the step of determining the first path distance comprises: determining a carpooling route for merging each of the car-hailing orders, the carpooling route including a starting point part and an ending part in turn, the starting point part including the starting point of the carpooling trip in each of the car-hailing orders; the ending point part including the end point of the carpool trip in each said ride-hailing order; A shortest carpool path distance among the carpool paths is determined. 3 . The order processing method according to claim 2 , wherein the shortest carpooling path distance includes each of the starting points and each of the ending points, and does not pass through the starting points and/or ending points repeatedly. 4 . 4 . The order processing method according to claim 1 , wherein the car-hailing order carries a preset car-pooling instruction. 5 . 5. An order processing device, characterized in that the device comprises: an order receiving module, configured to receive car-hailing orders from at least two clients, and determine a first path distance, where the first path distance is the shortest carpooling path distance that combines each of the car-hailing orders; A distance determination module, configured to obtain the target path of the car-hailing order, and determine a second path distance, where the second path distance is the sum of the path distances of each of the target paths; A parameter determination module, configured to determine carpooling parameters according to the first path distance and the second path distance; wherein the carpooling parameter is the difference between the first path distance and the second path distance , and the ratio between the longest path in the target path; an order merging module, configured to merge each of the car-hailing orders into a target order if the car-sharing parameters meet the preset value requirements; The distance determination module includes: A judging submodule for judging whether there is a target path that makes the distance of the second path greater than the distance of the first path in the optional paths of each car-hailing order: If so, determine the second path distance according to the target path; If not, it is determined that the car-hailing order does not meet the carpooling requirements. 6. The order processing device according to claim 5, wherein the order receiving module comprises: A route determination sub-module, configured to determine a carpooling route that combines each of the car-hailing orders, the carpooling route includes a starting point part and an ending part in turn, and the starting point part includes the carpooling itinerary in each of the car-hailing orders. the starting point; the ending point portion includes the ending point of the carpool trip in each of the ride-hailing orders; The distance determination submodule is used for determining the shortest carpooling route distance in the carpooling route. 7. An electronic device, comprising a processor, a memory, and a computer program stored on the memory and running on the processor, wherein the computer program is executed by the processor to achieve as claimed in the right Steps of the order processing method of any of claims 1 to 4. 8. A computer-readable storage medium, wherein a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the order according to any one of claims 1 to 4 is realized The steps of the processing method.

Images