CN103971515A - Taxi sharing method and system, and server - Google Patents
Taxi sharing method and system, and server Download PDFInfo
- Publication number
- CN103971515A CN103971515A CN201410170751.8A CN201410170751A CN103971515A CN 103971515 A CN103971515 A CN 103971515A CN 201410170751 A CN201410170751 A CN 201410170751A CN 103971515 A CN103971515 A CN 103971515A
- Authority
- CN
- China
- Prior art keywords
- path
- passenger
- bus
- 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.)
- Granted
Links
Abstract
The invention provides a taxi sharing method. The taxi sharing method comprises the steps of obtaining a starting point message and a terminal message of a first passenger, generating a first taxi taking path, obtaining a starting point message and a terminal message of a second passenger, generating a second taxi taking path, and giving a warning of taxi sharing if the starting point of the second passenger is within the first taxi taking path and the terminal message of the second taxi taking path is within the first taxi taking path or the terminal message of the first taxi taking path is within the second taxi taking path. The taxi sharing method is easy to operate, can solve the problem that as the difference of destinations maybe very large, much money and time are spent after taxi sharing, and can also better mobilize resources of taxis, and the taxis can serve more people with the shortest driving path. Meanwhile, the invention provides a taxi sharing system and a 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.Oneself reaches more than 110 ten thousand the current taxi total amount of China, 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, the difficult problem of calling a taxi the in the situation that of peak period on and off duty, festivals or holidays or bad weather is also perplexing 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 in pick-up point and discusses, and then determines whether to carry out share-car.This mode, may produce following problem: 1,, owing to being all stranger, be relatively difficult to link up in time; 2, because destination possibility difference is very large, cause the money of share-car post consumption and time more; 3, after share-car, need to look after other share-cars passenger, often need to 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 being carried after first passenger, and system generates the first path by bus of this passenger automatically; In the time that taxi sets out that by bus destination is left in path by first, system is again by constantly obtaining other passengers' riding information (comprising IP address information and end address information), and other passengers IP address information and end address Information generation second path by bus; If described the second passenger's IP address first by bus in path, and described second by bus path end address information first by bus path or first by bus the end address information in path, send share-car and remind by bus in path first.Driver and the first passenger obtain after share-car prompting, if agree to share-car, just can carry out share-car with the second passenger; Can avoid passenger because the inconsistent ground time and money that causes in destination is wasted, can make again taxi resource mobilization better, with minimum enforcement distance, be maximum people's services.
The invention discloses a kind of taxi share-car method, comprise step: obtain the first passenger's origin information and endpoint information, generation first path by bus; Obtain the second passenger's origin information and endpoint information, generation second path by bus; If described the second passenger's starting point first by bus in path, and described second by bus path endpoint information first by bus path or first by bus the endpoint information in path, send share-car and remind by bus in path second.
Generate the method in each path of riding, determine passenger's starting point and terminal, select the nearest front M bar driving path of origin-to-destination distance; Each driving path in described M bar driving path is divided into some segments path; calculate respectively the average velocity of taxi through every segment path; calculate respectively again the averaging time in taxi process every segment path according to the length in every segment path, obtain each the running time that driving path is total by being added the averaging time in every segment path; The running time of more each driving path, using the shortest running time one as the path of riding.
If described second by bus the path distance that overlaps in path is the longest by bus with first in path, second ride second passenger in path as optimum the second passenger using generating this.
When after N-1 passenger loading, continue to obtain N passenger's origin information and endpoint information, generate the N path of riding, 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, and described N is greater than 3 integer.
Server generates the described first path by bus again in real time according to the jam situation of highway at that time.
Described first by bus the path of riding, path and described second be the preset path of storing 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 the first passenger's origin information and endpoint information; Described second passenger's client is for obtaining the second passenger's origin information and endpoint information; Described server is for receiving respectively first passenger's client and the second passenger's client origin information and endpoint information, and generates the corresponding first path of riding, path and second by bus; If described the second passenger's starting point first by bus in path, and described second by bus the endpoint information in path first, the endpoint information in path is second by bus in path by bus in path or first by bus, described server sends share-car and reminds.
When after N-1 passenger loading, input origin information and endpoint information by N passenger, generate the N path of riding, 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, and described N is greater than 2 integer.
The invention also discloses a kind of taxi share-car server, described server is for according to the first passenger's origin information and endpoint information and according to the second passenger's origin information and endpoint information, generates respectively the first path of riding, path and second by bus; When described the second passenger's starting point is ridden in path first, and described second by bus the endpoint information in path first, the endpoint information in path is second by bus in path by bus in path or first by bus, server sends share-car to first passenger's client, second passenger's client and reminds.
When after N-1 passenger loading, input origin information and endpoint information by N passenger, generate the N path of riding, 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, and described N is 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 money and the more problem of time of share-car post consumption, can make again the resource of taxi be transferred better, with minimum enforcement distance, be maximum people's services.
Brief description of the drawings
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 the structural representation of a kind of taxi Carpooling system embodiment.
Embodiment
Below in conjunction with preferred embodiments wherein, the present invention program is described in detail.
As shown in Figure 1, the method in the present embodiment comprises step:
S101: obtain the first passenger's starting point and endpoint information, generation first path by bus;
The first passenger takes taxi (acquiescence is known origin information) at place O, and endpoint information is informed to cabdriver.Now, can the first passenger's starting point and endpoint information be uploaded to server by first passenger's client (mobile phone) or cabdriver's mobile phone or other communicating terminals, server obtains the content of database, according to empirical value generation first path by bus.As preferred example, server also can generate the first path by bus in real time according to the jam situation of highway at that time.Generally speaking; passenger can consider various factors in taking taxi; wherein time factor and price factor are major consideration; the present embodiment is mainly considered time factor; it generates the method in each path of riding; determine passenger's starting point and terminal, select the nearest front M bar driving path of origin-to-destination distance; Each driving path in described M bar driving path is divided into some segments path; calculate respectively the average velocity of taxi through every segment path; calculate respectively again the averaging time in taxi process every segment path according to the length in every segment path, obtain each the running time that driving path is total by being added the averaging time in every segment path; The running time of more each driving path, using the shortest running time one as the fastest driving path (electing path by bus as).
S102: obtain the second passenger's origin information and endpoint information, generation second path by bus.
After taxi carries the first passenger and sets out, constantly receive N around the second passenger's origin information and endpoint information on the way, and according to these Information generations N corresponding second path by bus.Because taxi can generate different share-car combinations according to actual situation after driving, and different share-cars is combined for the first passenger and ensuing the second passenger, the path overlapping is longer, and the cost of its waste will be fewer, and then improved the utilization factor of taxi resource.Combine the meaning with outbalance so choose optimum share-car in several share-car combinations.In addition, first by bus the path of riding, path and second be the preset path of storing in database, the empirical data that can recall from database after passenger inputs the information of starting point and terminal, the general impact of not considering environmental factor at that time, if consideration environmental factor, can adopt the fastest driving path in S101.
S103: if described the second passenger's starting point first by bus in path, and described second by bus path endpoint information first by bus in path or first by bus the endpoint information in path, send share-car and remind by bus in path second.
As shown in Figure 2, the first passenger is from place O, and its terminal is A.When the first passenger is from the O of place, on the way, in some the second passengers' that receive origin information and endpoint information, the starting point B that has second passenger is at first path (this time driver just need not specially detour and meet that passenger) by bus, and his the second terminal C that rides path forming rides in path first, that driver can be sending in the first passenger's way, just directly the second passenger is delivered to destination C, the time that only needs twice parking, the first passenger and the second passenger's coincidence path is BC herein.Compare existing share-car, this method is by the resource utilization greatly improving after share-car.And the more excellent selection of resource is, the second passenger's destination is C ', and the first terminal A that rides path rides in path second.At this moment, driver can be sending in the second passenger's way, just directly the first passenger is delivered to destination A(herein the first passenger and the second passenger's coincidence path be BA), be so more conducive to improve resource utilization.Both of these case only need to meet wherein a kind of, and system can be sent share-car and remind.At this moment, may produce all qualified situations of multiple the second passengers.Because taxi can only carry 4 passengers at every turn, thus in the situation that passenger is more, need to carry out the arrangement of priority to N the second passenger, and wherein the second passenger of optimum of screening.
In the mode of foregoing description, the first passenger is longer with the second passenger's the path distance that overlaps, its resource utilization can be higher, therefore, in the middle of several second passengers, if its production second by bus the ride path distance that overlaps in path of path and first is the longest, (priority prompting is set in the time pointing out using generating this second second passenger who rides path as optimum the second passenger, in normal situation, the first passenger can allow the taxi time according to priority carry out share-car), send share-car prompting or request to optimum the second passenger and the first passenger.If they agree to, cabdriver can pick optimum the second passenger, the utilization factor of the resource of taxi can be improved, if the first passenger or optimum the second passenger disagree with, driver does not go to accept optimum the second passenger, can continue to search for suboptimum the second passenger, until arrive the first passenger's destination.If the first passenger disagrees with at the very start certainly, 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 be taken N people, N>2 in theory.People is more, means that coincidence path will be more, and the average unit cost of taxi will further be reduced.
When after N-1 passenger loading, continue to obtain N passenger's origin information and endpoint information, generate the N path of riding, 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, and the N is here greater than 2 integer.Due to after many people get on the bus, the situation more complicated of generation, can adopt the shortest time path or lowest price path is 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, and first passenger's client is for obtaining the first passenger's origin information and endpoint information; Second passenger's client is obtained the second passenger's origin information and endpoint information; Server is for receiving respectively first passenger's client and the second passenger's client origin information and endpoint information, and generates the corresponding first path of riding, path and second by bus; If described the second passenger's starting point is ridden in path first, and described second by bus the endpoint information in path first, the endpoint information in path is second by bus in path by bus in path or first by bus, server sends share-car to first passenger's client, second passenger's client and reminds.In the situation that having N passenger's client, server can send share-car to N passenger's client and remind.
While disclosing in practical application, have the situation that N passenger carries out share-car in the inventive method is implemented, in this enforcement, also use N passenger's client corresponding with it, also the benefit of bringing with said method embodiment in share-car is consistent, the path distance that overlaps of the client that the first passenger uses with the second passenger is longer, and its resource utilization can be higher.
When after N-1 passenger loading, input origin information and endpoint information by N passenger, generate the N path of riding, 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, and described N is 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 share-car server, described server being for inputting origin information and endpoint information and input origin information and endpoint information according to the second passenger according to the first passenger, generates respectively the first path of riding, path and second by bus; When described the second passenger's starting point is ridden in path first, and described second by bus the endpoint information in path first, the endpoint information in path is second by bus in path by bus in path or first by bus, server sends share-car to first passenger's client, second passenger's client and reminds.The setting of path, origin information and endpoint information by bus is here identical with components of system as directed of the present invention, does not do repeat specification here.
When after N-1 passenger loading, input origin information and endpoint information by N passenger, generate the N path of riding, 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, and described N is greater than 2 integer.Book server quotes the problem that optimum N passenger solves and the effect of bringing is identical with the content in the inventive method embodiment, no longer launches to describe herein.
The above embodiment has only expressed embodiments of the present invention, and it describes comparatively concrete and detailed, but can not therefore 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: obtain the first passenger's origin information and endpoint information, generation first path by bus; Obtain some the second passengers' origin information and endpoint information, generate the some second path by bus; If described the second passenger's starting point first by bus in path, and described second by bus path endpoint information first by bus path or first by bus the endpoint information in path, send share-car and remind by bus in path second.
2. share-car method according to claim 1, is characterized in that, generates the method in each path of riding, and determines described passenger's starting point and terminal, selects the nearest front M bar driving path of origin-to-destination distance; Each driving path in described M bar driving path is divided into some segments path; calculate respectively the average velocity of taxi through every segment path; calculate respectively again the averaging time in taxi process every segment path according to the length in every segment path, obtain each the running time that driving path is total by being added the averaging time in every segment path; The running time of more each driving path, using the shortest running time one as described in path by bus.
3. share-car method according to claim 1, is characterized in that, if described second by bus the path distance that overlaps in path is the longest by bus with first in path, second rides second passenger in path as optimum the 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 to obtain N passenger's origin information and endpoint information, generate the N path of riding, 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, and described N is greater than 3 integer.
5. according to the share-car method described in claim 1-4 any one, it is characterized in that, server generates the described first path by bus again in real time according to the jam situation of highway at that time.
6. according to the share-car method described in claim 1-4 any one, it is characterized in that, described first by bus the path of riding, path and described second be the preset path of storing 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 the first passenger's origin information and endpoint information; Described second passenger's client is for obtaining the second passenger's origin information and endpoint information; Described server is for receiving respectively first passenger's client and the second passenger's client origin information and endpoint information, and generates the corresponding first path of riding, path and second by bus; If described the second passenger's starting point first by bus in path, and described second by bus the endpoint information in path first, the endpoint information in path is second by bus in path by bus in path or first by bus, 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, input origin information and endpoint information by N passenger, generate the N path of riding, 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, and described N is greater than 2 integer.
9. a taxi share-car server, is characterized in that, described server is for according to the first passenger's origin information and endpoint information and according to the second passenger's origin information and endpoint information, generates respectively the first path of riding, path and second by bus; When described the second passenger's starting point is ridden in path first, and described second by bus the endpoint information in path first, the endpoint information in path is second by bus in path by bus in path or first by bus, server sends share-car to first passenger's client, second passenger's client and reminds.
10. share-car server according to claim 9, it is characterized in that, when after N-1 passenger loading, input origin information and endpoint information by N passenger, generate the N path of riding, 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, and described N is 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.9 | 2014-02-23 | ||
| CN201410059642.9A CN103810843A (en) | 2014-02-23 | 2014-02-23 | Taxi sharing method, system and server |
| 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 true CN103971515A (en) | 2014-08-06 |
| CN103971515B 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 (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104282145A (en) * | 2014-10-28 | 2015-01-14 | 丁灏 | Taxi sharing information system and method for vehicle station |
| WO2015124106A1 (en) * | 2014-02-23 | 2015-08-27 | 曾昭兴 | Taxi sharing method and system and server |
| CN105702021A (en) * | 2016-04-13 | 2016-06-22 | 广州市沃希信息科技有限公司 | Taxi-based parcel delivery method, system and server |
| CN107123258A (en) * | 2016-02-24 | 2017-09-01 | 滴滴（中国）科技有限公司 | Order allocation method and device |
| CN107230091A (en) * | 2016-03-23 | 2017-10-03 | 滴滴（中国）科技有限公司 | Order matching process and device are asked in share-car |
| CN107798403A (en) * | 2016-09-07 | 2018-03-13 | 北京嘀嘀无限科技发展有限公司 | A kind of share-car order processing method, server, terminal device and system |
| CN108027906A (en) * | 2015-12-14 | 2018-05-11 | 谷歌有限责任公司 | Multiply the system and method for scheduling and route altogether for adjusting |
| CN108510349A (en) * | 2017-11-17 | 2018-09-07 | 广州沃定新信息科技有限公司 | It is a kind of that charger baby method and system are leased based on Quick Response Code |
| CN108629437A (en) * | 2017-03-15 | 2018-10-09 | 北京嘀嘀无限科技发展有限公司 | A kind of method and apparatus of determining share-car route |
| CN108780554A (en) * | 2016-04-01 | 2018-11-09 | 北京嘀嘀无限科技发展有限公司 | A kind of share-car method and system |
| CN109583605A (en) * | 2017-09-29 | 2019-04-05 | 北京嘀嘀无限科技发展有限公司 | Share-car method and device, computer equipment and readable storage medium storing program for executing |
| CN109781127A (en) * | 2019-01-14 | 2019-05-21 | 闽江学院 | A kind of air navigation aid and device based on vehicle platform |
| CN111523702A (en) * | 2020-03-30 | 2020-08-11 | 深圳大学 | Optimization method, system, server and storage medium for taxi-boarding points of network appointment taxi |
| US10997857B2 (en) | 2016-02-24 | 2021-05-04 | Beijing Didi Infinity Technology And Development Co., Ltd. | Methods and systems for carpooling |
Families Citing this family (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| CN104951513A (en) * | 2015-05-28 | 2015-09-30 | 成都亿邻通科技有限公司 | Method for providing special car carrying |
| 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 |
| CN112950312A (en) * | 2016-09-21 | 2021-06-11 | 北京嘀嘀无限科技发展有限公司 | Order processing method and device |
| 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 |
| 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 |
| CN109781128A (en) * | 2019-01-14 | 2019-05-21 | 闽江学院 | A kind of method and device for planning travel route |
| CN110553659B (en) * | 2019-08-27 | 2021-08-13 | 欧拉信息服务有限公司 | Route determining method and device |
| 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 (5)
| 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 |
| US20100138141A1 (en) * | 2007-08-22 | 2010-06-03 | Toyota Jidosha Kabushiki Kaisha | Traffic information generation method, traffic information generation 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辑》, no. 02, 15 February 2010 (2010-02-15) * |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015124106A1 (en) * | 2014-02-23 | 2015-08-27 | 曾昭兴 | Taxi sharing method and system and server |
| CN104282145A (en) * | 2014-10-28 | 2015-01-14 | 丁灏 | Taxi sharing information system and method for vehicle station |
| CN108027906A (en) * | 2015-12-14 | 2018-05-11 | 谷歌有限责任公司 | Multiply the system and method for scheduling and route altogether for adjusting |
| CN107123258A (en) * | 2016-02-24 | 2017-09-01 | 滴滴（中国）科技有限公司 | Order allocation method and device |
| US10997857B2 (en) | 2016-02-24 | 2021-05-04 | Beijing Didi Infinity Technology And Development Co., Ltd. | Methods and systems for carpooling |
| CN107230091A (en) * | 2016-03-23 | 2017-10-03 | 滴滴（中国）科技有限公司 | Order matching process and device are asked in share-car |
| CN108780554A (en) * | 2016-04-01 | 2018-11-09 | 北京嘀嘀无限科技发展有限公司 | A kind of share-car method and system |
| CN105702021A (en) * | 2016-04-13 | 2016-06-22 | 广州市沃希信息科技有限公司 | Taxi-based parcel delivery method, system and server |
| CN107798403A (en) * | 2016-09-07 | 2018-03-13 | 北京嘀嘀无限科技发展有限公司 | A kind of share-car order processing method, server, terminal device and system |
| CN108629437A (en) * | 2017-03-15 | 2018-10-09 | 北京嘀嘀无限科技发展有限公司 | A kind of method and apparatus of determining share-car route |
| CN109583605A (en) * | 2017-09-29 | 2019-04-05 | 北京嘀嘀无限科技发展有限公司 | Share-car method and device, computer equipment and readable storage medium storing program for executing |
| CN108510349A (en) * | 2017-11-17 | 2018-09-07 | 广州沃定新信息科技有限公司 | It is a kind of that charger baby method and system are leased based on Quick Response Code |
| CN108510349B (en) * | 2017-11-17 | 2022-11-04 | 广州市沃希信息科技有限公司 | Two-dimensional code-based method and system for renting charge pal |
| CN109781127A (en) * | 2019-01-14 | 2019-05-21 | 闽江学院 | A kind of air navigation aid and device based on vehicle platform |
| CN111523702A (en) * | 2020-03-30 | 2020-08-11 | 深圳大学 | Optimization method, system, server and storage medium for taxi-boarding points of network appointment taxi |
| CN111523702B (en) * | 2020-03-30 | 2023-01-13 | 深圳大学 | Optimization method, system, server and storage medium for taxi-boarding points of network appointment taxi |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103810843A (en) | 2014-05-21 |
| CN103971515B (en) | 2015-12-02 |
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 | |
| 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 | |
| CN104217585A (en) | Taxi pooling method, system and server | |
| US20180365629A1 (en) | Taxi-based express package delivery method, system and server | |
| US20180204179A1 (en) | Carpool-based package delivery method, system, and server | |
| CN105243836B (en) | A kind of share-car method and apparatus | |
| WO2016197943A1 (en) | Bicycle management system and control method and apparatus therefor | |
| CN104376604B (en) | A kind of charging method based on taxi share-car, system and server | |
| CN103761873B (en) | Carpooling system and utilize the share-car method of this Carpooling system | |
| CN104052802A (en) | Mobile social network implementation system and method based on vehicle communication | |
| CN102324122B (en) | Intelligent riding system which can generate riding scheme and predict passenger flow | |
| CN105225472A (en) | A kind of share-car method and apparatus | |
| CN104794886A (en) | System and method for estimating taxi fee in networked taxi renting system | |
| CN105279955A (en) | Carpooling method and device | |
| CN102202053A (en) | Taxi sharing system and method based on LBS and SNS | |
| CN103308062A (en) | Route planning and matching system and method as well as device and terminal of system | |
| CN103198652A (en) | Taxi operation business management system and method based on mobile internet | |
| CN104867321B (en) | Taxi share-car method, system and the server that a kind of same place is set out | |
| CN101826188A (en) | Carpooling method utilizing internet site electronic map | |
| Nagare et al. | Dynamic carpooling application development on android platform | |
| CN102393927A (en) | Optimization configuration system for road transportation capability | |
| CN103956044A (en) | Intelligent taxi on-call system and method based on mobile internet | |
| CN103021173B (en) | Achieving method of intelligent holographic targeted public transportation system |
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 |