A processing method, device, equipment and medium for trip matching

Abstract

The present invention provides a processing method for trip matching, including: obtaining the primary trip plan data of a driver; obtaining the secondary trip plan set data; inputting the primary trip plan data and the secondary trip plan data as parameters into a server to obtain matching degree related factors and determining the first matching set data; obtaining the overall matching degree data of the secondary trip plan data in the secondary trip plan set data and the primary trip plan data according to the matching degree related factors and the first matching set data; sorting the secondary trip plan data according to the overall matching degree data and aggregating the sorted secondary trip plan data to obtain the second matching set data; obtaining the target matching set according to the second matching set data; and pushing the target matching set to the driver. Through the processing method for trip matching disclosed by the present invention, the carpooling efficiency can be improved and the user experience can be enhanced.

Description

Technical Field

[0001] The present invention relates to the technical field of transportation, and in particular to a method, device, equipment and medium for processing trip matching. Background Art

[0002] A carpooling order refers to an order in which the driving route and direction of a driver are roughly the same as those of a passenger. Since multiple passengers may ride in a carpool, during the order-taking process of a carpool driver, the route of a new passenger may conflict with the route of a passenger who has already successfully shared the ride, resulting in the driver taking a detour and increasing the driving time. Thus, to a certain extent, the efficiency of carpooling is low, and the user experience is affected. Summary of the Invention

[0003] In view of the above-mentioned disadvantages of the prior art, the purpose of the present invention is to provide a method, device, equipment and medium for processing trip matching, which can improve the carpooling efficiency and the user experience.

[0004] To achieve the above object and other related objects, the present invention provides a method for processing trip matching, including:

[0005] Obtain the main trip plan data of the driver;

[0006] Obtain the secondary trip plan set data, where the secondary trip plan set data includes the secondary trip plan data of at least one passenger;

[0007] Take the main trip plan data and the secondary trip plan data as parameters, input them into the server, obtain the matching degree related factors, and determine the first matching set data;

[0008] According to the matching degree related factors and the first matching set data, obtain the overall matching degree data between the secondary trip plan data in the secondary trip plan set data and the main trip plan data;

[0009] Sort the secondary trip plan data according to the overall matching degree data, and set the sorted secondary trip plan data to obtain the second matching set data;

[0010] According to the second matching set data, obtain the target matching set;

[0011] Push the target matching set to the driver.

[0012] In an embodiment of the present invention, the main trip plan data includes the driver's starting point, the driver's ending point, the preset number of passengers to be carried, and the preset departure time.

[0013] In an embodiment of the present invention, the secondary trip plan data includes the passenger's starting point, the passenger's ending point, the number of passengers, the passenger's travel time, and the ratio of the number of passengers.

[0014] In an embodiment of the present invention, the step of inputting the primary trip plan data and the secondary trip plan data as parameters into the server to obtain a matching degree related factor and determining the first matching set of data includes:

[0015] Input the primary trip plan data and the secondary trip plan data as parameters into the server to obtain the matching degree related factor;

[0016] Preset a threshold factor, and determine whether the matching degree related factor is greater than the threshold factor. If it is greater than the threshold factor, retain the corresponding secondary trip plan data; if it is not greater than the threshold factor, eliminate the corresponding secondary trip plan data;

[0017] Aggregate the retained secondary trip plan data to obtain the first matching set of data.

[0018] In an embodiment of the present invention, the overall matching degree data c is expressed as:

[0019] where n represents the category of the matching degree related factor,

[0020] represents the matching degree related factor between the secondary trip plan data of the jth passenger and the primary trip plan data,

[0021] S i represents the dynamic weight of the ith category of the matching degree related factor,

[0022] k i represents the constant coefficient of the dynamic change of the ith category of the matching degree related factor,

[0023] W i represents the inherent weight of the ith category of the matching degree related factor.

[0024] In an embodiment of the present invention, the step of obtaining the target matching set according to the second matching set of data includes:

[0025] According to the highest overall matching degree data in the second matching set of data, obtain the number of passengers in the corresponding secondary trip plan data, which is characterized as the priority plan data;

[0026] Determine whether the number of passengers in the priority plan data is less than the number of passengers in the primary trip plan data;

[0027] When the number of passengers in the priority plan data is less than the number of passengers in the main itinerary plan data, merge the priority plan data with the main itinerary plan data to obtain the intermediate plan data;

[0028] Use the secondary itinerary plan data excluding the priority plan data and the intermediate plan data as parameters, input them into the server, and perform repeated calculations until the sum of the number of passengers in the obtained secondary itinerary plan data is equal to the number of passengers in the main itinerary plan data. Then, add the corresponding secondary itinerary plan data to the target matching set;

[0029] When the number of passengers in the priority plan data is equal to the number of passengers in the main itinerary plan data, add the priority plan data to the target matching set.

[0030] In an embodiment of the present invention, the target matching set includes the secondary itinerary plan data of at least one passenger.

[0031] The present invention also provides a processing device for itinerary matching, including:

[0032] A main itinerary acquisition module for acquiring the main itinerary plan data of the driver;

[0033] A secondary itinerary acquisition module for acquiring secondary itinerary plan set data, where the secondary itinerary plan set data includes the secondary itinerary plan data of at least one passenger;

[0034] A first matching set acquisition module for using the main itinerary plan data and the secondary itinerary plan data as parameters, inputting them into the server, obtaining matching degree related factors, and determining first matching set data;

[0035] A matching degree acquisition module for obtaining the overall matching degree data between the secondary itinerary plan data in the secondary itinerary plan set data and the main itinerary plan data according to the matching degree related factors and the first matching set data;

[0036] A second matching set acquisition module for sorting the secondary itinerary plan data according to the overall matching degree data and aggregating the sorted secondary itinerary plan data to obtain second matching set data;

[0037] A target matching set combination module for obtaining a target matching set according to the second matching set data; and

[0038] A push module for pushing the target matching set to the driver, where the target matching set includes the secondary itinerary plan data of at least one passenger.

[0039] The present invention also provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the steps of the processing method for trip matching are implemented.

[0040] The present invention also provides a computer-readable storage medium storing a computer program, and when the computer program is executed by a processor, the steps of the processing method for trip matching are implemented.

[0041] As described above, the present invention provides a processing method, device, equipment, and medium for trip matching. By introducing more comprehensive matching degree-related factors, calculating the overall matching degree based on the matching degree-related factors, considering the relationship between the number of passengers in the driver's driving set and the number of passengers in the passenger's trip plan, and considering the relationship between the passengers who have already been matched and those waiting to be matched, a target matching set is obtained, and passengers are recommended to the driver according to the target matching set. The trip plans of the passengers who have already been successfully matched are merged into the driver's trip plan as a new trip plan, thus ensuring the rights and interests of all passengers in the car and avoiding situations such as detours and fuel consumption. At the same time, the experience of passengers taking the ride is also considered, reducing the possibility of sharing the ride with strangers. When the number of passengers with the highest overall matching degree is equal to the number of passengers the driver can take, the ride plan with the highest overall matching degree is pushed to the user. The present invention considers multiple scenarios and multiple factors, simplifies the carpooling process, improves the carpooling efficiency, and enhances the user experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present invention, and those of ordinary skill in the art can obtain other drawings without creative efforts based on these drawings.

[0043] Figure 1 It shows a flowchart of a processing method for trip matching according to the present invention.

[0044] Figure 2 It shows as Figure 1 a flowchart of a specific implementation manner of step S30 in

[0045] Figure 3 It shows as Figure 1 a flowchart of a specific implementation manner of step S60 in

[0046] Figure 4 It shows a structural diagram of a processing device for trip matching according to the present invention.

[0047] Figure 5It shows a schematic structural diagram of a computer device in an embodiment of the present invention.

[0048] Element label description:

[0049] 10. Main trip acquisition module; 20. Secondary trip acquisition module; 30. First matching set acquisition module; 40. Matching degree acquisition module; 50. Second matching set acquisition module; 60. Target matching subset module; 70. Push module. Detailed implementation manners

[0050] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all 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 belong to the scope of protection of the present invention.

[0051] Please refer to Figures 1-5 . It should be noted that the illustrations provided in this embodiment only schematically illustrate the basic concept of the present invention. Therefore, only the components related to the present invention are shown in the drawings, rather than being drawn according to the number, shape and size of the components in actual implementation. The types, quantities and proportions of the components in actual implementation can be arbitrarily changed, and the component layout type may also be more complex.

[0052] Please refer to Figure 1 as shown in Figure 1 which is a flow schematic diagram of a trip matching processing method provided by an embodiment of the present invention, including the following steps:

[0053] Step S10: Obtain the main trip plan data of the driver.

[0054] In an embodiment of the present invention, when performing step S10, that is, obtaining the main trip plan data of the driver. Among them, the main trip plan data may include the driver's starting point, the driver's ending point, the preset number of passengers, and the preset departure time, etc. The driver's starting point represents the starting position where the driver departs. The driver's ending point represents the final position where the driver arrives. The preset number of passengers represents the number of passengers the driver is prepared to carry. The preset departure time represents the specific departure time of the driver.

[0055] Step S20: Obtain the secondary trip plan set data, and the secondary trip plan set data includes the secondary trip plan data of multiple passengers.

[0056] In an embodiment of the present invention, when step S20 is performed, that is, the secondary trip plan set data is obtained. Among them, since each passenger has different secondary trip plan data, the secondary trip plan data of multiple passengers can be obtained. The secondary trip plan data includes the passenger starting point, the passenger ending point, the number of passengers in the vehicle, the passenger travel time, and the ratio of the number of passengers in the vehicle, etc. The passenger starting point represents the starting position where the passenger departs. The passenger ending point represents the final position where the passenger arrives. The number of passengers in the vehicle represents the number of passengers in a single secondary trip plan data. The ratio of the number of passengers in the vehicle represents the ratio of the number of passengers in the vehicle to the preset number of passengers in the vehicle.

[0057] Step S30: Input the primary trip plan data and the secondary trip plan data as parameters into the server to obtain the matching degree related factors and determine the first matching set data.

[0058] Please refer to Figure 2 As shown, in an embodiment of the present invention, when step S30 is executed, that is, the primary trip plan data and the secondary trip plan data are input into the server as parameters to obtain the matching degree related factors and determine the first matching set data. Among them, the matching degree related factors include the time difference, the starting point distance difference, the ending point distance difference, the straight line angle, the distance ratio before and after carpooling, and the route similarity. The time difference represents the time difference between the preset travel time and the passenger travel time. The starting point distance difference represents the distance difference between the driver's starting point and the passenger's starting point. The ending point distance difference represents the distance difference between the driver's ending point and the passenger's ending point. The straight line angle represents the angle between the straight line where the driver's driving direction is located and the straight line where the passenger's driving direction is located. The distance ratio before and after carpooling represents the ratio of the distance of the driver's actual driving route after carpooling to the distance of the driver's driving route before carpooling. The route similarity represents the similarity between the driver's driving route and the passenger's driving route. In this embodiment, the time difference can be unaffected within half an hour, and when the time difference exceeds two hours, it can indicate a matching failure, and the corresponding secondary trip plan data needs to be excluded. At the same time, if the number of passengers in the vehicle is greater than the preset number of passengers in the vehicle, it also indicates a matching failure, and the corresponding secondary trip plan data needs to be excluded. The calculation methods of the route similarity can include the pre-similarity method, the Euclidean distance method, the Mahalanobis distance method, the Hamming distance method, and the Manhattan distance method, etc. Specifically, the sub-steps of step S30 can include:

[0059] Step S31: Input the primary trip plan data and the secondary trip plan data as parameters into the server to obtain the matching degree related factors.

[0060] In an embodiment of the present invention, when step S31 is executed, it is necessary to calculate the matching degree related factors between the main itinerary plan data and each sub-itinerary plan data. The driving route of the driver can be obtained according to the driver's starting point and ending point in the main itinerary plan data, and the driving route of the passenger can be obtained according to the passenger's starting point and ending point in the sub-itinerary plan data. Thus, the first related factor can be obtained according to the driving route of the driver and the driving route of the passenger. At the same time, the second related factor can also be obtained according to the preset travel time in the main itinerary plan data and the passenger travel time in the sub-itinerary plan data. The third related factor can also be obtained according to the preset number of passengers in the main itinerary plan data and the number of passengers in the sub-itinerary plan data. Thus, the first related factor, the second related factor, the third related factor, etc. can be processed. For example, they can be aggregated to obtain the corresponding matching degree related factors.

[0061] Step S32: Preset a threshold factor, and determine whether the matching degree related factor is greater than the threshold factor. If it is greater than the threshold factor, the corresponding sub-itinerary plan data is retained; if it is not greater than the threshold factor, the corresponding sub-itinerary plan data is excluded.

[0062] Step S33: Aggregate the retained sub-itinerary plan data to obtain the first matching set data.

[0063] In an embodiment of the present invention, when steps S32 and S33 are executed, first, a threshold factor can be preset, and then it can be determined whether the matching degree related factor is greater than the threshold factor. When the matching degree related factor is greater than the threshold factor, it means that the sub-itinerary plan data corresponding to the matching degree related factor is associated with the main itinerary plan data. At this time, there is a possibility of successful matching between the sub-itinerary plan data and the main itinerary plan data. At this time, the sub-itinerary plan data of the passenger can be retained. When the matching degree related factor is not greater than the threshold factor, it means that the sub-itinerary plan data corresponding to the matching degree related factor is not related to the main itinerary plan data. At this time, there is no possibility of successful matching between the sub-itinerary plan data and the main itinerary plan data. For example, if the time difference exceeds two hours, it can indicate a failed match, or if the number of passengers is greater than the preset number of passengers, it also indicates a failed match. At this time, the sub-itinerary plan data of the passenger can be excluded from the sub-itinerary plan set data. Thus, the sub-itinerary plan data of the retained passengers can be aggregated to obtain the first matching set data.

[0064] Step S40: Obtain the overall matching degree data c between the sub-itinerary plan data and the main itinerary plan data according to the matching degree related factor and the first matching set data, which is expressed as:

[0065] where n represents the category of the matching degree related factor,

[0066] Represents the matching degree correlation factor between the secondary trip plan data of the j-th passenger and the primary trip plan data of the driver.

[0067] S i Represents the dynamic weight of the i-th type of matching degree correlation factor.

[0068] k i Represents the constant coefficient of the dynamic change of the i-th type of matching degree correlation factor.

[0069] W i Represents the inherent weight of the i-th type of matching degree correlation factor.

[0070] In an embodiment of the present invention, when step S40 is executed, that is, according to the matching degree correlation factor and the first matching set data, the overall matching degree data of the secondary trip plan data and the primary trip plan data is obtained. Since the matching degree correlation factor can only judge the association between the primary trip plan data of the driver and the secondary trip plan data of multiple passengers, for the actual situation, when the total driving distance of the driver is much greater than the riding distance of the passenger, but the riding route of the passenger and the driving route of the driver are on the same road, for example, the total driving distance of the driver is 100 km and the riding distance of the passenger is 1 km, at this time, the calculated matching degree correlation factor is relatively high, and the secondary trip plan data of this passenger will also be recommended to the driver in the later stage, so there are certain problems. In order to improve the overall recommendation accuracy, it is necessary to recalculate the secondary trip plan data of the passengers in the first matching set data according to the matching degree correlation factor and the first matching set data, so as to obtain the corresponding overall matching degree data.

[0071] Step S50: Sort the secondary trip plan data according to the overall matching degree data, and set the sorted secondary trip plan data to obtain the second matching set data.

[0072] In an embodiment of the present invention, when the overall matching degree data is obtained, the corresponding secondary trip plan data can be sorted according to the level of the overall matching degree data. At this time, the overall matching degree data will comprehensively consider the time difference, the starting point distance difference, the ending point distance difference, the straight line angle, the distance ratio before and after sharing a ride, and the route similarity. Therefore, the sorted secondary trip plan data can be set to obtain the second matching set data.

[0073] Step S60: Obtain the target matching set according to the second matching set data.

[0074] Please refer to Figure 3 As shown, in an embodiment of the present invention, when step S60 is performed, that is, the target matching set is obtained according to the second matching set data. Specifically, the sub-steps of step S60 may include:

[0075] Step S61: Obtain the number of passengers in the corresponding secondary itinerary plan data according to the highest overall matching degree data in the second matching set data, which is characterized as the priority plan data.

[0076] Step S62: Determine whether the number of passengers in the priority plan data is less than the number of passengers in the primary itinerary plan data.

[0077] Step S63: When the number of passengers in the priority plan data is less than the number of passengers in the primary itinerary plan data, merge the priority plan data and the primary itinerary plan data to obtain the intermediate plan data.

[0078] Step S64: Use the secondary itinerary plan data after excluding the priority plan data and the intermediate plan data as parameters and input them into the server for repeated calculation until the sum of the numbers of passengers in the obtained secondary itinerary plan data is equal to the number of passengers in the primary itinerary plan data. Then add the corresponding secondary itinerary plan data to the target matching set.

[0079] Step S65: When the number of passengers in the priority plan data is equal to the number of passengers in the primary itinerary plan data, add the priority plan data to the target matching set.

[0080] In an embodiment of the present invention, when performing step S60, since the overall matching degree data in the second matching set data is sorted in descending or ascending order, the highest overall matching degree data can be selected to obtain the corresponding secondary itinerary plan data. At this time, the corresponding passenger of this secondary itinerary plan data can be the optimal hitchhiking passenger. Since the number of passengers in the secondary itinerary plan data of this passenger is uncertain, there may be only one person, or there may be two, three, etc. And the number of passengers in the driver's primary itinerary plan data is determined. Therefore, it is necessary to determine whether the number of passengers in the secondary itinerary plan data of this passenger is less than the number of passengers in the primary itinerary plan data so that the driver can successfully receive the order.

[0081] Step S70: Push the target matching set to the driver, where the target matching set includes the secondary itinerary plan data of at least one passenger.

[0082] It can be seen that in the above solution, by introducing more comprehensive matching-related factors, the overall matching degree is calculated based on the matching-related factors. The relationship between the number of passengers in the driver's driving set and the number of passengers in the passenger's driving plan is considered, and the relationship between the passengers who have already been paired and those waiting to be paired is considered to obtain the target matching set. Passengers are recommended to the driver according to the target matching set. The travel plans of the passengers who have already been successfully paired are merged into the driver's travel plan as the new travel plan, thus ensuring the rights and interests of all passengers in the car and avoiding situations such as detours and fuel consumption. At the same time, the driving experience of passengers is also considered, reducing the possibility of sharing a ride with strangers. When the number of passengers with the highest overall matching degree is equal to the number of passengers the driver can take, the travel plan with the highest overall matching degree is pushed to the user. The present invention considers multiple scenarios and multiple factors, simplifies the carpooling process, improves the carpooling efficiency, and enhances the user experience.

[0083] It should be understood that the magnitudes of the sequence numbers of the steps in the above embodiments do not mean the order of execution. The order of execution of each process should be determined according to its function and internal logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.

[0084] Please refer to Figure 4 As shown, the present invention also provides a processing device for trip matching, which corresponds one-to-one with the trip matching processing method in the above embodiments. The processing device for trip matching may include a main trip acquisition module 10, a secondary trip acquisition module 20, a first matching set acquisition module 30, a matching degree acquisition module 40, a second matching set acquisition module 50, a target matching set module 60, and a push module 70. The detailed description of each functional module is as follows:

[0085] The main trip acquisition module 10 may be configured to acquire the main trip plan data of the driver. The secondary trip acquisition module 20 may be configured to acquire the secondary trip plan set data, and the secondary trip plan set data includes the secondary trip plan data of multiple passengers. The first matching set acquisition module 30 may be configured to input the main trip plan data and the secondary trip plan data as parameters into the server to obtain the matching-related factors and determine the first matching set data. The matching degree acquisition module 40 may be configured to obtain the overall matching degree data of the secondary trip plan data and the main trip plan data according to the matching-related factors and the first matching set data. The second matching set acquisition module 50 may be configured to sort the secondary trip plan data according to the overall matching degree data and set the sorted secondary trip plan data to obtain the second matching set data. The target matching set module 60 may be configured to obtain the target matching set according to the second matching set data. The push module 70 may be configured to push the target matching set to the driver, where the target matching set includes the secondary trip plan data of at least one passenger.

[0086] In an embodiment of the present invention, specifically, the main trip acquisition module 10 can be used to acquire the main trip plan data of the driver. The main trip plan data may include the driver's starting point, the driver's ending point, the preset number of passengers to be carried, and the preset departure time, etc. The driver's starting point represents the starting position where the driver departs. The driver's ending point represents the final position where the driver arrives. The preset number of passengers to be carried represents the number of passengers the driver is prepared to carry. The preset departure time represents the specific departure time of the driver.

[0087] In an embodiment of the present invention, specifically, the secondary trip acquisition module 20 can be used to acquire the secondary trip plan set data, and the secondary trip plan set data includes the secondary trip plan data of multiple passengers. Among them, since each passenger has different secondary trip plan data, the secondary trip plan data of multiple passengers can be acquired. The secondary trip plan data includes the passenger's starting point, the passenger's ending point, the number of passengers in the ride, the passenger's departure time, and the ratio of the number of passengers in the ride, etc. The passenger's starting point represents the starting position where the passenger departs. The passenger's ending point represents the final position where the passenger arrives. The number of passengers in the ride represents the number of passengers in a single secondary trip plan data. The ratio of the number of passengers in the ride represents the ratio of the number of passengers in the ride to the preset number of passengers to be carried.

[0088] In an embodiment of the present invention, specifically, the first matching set acquisition module 30 can be used to input the main trip plan data and the secondary trip plan data as parameters into the server to obtain matching degree related factors and determine the first matching set data. Among them, the matching degree related factors include time difference, starting point distance difference, ending point distance difference, straight line angle, distance ratio before and after carpooling, and route similarity. The time difference represents the time difference between the preset departure time and the passenger's departure time. The starting point distance difference represents the distance difference between the driver's starting point and the passenger's starting point. The ending point distance difference represents the distance difference between the driver's ending point and the passenger's ending point. The straight line angle represents the angle between the straight line where the driver's driving direction is located and the straight line where the passenger's driving direction is located. The distance ratio before and after carpooling represents the ratio of the distance of the driver's actual driving route after carpooling to the distance of the driver's driving route before carpooling. The route similarity represents the similarity between the driver's driving route and the passenger's driving route.

[0089] In an embodiment of the present invention, specifically, the matching degree acquisition module 40 can be used to obtain the overall matching degree data of the secondary itinerary plan data and the primary itinerary plan data according to the matching degree related factors and the first matching set data. Since the matching degree related factors can only judge the association between the driver's primary itinerary plan data and the secondary itinerary plan data of multiple passengers, in the actual situation, when the total driving distance of the driver is much greater than the riding distance of the passenger, but the riding route of the passenger and the driving route of the driver are on the same road, for example, the total driving distance of the driver is 100 km and the riding distance of the passenger is 1 km, at this time, the calculated matching degree related factor is relatively high, and the secondary itinerary plan data of this passenger will also be recommended to the driver in the later stage. Therefore, there are certain problems. In order to improve the overall recommendation accuracy, it is necessary to recalculate the secondary itinerary plan data of the passengers in the first matching set data according to the matching degree related factors and the first matching set data, so as to obtain the corresponding overall matching degree data.

[0090] In an embodiment of the present invention, specifically, the second matching set acquisition module 50 can be used to sort the secondary itinerary plan data according to the overall matching degree data, and aggregate the sorted secondary itinerary plan data to obtain the second matching set data. After obtaining the overall matching degree data, the corresponding secondary itinerary plan data can be sorted according to the level of the overall matching degree data. At this time, the overall matching degree data will comprehensively consider the time difference, the starting point distance difference, the ending point distance difference, the straight line angle, the distance ratio before and after sharing a ride, and the route similarity. Therefore, the sorted secondary itinerary plan data can be aggregated to obtain the second matching set data.

[0091] In an embodiment of the present invention, specifically, the target matching set module 60 can be used to obtain the target matching set according to the second matching set data. Since the overall matching degree data in the second matching set data is sorted from high to low or from low to high, the highest overall matching degree data can be selected to obtain the corresponding secondary itinerary plan data. At this time, the passenger corresponding to this secondary itinerary plan data can be the optimal hitchhiking passenger. Since the number of passengers in the secondary itinerary plan data of this passenger is uncertain, there may be only one person, or there may be two, three, etc. And the number of passengers in the driver's primary itinerary plan data is determined. Therefore, it is necessary to judge whether the number of passengers in the secondary itinerary plan data of this passenger is less than the number of passengers in the primary itinerary plan data, so that the driver can successfully receive the order.

[0092] For the specific limitations of the processing device for trip matching, reference can be made to the limitations of the processing method for trip matching in the above text, which will not be elaborated here. Each module in the above-mentioned processing device for trip matching can be implemented in whole or in part by software, hardware, and their combinations. The above-mentioned modules can be embedded in the processor of the computer device in the form of hardware or independent of it, or stored in the memory of the computer device in the form of software, so as to facilitate the processor to call and execute the operations corresponding to the above-mentioned modules.

[0093] Please refer to Figure 5 As shown, the present invention also provides a computer device, which includes a processor, a memory, a network interface, and a database connected by a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile and / or volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The network interface of the computer device is used to communicate with an external client through a network connection. When the computer program is executed by the processor, it realizes the functions or steps of a processing method for trip matching.

[0094] In an embodiment of the present invention, the computer device may include a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the computer program, the following steps are realized:

[0095] Obtain the main trip plan data of the driver.

[0096] Obtain the secondary trip plan set data, and the secondary trip plan set data includes the secondary trip plan data of multiple passengers.

[0097] Take the main trip plan data and the secondary trip plan data as parameters and input them into the server to obtain matching degree related factors and determine the first matching set data.

[0098] According to the matching degree related factors and the first matching set data, obtain the overall matching degree data of the secondary trip plan data and the main trip plan data.

[0099] Sort the secondary trip plan data according to the overall matching degree data, and aggregate the sorted secondary trip plan data to obtain the second matching set data.

[0100] Obtain the target matching set according to the second matching set data.

[0101] Push the target matching set to the driver, where the target matching set includes the secondary trip plan data of at least one passenger.

[0102] It should be noted that for the functions or steps that can be achieved by the above computer-readable storage medium or computer device, reference can be made to the relevant descriptions on the server side and the client side in the foregoing method embodiments. To avoid repetition, they will not be described one by one here.

[0103] Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be completed by instructing relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above various methods. Among them, any reference to a memory, storage, database, or other medium used in the various embodiments provided in the present application can include non-volatile and / or volatile memories. Non-volatile memories can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memories can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0104] Those skilled in the art can clearly understand that for the convenience and brevity of description, only the above division of each functional unit and module is used as an example. In practical applications, the above functions can be allocated to different functional units and modules according to needs, that is, the internal structure of the device is divided into different functional units or modules to complete all or part of the functions described above.

[0105] In the description of this specification, the descriptions with reference to terms such as "this embodiment", "example", "specific example", etc. mean that the specific features, structures, materials, or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials, or characteristics described can be combined in a suitable manner in any one or more embodiments or examples.

[0106] The embodiments of the present invention disclosed above are only used to help illustrate the present invention. The embodiments do not describe all the details in detail, nor do they limit the invention to the specific embodiments described. Obviously, many modifications and variations can be made according to the content of this specification. These embodiments are selected and specifically described in this specification to better explain the principles and practical applications of the present invention, so that those skilled in the art can well understand and utilize the present invention. The present invention is only limited by the claims and their full scope and equivalents.

Claims

1. A method for processing trip matching, characterized in that, Including: Obtain the driver's main trip plan data; Obtain the secondary trip plan set data, where the secondary trip plan set data includes the secondary trip plan data of at least one passenger; Use the main trip plan data and the secondary trip plan data as parameters and input them into the server to obtain a matching degree related factor and determine the first matching set data; According to the matching degree related factor and the first matching set data, obtain the overall matching degree data between the secondary trip plan data in the secondary trip plan set data and the main trip plan data; Sort the secondary trip plan data according to the overall matching degree data and aggregate the sorted secondary trip plan data to obtain the second matching set data; According to the highest overall matching degree data in the second matching set data, obtain the number of passengers in the corresponding secondary trip plan data, which is characterized as the priority plan data; Judge whether the number of passengers in the priority plan data is less than the number of passengers in the main trip plan data; When the number of passengers in the priority plan data is less than the number of passengers in the main trip plan data, merge the priority plan data and the main trip plan data to obtain intermediate plan data; use the secondary trip plan data after excluding the priority plan data and the intermediate plan data as parameters and input them into the server for repeated calculation until the sum of the number of passengers in the obtained secondary trip plan data is equal to the number of passengers in the main trip plan data, and add the corresponding secondary trip plan data to the target matching set; When the number of passengers in the priority plan data is equal to the number of passengers in the main trip plan data, add the priority plan data to the target matching set; Push the target matching set to the driver.

2. The processing method for travel matching according to claim 1, wherein The main trip plan data includes the driver's starting point, the driver's ending point, the preset number of passengers, and the preset travel time.

3. The processing method for stroke matching according to claim 1, characterized in that The secondary trip plan data includes the passenger's starting point, the passenger's ending point, the number of passengers of the passenger, the passenger's travel time, and the passenger number ratio.

4. The processing method for travel matching according to claim 1, characterized in that The step of using the main trip plan data and the secondary trip plan data as parameters and inputting them into the server to obtain a matching degree related factor and determine the first matching set data includes: Use the main trip plan data and the secondary trip plan data as parameters and input them into the server to obtain the matching degree related factor; Preset a threshold factor and judge whether the matching degree related factor is greater than the threshold factor: if it is greater than the threshold factor, retain the corresponding secondary trip plan data; if it is not greater than the threshold factor, exclude the corresponding secondary trip plan data; Aggregate the retained secondary trip plan data to obtain the first matching set data.

5. The processing method for stroke matching according to claim 1, wherein The overall matching degree data , is expressed as: ; Among them, represents the category of the matching degree related factor; Indicates the correlation factor between the sub-trip plan data of the th passenger and the main trip plan data; Indicating the dynamic weight of the category matching degree related factor, , ; Indicates the constant coefficient for the dynamic change of the class matching degree related factor; Indicates the intrinsic weight of the class matching degree related factor.

6. The method for processing stroke matching according to claim 1, wherein The target matching set includes the secondary trip plan data of at least one passenger.

7. A processing device for trip matching, characterized in that, Including: A main trip acquisition module for obtaining the driver's main trip plan data; A secondary trip acquisition module for obtaining the secondary trip plan set data, where the secondary trip plan set data includes the secondary trip plan data of at least one passenger; The first matching set acquisition module is configured to input the main itinerary plan data and the secondary itinerary plan data as parameters into a server, obtain matching degree related factors, and determine first matching set data; The matching degree acquisition module is configured to obtain the overall matching degree data between the secondary itinerary plan data in the secondary itinerary plan set data and the main itinerary plan data according to the matching degree related factors and the first matching set data; The second matching set acquisition module is configured to sort the secondary itinerary plan data according to the overall matching degree data, and collect the sorted secondary itinerary plan data to obtain second matching set data; The target matching set module is configured to obtain the number of passengers in the corresponding secondary itinerary plan data according to the highest overall matching degree data in the second matching set data, which is characterized as priority plan data; determine whether the number of passengers in the priority plan data is less than the number of passengers in the main itinerary plan data; when the number of passengers in the priority plan data is less than the number of passengers in the main itinerary plan data, merge the priority plan data and the main itinerary plan data to obtain intermediate plan data; input the secondary itinerary plan data excluding the priority plan data and the intermediate plan data into the server, and repeat the calculation until the sum of the number of passengers in the obtained secondary itinerary plan data is equal to the number of passengers in the main itinerary plan data, and add the corresponding secondary itinerary plan data to the target matching set; when the number of passengers in the priority plan data is equal to the number of passengers in the main itinerary plan data, add the priority plan data to the target matching set; and The push module is configured to push the target matching set to the driver, where the target matching set includes the secondary itinerary plan data of at least one passenger.

8. A computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the steps of the itinerary matching processing method according to any one of claims 1 to 6.

9. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by the processor, it implements the steps of the itinerary matching processing method according to any one of claims 1 to 6.

Images