CN103971515B - A kind of taxi share-car method, system and server - Google Patents
A kind of taxi share-car method, system and server Download PDFInfo
- Publication number
- CN103971515B CN103971515B CN201410170751.8A CN201410170751A CN103971515B CN 103971515 B CN103971515 B CN 103971515B CN 201410170751 A CN201410170751 A CN 201410170751A CN 103971515 B CN103971515 B CN 103971515B
- Authority
- CN
- China
- Prior art keywords
- path
- passenger
- ride
- information
- share
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention provides a kind of taxi share-car method, comprise step: the origin information and the endpoint information that obtain the first passenger, generate first and to ride path; Obtain origin information and the endpoint information of the second passenger, generate second and to ride path; If the starting point of described second passenger is ridden in path first, and the described second endpoint information of riding path is ridden in path in the first ride endpoint information in path of path or first of riding second, sends share-car and reminds.The present invention is simple to operate, can solve due to destination may difference very large, cause the money of share-car post consumption and time more problem, the resource of taxi can be made again to be transferred better, with minimum enforcement distance, is maximum people service.Meanwhile, the invention provides a kind of taxi Carpooling system and server.
Description
Technical field
The present invention relates to a kind of Urban Transportation field, particularly a kind of taxi share-car method, system and server.
Background technology
Taxi is one of important component part of urban transportation.China at present taxi total amount oneself reach more than 110 ten thousand, yearly passenger carrying capacity reaches 12,000,000,000 person-times, and the consumption of its energy is well imagined, and current most taxi can only carry a side passenger, in most cases passenger also only has a people, therefore causes the waste of resource and serious.On the other hand, when peak period on and off duty, festivals or holidays or bad weather difficult problem of calling a taxi also annoying consumers in general.Taxi share-car can be not only that country saves mass energy, can also bring convenience to consumers in general.
The passenger of current most of share-car, adopts and discusses in pick-up point, and then determines whether carry out share-car.This mode, may produce following problem: 1, owing to being all stranger, compares and is difficult to link up in time; 2, due to destination may difference very large, cause the money of share-car post consumption and the time more; 3, need after share-car to look after other share-cars passenger, often need detour or allow other passengers get off in advance.
Summary of the invention
Based on above-mentioned situation, the present invention proposes a kind of share-car method, taxi driver is after having carried first passenger, and system automatically generates this passenger's first and to ride path; Taxi set out by first ride path leave for destination time, system again by constantly obtaining the riding information (comprising IP address information and end address information) of other passengers, and other passengers IP address information and end address information generate second and to ride path; If the IP address of described second passenger is ridden in path first, and the described second end address information of riding path is ridden in path in the first ride end address information in path of path or first of riding first, sends share-car and reminds.Driver and the first passenger if agree to share-car, just can carry out share-car with the second passenger after obtaining share-car prompting; Can avoid passenger because destination is inconsistent cause ground time and money waste, can make again taxi resource mobilization better, with minimum enforcement distance, be maximum people service.
The invention discloses a kind of taxi share-car method, comprise step: the origin information and the endpoint information that obtain the first passenger, generate first and to ride path; Obtain origin information and the endpoint information of the second passenger, generate second and to ride path; If the starting point of described second passenger is ridden in path first, and the described second endpoint information of riding path is ridden in path in the first ride endpoint information in path of path or first of riding second, sends share-car and reminds.
Generate the method in each path of riding, determine starting point and the terminal of passenger, select the front M bar driving path that origin-to-destination distance is nearest; Each bar driving path in described M bar driving path is divided into some segment paths; calculate the average velocity of taxi through every segment path respectively; calculate the averaging time of taxi through every segment path respectively according to the length in every segment path again, the averaging time in every segment path is added and obtains the total running time of each bar driving path; The running time of more each bar driving path, using the shortest for running time one as path of riding.
If the described second ride path distance that overlaps in path of path and first of riding is the longest, second ride second passenger in path as optimum second passenger using generating this.
When after N-1 passenger loading, continue origin information and the endpoint information of acquisition N passenger, generate N to ride path, if described N-1 rides, the ride path distance that overlaps in path of path and N is the longest, ride the N passenger in path as optimum N passenger using generating this N, described N be greater than 3 integer.
Server again generates described first in real time according to the jam situation of highway at that time and to ride path.
Described first path of riding, path and described second of riding is the preset path stored in database.
The invention also discloses a kind of taxi Carpooling system, comprise first passenger's client, server and second passenger's client, described first passenger's client is for obtaining origin information and the endpoint information of the first passenger; Described second passenger's client is for obtaining origin information and the endpoint information of the second passenger; Described server is used for receiving first passenger's client and the second passenger's client origin information and endpoint information respectively, and generates the corresponding first path and second of riding and to ride path; If the starting point of described second passenger is ridden in path first, and the described second endpoint information of riding path is ridden in path in the first ride endpoint information in path of path or first of riding second, and described server sends share-car and reminds.
When after N-1 passenger loading, origin information and endpoint information is inputted by N passenger, generate N to ride path, if described N-1 rides, the ride path distance that overlaps in path of path and N is the longest, ride the N passenger in path as optimum N passenger using generating this N, described N be greater than 2 integer.
The invention also discloses a kind of taxi Ride-share service device, described server is used for according to the origin information of the first passenger and endpoint information and according to the origin information of the second passenger and endpoint information, and ride path in generation first path and second of riding respectively; When the starting point of described second passenger is ridden in path first, and the described second endpoint information of riding path is ridden in path in the first ride endpoint information in path of path or first of riding second, server sends share-car remind to first passenger's client, second passenger's client.
When after N-1 passenger loading, origin information and endpoint information is inputted by N passenger, generate N to ride path, if described N-1 rides, the ride path distance that overlaps in path of path and N is the longest, ride the N passenger in path as optimum N passenger using generating this N, described N be greater than 2 integer.
Compared to prior art, the present invention is simple to operate, can solve because destination possibility difference is very large, cause the money of share-car post consumption and time more problem, the resource of taxi can be made again to be transferred better, with minimum enforcement distance, is maximum people service.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of a kind of taxi share-car method of the present invention;
Fig. 2 is the route schematic diagram of a kind of taxi share-car embodiment of the method for the present invention;
Fig. 3 is a kind of structural representation of taxi Carpooling system embodiment.
Embodiment
Below in conjunction with better embodiment wherein, the present invention program is described in detail.
As shown in Figure 1, the method in the present embodiment comprises step:
S101: the starting point and the endpoint information that obtain the first passenger, generates first and to ride path;
First passenger takes taxi (acquiescence knows origin information) at place O, and endpoint information is informed cabdriver.Now, by the mobile phone of first passenger's client (mobile phone) or cabdriver or other communicating terminals, the starting point of the first passenger and endpoint information are uploaded to server, server obtains the content of database, and empirically value generation first is ridden path.As preferred example, server also can generate first in real time according to the jam situation of highway at that time and to ride path.Generally speaking; passenger can consider various factors when taking taxi; wherein time factor and price factor are major consideration; the present embodiment mainly considers time factor; it generates the method in each path of riding; determine starting point and the terminal of passenger, select the front M bar driving path that origin-to-destination distance is nearest; Each bar driving path in described M bar driving path is divided into some segment paths; calculate the average velocity of taxi through every segment path respectively; calculate the averaging time of taxi through every segment path respectively according to the length in every segment path again, the averaging time in every segment path is added and obtains the total running time of each bar driving path; The running time of more each bar driving path, using the shortest for running time one as the fastest driving path (namely electing path by bus as).
S102: the origin information and the endpoint information that obtain the second passenger, generates second and to ride path.
When taxi carries after the first passenger sets out, constantly receive origin information and the endpoint information of N number of second passenger around on the way, and generate N number of corresponding second according to these information and to ride path.Because taxi can generate different share-car combinations according to the situation of reality after driving, and different share-car combinations is for the first passenger and ensuing second passenger, the path overlapped is longer, and the cost of its waste will be fewer, and then improve the utilization factor of taxi resource.So choose the meaning that optimum share-car combination has outbalance in several share-cars combination.In addition, first path of riding, path and second of riding is the preset path stored in database, the empirical data that can recall from database after the information that passenger inputs starting point and terminal, the general impact not considering environmental factor at that time, if consideration environmental factor, the fastest driving path in S101 can be adopted.
S103: if the starting point of described second passenger is ridden in path first, and the described second endpoint information of riding path is ridden in path or the first endpoint information of riding path is ridden in path second first, sends share-car and reminds.
As shown in Figure 2, the first passenger is from place O, and its terminal is A.When the first passenger is after the O of place, on the way, in the origin information of some second passengers received and endpoint information, the starting point B of second passenger is had to ride path (this time driver just need not specially detour meet that passenger) first, and his the formed second terminal C riding path rides in path first, that driver can in the way sending the first passenger, with regard to direct, second passenger is delivered to destination C, only need the time of twice parking, the coincidence path of the first passenger and the second passenger is BC herein.Compare existing share-car, this method will greatly improve the resource utilization after share-car.And the more excellent selection of resource is that the destination of the second passenger is C ', the first terminal A riding path rides in path second.At this moment, driver can in the way sending the second passenger, and just the direct coincidence path first passenger being delivered to destination A(the first passenger and the second passenger is herein BA), be so more conducive to improving resource utilization.Both of these case only needs to meet wherein a kind of, and system can send share-car and remind.At this moment, all qualified situation of multiple second passenger may be produced.Because taxi can only carry 4 passengers at every turn, so when passenger is more, need the arrangement N number of second passenger being carried out to priority, and the second passenger that screening is wherein optimum.
In the mode of foregoing description, first passenger is longer with the path distance that overlaps of the second passenger, then its resource utilization can be higher, therefore, in the middle of several second passengers, if its second ride path distance that overlaps in path of path and first of riding produced is the longest, as optimum second passenger, (priority prompting is set when pointing out using generating this second second passenger riding path, first passenger can allow the taxi time according to priority carry out share-car under normal conditions), send share-car to optimum second passenger and the first passenger and remind or request.If they agree to, cabdriver can pick optimum second passenger, the utilization factor of the resource of taxi can be improved, if the first passenger or optimum second passenger do not agree to, then driver does not go to accept optimum second passenger, search suboptimum second passenger can be continued, until arrive the destination of the first passenger.If the first passenger does not agree at the very start certainly, then close this share-car function.
Because a taxi can allow at most to carry four people simultaneously, in the share-car stage, can how simultaneously someone get on the bus and have people to get off again, so a taxi can take N number of people, N>2 in theory.People is more, means that coincidence path will be more, and the average unit cost of taxi will be reduced further.
When after N-1 passenger loading, continue origin information and the endpoint information of acquisition N passenger, generate N to ride path, if described N-1 rides, the ride path distance that overlaps in path of path and N is the longest, ride the N passenger in path as optimum N passenger using generating this N, N be here be greater than 2 integer.After many people get on the bus, the situation more complicated of generation, can adopt the shortest time path or lowest price path to be optimal path.
The structural representation of a kind of taxi Carpooling system embodiment of the present invention has been shown in Fig. 2.
A kind of taxi Carpooling system, comprising: first passenger's client, server and second passenger's client, first passenger's client is for obtaining origin information and the endpoint information of the first passenger; Second passenger's client obtains origin information and the endpoint information of the second passenger; Server is used for receiving first passenger's client and the second passenger's client origin information and endpoint information respectively, and generates the corresponding first path and second of riding and to ride path; If the starting point of described second passenger is ridden in path first, and the described second endpoint information of riding path is ridden in path in the first ride endpoint information in path of path or first of riding second, server sends share-car remind to first passenger's client, second passenger's client.When there being N number of passenger's client, server can send share-car to N number of passenger's client and remind.
The situation that N number of passenger carries out share-car is had when disclosing in practical application in the inventive method is implemented, also use N passenger's client corresponding with it in this enforcement, also consistent with the benefit that said method embodiment is brought when share-car, namely the path distance that overlaps of client that uses with the second passenger of the first passenger is longer, then its resource utilization can be higher.
When after N-1 passenger loading, origin information and endpoint information is inputted by N passenger, generate N to ride path, if described N-1 rides, the ride path distance that overlaps in path of path and N is the longest, ride the N passenger in path as optimum N passenger using generating this N, described N be greater than 2 integer.The corresponding optimum N passenger's client of optimum N passenger.
In addition, the invention also discloses a kind of taxi Ride-share service device, described server is used for inputting origin information and endpoint information according to the first passenger and inputting origin information and endpoint information according to the second passenger, and ride path in generation first path and second of riding respectively; When the starting point of described second passenger is ridden in path first, and the described second endpoint information of riding path is ridden in path in the first ride endpoint information in path of path or first of riding second, server sends share-car remind to first passenger's client, second passenger's client.The setting of by bus path here, origin information and endpoint information is identical with components of system as directed of the present invention, does not do repeat specification here.
When after N-1 passenger loading, origin information and endpoint information is inputted by N passenger, generate N to ride path, if described N-1 rides, the ride path distance that overlaps in path of path and N is the longest, ride the N passenger in path as optimum N passenger using generating this N, described N be greater than 2 integer.Book server quotes the problem that optimum N passenger solves and the effect brought is identical with the content in the inventive method embodiment, no longer launches to describe herein.
The above embodiment only have expressed embodiments of the present invention, and it describes comparatively concrete and detailed, but therefore can not be interpreted as the restriction to the scope of the claims of the present invention.It should be pointed out that for the person of ordinary skill of the art, without departing from the inventive concept of the premise, can also make some distortion and improvement, these all belong to protection scope of the present invention.Therefore, the protection domain of patent of the present invention should be as the criterion with claims.
Claims (10)
1. a taxi share-car method, is characterized in that, comprises step: the origin information and the endpoint information that obtain the first passenger, generates first and to ride path; Obtain origin information and the endpoint information of some second passengers, generate some second and to ride path; If the starting point of described second passenger is ridden in path first, and the described second endpoint information of riding path is ridden in path in the first ride endpoint information in path of path or first of riding second, sends share-car and reminds.
2. share-car method according to claim 1, is characterized in that, generates the method in each path of riding, determines starting point and the terminal of described passenger, selects the front M bar driving path that origin-to-destination distance is nearest; Each bar driving path in described M bar driving path is divided into some segment paths; calculate the average velocity of taxi through every segment path respectively; calculate the averaging time of taxi through every segment path respectively according to the length in every segment path again, the averaging time in every segment path is added and obtains the total running time of each bar driving path; The running time of more each bar driving path, using the shortest for running time one as described in by bus path.
3. share-car method according to claim 1, is characterized in that, if the described second ride path distance that overlaps in path of path and first of riding is the longest, second rides second passenger in path as optimum second passenger using generating this.
4. share-car method according to claim 1, it is characterized in that, when after N-1 passenger loading, continue origin information and the endpoint information of acquisition N passenger, generate N to ride path, if described N-1 rides, the ride path distance that overlaps in path of path and N is the longest, rides the N passenger in path as optimum N passenger using generating this N, described N be greater than 2 integer.
5. the share-car method according to any one of claim 1-4, is characterized in that, server again generates described first in real time according to the jam situation of highway at that time and to ride path.
6. the share-car method according to any one of claim 1-4, is characterized in that, the described first path of riding, path and described second of riding is the preset path stored in database.
7. a taxi Carpooling system, is characterized in that, comprises first passenger's client, server and second passenger's client, and described first passenger's client is for obtaining origin information and the endpoint information of the first passenger; Described second passenger's client is for obtaining origin information and the endpoint information of the second passenger; Described server is used for receiving first passenger's client and the second passenger's client origin information and endpoint information respectively, and generates the corresponding first path and second of riding and to ride path; If the starting point of described second passenger is ridden in path first, and the described second endpoint information of riding path is ridden in path in the first ride endpoint information in path of path or first of riding second, and described server sends share-car and reminds.
8. Carpooling system according to claim 7, it is characterized in that, when after N-1 passenger loading, origin information and endpoint information is inputted by N passenger, generate N to ride path, if described N-1 rides, the ride path distance that overlaps in path of path and N is the longest, rides the N passenger in path as optimum N passenger using generating this N, described N be greater than 2 integer.
9. a taxi Ride-share service device, is characterized in that, described server is used for according to the origin information of the first passenger and endpoint information and according to the origin information of the second passenger and endpoint information, and ride path in generation first path and second of riding respectively; When the starting point of described second passenger is ridden in path first, and the described second endpoint information of riding path is ridden in path in the first ride endpoint information in path of path or first of riding second, server sends share-car remind to first passenger's client, second passenger's client.
10. Ride-share service device according to claim 9, it is characterized in that, when after N-1 passenger loading, origin information and endpoint information is inputted by N passenger, generate N to ride path, if described N-1 rides, the ride path distance that overlaps in path of path and N is the longest, rides the N passenger in path as optimum N passenger using generating this N, described N be greater than 2 integer.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410170751.8A CN103971515B (en) | 2014-02-23 | 2014-04-27 | A kind of taxi share-car method, system and server |
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410059642.9A CN103810843A (en) | 2014-02-23 | 2014-02-23 | Taxi sharing method, system and server |
| CN201410059642.9 | 2014-02-23 | ||
| CN201410170751.8A CN103971515B (en) | 2014-02-23 | 2014-04-27 | A kind of taxi share-car method, system and server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103971515A CN103971515A (en) | 2014-08-06 |
| CN103971515B true CN103971515B (en) | 2015-12-02 |
Family
ID=50707551
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410059642.9A Pending CN103810843A (en) | 2014-02-23 | 2014-02-23 | Taxi sharing method, system and server |
| CN201410170751.8A Active CN103971515B (en) | 2014-02-23 | 2014-04-27 | A kind of taxi share-car method, system and server |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410059642.9A Pending CN103810843A (en) | 2014-02-23 | 2014-02-23 | Taxi sharing method, system and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN103810843A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109781128A (en) * | 2019-01-14 | 2019-05-21 | 闽江学院 | A kind of method and device for planning travel route |
Families Citing this family (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104332046A (en) * | 2014-02-23 | 2015-02-04 | 曾昭兴 | Taxi pooling method, system and server |
| CN104065722A (en) * | 2014-06-23 | 2014-09-24 | 中国联合网络通信集团有限公司 | Taxi joint taking taxi calling method and server |
| CN104104732B (en) * | 2014-07-31 | 2019-09-24 | 浙江翼信科技有限公司 | A kind of method, apparatus and system of pushed information |
| CN104167093B (en) * | 2014-08-04 | 2016-08-17 | 北京嘀嘀无限科技发展有限公司 | Windward driving operation system based on driver's certificate address information |
| CN104269050A (en) * | 2014-10-15 | 2015-01-07 | 西安航天华迅科技有限公司 | Traffic information processing system |
| CN104282145B (en) * | 2014-10-28 | 2016-07-27 | 丁灏 | One station taxi sharing information system and method |
| CN104951513A (en) * | 2015-05-28 | 2015-09-30 | 成都亿邻通科技有限公司 | Method for providing special car carrying |
| US20170169366A1 (en) * | 2015-12-14 | 2017-06-15 | Google Inc. | Systems and Methods for Adjusting Ride-Sharing Schedules and Routes |
| CN107123258A (en) * | 2016-02-24 | 2017-09-01 | 滴滴（中国）科技有限公司 | Order allocation method and device |
| JP6543723B2 (en) | 2016-02-24 | 2019-07-10 | ベイジン ディディ インフィニティ テクノロジー アンド ディベロップメント カンパニー リミティッド | Carpool method and system |
| CN107230091B (en) * | 2016-03-23 | 2020-10-30 | 滴滴（中国）科技有限公司 | Car pooling request order matching 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 |
| CN106022540A (en) * | 2016-06-02 | 2016-10-12 | 深圳市永兴元科技有限公司 | Order processing method and order processing device |
| CN106096764A (en) * | 2016-06-02 | 2016-11-09 | 深圳市永兴元科技有限公司 | order processing method and device |
| CN106022539A (en) * | 2016-06-02 | 2016-10-12 | 深圳市永兴元科技有限公司 | Order processing method and order processing device |
| CN107798403A (en) * | 2016-09-07 | 2018-03-13 | 北京嘀嘀无限科技发展有限公司 | A kind of share-car order processing method, server, terminal device and system |
| CN107844843B (en) * | 2016-09-21 | 2021-04-20 | 北京嘀嘀无限科技发展有限公司 | Order processing method and server |
| CN106373385A (en) * | 2016-10-12 | 2017-02-01 | 苏州大通多宝软件技术有限公司 | Taxi hailing appointment method and system based on driving route |
| CN106767863A (en) * | 2016-12-01 | 2017-05-31 | 广州麦仑信息科技有限公司 | A kind of method and system of share-car trip route navigation |
| CN108629437B (en) * | 2017-03-15 | 2021-04-20 | 北京嘀嘀无限科技发展有限公司 | Method and device for determining carpooling route |
| CN109583605A (en) * | 2017-09-29 | 2019-04-05 | 北京嘀嘀无限科技发展有限公司 | Share-car method and device, computer equipment and readable storage medium storing program for executing |
| CN108510349B (en) * | 2017-11-17 | 2022-11-04 | 广州市沃希信息科技有限公司 | Two-dimensional code-based method and system for renting charge pal |
| CN108197869A (en) * | 2017-12-30 | 2018-06-22 | 惠龙易通国际物流股份有限公司 | A kind of Stream match method, equipment and computer storage media |
| CN108416480A (en) * | 2018-03-23 | 2018-08-17 | 中山市博林树投资管理有限公司 | A kind of intelligence share-car matching process |
| TWI707291B (en) * | 2018-05-14 | 2020-10-11 | 淡江大學 | Car-pool system and method thereof |
| JP7196440B2 (en) * | 2018-07-03 | 2022-12-27 | トヨタ自動車株式会社 | Information processing device and information processing method |
| CN109781127A (en) * | 2019-01-14 | 2019-05-21 | 闽江学院 | A kind of air navigation aid and device based on vehicle platform |
| CN110553659B (en) * | 2019-08-27 | 2021-08-13 | 欧拉信息服务有限公司 | Route determining method and device |
| CN111523702B (en) * | 2020-03-30 | 2023-01-13 | 深圳大学 | Optimization method, system, server and storage medium for taxi-boarding points of network appointment taxi |
| CN112201072A (en) * | 2020-09-30 | 2021-01-08 | 姜锡忠 | Urban traffic path planning method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2180456A1 (en) * | 2007-08-22 | 2010-04-28 | Toyota Jidosha Kabushiki Kaisha | Traffic information creation method, traffic information creation device, and navigation system |
| CN102637359A (en) * | 2012-04-24 | 2012-08-15 | 广西工学院 | Taxi sharing cluster optimization system based on complex road network and optimization method thereof |
| CN103259783A (en) * | 2013-04-09 | 2013-08-21 | 安徽科技学院 | Real-time Android mobile terminal carpooling system and method based on SIP conversation and LBS positioning |
| CN103514738A (en) * | 2013-09-18 | 2014-01-15 | 福建工程学院 | Taxi calling and sharing same-route matching method and system |
-
2014
- 2014-02-23 CN CN201410059642.9A patent/CN103810843A/en active Pending
- 2014-04-27 CN CN201410170751.8A patent/CN103971515B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2180456A1 (en) * | 2007-08-22 | 2010-04-28 | Toyota Jidosha Kabushiki Kaisha | Traffic information creation method, traffic information creation device, and navigation system |
| CN102637359A (en) * | 2012-04-24 | 2012-08-15 | 广西工学院 | Taxi sharing cluster optimization system based on complex road network and optimization method thereof |
| CN103259783A (en) * | 2013-04-09 | 2013-08-21 | 安徽科技学院 | Real-time Android mobile terminal carpooling system and method based on SIP conversation and LBS positioning |
| CN103514738A (en) * | 2013-09-18 | 2014-01-15 | 福建工程学院 | Taxi calling and sharing same-route matching method and system |
Non-Patent Citations (1)
| Title |
|---|
| 出租车"拼车"问题研究及其服务系统设计实现;张瑾;《中国优秀硕士学位论文全文数据库 工程科技II辑》;20100215(第02期);第20-21页第2.3.2节 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109781128A (en) * | 2019-01-14 | 2019-05-21 | 闽江学院 | A kind of method and device for planning travel route |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103971515A (en) | 2014-08-06 |
| CN103810843A (en) | 2014-05-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103971515B (en) | A kind of taxi share-car method, system and server | |
| CN104332046A (en) | Taxi pooling method, system and server | |
| CN104217585A (en) | Taxi pooling method, system and server | |
| CN104464275B (en) | A kind of share-car method based on many taxis, system and server | |
| CN104332047B (en) | Taxi share-car method, system and the server set out in a kind of same place | |
| US20180365629A1 (en) | Taxi-based express package delivery method, system and server | |
| WO2016197943A1 (en) | Bicycle management system and control method and apparatus therefor | |
| CN105243836B (en) | A kind of share-car method and apparatus | |
| CN103761873B (en) | Carpooling system and utilize the share-car method of this Carpooling system | |
| US20180204179A1 (en) | Carpool-based package delivery method, system, and server | |
| CN104052802B (en) | Mobile social networking based on vehicle communication realizes system and method | |
| CN104376604B (en) | A kind of charging method based on taxi share-car, system and server | |
| WO2016008391A1 (en) | Method and system for booking taxi for third party in online taxi hiring system | |
| CN103996290A (en) | Taxi service providing method, server and system | |
| CN104167093A (en) | Hitchhiking operation system based on driver address information | |
| CN102202053A (en) | Taxi sharing system and method based on LBS and SNS | |
| CN105976605A (en) | Automatic car sharing method based on internet of vehicles | |
| CN106557826A (en) | Many people are used in conjunction with reserving method, client and the system of the shared vehicles | |
| CN105006171A (en) | Urban intelligent parking management system | |
| CN106530004A (en) | Taxi application program recommending method and device | |
| CN104867321B (en) | Taxi share-car method, system and the server that a kind of same place is set out | |
| Nagare et al. | Dynamic carpooling application development on android platform | |
| CN104281914A (en) | Car-pooling system and method based on carbon emission reduction | |
| CN103021173B (en) | Achieving method of intelligent holographic targeted public transportation system | |
| CN106097772A (en) | A kind of road parking place reservation system based on mobile Internet and method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| GR01 | Patent grant | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20151111 Address after: 510530 No. 102, Luogang District, Guangzhou, Guangdong, Qingnian Road Applicant after: Zeng Zhaoxing Address before: 510530, room 81, 207 Lai Hong Road, Luogang District, Guangdong, Guangzhou Applicant before: Guangzhou Woxi Information Technology Co., Ltd. |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20160512 Address after: Two Street East China Development Zone in Guangzhou City, Guangdong province 510000 No. 81 room 326 Patentee after: Guangzhou Woxi Information Technology Co., Ltd. Address before: 510530 No. 102, Luogang District, Guangzhou, Guangdong, Qingnian Road Patentee before: Zeng Zhaoxing |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20170315 Address after: 100089 Beijing, Haidian District, northeast Wang West Road, building 8, No. 34 Patentee after: Unlimited development in science and technology company limited ticks in Beijing Address before: Two Street East China Development Zone in Guangzhou City, Guangdong province 510000 No. 81 room 326 Patentee before: Guangzhou Woxi Information Technology Co., Ltd. |
|
| TR01 | Transfer of patent right |