Carpooling order processing method

Abstract

The invention discloses a car-pooling order processing method, which comprises the following steps: receiving a first car-pooling order sent by a first passenger, continuously matching and receiving a new car-pooling order in the process of carrying out the first car-pooling order, and repeating the steps until a car stops receiving the order; in the driving process of the vehicle completing the car-pooling order, after any car-pooling order is completed, the vehicle restarts order receiving, matching and receiving of the next car-pooling order, and the steps are repeated until the order receiving is stopped. According to the invention, continuous car sharing is realized, the empty seat rate and the empty driving rate of the car are greatly reduced, the riding cost of the passenger is reduced, the income of the driver is increased, the willingness of the passenger to take the car is increased, a larger operating car market can be generated, the income of an operating car platform is increased, the order matching speed is accelerated, and the virtuous cycle of the car sharing industry is realized.

Description

Technical Field

[0001] The present invention belongs to the technical field of intelligent transportation technology, and specifically relates to a method for processing a carpooling order. Background Art

[0002] With the development of the Internet and smart terminal technology, people often use taxi apps to meet their needs for convenient travel. In order to make better use of the empty seats in the vehicle and reduce travel costs, more and more passengers choose to carpool. Carpooling is an economical and environmentally friendly way of travel, which is to share the operating vehicle (such as online car-hailing) with other passengers on the same route to share the fare and increase the driver's commission. However, the existing carpooling scheme generally combines two to three orders, that is, after the driver receives the first carpooling order, he receives the second carpooling order according to the degree of convenience, and then receives the third carpooling order according to the number of empty seats and the degree of convenience. When all three orders are completed, a new carpooling order is placed. However, in reality, when all orders are not fully completed, one of the carpooling orders is completed, and an empty seat appears. However, only when all orders are completed can the driver receive a new order. From the appearance of an empty seat to the driver receiving a new carpooling order, the passenger can be divided into two stages: the first stage is from the appearance of an empty seat to the completion of all orders, during which the vehicle has an empty seat, and the second stage is from the end of the order to the driver's waiting for orders (empty running without orders) and the process of arriving at the designated location to pick up passengers after receiving the order. This stage is the empty vehicle. A number of studies have shown that the proportion of empty driving distance of operating vehicles accounts for 45% of the total driving distance, close to 50%. For every two operating vehicles on the road, one is empty. Therefore, the existing method for processing carpooling orders still cannot make optimal use of operating vehicle resources. If the driver can accept orders continuously, he can seamlessly pick up and drop off passengers, reduce the proportion of empty driving, and make timely use of the vehicle's empty seats to benefit more passengers. To this end, the present invention provides a method for processing carpooling orders that can make full use of the empty seats of operating vehicles in a timely manner and reduce the proportion of empty driving of operating vehicles. Summary of the invention

[0003] The purpose of the present invention is to overcome the shortcomings of the prior art and seek to design a carpooling order processing method to solve the problem that the existing carpooling order processing method cannot make use of the vacant seats in the vehicle in a timely manner and has a high proportion of empty driving.

[0004] In order to achieve the above object, the present invention adopts the following technical solutions:

[0005] A method for processing a carpooling order comprises the following steps:

[0006] (1) receiving a first carpooling order from a first passenger, and continuing to match and receive new carpooling orders while the first carpooling order is in progress, and repeating this process until the vehicle stops accepting orders;

[0007] (2) During the process of driving to complete a carpool order, after any carpool order is completed, the vehicle restarts receiving orders, matches and receives the next carpool order, and so on in a cycle until it stops receiving orders; the specific situations where steps (1) and (2) stop receiving orders are the following three cases: First, the vehicle stops receiving orders when there are no vacant seats; Second, upon receiving a stop receiving order request, which can be issued by the driver or the passenger; Third, the operation platform issues a stop receiving order instruction.

[0008] The method for matching the next carpool order specifically includes the following steps:

[0009] (101) According to the current driving route, which includes each point in the driving route and its corresponding time, match the carpool orders to be matched within a certain range along the current driving route. The number of passengers in the carpool orders to be matched needs to be less than or equal to the number of vacant seats on the vehicle when arriving at the origin of the carpool order to be matched;

[0010] (102) Then calculate the origin matching degree K1 and the time matching degree K2 between the carpool order to be matched and the driver's current driving route. The origin matching degree K1 is the shortest driving distance from the origin of the carpool order to be matched to the current driving route, and the time matching degree K2 is the time difference between the estimated time to reach the origin of the carpool order to be matched according to the current road conditions and the boarding time of the carpool order to be matched. If K1 and K2 are within the set range, then proceed to step (103) or (104). The boarding time of the carpool order to be matched is the time that the passenger hopes to board or the passenger's taxi-taking time;

[0011] (103) As Figure 1 shown, when the distance between the origin location of the carpool order to be matched and the destination of the current driving route is greater than the set distance M, calculate the route matching degree K3 between the carpool order to be matched and the driver's current driving route. The route matching degree K3 is the repeatability between the planned route to complete the carpool order to be matched and the current driving route. If K3 is within the set range, then determine the carpool order to be matched as the next carpool order and plan the latest driving route; otherwise, do not match it;

[0012] (104) When the distance between the origin location of the carpool order to be matched and the destination of the current driving route is less than or equal to the set distance M, then directly use it as the next carpool order and plan the latest driving route.

[0013] In the next carpool order matching method, the current driving route involved is the optimal route that is currently being driven. The method for generating the i-th optimal route is as follows: Based on the first carpool order information, determine the first optimal route of the first carpool order. The first optimal route is the optimal route from the first departure place to the first destination. Based on all the ongoing uncompleted carpool order information, generate the (i + 1)-th optimal route. The (i + 1)-th optimal route is the optimal route with the location where the vehicle is located when the (i + 1)-th carpool order is successfully matched as the starting point, passing through the departure places of all the orders that have not yet boarded and the destinations of all the uncompleted orders. i is a positive integer greater than or equal to 1.

[0014] The i-th carpool order information corresponding to the i-th carpool order includes the i-th departure place, the i-th destination, the i-th boarding time, and the i-th number of available seats.

[0015] Furthermore, the next carpool order matching method further includes step (105).

[0016] (105) Based on the latest driving route, determine the time T2 when all the uncompleted carpool orders reach their corresponding destinations, and the end time of the i-th carpool order is the time T1 when reaching the i-th destination when driving according to the i-th optimal route. If T2 - T1 exceeds the set range N, then provide a fare reduction compensation to the passengers of the i-th carpool order, or invalidate the newly determined order to be matched, and directly return to step (101) to find a new order to be matched.

[0017] The present invention has the following beneficial effects compared with the prior art: (1) The carpool order processing method of the present invention realizes continuous carpooling, greatly reduces the empty seat rate of the vehicle, reduces the riding cost of passengers, and also increases the income of the driver; (2) The reduction of the passenger cost increases the willingness of passengers to take a taxi, which can generate a larger market for operating vehicles, increase the income of the operating vehicle platform, and at the same time speed up the order matching speed, realizing a virtuous cycle in the carpooling industry; (3) This order processing method can reduce or even eliminate the driver's empty driving rate, improve the effective value generated by the operating vehicle per unit time, and improve the efficiency; (4) The next carpool order matching method can fully consider the relationship between time, location, and distance, which is not only convenient for finding the best carpool order, but also can well balance the relationship between the passenger's time cost and economic cost. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] Figure 1 It is a position diagram between specific carpool orders involved in Embodiment 1. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0019] The present invention will be further described below through specific embodiments.

[0020] Embodiment 1

[0021] A carpool order processing method includes the following steps:

[0022] (1) Receive the first carpool order sent by the first passenger. During the process of the first carpool order, continue to match and receive new carpool orders, and repeat this process until the vehicle stops receiving orders.

[0023] (2) During the driving process of the vehicle to complete the carpool order, after any carpool order is completed, the vehicle restarts receiving orders, matches and receives the next carpool order, and repeats this cycle until it stops receiving orders.

[0024] The situation where steps (1) and (2) stop receiving orders specifically refers to the following three cases: First, the vehicle stops receiving orders when there are no empty seats; Second, a stop receiving order request is received, and the stop receiving order request can be sent by the driver or the passenger; Third, it is sent by the operation platform. Due to the driver's long-term fatigue driving or other abnormal situations, new orders are no longer assigned to the vehicle.

[0025] Step (1) determines the maximum number of orders received based on the number of seats in the operating vehicle and the number of seats required for each carpool order. For example, when each carpool order is for 1 person, for a 5-seat car, the maximum number of orders received is 4, and for a 7-seat car, the maximum number of orders received is 6. However, in the actual carpool process, the vehicle being full will greatly reduce the customer experience. Therefore, during the order receiving process, the specific needs of the driver and passengers are fully considered to determine whether to continue receiving orders.

[0026] According to the above carpool order processing method, the driver receives the first carpool order sent by the first passenger, determines the first optimal route for the first carpool order. During the process of the first carpool order, matches and receives the second carpool order, generates the second optimal route, and drives according to the second optimal route. If the vehicle is in the order receiving state, it matches and receives the third carpool order, generates the third optimal route, and repeats this process to match and receive the i-th carpool order, generate the i-th optimal route, and drive according to the i-th optimal route. By continuously receiving orders during the order progress, the empty seats on the vehicle are fully utilized, greatly reducing the vehicle empty driving ratio. The i-th optimal route can be the route with the shortest time.

[0027] In the above carpool order processing method, the matching of the next order can be carried out according to the existing technology. Of course, the next order can also be matched according to the following method.

[0028] As an implementation method, the next carpool order matching method specifically includes the following steps:

[0029] (101) According to the current driving route (such as the i-th optimal route), the driving route includes each point in the driving route and its corresponding time, and match the carpooling orders to be matched within a certain range along the current driving route. The number of passengers in the carpooling orders to be matched needs to be less than or equal to the number of empty seats in the vehicle when arriving at the origin of the carpooling order to be matched;

[0030] (102) Then calculate the origin matching degree K1 and the time matching degree K2 between the carpooling order to be matched and the driver's current driving route. The origin matching degree K1 is the shortest driving distance from the origin of the carpooling order to be matched to the current driving route. The shorter the distance, the higher the matching degree K1. The time matching degree K2 is the time difference between the estimated time to reach the origin of the carpooling order to be matched according to the current road conditions and the boarding time of the carpooling order to be matched. The shorter the time difference, the higher the matching degree K2. If K1 and K2 are within the set range, then proceed to step (103) or (104). The boarding time of the carpooling order to be matched is the time that the passenger hopes to board or the time when the passenger hails a taxi;

[0031] (103) As Figure 1 shown, the current vehicle driving route is from place A to place B. When the origin location (place C) of the carpooling order to be matched is far from the destination (place B) of the current driving route (such as the distance between C and B is greater than the set distance M), calculate the route matching degree K3 between the carpooling order to be matched and the driver's current driving route. The route matching degree K3 is the repeatability between the planned route to complete the carpooling order to be matched and the current driving route. The higher the repeatability, the higher the matching degree. If K3 is within the set range, then determine the carpooling order to be matched as the next carpooling order and plan the latest driving route (such as the (i + 1)-th optimal route), otherwise do not match;

[0032] (104) When the origin location (place E) of the carpooling order to be matched is close to the destination (place B) of the current driving route (such as the distance between E and B is less than or equal to the set distance M), then directly use it as the next carpooling order and plan the latest driving route (such as the (i + 1)-th optimal route).

[0033] The current driving route involved in the next carpooling order matching method is the currently driving optimal route. The method for generating the i-th optimal route is: determine the first optimal route of the first carpooling order based on the first carpooling order information. The first optimal route is the optimal route from the first departure place to the first destination. Generate the (i + 1)-th optimal route based on all the ongoing uncompleted carpooling order information. The (i + 1)-th optimal route is the optimal route with the location where the vehicle is located when the (i + 1)-th carpooling order is successfully matched as the starting point, passing through the origins of all the unboarded orders and the destinations of all the uncompleted orders. i is a positive integer greater than or equal to 1.

[0034] To complete the above matching and the setting of the optimal route, the information of the i-th carpooling order corresponding to the i-th carpooling order includes information such as the i-th origin, the i-th destination, the i-th boarding time, and the number of seats required for the i-th carpooling order. The i-th boarding time is the estimated time when the vehicle arrives at the origin of the carpooling order to be matched. The (i + 1)-th origin should be set within a certain range along the i-th optimal route.

[0035] To improve the user experience and avoid subsequent orders affecting the completion of previous orders and wasting the time of previous passengers, the information of the i-th carpooling order further includes the end time of the i-th carpooling order. The end time of the i-th carpooling order is the time T1 when arriving at the i-th destination according to the i-th optimal route. When receiving a new order for matching, for the uncompleted i-th carpooling order, calculate the time T2 when arriving at the i-th destination according to the latest planned optimal route. If T2 - T1 exceeds the set range N, a fee reduction compensation is given to the passengers of the i-th carpooling order. The setting of the order end time takes into account the additional time cost borne by the passengers. Since there is a correlation between the order end time and the driving distance, it also takes into account the additional driving distance.

[0036] Furthermore, the method for matching the next carpooling order further includes step (105).

[0037] (105) Based on the latest driving route, determine the time T2 when all uncompleted carpooling orders arrive at their corresponding destinations. If T2 - T1 exceeds the set range N, a fee reduction compensation is given to the passengers of the i-th carpooling order, or the latest determined order to be matched is invalidated, and directly return to step (101) to find a new order to be matched.

[0038] For existing carpooling orders, to avoid excessive detours, usually a vehicle can pick up at most 2 - 3 orders. The total fare includes a starting price + mileage fee + duration fee + long-distance fee (for extremely long distances). If two people share a car, each pays about 70%, and if three people share a car, each pays about 50%. The more people sharing the car, the less the passengers pay, and the higher the driver's remuneration. Through the order processing method of the present invention, the empty seat rate and empty driving rate of the vehicle are reduced. More passengers share a car during the same period, reducing the fare borne by each passenger, and the driver's remuneration also increases accordingly.

[0039] From online car-hailing to carpooling, it solves the waste of vehicle transportation capacity caused by the vehicle having unoccupied seats. From carpooling to continuous carpooling, it solves the waste of the effective value of the driver and the vehicle caused by the vehicle driving empty.

Claims

1. A carpool order processing method, characterized in that, It includes the following steps: (1) Receive the first carpooling order sent by the first passenger. During the process of the first carpooling order, continue to match and receive new carpooling orders, and repeat this process until the vehicle stops receiving orders; (2) During the driving process of completing the carpooling order, after any carpooling order is completed, the vehicle restarts receiving orders, matches and receives the next carpooling order, and repeats this cycle until it stops receiving orders. The specific situations where steps (1) and (2) stop receiving orders are as follows: First, the vehicle stops receiving orders when there are no empty seats; Second, receive a stop receiving order request, which can be sent by the driver or the passenger; Third, the operation platform issues a stop receiving order instruction.

2. The carpooling order processing method according to claim 1, wherein The method for matching the next carpooling order specifically includes the following steps: (101) According to the current driving route, which includes each point and its corresponding time in the driving route, match the carpooling orders to be matched within a certain range along the current driving route. The number of passengers in the carpooling orders to be matched needs to be less than or equal to the number of empty seats on the vehicle when arriving at the origin of the carpooling order to be matched; (102) Then calculate the origin matching degree K1 and the time matching degree K2 between the carpooling order to be matched and the driver's current driving route. The origin matching degree K1 is the shortest driving distance from the origin of the carpooling order to be matched to the current driving route, and the time matching degree K2 is the time difference between the estimated time to reach the origin of the carpooling order to be matched according to the current road conditions and the boarding time of the carpooling order to be matched. If K1 and K2 are within the set range, then proceed to step (103) or (104). The boarding time of the carpooling order to be matched is the time that the passenger hopes to board or the passenger's taxi-taking time; (103) As shown in Figure 1, when the distance between the origin location of the carpooling order to be matched and the destination of the current driving route is greater than the set distance M, calculate the route matching degree K3 between the carpooling order to be matched and the driver's current driving route. The route matching degree K3 is the repeatability between the planned route for completing the carpooling order to be matched and the current driving route. If K3 is within the set range, then determine the carpooling order to be matched as the next carpooling order and plan the latest driving route; otherwise, do not match; (104) When the distance between the origin location of the carpooling order to be matched and the destination of the current driving route is less than or equal to the set distance M, directly use it as the next carpooling order and plan the latest driving route.

3. The carpool order processing method according to claim 2, wherein The current driving route involved in the method for matching the next carpooling order is the optimal route being driven. The driver receives the first carpooling order sent by the first passenger, determines the first optimal route of the first carpooling order. During the process of the first carpooling order, match and receive the second carpooling order, generate the second optimal route, and drive according to the second optimal route. If the vehicle is in the order-receiving state, then match and receive the third carpooling order, generate the third optimal route, and repeat this process. Match and receive the i-th carpooling order, generate the i-th optimal route, and drive according to the i-th optimal route. The method for generating the i-th optimal route is as follows: Determine the first optimal route of the first carpooling order based on the first carpooling order information. The first optimal route is the optimal route from the first departure place to the first destination. Generate the (i + 1)-th optimal route based on all ongoing uncompleted carpooling order information. The (i + 1)-th optimal route is the optimal route with the location where the vehicle is located when the (i + 1)-th carpooling order is successfully matched as the starting point, passing through the departure places of all unboarded orders and the destinations of all uncompleted orders. i is a positive integer greater than or equal to 1.

4. The carpool order processing method according to claim 3, wherein The i-th carpooling order information corresponding to the i-th carpooling order includes the i-th departure place, the i-th destination, the i-th boarding time, and the i-th number of seats required.

5. The carpool order processing method according to claim 3, wherein, Furthermore, the method for matching the next carpooling order further includes step (105). (105) Based on the latest driving route, determine the time T2 when all uncompleted carpooling orders reach their corresponding destinations, and the end time of the i-th carpooling order is the time T1 when reaching the i-th destination when driving according to the i-th optimal route. If T2 - T1 exceeds the set range N, then provide a fee reduction compensation to the passengers of the i-th carpooling order, or invalidate the latest determined order to be matched, and directly return to step (101) to find a new order to be matched.

Images