WO2015124106A1 - Taxi sharing method and system and server - Google Patents

Taxi sharing method and system and server Download PDF

Info

Publication number
WO2015124106A1
WO2015124106A1 PCT/CN2015/073146 CN2015073146W WO2015124106A1 WO 2015124106 A1 WO2015124106 A1 WO 2015124106A1 CN 2015073146 W CN2015073146 W CN 2015073146W WO 2015124106 A1 WO2015124106 A1 WO 2015124106A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
passenger
point information
carpooling
boarding
Prior art date
Application number
PCT/CN2015/073146
Other languages
French (fr)
Chinese (zh)
Inventor
曾昭兴
Original Assignee
曾昭兴
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 曾昭兴 filed Critical 曾昭兴
Publication of WO2015124106A1 publication Critical patent/WO2015124106A1/en

Links

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3407—Route searching; Route guidance specially adapted for specific applications
    • G01C21/3438—Rendez-vous, i.e. searching a destination where several users can meet, and the routes to this destination for these users; Ride sharing, i.e. searching a route such that at least two users can share a vehicle for at least part of the route
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/26—Government or public services
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
    • G08G1/202—Dispatching vehicles on the basis of a location, e.g. taxi dispatching

Definitions

  • Taxi car car pooling method system and server
  • the present invention relates to the field of urban transportation, and in particular, to a taxi car carpooling method, system and server.
  • 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.
  • the present invention proposes a carpooling method.
  • 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.
  • the carpool reminder 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.
  • 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.
  • the second passenger who generates the second boarding path is taken as the optimal second passenger.
  • a carpool reminder is sent to the second passenger whose carpool priority is the top N, N ⁇ 4.
  • 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.
  • the server re-implements the first boarding path according to the congestion condition of the road.
  • 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.
  • the second passenger who generates the second riding path is the optimal second passenger.
  • a taxi carpooling server 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.
  • 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.
  • FIG. 1 is a schematic flow chart of an embodiment of a taxi car caring method according to the present invention.
  • FIG. 2 is a schematic diagram of an embodiment of a carpooling method of a taxi according to the present invention
  • FIG. 3 is a schematic structural view of an embodiment of a taxi carpooling system.
  • the method in this embodiment includes the following steps:
  • S101 acquiring start point and end point information of the first passenger, and generating a first ride path
  • 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).
  • S102 Obtain starting point information and end point information of a plurality of second passengers, and generate a plurality of second riding paths.
  • 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.
  • 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.
  • S103 If there is a coincidence path between the generated second boarding path and the first boarding path, a carpool reminder is issued.
  • 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.
  • 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
  • the second passenger 2 is sent to C'.
  • the system will send a carpool reminder to the first passenger and the second passenger.
  • the coincidence path occurs.
  • the coincidence path occurs.
  • 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.
  • the optimal second passenger there may be cases where a plurality of second passengers are eligible.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • FIG. 3 is a schematic structural view of an embodiment of a taxi carpooling system of the present invention.
  • 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
  • the server can issue a carpool reminder to N passenger clients.
  • 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.
  • 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.
  • 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.
  • 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 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.

Landscapes

  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Tourism & Hospitality (AREA)
  • Health & Medical Sciences (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Automation & Control Theory (AREA)
  • Economics (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Educational Administration (AREA)
  • Primary Health Care (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Traffic Control Systems (AREA)

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] 本发明涉及一种城市交通运输领域， 特别涉及一种计程车拼车方法、 ***及服 务器。  [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] 出租车是城市交通的重要组成部分之一。 中国目前出租汽车总量己达 110多万 辆， 年客运量达 120亿人次， 其能源的消耗量可想而知， 并且目前多数出租车只 能搭载一方乘客， 多数情况下乘客也只有一人， 因此造成资源的浪费及其严重 。 另一方面， 在上下班高峰期、 节假日或天气不好的情况下打车难的问题也困 扰着广大消费者。 计程车拼车不但能为国家节约大量能源， 还能给广大消费者 带来方便。  [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] 目前大部分拼车的乘客， 都采用在乘车地点讨论， 然后再决定是否进行拼车。  [0003] At present, most of the carpooling passengers are discussed at the location of the car, and then decide whether to carry out carpooling.
这种方式， 可能产生以下问题： 1、 由于都是陌生人， 比较难以进行及吋沟通； 2、 由于目的地可能差异非常大， 导致拼车后消耗的金钱和吋间较多； 3、 拼车 后需要照顾其他拼车乘客， 经常需要绕路或者让其他乘客提前下车， 造成用户 使用不便。  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] 基于上述情况， 本发明提出了一种拼车方法， 计程车司机在载了第一个乘客后 ， ***自动生成该乘客的第一乘车路径； 在计程车出发按第一乘车路径出发去 目的地吋， ***再通过不断获取其他乘客的乘车信息 （包括起点信息以及起点 信息） ， 并其他乘客的的起点信息以及起点信息生成第二乘车路径； 若生成的 所述第二乘车路径与所述第一乘车路径的有重合路径， 发出拼车提醒。 这里产 生的重合路径相对比较多， 可以利用优先级排序使得乘客有多种选择， 司机和 第一乘客获取拼车提醒后， 如果同意拼车， 就可以与第二乘客进行拼车； 可以 避免乘客因为目的地不一致造成地吋间和金钱浪费， 又可以使得计程车更好地 调动资源， 以最少的行使路程， 为最多的人服务。 [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] 本发明公幵了一种计程车拼车方法， 包括步骤： 获取第一乘客的起点信息和终 点信息， 生成第一乘车路径； 获取若干第二乘客的起点信息以及终点信息， 生 成若干第二乘车路径； 若生成的所述第二乘车路径与所述第一乘车路径的有重 合路径， 发出拼车提醒。  [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] 若生成的所述第二乘车路径与所述第一乘车路径的重合路径最长， 则将生成该 第二乘车路径的第二乘客作为最优第二乘客。  [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] 所述第二乘车路径与所述第一乘车路径的重合路径越长， 则对应的第二乘客的 拼车优先级越高。  [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] 向所述拼车优先级为前 N的第二乘客发出拼车提醒， N<4。  [0008] A carpool reminder is sent to the second passenger whose carpool priority is the top N, N<4.
[0009] 所述生成乘车路径的方法， 确定乘客的起点和终点， 选择起点到终点路程最近 的前 M条行驶路径;将所述 M条行驶路径中的各条行驶路径划分为若干小段路径 ， 分别计算计程车经过每小段路径的平均速度， 再根据每小段路径的长度分别 计算计程车经过每小段路径的平均吋间， 将每小段路径的平均吋间相加得到各 条行驶路径总的行驶吋间；比较各条行驶路径的行驶吋间， 将行驶吋间最短的一 条作为乘车路径。  [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] 服务器根据当吋公路的拥堵情况重新实吋生成所述第一乘车路径。  [0010] The server re-implements the first boarding path according to the congestion condition of the road.
[0011] 本发明还公幵了一种计程车拼车***， 包括第一乘客客户端、 服务器以及若干 第二乘客客户端， 所述第一乘客客户端用于获取第一乘客的起点信息与终点信 息； 所述若干第二乘客客户端用于获取若干第二乘客的起点信息与终点信息； 所述服务器用于分别接收第一乘客客户端以及若干第二乘客客户端起点信息与 终点信息并生成相应的第一乘车路径与若干第二乘车路径； 若生成的所述第二 乘车路径与所述第一乘车路径的有重合路径， 发出拼车提醒。  [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] 若生成的所述第二乘车路径与所述第一乘车路径的重合路径最长， 则将生成该 第二乘车路径的第二乘客作为最优第二乘客。  [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] 以及公幵了一种计程车拼车服务器， 所述服务器用于根据第一乘客的起点信息 与终点信息以及根据第二乘客的起点信息与终点信息， 分别生成第一乘车路径 与第二乘车路径； 当生成的所述第二乘车路径与所述第一乘车路径的有重合路 径， 发出拼车提醒。 [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
[0014] 相较于现有技术， 本发明操作简单， 可以解决了由于目的地可能差异大导致拼 车后消耗的金钱和吋间较多的问题， 又可以使得多计程车的乘客可以进行较合 理地交换， 使得计程车资源得到更好地调动， 减少了司机和乘客的成本投入。 对附图的简要说明  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
[0015] 图 1是本发明的一种计程车拼车方法实施例的流程示意图；  1 is a schematic flow chart of an embodiment of a taxi car caring method according to the present invention;
[0016] 图 2是本发明的一种计程车的拼车方法实施例的路线示意； 2 is a schematic diagram of an embodiment of a carpooling method of a taxi according to the present invention;
[0017] 图 3是一种计程车拼车***实施例的结构示意图。 3 is a schematic structural view of an embodiment of a taxi carpooling system.
本发明的实施方式 Embodiments of the invention
[0018] 以下结合其中的较佳实施方式对本发明方案进行详细阐述。 [0018] The solution of the present invention will be described in detail below in conjunction with the preferred embodiments thereof.
[0019] 如图 1所示， 本实施例中的方法包括步骤： [0019] As shown in FIG. 1, the method in this embodiment includes the following steps:
[0020] S101 : 获取第一乘客的起点和终点信息， 生成第一乘车路径； [0020] S101: acquiring start point and end point information of the first passenger, and generating a first ride path;
[0021] 第一乘客在地点 0乘坐计程车 （默认知道起点信息） ， 并将终点信息告知计程 车司机。 此吋， 可通过第一乘客客户端 （手机） 或计程车司机的手机或其他通 讯终端将第一乘客的起点和终点信息上传给服务器， 服务器获取数据库的内容 ， 依据经验值生成第一乘车路径。 作为更优选的例子， 服务器还会根据当吋公 路的拥堵情况生成第一乘车路径。 一般而言， 乘客在乘坐计程车的吋候会考虑 各种因素， 其中吋间因素和价钱因素是主要考虑因素， 本实施例主要考虑吋间 因素， 其生成第一乘车路径的方法， 确定第一乘客的起点和终点， 选择起点到 终点路程最近的前 M条行驶路径;将所述 M条行驶路径中的各条行驶路径划分为 若干小段路径， 分别计算计程车经过每小段路径的平均速度， 再根据每小段路 径的长度分别计算计程车经过每小段路径的平均吋间， 将每小段路径的平均吋 间相加得到各条行驶路径总的行驶吋间；比较各条行驶路径的行驶吋间， 将行驶 吋间最短的一条作为最快行驶路径 （即选为第一乘车路径） 。 [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: 获取若干第二乘客的起点信息以及终点信息， 生成若干第二乘车路径。 [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] 当计程车载着第一乘客出发后， 在途中不断接收周围的 N个第二乘客的起点信 息以及终点信息， 并根据这些信息生成 N个相应的第二乘车路径。 由于计程车在 幵车后会根据实际的情况生成不同的拼车组合， 而不同的拼车组合针对第一乘 客以及接下来的第二乘客而言， 重合的路径越长， 其浪费的成本就会越少， 可 以提高了计程车资源的利用率。 所以在若干个拼车组合中选取最优的拼车组合 具有较为重要的意义。 另外， 第一乘车路径与第二乘车路径为数据库中存储的 预设路径， 在乘客输入起点和终点的信息后即可从数据库中调出的经验数据， 一般没有考虑当吋的环境因素的影响， 若考虑环境因素， 都可以采用 S101中的 最快行驶路径。 [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: 若生成的所述第二乘车路径与所述第一乘车路径的有重合路径， 发出拼 车提醒。  [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] 如图 2所示， 第一乘客从地点 0出发， 其终点为八。 当第一乘客从地点 0出发后 ， 在途中， 接收的若干第二乘客的起点信息以及终点信息中， 其中第二乘客 1的 起点 B、 第二乘客 2的起点 B'在第一乘车路径 （这个吋候司机就不用特意绕路去 接那位乘客） ， 且第二乘客 1的终点 C、 第二乘客 2的终点 C在第一乘车路径内， 那司机可以在送第一乘客的途中， 就直接将第二乘客送到目的地 C， 此处第一乘 客和第二乘客 1的重合路径为 BC， 第一乘客和第二乘客 2的重合路径为 B' A， 计 程车在将第一乘客送至 A后， 再将第二乘客 2送至 C'。 这种情况下， ***会向第 一乘客和第二乘客发出拼车提醒。 在现实情况中， 如果第二乘客并不多的情况 下， 出现重合路径的机会并不多， 因而可以一出现重合路径就发出提醒。 但是 ， 如果同一吋间内进行需要进行拼车的乘客非常多， 就必须对乘客进行一个优 先级的排列了， 这样可以找到最优的拼车组合。  [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] 作为更优的实施例子， 若生成的所述第二乘车路径与所述第一乘车路径的重合 路径最长， 则将生成该第二乘车路径的第二乘客作为最优第二乘客。 从图中来 看， 第一乘客和第二乘客 1的重合路径为 BC大于第一乘客和第二乘客 2的重合路 径为 B' A， 因而***会将第二乘客 1作为最优第二乘客， 并发出拼车提醒。 此处 的拼车提醒可以向多人发送， 使得拼车的相关人士可以根据该提醒做出是否拼 车的决定。 另外， 在本实施例中， 除了最优第二乘客外， 可能还会产生多个第 二乘客都符合条件的情况。 由于计程车每次只能载 4名乘客， 所以在乘客较多的 情况下， 需要对 N个第二乘客进行优先级的排列， 并筛选其中最优的几个第二乘 客。 此处优先级的排列规则是： 第二乘车路径与所述第一乘车路径的重合路径 越长， 则对应的第二乘客的拼车优先级越高。 相较现有的拼车， 本方法将极大 地提高拼车后的资源利用率， 使得计程车在行驶相同的路程的吋候， 可以至少 为两个以上的人服务。 [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] 上述描述的方式中， 第一乘客与第二乘客的重合路径距离越长， 则其资源利用 率会越高， 因此， 在若干个第二乘客当中， 若其生产的第二乘车路径与第一乘 车路径的重合路径距离最长， 将生成该第二乘车路径的第二乘客作为最优第二 乘客 （再提示吋设置优先级提示， 在正常的情况下第一乘客可以让计程车吋间 按优先级进行拼车） ， 向最优第二乘客及第一乘客发出拼车提醒或请求。 若他 们都同意， 计程车司机即可接送最优第二乘客， 使得计程车的资源的利用率可 以得到提高， 若第一乘客或最优第二乘客不同意， 则司机不去接受最优第二乘 客， 可继续搜索次优第二乘客， 直至到达第一乘客的目的地。 当然若第一乘客 一幵始就不同意， 则关闭该拼车功能。  [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] 由于一辆计程车可以最多允许同吋载四人， 在拼车阶段， 又可以多同吋有人上 车和有人下车， 所以理论上一辆计程车可以乘坐 N个人， N>2。 人越多， 意味着 重合路径就会越多， 计程车的平均成本将会进一步得到降低。  [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] 当第 N-1乘客上车后， 继续获取第 N乘客的起点信息以及终点信息， 生成第 N乘 车路径， 若所述第 N-1乘车路径与第 N乘车路径的重合路径距离最长， 将生成该 第 N乘车路径的第 N乘客作为最优第 N乘客， 这里的 N为大于 2的整数。 由于多人 上车之后， 产生的情况比较复杂， 可采用最短吋间路径或最低价格路径为最优 路径。  [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] 图 3中示出了本发明的一种计程车拼车***实施例的结构示意图。  [0030] FIG. 3 is a schematic structural view of an embodiment of a taxi carpooling system of the present invention.
[0031] 一种计程车拼车***， 包括： 第一乘客客户端、 服务器以及若干第二乘客客户 端， 所述第一乘客客户端用于获取第一乘客的起点信息与终点信息； 所述若干 第二乘客客户端用于获取若干第二乘客的起点信息与终点信息； 所述服务器用 于分别接收第一乘客客户端以及若干第二乘客客户端起点信息与终点信息并生 成相应的第一乘车路径与若干第二乘车路径； 若生成的所述第二乘车路径与所 述第一乘车路径的有重合路径， 发出拼车提醒。 若生成的所述第二乘车路径与 所述第一乘车路径的重合路径最长， 则将生成该第二乘车路径的第二乘客作为 最优第二乘客。 在有 N个乘客客户端的情况下， 服务器可以向 N个乘客客户端发 出拼车提醒。 [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] 在本发明方法实施中公幵了在实际应用吋会有 N个乘客进行拼车的状况， 本实 施中也使用第 N乘客客户端与其对应， 在拼车的吋候也与上述方法实施例所带来 的好处一致， 其中所述第二乘车路径与所述第一乘车路径的重合路径最长， 则 将生成该第二乘车路径的第二乘客作为最优第二乘客， 第二乘车路径与所述第 一乘车路径的重合路径越长， 则对应的第二乘客的拼车优先级越高， 则其资源 利用率会越高。  [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] 该***也可以采用本发明方法实施例的拼车的方式， 带来的效果及好处与方法 实施例对应， 此处不再展幵描述。  [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] 另外， 本发明还公幵了一种基于多计程车的拼车服务器， 该服务器用于根据第 一乘客的起点信息与终点信息以及根据第二乘客的起点信息与终点信息， 分别 生成第一乘车路径与第二乘车路径； 当生成的所述第二乘车路径与所述第一乘 车路径的有重合路径， 发出拼车提醒。 [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] 该服务器也可以采用本发明方法实施例的拼车的方式， 带来的效果及好处与方 法实施例对应， 此处不再展幵描述。 [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.
[0036] 以上所述实施例仅表达了本发明的实施方式， 其描述较为具体和详细， 但并不 能因此而理解为对本发明专利范围的限制。 应当指出的是， 对于本领域的普通 技术人员来说， 在不脱离本发明构思的前提下， 还可以做出若干变形和改进， 这些都属于本发明的保护范围。 因此， 本发明专利的保护范围应以所附权利要 求为准。 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.
工业实用性 本发明采用移动终端、 无线通讯网络以及网络服务器作为实现载体， 使用软件 程序、 应用程序， 在 pc端或者移动终端上做出相应的操作即可实现。 可以解决了 由于目的地可能差异大导致拼车后消耗的金钱和吋间较多的问题， 又可以使得 多计程车的乘客可以进行较合理地交换， 使得计程车资源得到更好地调动， 减 少了司机和乘客的成本投入。 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
一种计程车拼车方法， 其特征在于， 包括步骤： 获取第一乘客的 起点信息和终点信息， 生成第一乘车路径； 获取若干第二乘客的 起点信息以及终点信息， 生成若干第二乘车路径； 若生成的所述 第二乘车路径与所述第一乘车路径的有重合路径， 发出拼车提醒 根据权利要求 1所述的拼车方法， 其特征在于， 若生成的所述第二 乘车路径与所述第一乘车路径的重合路径最长， 则将生成该第二 乘车路径的第二乘客作为最优第二乘客。 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.
根据权利要求 1所述的拼车方法， 其特征在于， 所述第二乘车路径 与所述第一乘车路径的重合路径越长， 则对应的第二乘客的拼车 优先级越高。 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.
根据权利要求 2所述的拼车方法， 其特征在于， 向所述拼车优先级 为前 N的第二乘客发出拼车提醒， N<4。 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.
根据权利要求 1-4所述的拼车方法， 其特征在于， 所述生成乘车路 径的方法， 确定 s所述乘客的起点和终点， 选择起点到终点路程最 近的前 M条行驶路径;将所述 M条行驶路径中的各条行驶路径划分 为若干小段路径， 分别计算计程车经过每小段路径的平均速度， 再根据每小段路径的长度分别计算计程车经过每小段路径的平均 吋间， 将每小段路径的平均吋间相加得到各条行驶路径总的行驶 吋间；比较各条行驶路径的行驶吋间， 将行驶吋间最短的一条作为 所述乘车路径。 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.
[权利要求 7] 根据权利要求 6所述的计程车拼车***， 其特征在于， 若生成的所 述第二乘车路径与所述第一乘车路径的重合路径最长， 则将生成 该第二乘车路径的第二乘客作为最优第二乘客。 [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.
[权利要求 8] 根据权利要求 7所述的拼车方法， 其特征在于， 所述第二乘车路径 与所述第一乘车路径的重合路径越长， 则对应的第二乘客的拼车 优先级越高。 [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.
[权利要求 9] 一种计程车拼车服务器， 其特征在于， 所述服务器用于根据第一 乘客的起点信息与终点信息以及根据第二乘客的起点信息与终点 信息， 分别生成第一乘车路径与第二乘车路径； 当生成的所述第 二乘车路径与所述第一乘车路径的有重合路径， 发出拼车提醒。  [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.
[权利要求 10] 根据权利要求 9所述的拼车服务器， 其特征在于， 所述第二乘车路 径与所述第一乘车路径的重合路径越长， 则对应的第二乘客的拼 车优先级越高。  [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.
PCT/CN2015/073146 2014-02-23 2015-02-15 Taxi sharing method and system and server WO2015124106A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410059643.3 2014-02-23
CN201410059643.3A CN104332046A (en) 2014-02-23 2014-02-23 Taxi pooling method, system and server

Publications (1)

Publication Number Publication Date
WO2015124106A1 true WO2015124106A1 (en) 2015-08-27

Family

ID=52406765

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/073146 WO2015124106A1 (en) 2014-02-23 2015-02-15 Taxi sharing method and system and server

Country Status (2)

Country Link
CN (1) CN104332046A (en)
WO (1) WO2015124106A1 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108074050A (en) * 2018-02-13 2018-05-25 广州小享科技有限公司 A kind of share-car method and system based on flight
CN109523294A (en) * 2018-10-10 2019-03-26 广东工业大学 A kind of taxi sharing charging method based on husky Puli's algorithm
CN111523968A (en) * 2015-11-26 2020-08-11 滴滴（中国）科技有限公司 Order splicing method and equipment
EP3607525A4 (en) * 2017-04-03 2021-01-27 Uber Technologies, Inc. Coordinating travel on a public transit system and a travel coordination system

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104332046A (en) * 2014-02-23 2015-02-04 曾昭兴 Taxi pooling method, system and server
CN104931063B (en) * 2015-04-29 2020-08-11 腾讯科技（深圳）有限公司 Path planning method
TWI596565B (en) * 2015-12-11 2017-08-21 建漢科技股份有限公司 Transport System and Method
EP3320492A1 (en) 2016-02-24 2018-05-16 Beijing Didi Infinity Technology and Development Co., Ltd. Methods and systems for carpooling
CN107123258A (en) * 2016-02-24 2017-09-01 滴滴（中国）科技有限公司 Order allocation method and device
CN107292692A (en) * 2016-04-01 2017-10-24 滴滴（中国）科技有限公司 Share-car method and system
CN105702021B (en) * 2016-04-13 2018-01-05 广州市沃希信息科技有限公司 Method, system and server are sent in a kind of express delivery based on taxi with charge free
CN105787859A (en) * 2016-04-13 2016-07-20 广州市沃希信息科技有限公司 Method and system for moving housing based on taxi
CN106373385A (en) * 2016-10-12 2017-02-01 苏州大通多宝软件技术有限公司 Taxi hailing appointment method and system based on driving route
CN107289960A (en) * 2017-07-15 2017-10-24 东莞市华睿电子科技有限公司 A kind of method and system of share-car path navigation
CN109426875A (en) * 2017-08-21 2019-03-05 深圳富泰宏精密工业有限公司 Share-car device and method
JP7040355B2 (en) * 2018-08-09 2022-03-23 トヨタ自動車株式会社 Information processing equipment and information processing methods, programs
JP7047680B2 (en) * 2018-09-04 2022-04-05 トヨタ自動車株式会社 Information processing equipment, information processing methods and programs
CN111353837A (en) * 2018-12-20 2020-06-30 北京嘀嘀无限科技发展有限公司 Car pooling method and system and computer readable medium
CN109781128A (en) * 2019-01-14 2019-05-21 闽江学院 A kind of method and device for planning travel route
CN109781127A (en) * 2019-01-14 2019-05-21 闽江学院 A kind of air navigation aid and device based on vehicle platform
CN110702131B (en) * 2019-09-06 2021-06-04 杭州飞步科技有限公司 Data processing method and device

Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070276595A1 (en) * 2006-05-25 2007-11-29 Survey People Corp. Method of selective ride-sharing among multiple users along an optimized travel route
CN101355714A (en) * 2007-07-24 2009-01-28 梁宇杰 System and method for real time pooling vehicle
CN101383089A (en) * 2008-10-15 2009-03-11 梁宇杰 Vehicle matching scheduling system and method
US20100211401A1 (en) * 2009-02-16 2010-08-19 Williams David M Transportation System
CN102252687A (en) * 2011-07-06 2011-11-23 广东威创视讯科技股份有限公司 Method and device for acquiring fastest running path of vehicle
CN102353381A (en) * 2011-07-06 2012-02-15 广东威创视讯科技股份有限公司 Method and device for obtaining optimal path to hurry to scene of traffic accident
CN102867410A (en) * 2012-09-21 2013-01-09 李明康 Method for implementing intelligent interactive service between taxi driver and passenger by position service and cloud computation
CN103327439A (en) * 2012-03-19 2013-09-25 上海博路信息技术有限公司 Real-time car-sharing system based on short messages
CN103325046A (en) * 2012-03-19 2013-09-25 上海博路信息技术有限公司 Real-time car-sharing system based on HTML5
CN103327440A (en) * 2012-03-19 2013-09-25 上海博路信息技术有限公司 Real-time car-sharing system based on voice
CN103390344A (en) * 2012-05-09 2013-11-13 深圳华宏联创科技有限公司 Method and system for achieving taxi sharing
CN103546515A (en) * 2012-07-16 2014-01-29 上海***信息技术有限公司 Real-time car-sharing system
CN103971515A (en) * 2014-02-23 2014-08-06 广州市沃希信息科技有限公司 Taxi sharing method and system, and server
CN104217585A (en) * 2014-02-23 2014-12-17 广州市沃希信息科技有限公司 Taxi pooling method, system and server
CN104332047A (en) * 2014-02-23 2015-02-04 曾昭兴 Taxi pooling method, system and server when starting from same place
CN104332046A (en) * 2014-02-23 2015-02-04 曾昭兴 Taxi pooling method, system and server

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4972668B2 (en) * 2009-04-13 2012-07-11 ヤフー株式会社 Carpooling support device, carpooling support method and program
CN102254426B (en) * 2011-07-15 2013-07-10 重庆信科设计有限公司 Real-time interactive taxi calling method
CN202563679U (en) * 2012-05-09 2012-11-28 深圳华宏联创科技有限公司 System for carpooling of taxi
CN102903154B (en) * 2012-10-16 2014-12-10 上海天英微***科技有限公司 Carpooling taxi and carpooling method thereof
CN103473924B (en) * 2013-09-18 2015-06-17 福建工程学院 Private car calling and pooling processing method and system thereof
CN103514738B (en) * 2013-09-18 2015-09-02 福建工程学院 A kind of taxi taking share-car matching process and system thereof by the way

Patent Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070276595A1 (en) * 2006-05-25 2007-11-29 Survey People Corp. Method of selective ride-sharing among multiple users along an optimized travel route
CN101355714A (en) * 2007-07-24 2009-01-28 梁宇杰 System and method for real time pooling vehicle
CN101383089A (en) * 2008-10-15 2009-03-11 梁宇杰 Vehicle matching scheduling system and method
US20100211401A1 (en) * 2009-02-16 2010-08-19 Williams David M Transportation System
CN102252687A (en) * 2011-07-06 2011-11-23 广东威创视讯科技股份有限公司 Method and device for acquiring fastest running path of vehicle
CN102353381A (en) * 2011-07-06 2012-02-15 广东威创视讯科技股份有限公司 Method and device for obtaining optimal path to hurry to scene of traffic accident
CN103325046A (en) * 2012-03-19 2013-09-25 上海博路信息技术有限公司 Real-time car-sharing system based on HTML5
CN103327439A (en) * 2012-03-19 2013-09-25 上海博路信息技术有限公司 Real-time car-sharing system based on short messages
CN103327440A (en) * 2012-03-19 2013-09-25 上海博路信息技术有限公司 Real-time car-sharing system based on voice
CN103390344A (en) * 2012-05-09 2013-11-13 深圳华宏联创科技有限公司 Method and system for achieving taxi sharing
CN103546515A (en) * 2012-07-16 2014-01-29 上海***信息技术有限公司 Real-time car-sharing system
CN102867410A (en) * 2012-09-21 2013-01-09 李明康 Method for implementing intelligent interactive service between taxi driver and passenger by position service and cloud computation
CN103971515A (en) * 2014-02-23 2014-08-06 广州市沃希信息科技有限公司 Taxi sharing method and system, and server
CN104217585A (en) * 2014-02-23 2014-12-17 广州市沃希信息科技有限公司 Taxi pooling method, system and server
CN104332047A (en) * 2014-02-23 2015-02-04 曾昭兴 Taxi pooling method, system and server when starting from same place
CN104332046A (en) * 2014-02-23 2015-02-04 曾昭兴 Taxi pooling method, system and server

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111523968A (en) * 2015-11-26 2020-08-11 滴滴（中国）科技有限公司 Order splicing method and equipment
CN111523968B (en) * 2015-11-26 2023-11-21 滴滴（中国）科技有限公司 Method and equipment for spelling bill
EP3607525A4 (en) * 2017-04-03 2021-01-27 Uber Technologies, Inc. Coordinating travel on a public transit system and a travel coordination system
US11965746B2 (en) 2017-04-03 2024-04-23 Uber Technologies, Inc. Coordinating travel on a public transit system and a travel coordination system
CN108074050A (en) * 2018-02-13 2018-05-25 广州小享科技有限公司 A kind of share-car method and system based on flight
CN109523294A (en) * 2018-10-10 2019-03-26 广东工业大学 A kind of taxi sharing charging method based on husky Puli's algorithm

Also Published As

Publication number Publication date
CN104332046A (en) 2015-02-04

Similar Documents

Publication Publication Date Title
WO2015124106A1 (en) Taxi sharing method and system and server
US10706659B2 (en) Facilitating direct rider-driver pairing
WO2015124105A1 (en) Taxi sharing method and system for same origin and server
CN103971515B (en) A kind of taxi share-car method, system and server
US20170213273A1 (en) Customer-centered transportation aggregator
US20180091604A1 (en) Service information and configuration user interface
CN102637359B (en) Taxi sharing cluster optimization system based on complex road network and optimization method thereof
CN105279955B (en) A kind of share-car method and apparatus
CN104464275B (en) A kind of share-car method based on many taxis, system and server
CN104217585A (en) Taxi pooling method, system and server
CN104794886A (en) System and method for estimating taxi fee in networked taxi renting system
JP6669706B2 (en) Vehicle sharing support system
CN112262418A (en) Vehicle management system and vehicle management method
CN111882107B (en) Driver and passenger matching method based on automatic driving shared taxi system
CN106441325A (en) System and method for joint transport navigation
CN110956351A (en) Order allocation method and device, server and computer readable storage medium
JP6439251B2 (en) Vehicle management system and vehicle management method
CN106558159B (en) Carpooling method and device
JP2020166754A (en) Information processor, mobile object, program and method
Lin et al. A cloud computing framework for real-time carpooling services
JP6333341B2 (en) Information processing apparatus, search area setting method, and program
CN113379159A (en) Taxi driver passenger-searching route recommendation method based on gray model and Markov decision process
CN104867321A (en) Taxi sharing method for passengers starting from same place, system and server
JP7448376B2 (en) Vehicle sharing support system and vehicle sharing support method
WO2013044319A1 (en) Method and system for coordinating usage of vehicles in a transport network

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15752469

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205N DATED 02-11-2016)

122 Ep: pct application non-entry in european phase

Ref document number: 15752469

Country of ref document: EP

Kind code of ref document: A1