WO2015124106A1 - Procédé, système et serveur de partage de taxi - Google Patents

Procédé, système et serveur de partage de taxi 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
English (en)
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/fr

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

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

Abstract

La présente invention concerne un procédé de partage de taxi, qui comprend les étapes consistant à acquérir des informations d'origine et des informations de destination d'un premier passager et à générer un premier itinéraire routier; à acquérir des informations d'origine et des informations de destination d'une pluralité de seconds passagers et à générer une pluralité de seconds itinéraires routiers; et si un itinéraire parmi les seconds itinéraires routiers générés coïncide avec le premier itinéraire routier, à donner une invite de partage de taxi. Le procédé peut résoudre le problème selon lequel beaucoup d'argent et de temps sont dépensés en termes de partage de taxi en raison de la diversité des destinations et permet une meilleure utilisation des ressources de taxi, afin de déposer plus de personnes sur la plus courte distance en taxi. La présente invention concerne également un système et un serveur de partage de taxi.
PCT/CN2015/073146 2014-02-23 2015-02-15 Procédé, système et serveur de partage de taxi WO2015124106A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410059643.3 2014-02-23
CN201410059643.3A CN104332046A (zh) 2014-02-23 2014-02-23 一种计程车拼车方法、***及服务器

Publications (1)

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

Family

ID=52406765

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/073146 WO2015124106A1 (fr) 2014-02-23 2015-02-15 Procédé, système et serveur de partage de taxi

Country Status (2)

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

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108074050A (zh) * 2018-02-13 2018-05-25 广州小享科技有限公司 一种基于航班的拼车方法及***
CN109523294A (zh) * 2018-10-10 2019-03-26 广东工业大学 一种基于沙普利算法的出租车拼车计费方法
CN111523968A (zh) * 2015-11-26 2020-08-11 滴滴（中国）科技有限公司 拼单方法和设备
EP3607525A4 (fr) * 2017-04-03 2021-01-27 Uber Technologies, Inc. Coordination de déplacement sur un système de transport en commun et système de coordination de déplacement

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104332046A (zh) * 2014-02-23 2015-02-04 曾昭兴 一种计程车拼车方法、***及服务器
CN104931063B (zh) * 2015-04-29 2020-08-11 腾讯科技（深圳）有限公司 路径规划方法
TWI596565B (zh) * 2015-12-11 2017-08-21 建漢科技股份有限公司 運輸規劃系統及方法
AU2016102414A4 (en) 2016-02-24 2020-04-30 Beijing Didi Infinity Technology And Development Co., Ltd. Methods and systems for carpooling
CN107123258A (zh) * 2016-02-24 2017-09-01 滴滴（中国）科技有限公司 订单分配方法及装置
CN107292692A (zh) * 2016-04-01 2017-10-24 滴滴（中国）科技有限公司 拼车方法和***
CN105702021B (zh) * 2016-04-13 2018-01-05 广州市沃希信息科技有限公司 一种基于计程车的快递派送方法、***及服务器
CN105787859A (zh) * 2016-04-13 2016-07-20 广州市沃希信息科技有限公司 一种基于计程车的搬家方法及搬家***
CN106373385A (zh) * 2016-10-12 2017-02-01 苏州大通多宝软件技术有限公司 基于行驶路线的出租车预约招车方法及***
CN107289960A (zh) * 2017-07-15 2017-10-24 东莞市华睿电子科技有限公司 一种拼车路径导航的方法及***
CN109426875A (zh) * 2017-08-21 2019-03-05 深圳富泰宏精密工业有限公司 拼车装置及方法
JP7040355B2 (ja) * 2018-08-09 2022-03-23 トヨタ自動車株式会社 情報処理装置及び情報処理方法、プログラム
JP7047680B2 (ja) * 2018-09-04 2022-04-05 トヨタ自動車株式会社 情報処理装置、情報処理方法及びプログラム
CN111353837A (zh) * 2018-12-20 2020-06-30 北京嘀嘀无限科技发展有限公司 一种拼车方法、***及计算机可读介质
CN109781128A (zh) * 2019-01-14 2019-05-21 闽江学院 一种规划行驶路线的方法及装置
CN109781127A (zh) * 2019-01-14 2019-05-21 闽江学院 一种基于汽车平台的导航方法及装置
CN110702131B (zh) * 2019-09-06 2021-06-04 杭州飞步科技有限公司 数据处理方法及装置

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 (zh) * 2007-07-24 2009-01-28 梁宇杰 一种实时拼车***和方法
CN101383089A (zh) * 2008-10-15 2009-03-11 梁宇杰 一种车辆匹配调度***和方法
US20100211401A1 (en) * 2009-02-16 2010-08-19 Williams David M Transportation System
CN102252687A (zh) * 2011-07-06 2011-11-23 广东威创视讯科技股份有限公司 获取车辆最快行驶路径的方法与装置
CN102353381A (zh) * 2011-07-06 2012-02-15 广东威创视讯科技股份有限公司 获取赶往交通事故现场最优路径的方法与装置
CN102867410A (zh) * 2012-09-21 2013-01-09 李明康 通过位置服务和云计算实现出租车司乘智能交互服务方法
CN103327440A (zh) * 2012-03-19 2013-09-25 上海博路信息技术有限公司 一种基于语音的实时拼车***
CN103325046A (zh) * 2012-03-19 2013-09-25 上海博路信息技术有限公司 一种基于html5的实时拼车***
CN103327439A (zh) * 2012-03-19 2013-09-25 上海博路信息技术有限公司 一种基于短信的实时拼车***
CN103390344A (zh) * 2012-05-09 2013-11-13 深圳华宏联创科技有限公司 实现出租车拼车的方法及***
CN103546515A (zh) * 2012-07-16 2014-01-29 上海***信息技术有限公司 一种实时拼车***
CN103971515A (zh) * 2014-02-23 2014-08-06 广州市沃希信息科技有限公司 一种计程车拼车方法、***及服务器
CN104217585A (zh) * 2014-02-23 2014-12-17 广州市沃希信息科技有限公司 一种计程车拼车方法、***及服务器
CN104332046A (zh) * 2014-02-23 2015-02-04 曾昭兴 一种计程车拼车方法、***及服务器
CN104332047A (zh) * 2014-02-23 2015-02-04 曾昭兴 一种同地点出发的计程车拼车方法、***及服务器

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4972668B2 (ja) * 2009-04-13 2012-07-11 ヤフー株式会社 相乗り支援装置、相乗り支援方法およびプログラム
CN102254426B (zh) * 2011-07-15 2013-07-10 重庆信科设计有限公司 实时互动的出租车呼车方法
CN202563679U (zh) * 2012-05-09 2012-11-28 深圳华宏联创科技有限公司 实现出租车拼车的***
CN102903154B (zh) * 2012-10-16 2014-12-10 上海天英微***科技有限公司 拼车用出租车及其拼车方法
CN103514738B (zh) * 2013-09-18 2015-09-02 福建工程学院 一种出租车叫车拼车顺路匹配方法及其***
CN103473924B (zh) * 2013-09-18 2015-06-17 福建工程学院 一种私家车叫车拼车处理方法及其***

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 (zh) * 2007-07-24 2009-01-28 梁宇杰 一种实时拼车***和方法
CN101383089A (zh) * 2008-10-15 2009-03-11 梁宇杰 一种车辆匹配调度***和方法
US20100211401A1 (en) * 2009-02-16 2010-08-19 Williams David M Transportation System
CN102252687A (zh) * 2011-07-06 2011-11-23 广东威创视讯科技股份有限公司 获取车辆最快行驶路径的方法与装置
CN102353381A (zh) * 2011-07-06 2012-02-15 广东威创视讯科技股份有限公司 获取赶往交通事故现场最优路径的方法与装置
CN103325046A (zh) * 2012-03-19 2013-09-25 上海博路信息技术有限公司 一种基于html5的实时拼车***
CN103327440A (zh) * 2012-03-19 2013-09-25 上海博路信息技术有限公司 一种基于语音的实时拼车***
CN103327439A (zh) * 2012-03-19 2013-09-25 上海博路信息技术有限公司 一种基于短信的实时拼车***
CN103390344A (zh) * 2012-05-09 2013-11-13 深圳华宏联创科技有限公司 实现出租车拼车的方法及***
CN103546515A (zh) * 2012-07-16 2014-01-29 上海***信息技术有限公司 一种实时拼车***
CN102867410A (zh) * 2012-09-21 2013-01-09 李明康 通过位置服务和云计算实现出租车司乘智能交互服务方法
CN103971515A (zh) * 2014-02-23 2014-08-06 广州市沃希信息科技有限公司 一种计程车拼车方法、***及服务器
CN104217585A (zh) * 2014-02-23 2014-12-17 广州市沃希信息科技有限公司 一种计程车拼车方法、***及服务器
CN104332046A (zh) * 2014-02-23 2015-02-04 曾昭兴 一种计程车拼车方法、***及服务器
CN104332047A (zh) * 2014-02-23 2015-02-04 曾昭兴 一种同地点出发的计程车拼车方法、***及服务器

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111523968A (zh) * 2015-11-26 2020-08-11 滴滴（中国）科技有限公司 拼单方法和设备
CN111523968B (zh) * 2015-11-26 2023-11-21 滴滴（中国）科技有限公司 拼单方法和设备
EP3607525A4 (fr) * 2017-04-03 2021-01-27 Uber Technologies, Inc. Coordination de déplacement sur un système de transport en commun et système de coordination de déplacement
US11965746B2 (en) 2017-04-03 2024-04-23 Uber Technologies, Inc. Coordinating travel on a public transit system and a travel coordination system
CN108074050A (zh) * 2018-02-13 2018-05-25 广州小享科技有限公司 一种基于航班的拼车方法及***
CN109523294A (zh) * 2018-10-10 2019-03-26 广东工业大学 一种基于沙普利算法的出租车拼车计费方法

Also Published As

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

Similar Documents

Publication Publication Date Title
WO2015124106A1 (fr) Procédé, système et serveur de partage de taxi
WO2015124105A1 (fr) Procédé et système de partage de taxi pour le même lieu de départ, et serveur
CN103971515B (zh) 一种计程车拼车方法、***及服务器
US20170213273A1 (en) Customer-centered transportation aggregator
US20180091604A1 (en) Service information and configuration user interface
CN105279955B (zh) 一种拼车方法及设备
JP5935887B2 (ja) オンデマンド車両運行管理装置、オンデマンド車両運行管理方法及びオンデマンド車両運行管理システム
CA3059762A1 (fr) Facilitation d'appariement direct entre conducteurs et passagers pour zones de sortie en masse
CN108876156A (zh) 拼车及用户订单处理方法、***及所适用的设备
CN104464275B (zh) 一种基于多计程车的拼车方法、***及服务器
CN104217585A (zh) 一种计程车拼车方法、***及服务器
CN104794886A (zh) 网络租车***中打车费用预估***和方法
JP6669706B2 (ja) 車両乗合支援システム
CN111882107B (zh) 一种基于自动驾驶共享出租车***的司乘匹配方法
CN112262418A (zh) 车辆管理***和车辆管理方法
CN110956351A (zh) 一种订单分配方法及装置、服务器、计算机可读存储介质
JP6439251B2 (ja) 車両管理システム及び車両管理方法
CN106558159B (zh) 一种拼车方法和装置
JP2020166754A (ja) 情報処理装置、移動体、プログラム及び方法
Lin et al. A cloud computing framework for real-time carpooling services
JP6333341B2 (ja) 情報処理装置、探索領域設定方法及びプログラム
CN113379159A (zh) 基于灰色模型和马尔可夫决策过程的出租车司机寻客路线推荐方法
CN104867321A (zh) 一种同地点出发的计程车拼车方法、***及服务器
JP2022021873A (ja) 情報処理装置、情報処理方法、およびプログラム
JP7448376B2 (ja) 車両乗合支援システム及び車両乗合支援方法

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