WO2015124106A1

WO2015124106A1 - Taxi sharing method and system and server

Info

Publication number: WO2015124106A1
Application number: PCT/CN2015/073146
Authority: WO
Inventors: 曾昭兴
Original assignee: 曾昭兴
Priority date: 2014-02-23
Filing date: 2015-02-15
Publication date: 2015-08-27
Also published as: CN104332046A

Abstract

A taxi sharing method, comprising the steps of: acquiring origin information and destination information of a first passenger and generating a first riding route; acquiring origin information and destination information of a plurality of second passengers and generating a plurality of second riding routes; and if a route in the generated second riding routes coincides with the first riding route, giving a taxi sharing prompt. The method can solve the problem that a lot of money and time is spent in taxi sharing due to varying destinations, and enables better utilization of taxi resources, so as to serve more people with the shortest driving distance. Also provided are a taxi sharing system and a server.

Description

Taxi car car pooling method, system and server

[0001] The present invention relates to the field of urban transportation, and in particular, to a taxi car carpooling method, system and server.

Background technique

[0002] Taxi is one of the important components of urban traffic. At present, the total number of taxis in China has reached more than 1.1 million, and the annual passenger traffic has reached 12 billion passengers. The energy consumption can be imagined. At present, most taxis can only carry one passenger. In most cases, there is only one passenger. Therefore, the waste of resources and its seriousness. On the other hand, the difficulty of getting a taxi during peak hours, holidays or bad weather is also plaguing consumers. Taxi car not only saves a lot of energy for the country, but also brings convenience to consumers.

technical problem

[0003] At present, most of the carpooling passengers are discussed at the location of the car, and then decide whether to carry out carpooling.

In this way, the following problems may occur: 1. Because they are strangers, it is more difficult to communicate and communicate; 2. Because the destination may be very different, resulting in more money and time spent after carpooling; 3. After carpooling Need to take care of other carpooling passengers, often need to detour or let other passengers get off in advance, resulting in inconvenient user use.

Problem solution

Technical solution

[0004] Based on the above situation, the present invention proposes a carpooling method. After the taxi driver carries the first passenger, the system automatically generates the first passenger route of the passenger; when the taxi departs, the first passenger route is started. Destination 吋, the system further obtains the passenger information of the other passengers (including the starting point information and the starting point information), and the starting point information of the other passengers and the starting point information to generate a second boarding route; if the second board is generated A coincidence path between the path and the first ride path is issued, and a carpool reminder is issued. The coincidence path generated here is relatively large, and the priority ordering can be used to make the passenger have multiple choices. After the driver and the first passenger obtain the carpool reminder, if the carpool is agreed to be carpooled, the car can be carpooled with the second passenger; Avoiding the waste of the land and money caused by the inconsistency of the destination, the taxi can better mobilize the resources and serve the most people with the least amount of exercise.

[0005] The present invention discloses a taxi car carpooling method, including the steps of: acquiring a starting point information and an ending point information of a first passenger, generating a first riding route; acquiring a starting point information and ending point information of a plurality of second passengers, generating a plurality of a second ride path; if the generated second ride path and the first ride path have a coincident path, a carpool reminder is issued.

[0006] If the generated coincidence path of the second boarding path and the first boarding path is the longest, the second passenger who generates the second boarding path is taken as the optimal second passenger.

[0007] The longer the coincidence path of the second boarding path and the first boarding path, the higher the carpooling priority of the corresponding second passenger.

[0008] A carpool reminder is sent to the second passenger whose carpool priority is the top N, N<4.

[0009] the method for generating a boarding route, determining a starting point and an ending point of the passenger, selecting a top M driving path closest to the ending point; dividing each driving path in the M driving path into a plurality of small paths Calculate the average speed of the taxi passing through each small path, and then calculate the average time of each small path through each small path according to the length of each small path. Add the average time of each small path to get the total driving speed of each driving path. Comparing the driving time of each driving route, the shortest one in the running time is taken as the riding route.

[0010] The server re-implements the first boarding path according to the congestion condition of the road.

[0011] The present invention also discloses a taxi carpooling system, including a first passenger client, a server, and a plurality of second passenger clients, wherein the first passenger client is configured to acquire starting point information and destination information of the first passenger. The plurality of second passenger clients are configured to obtain start point information and end point information of the plurality of second passengers; the server is configured to respectively receive the first passenger client and the plurality of second passenger client start point information and the end point information, and generate corresponding a first riding path and a plurality of second riding paths; if the generated second riding path and the first riding path have a coincident path, a carpool reminder is issued.

[0012] If the generated coincidence path of the second riding path and the first riding path is the longest, the second passenger who generates the second riding path is the optimal second passenger.

[0013] and a taxi carpooling server is disclosed, wherein the server is configured to generate a first carriage path according to the start point information and the end point information of the first passenger and according to the start point information and the end point information of the second passenger respectively And a second ride path; when the generated second ride path and the first ride path have a coincident path, a carpool reminder is issued.

Advantageous effects of the invention

Beneficial effect

Compared with the prior art, the present invention is simple in operation, and can solve the problem of more money and time spent after carpooling due to the possibility of large difference in destinations, and can make the passengers of multi-taxis vehicles more reasonable. Exchange, making taxi resources better mobilized, reducing the cost of drivers and passengers. Brief description of the drawing

DRAWINGS

1 is a schematic flow chart of an embodiment of a taxi car caring method according to the present invention;

2 is a schematic diagram of an embodiment of a carpooling method of a taxi according to the present invention;

3 is a schematic structural view of an embodiment of a taxi carpooling system.

Embodiments of the invention

[0018] The solution of the present invention will be described in detail below in conjunction with the preferred embodiments thereof.

[0019] As shown in FIG. 1, the method in this embodiment includes the following steps:

[0020] S101: acquiring start point and end point information of the first passenger, and generating a first ride path;

[0021] The first passenger rides the taxi at the location 0 (the default knows the starting point information) and informs the taxi driver of the destination information. Thereafter, the first passenger's starting point and destination information can be uploaded to the server through the first passenger client (mobile phone) or the taxi driver's mobile phone or other communication terminal, the server obtains the content of the database, and generates the first riding path according to the experience value. . As a more preferred example, the server also generates a first ride path based on the congestion of the highway. In general, passengers will consider various factors when riding a taxi. The inter-department factor and price factor are the main considerations. This embodiment mainly considers the inter-turn factor, and the method of generating the first ride path is determined. The starting point and the ending point of a passenger, selecting the first M driving paths from the starting point to the ending point; dividing each driving path in the M driving paths into a plurality of small paths, respectively calculating the average speed of the taxi passing each small path, Then calculate the average time of each small path based on the length of each small path. Add the total travel time of each travel route; compare the travel time of each travel route, and take the shortest travel route between the travel time as the fastest travel route (ie, the first travel route).

[0022] S102: Obtain starting point information and end point information of a plurality of second passengers, and generate a plurality of second riding paths.

[0023] When the first passenger arrives on the taxi, the starting point information and the end point information of the surrounding N second passengers are continuously received on the way, and N corresponding second riding paths are generated based on the information. Since the taxi will generate different carpool combinations according to the actual situation after the brakes, the different carpool combinations for the first passenger and the next second passenger, the longer the coincident path, the less the wasteful cost. , can improve the utilization of taxi resources. Therefore, it is more important to select the best carpool combination among several carpooling combinations. In addition, the first boarding path and the second boarding path are preset paths stored in the database, and the empirical data that can be retrieved from the database after the passenger inputs the information of the starting point and the ending point, generally does not consider the environmental factors of the vehicle. The impact, if considering environmental factors, can use the fastest driving route in S101.

[0024] S103: If there is a coincidence path between the generated second boarding path and the first boarding path, a carpool reminder is issued.

[0025] As shown in FIG. 2, the first passenger starts from the location 0 and has an end point of eight. After the first passenger departs from the location 0, on the way, the starting point information of the second passenger received and the destination information, wherein the starting point B of the second passenger 1 and the starting point B′ of the second passenger 2 are in the first riding path (The driver does not need to detour to pick up the passenger), and the destination C of the second passenger 1 and the destination C of the second passenger 2 are in the first passenger route. The driver can send the first passenger. On the way, the second passenger is directly sent to the destination C, where the coincidence path of the first passenger and the second passenger 1 is BC, the coincidence path of the first passenger and the second passenger 2 is B' A, and the taxi is in the first After one passenger is sent to A, the second passenger 2 is sent to C'. In this case, the system will send a carpool reminder to the first passenger and the second passenger. In the real world, if there are not many second passengers, there are not many chances of a coincident path, so a reminder can be issued as soon as the coincidence path occurs. However, if there are a large number of passengers in the same room that need to be carpooled, it is necessary to prioritize the passengers so that the best carpool combination can be found.

[0026] As a more preferred embodiment, if the generated coincidence path of the second boarding path and the first boarding path is the longest, the second passenger who generates the second boarding path is optimal. Second passenger. As seen from the figure, the coincidence path of the first passenger and the second passenger 1 is that the BC is larger than the coincidence path of the first passenger and the second passenger 2. The path is B' A, so the system will use the second passenger 1 as the optimal second passenger and issue a carpool reminder. The carpool reminder here can be sent to multiple people, so that the relevant person of the carpool can make a decision on whether to carpool according to the reminder. In addition, in the present embodiment, in addition to the optimal second passenger, there may be cases where a plurality of second passengers are eligible. Since the taxi can only carry 4 passengers at a time, in the case of a large number of passengers, it is necessary to prioritize the N second passengers and screen the best of the second passengers. Here, the ranking rule of priority is: The longer the coincidence path of the second boarding path and the first boarding path, the higher the carpooling priority of the corresponding second passenger. Compared with the existing carpooling, the method will greatly improve the resource utilization rate after carpooling, so that the taxi can serve at least two people when driving the same distance.

[0027] In the above described manner, the longer the coincidence path distance between the first passenger and the second passenger, the higher the resource utilization rate, and therefore, among the plurality of second passengers, if the second passenger is produced The distance between the path and the first boarding path is the longest, and the second passenger who generates the second boarding path is used as the optimal second passenger (re-prompting to set the priority prompt, in the normal case, the first passenger can Let the taxis be carpooled according to priority), and send a carpool reminder or request to the best second passenger and the first passenger. If they all agree, the taxi driver can pick up the best second passenger, so that the utilization rate of the taxi's resources can be improved. If the first passenger or the second best passenger does not agree, the driver does not accept the best second passenger. , you can continue to search for the second best passenger until you reach the destination of the first passenger. Of course, if the first passenger does not agree at the beginning, the carpooling function is turned off.

[0028] Since a taxi can allow up to four people to be loaded at the same time, in the carpooling stage, more people can get on the bus and someone can get off the bus. Therefore, in theory, a taxi can take N people, N>2. The more people, the more the coincidence path will be, and the average cost of the taxi will be further reduced.

[0029] After the N-1 passenger gets on the vehicle, the origin information and the destination information of the Nth passenger are continuously acquired, and an Nth ride path is generated, if the N-1 ride path coincides with the Nth ride path The path distance is the longest, and the Nth passenger who generates the Nth ride path is the optimal Nth passenger, where N is an integer greater than 2. Since many people get on the train, the situation is more complicated, and the shortest inter-turn path or the lowest price path can be used as the optimal path.

[0030] FIG. 3 is a schematic structural view of an embodiment of a taxi carpooling system of the present invention.

[0031] A taxi carpooling system, comprising: a first passenger client, a server, and a plurality of second passenger customers The first passenger client is configured to acquire start point information and end point information of the first passenger; the plurality of second passenger clients are configured to acquire start point information and end point information of the plurality of second passengers; Receiving a first passenger client and a plurality of second passenger client starting point information and destination information and generating a corresponding first riding path and a plurality of second riding paths; if the generated second riding path and the first There is a coincidence path on the ride path, and a carpool reminder is issued. If the generated coincidence path of the second riding path and the first riding path is the longest, the second passenger of the second riding path is generated as the optimal second passenger. In the case of N passenger clients, the server can issue a carpool reminder to N passenger clients.

[0032] In the implementation of the method of the present invention, it is disclosed that there are N passengers performing carpooling in actual application, and in this embodiment, the Nth passenger client is also used to correspond thereto, and in the case of carpooling, the method embodiment is also used. The benefits are consistent, wherein the second passenger path and the first passenger path have the longest coincidence path, and the second passenger who generates the second passenger route is the optimal second passenger, and the second The longer the coincidence path of the ride path with the first ride path, the higher the carpool priority of the corresponding second passenger, the higher the resource utilization rate.

[0033] The system can also adopt the manner of carpooling in the embodiment of the method of the present invention, and the effects and benefits brought about by the method are corresponding to the method embodiments, and the description is not further described herein.

[0034] In addition, the present invention also discloses a carpooling server based on a multi-tasking vehicle, which is configured to generate a first according to the starting point information and the ending point information of the first passenger and according to the starting point information and the ending point information of the second passenger. a ride path and a second ride path; when the generated second ride path and the first ride path have a coincident path, a carpool reminder is issued.

[0035] The server may also adopt the manner of carpooling in the embodiment of the method of the present invention, and the effects and benefits thereof are corresponding to the method embodiments, and the description is not further described herein.

The above-described embodiments are merely illustrative of the embodiments of the present invention, and the description thereof is not to be construed as limiting the scope of the invention. It should be noted that a number of variations and modifications may be made by those skilled in the art without departing from the spirit and scope of the invention. Therefore, the scope of the invention should be determined by the appended claims.

Industrial applicability The invention adopts a mobile terminal, a wireless communication network and a network server as implementation carriers, and can implement the corresponding operation on the pc end or the mobile terminal by using a software program and an application program. It can solve the problem of more money and time spent after carpooling due to the possible difference in destinations. It can also make the passengers of multi-taxis vehicles exchange reasonably, so that the taxi resources can be better mobilized, reducing the driver and The cost of passengers.

Claims

Claim

A taxi car carpooling method, comprising the steps of: acquiring a starting point information and an ending point information of a first passenger, generating a first riding route; acquiring a starting point information of the second passenger and the ending point information, and generating a plurality of second riding paths And if the generated second riding path and the first riding path have a coincident path, the carpooling method is issued, and the carpooling method according to claim 1, wherein the second car is generated If the coincidence path of the path with the first ride path is the longest, the second passenger who generates the second ride path is the optimal second passenger.

The carpooling method according to claim 1, wherein the longer the coincidence path of the second boarding path with the first boarding path, the higher the carpooling priority of the corresponding second passenger.

The carpooling method according to claim 2, wherein a carpool reminder is issued to the second passenger whose carpool priority is the top N, N < 4.

The carpooling method according to any one of claims 1-4, wherein the method for generating a boarding route determines s the starting point and the ending point of the passenger, and selects the first M driving paths closest to the ending point; Each of the M driving paths is divided into a plurality of small paths, and the average speed of the taxi passing through each small path is calculated respectively, and then the average time of each small path is calculated according to the length of each small path, and each small segment is calculated. The average time of the paths is added to obtain the total travel time of each travel route; when the travel time of each travel route is compared, the shortest one between the travel times is used as the travel route.

A taxi carpooling system, comprising: a first passenger client, a server, and a plurality of second passenger clients, wherein the first passenger client is configured to acquire starting point information and destination information of the first passenger; The second passenger client is configured to obtain start point information and end point information of the plurality of second passengers; the server is configured to respectively receive the first passenger client and the plurality of second passenger client start point information and the end point information, and generate a corresponding first ride a path and a plurality of second ride paths; if the generated The carriage path and the first boarding path have a coincidence path, and a carpool reminder is issued.

[Claim 7] The taxi carpooling system according to claim 6, wherein if the generated coincidence path of the second riding path and the first riding path is the longest, the second is generated The second passenger of the ride path acts as the optimal second passenger.

[Claim 8] The carpooling method according to claim 7, wherein the longer the coincidence path of the second boarding path and the first boarding path, the corresponding carpool priority of the second passenger The higher.

[Claim 9] A taxi carpooling server, wherein the server is configured to respectively generate a first riding route according to a starting point information and an ending point information of the first passenger and according to the starting point information and the ending point information of the second passenger a second boarding route; when the generated second boarding path and the first boarding path have a coincident path, a carpool reminder is issued.

[Claim 10] The carpooling server according to claim 9, wherein the longer the coincidence path of the second boarding path and the first boarding path, the corresponding carpool priority of the second passenger The higher.