CN104464274A - Car-sharing taxi taking method and server - Google Patents
Car-sharing taxi taking method and server Download PDFInfo
- Publication number
- CN104464274A CN104464274A CN201410707502.8A CN201410707502A CN104464274A CN 104464274 A CN104464274 A CN 104464274A CN 201410707502 A CN201410707502 A CN 201410707502A CN 104464274 A CN104464274 A CN 104464274A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- candidate
- passenger
- bus
- current
- 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 car-sharing taxi taking method and a server. The method includes the step that order modification information sent by a first car-sharing passenger on a first vehicle is received, wherein the order modification information includes current car taking requirement information of the first passenger; a second vehicle meeting the requirement of current car taking requirement information is selected as a transfer vehicle in the preset range of the current position of the first vehicle, and the overlap point of the running path of the first vehicle and the running path of the second vehicle is a transfer position; passenger confirmation information is sent to the first passenger and includes the transfer position and an identification of the second vehicle; vehicle confirmation information is sent to the first vehicle and the second vehicle and includes the transfer position. By means of the car-sharing taxi taking method and the server, requirements of passengers can be met to the largest extent, time of the passengers is saved, and the transfer success rate and user experience are improved.
Description
Technical field
The present invention relates to intelligent transport technology, particularly relate to a kind of carpool and to call a taxi method and server.
Background technology
Carpool, also known as taking advantage of altogether, refers to that multidigit passenger is through consulting the voluntary agreeing to jointly take same taxi.Along with the develop rapidly of urbanization process and the intensive growth of urban population, occurred in a lot of city calling a taxi difficulty and the large problem of commuter time traffic pressure.For making the maximizing the benefits of transport facility, alleviating pollution and waste that communications and transportation causes, and reducing the daily transportation cost of people, the call a taxi importance of service system of passenger's carpool is increasing.
Existing carpool is called a taxi, and service system can provide registration, login, submission demand for passenger, the basic function such as confirm an order, after the order receiving passenger's submission, according to information such as the destinations comprised in the current position of passenger and order, optimization algorithm is used to be that passenger selects suitable transport vehicle, the driving path transporting vehicle is arranged, and information of vehicles and fee payable are sent to passenger, after passenger arrives destination, can also provide for passenger the function complaining and evaluate this pick-up service.
The deficiencies in the prior art part is, because passenger is with taking advantage of a car with other people, the route of vehicle has just confirmed and has fixed before passenger loading, therefore passenger can only accept existing arrangement after confirming an order, do not allow passenger to change destination or driving path again after getting on the bus, the up-to-date demand that passenger proposes can not be met in time.
Summary of the invention
The invention provides a kind of carpool to call a taxi method and server, the technical matters of the up-to-date demand that passenger proposes can not be met in order to solve the carpool system of calling a taxi of the prior art in time.
The invention provides a kind of carpool to call a taxi method, comprising:
Receive the editing order message that first passenger of carpool on the first vehicle sends, described editing order message comprises the current demand information by bus of described first passenger;
In the preset range of the described first current position of vehicle, select the second vehicle meeting described current demand information by bus as transfer vehicle, the coincide point of the driving path of described first vehicle and the second vehicle is transfer site;
Send passenger's acknowledge message to described first passenger, described passenger's acknowledge message comprises the mark of described transfer site and described second vehicle; Send vehicle acknowledge message to described first vehicle and described second vehicle, described vehicle acknowledge message comprises described transfer site.
Further, described in the preset range of the described first current position of vehicle, select the second vehicle meeting described current demand information by bus as transfer vehicle, specifically comprise:
Step a, all vehicles alternatively vehicle intersection selected in the preset range of the first vehicle position, make n=1, and perform step b;
Step b, in described candidate's vehicle intersection select n-th candidate's vehicle, determine the coincide point of the driving path of described first vehicle and n-th candidate's vehicle, alternatively transfer site; According to the Customer information on described first candidate's vehicle, judge whether described first candidate's vehicle has vacant seating position in described candidate's transfer site: if so, then perform step c, if not, then perform step f;
Step c, according to the driving path of other Customer informations, described first vehicle and n-th the candidate's vehicle on the departure place of described candidate's transfer site, described first passenger and current destination, described first vehicle and n-th candidate's vehicle, determine the by bus total expenses of described first passenger on described first vehicle and n-th candidate's vehicle; Judge whether described total expenses is by bus less than cost threshold: if so, then perform steps d, if not, then perform step e;
Steps d, select current n-th candidate's vehicle as described second vehicle;
Step e, judge whether n reaches predetermined value: if, in front n candidate's vehicle, then select there are all candidate's vehicles of vacant seating position as car intersection to be selected in corresponding candidate's transfer site, in described car intersection to be selected, select minimum candidate's vehicle that total expenses is corresponding by bus as the second vehicle; If not, then step f is performed;
The numerical value of step f:n adds 1, re-executes step b.
Further, described current demand information by bus comprises at least one item in amended destination, amended expectation route, amended expected approach time;
If described current demand information by bus comprises amended destination, then the current destination of the first passenger described in step c is described amended destination; If described current demand information by bus does not comprise amended destination, then the current destination of the first passenger described in step c is the destination in original order;
If described current demand information by bus comprises amended expectation route, then described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, described step c also comprises: according to the driving path of described candidate's transfer site, described current destination and described first vehicle and described n-th candidate's vehicle, determine that whether described first passenger is through described expected path, if not, then step f is performed;
If described current demand information by bus comprises amended expected approach time, then described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, described step c also comprises: according to position and the driving path of described candidate's transfer site, described first vehicle and described n-th candidate's vehicle, determine whether the time that described first passenger arrives current destination meets described expected approach time, if not, then step f is performed.
Further, described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, described step c also comprises:
According to position and the driving path of described candidate's transfer site, described first vehicle and n-th candidate's vehicle, determine that described first vehicle and n-th candidate's vehicle arrive the mistiming of described candidate's transfer site;
Judge the described mistiming whether within the default stand-by period, if not, then perform step f.
Further, if described n-th candidate's vehicle is current backlog, then the driving path of n-th candidate's vehicle comprises the shortest driving path of driving path corresponding to described backlog and destination corresponding to described backlog to the current destination of described first passenger;
If described n-th candidate's vehicle is current do not have backlog, then the driving path of described n-th candidate's vehicle is the shortest driving path of the current position of described vehicle to the current destination of described first passenger.
Further, before described in described judgement, by bus whether total expenses is less than cost threshold, also comprise: determine described cost threshold according to the distance between the departure place of described first passenger and current destination.
The present invention also provides a kind of carpool to call a taxi server, comprising:
Message reception module, for receiving the editing order message that first passenger of carpool on the first vehicle sends, described editing order message comprises the current demand information by bus of described first passenger;
Module selected by transfer vehicle, for in the preset range of the described first current position of vehicle, select the second vehicle meeting described current demand information by bus as transfer vehicle, the coincide point of the driving path of described first vehicle and the second vehicle is transfer site;
Message transmission module, for sending passenger's acknowledge message to described first passenger, described passenger's acknowledge message comprises the mark of described transfer site and described second vehicle; Send vehicle acknowledge message to described first vehicle and described second vehicle, described vehicle acknowledge message comprises described transfer site.
Further, described transfer vehicle select module specifically for:
Step a, all vehicles alternatively vehicle intersection selected in the preset range of the first vehicle position, make n=1, and perform step b;
Step b, in described candidate's vehicle intersection select n-th candidate's vehicle, determine the coincide point of the driving path of described first vehicle and n-th candidate's vehicle, alternatively transfer site; According to the Customer information on described n-th candidate's vehicle, judge whether described n-th candidate's vehicle has vacant seating position in described candidate's transfer site: if so, then perform step c, if not, then perform step f;
Step c, according to the driving path of other Customer informations, described first vehicle and n-th the candidate's vehicle on the departure place of described candidate's transfer site, described first passenger and current destination, described first vehicle and n-th candidate's vehicle, determine the by bus total expenses of described first passenger on described first vehicle and n-th candidate's vehicle; Judge whether described total expenses is by bus less than cost threshold: if so, then perform steps d, if not, then perform step e;
Steps d, select current n-th candidate's vehicle as described second vehicle;
Step e, judge whether n reaches predetermined value: if, in front n candidate's vehicle, then select there are all candidate's vehicles of vacant seating position as car intersection to be selected in corresponding candidate's transfer site, in described car intersection to be selected, select minimum candidate's vehicle that total expenses is corresponding by bus as the second vehicle; If not, then step f is performed;
The numerical value of step f:n adds 1, re-executes step b.
Further, described current demand information by bus comprises at least one item in amended destination, amended expectation route, amended expected approach time;
If described current demand information by bus comprises amended destination, then the current destination of the first passenger described in step c is described amended destination; If described current demand information by bus does not comprise amended destination, then the current destination of the first passenger described in step c is the destination in original order;
If described current demand information by bus comprises amended expectation route, then described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, described step c also comprises: according to the driving path of described candidate's transfer site, described current destination and described first vehicle and described n-th candidate's vehicle, determine that whether described first passenger is through described expected path, if not, then step f is performed;
If described current demand information by bus comprises amended expected approach time, then described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, described step c also comprises: according to position and the driving path of described candidate's transfer site, described first vehicle and described n-th candidate's vehicle, determine whether the time that described first passenger arrives current destination meets described expected approach time, if not, then step f is performed.
Further, described transfer vehicle select module also for:
Described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, according to position and the driving path of described candidate's transfer site, described first vehicle and n-th candidate's vehicle, determine that described first vehicle and n-th candidate's vehicle arrive the mistiming of described candidate's transfer site;
Judge the described mistiming whether within the default stand-by period, if not, then perform step f.
Further, if described n-th candidate's vehicle is current backlog, then the driving path of n-th candidate's vehicle comprises the shortest driving path of driving path corresponding to described backlog and destination corresponding to described backlog to the current destination of described first passenger;
If described n-th candidate's vehicle is current do not have backlog, then the driving path of described n-th candidate's vehicle is the shortest driving path of the current position of described vehicle to the current destination of described first passenger.
Further, described transfer vehicle select module also for:
Before by bus whether total expenses is less than cost threshold described in described judgement, determine described cost threshold according to the distance between the departure place of described first passenger and current destination.
Technique effect of the present invention is: by receiving the current demand information by bus that first passenger of carpool on the first vehicle sends, in the preset range of the first current position of vehicle, select to meet the transfer vehicle of described current by bus demand information, determine transfer site, and the mark of described transfer site and transfer vehicle is sent to the first passenger, make the first passenger can change to described transfer vehicle in transfer site, can farthest meet passenger's requirement, save passenger's time, improve and transport success ratio and user experience.
Accompanying drawing explanation
Fig. 1 to call a taxi the process flow diagram of method for carpool that the embodiment of the present invention one provides;
Fig. 2 to call a taxi the process flow diagram of method for carpool that the embodiment of the present invention two provides;
Fig. 3 to call a taxi the process flow diagram of method for carpool that the embodiment of the present invention three provides;
Fig. 4 to call a taxi the structural representation of server for carpool that the embodiment of the present invention four provides.
Embodiment
For making the object of the embodiment of the present invention, technical scheme and advantage clearly, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
Embodiment one
Fig. 1 to call a taxi the process flow diagram of method for carpool that the embodiment of the present invention one provides.As shown in Figure 1, the method in the present embodiment, can comprise:
The editing order message that step 101, first passenger of reception carpool on the first vehicle send, described editing order message comprises the current demand information by bus of described first passenger.
Particularly, in the present embodiment, the executive agent of method can be server.
When the first passenger has the demand of riding, sequence information can be sent to server, the first current position of passenger and destination in sequence information, can be comprised.Server can according to the first current position of passenger and destination, be that the first passenger selects the first vehicle as treating by bus, and the mark of the first vehicle is sent to the first passenger, the first passenger first passenger position sent to the first vehicle, so that in current location, can wait for that the first vehicle arrives.After the first passenger loading, can send prompting message to server, represent and oneself get on the bus, server can upgrade the passenger status information of the first vehicle according to this prompting message.
If need amendment demand by bus after the first passenger loading, such as, need to change current destination, then can send editing order message to server, it can be such as amended destination that editing order message comprises current demand information by bus.Server, after receiving editing order message, can, according to the current demand information by bus wherein comprised, before described first passenger getting off car, be its selection transfer vehicle.
Step 102, in the preset range of the described first current position of vehicle, select the second vehicle meeting described current by bus demand information as transfer vehicle, the coincide point of the driving path of described first vehicle and the second vehicle is transfer site.
Wherein, described preset range can be determined according to the first current position of vehicle and current time by server, such as, if the first current position of vehicle is more remote or current time is peak period on and off duty, then described preset range can be comparatively large, otherwise then described preset range can be less.
The coincide point of the driving path of the first vehicle and the second vehicle can be the point of crossing of the first vehicle and the second vehicle running path, when there being multiple point of crossing, can select arbitrarily in multiple point of crossing a bit as coincide point, when the driving path of the first vehicle and the second vehicle overlaps, the any point of lap can be selected as coincide point, and described coincide point is the first passenger and is changed to the transfer site of the second vehicle by the first vehicle.
Existing carpool is called a taxi in method, due to passenger and other people take advantage of same car altogether, therefore in order to avoid damaging other people interests, passenger is not allowed to revise order after getting on the bus, if passenger thinks other destination, be merely able to stop current order and get off, and in the present embodiment, passenger directly can revise demand information by bus on the basis of original order, server can be that passenger selects suitable transfer vehicle and transfer site according to demand information of riding, for passenger in described transfer site transfer to described transfer vehicle.
Step 103, send passenger's acknowledge message to described first passenger, described passenger's acknowledge message comprises the mark of described transfer site and described second vehicle; Send vehicle acknowledge message to described first vehicle and described second vehicle, described vehicle acknowledge message comprises described transfer site.
Particularly, server is after determining that the second vehicle is as the transfer vehicle of the first passenger, the mark of transfer site and the second vehicle can be sent to described first passenger, be convenient to the first passenger and get off from described first vehicle in described transfer site, and transfer is in the second vehicle.
When the first passenger is taking after the second vehicle arrives at the destination, the statement of expense can also be sent to the first passenger by server, to be completed charge operation by the first passenger.In addition, the first passenger can also send this evaluation information of serving by bus and/or calling information to server, carries out respective handling by server.
The carpool that the present embodiment provides is called a taxi in method, by receiving the current demand information by bus that first passenger of carpool on the first vehicle sends, in the preset range of the first current position of vehicle, selection meets the transfer vehicle of described current demand information by bus and determines transfer site, and the mark of described transfer site and transfer vehicle is sent to the first passenger, make the first passenger can change to described transfer vehicle in transfer site, can farthest meet passenger's requirement, save passenger's time, improve and transport success ratio and user experience.
Wherein, described in the preset range of the described first current position of vehicle, select the second vehicle meeting described current demand information by bus as transfer vehicle, multiple implementation can be had, the invention provides the method that two kinds are selected transfer vehicle, illustrate with embodiment two and embodiment three respectively.
Embodiment two
Fig. 2 to call a taxi the process flow diagram of method for carpool that the embodiment of the present invention two provides.As shown in Figure 2, the method in the present embodiment, can comprise:
The editing order message that step 201, first passenger of reception carpool on the first vehicle send, described editing order message comprises the current demand information by bus of described first passenger.
Wherein, at least one item in amended destination, amended expectation route, amended expected approach time can be comprised in described current demand information by bus.
When the first passenger wants to change destination after getting on the bus, amended destination can be sent to server, or, when although the first passenger does not want to change destination after getting on the bus, but reach the time to present running route or expectation to be unsatisfied with, then can using want through route or want the time arrived to send to server as amended expectation route or amended expected approach time.
Server is after receiving editing order message, be that the first passenger selects to change to vehicle, particularly, in the preset range of the described first current position of vehicle, select the second vehicle meeting described current demand information by bus as transfer vehicle, can be realized by following steps 202 to step 206.
Step 202, all vehicles alternatively vehicle intersection selected in the preset range of the first vehicle position, make n=1, and perform step 203.
Step 203, in described candidate's vehicle intersection select n-th candidate's vehicle, determine the coincide point of the driving path of described first vehicle and n-th candidate's vehicle, alternatively transfer site; According to the Customer information on described n-th candidate's vehicle, judge whether described n-th candidate's vehicle has vacant seating position in described candidate's transfer site: if so, then perform step 204, if not, then perform step 208.
Particularly, the driving path of n-th candidate's vehicle is determined in the following way: if described n-th candidate's vehicle is current backlog, then the driving path of n-th candidate's vehicle comprises the shortest driving path of driving path corresponding to described backlog and destination corresponding to described backlog to the current destination of described first passenger; If described n-th candidate's vehicle is current do not have backlog, then the driving path of described n-th candidate's vehicle is the shortest driving path of the current position of described vehicle to the current destination of described first passenger.
That is, before other passengers take n-th candidate's vehicle, the driving path that server can be determined between n-th candidate's vehicle is from the departure place of other passengers to destination according to the sequence information of other passengers, when the first passenger submits editing order message to, if n-th candidate's vehicle has backlog, then the driving path of n-th candidate's vehicle is fixing, after other passengers are delivered to destination by n-th candidate's vehicle, can think that the driving path of n-th candidate's vehicle is arbitrary, nearest path, the current position of described passenger can be chosen as driving path.
According to the driving path of the first vehicle and n-th candidate's vehicle, can determine coincide point, particularly, coincide point can be first point of crossing of the first vehicle and n-th candidate's vehicle, selects this coincide point alternatively transfer site.
After candidate's transfer site is determined, can judge whether n-th candidate's vehicle has vacant seating position in candidate's transfer site further, if there is no vacant seating position, illustrate that n-th candidate's vehicle is undesirable, then directly perform step 208, change candidate's vehicle to calculate, if meet the requirements, then perform step 204:
Step 204, driving path according to other Customer informations, described first vehicle and n-th the candidate's vehicle on the departure place of described candidate's transfer site, described first passenger and current destination, described first vehicle and n-th candidate's vehicle, determine the by bus total expenses of described first passenger on described first vehicle and n-th candidate's vehicle; Judge whether described total expenses is by bus less than cost threshold: if so, then perform step 205, if not, then perform step 206.
Particularly, if current demand information by bus comprises amended destination, then the current destination of the first passenger described in step 204 refers to amended destination; If current demand information by bus does not comprise amended destination, then the current destination of described first passenger refers to the destination in original order.
After candidate's transfer site is determined, the mileage that server can be passed by by passenger and unit price determine that riding fee is used, such as, concrete carpool expense standard is: passenger's carpool part everyone each pair 60%, the independent sitting part of passenger divides pays 100% for oneself, due to the first passenger getting on the bus at the first vehicle and ground of getting off, the driving path of the first vehicle, on first vehicle other passengers get on the bus and all determine with getting off, therefore can obtain the riding fee of the first passenger on the first vehicle to use, in like manner can obtain the riding fee of the first passenger on the second vehicle to use, be added the total expenses by bus that namely can obtain the first passenger.In addition, can also determine that the first passenger estimates to arrive the time of destination according to above-mentioned each information.
Described cost threshold can be determined according to the distance between the departure place of the first passenger and current destination, and distance is larger, and cost threshold is larger, otherwise then cost threshold is less.When the total expenses of riding of the first passenger is less than cost threshold, performs step 205, otherwise perform step 208.
If described current demand information by bus comprises amended expectation route, then described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, can also according to the driving path of described candidate's transfer site, described current destination and described first vehicle and described n-th candidate's vehicle, determine that whether described first passenger is through described expected path, if not, then step 208 is performed.Like this, the candidate's vehicle not meeting the expected path of passenger can be got rid of.
If described current demand information by bus comprises amended expected approach time, then described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, can also according to the position of described candidate's transfer site, described first vehicle and described n-th candidate's vehicle and driving path, determine whether the time that described first passenger arrives current destination meets described expected approach time, if not, then step 208 is performed.Like this, the candidate's vehicle not meeting the expected approach time of passenger can be got rid of.
Step 205, select current n-th candidate's vehicle as described second vehicle, and perform step 209.
When determining that the by bus total expenses of the first passenger is less than cost threshold, can think that n-th current candidate's vehicle changes to vehicle than more preferably candidate, therefore select n-th candidate's vehicle as the second vehicle, current candidate's transfer site is as transfer site.After determining transfer vehicle and transfer site, perform step 208.
Step 206, judge whether n reaches predetermined value: if so, then perform step 207; If not, then step 208 is performed.
Step 207: select there are all candidate's vehicles of vacant seating position as car intersection to be selected in corresponding candidate's transfer site in front n candidate's vehicle, in described car intersection to be selected, select minimum candidate's vehicle that total expenses is corresponding by bus as the second vehicle, and perform step 209.
If the by bus total expenses of the first passenger on the first vehicle and n-th candidate's vehicle is not less than cost threshold, then judge whether n reaches predetermined value, if n reaches predetermined value, illustrate and abundant candidate's vehicle is calculated, conduct second vehicle of most suitable one can be selected in this n candidate's vehicle, particularly, can first in front n candidate's vehicle, candidate's vehicle of vacant seating position is not had all to get rid of the candidate's transfer site in correspondence, remaining all candidate's vehicles are as car intersection to be selected, then in car intersection to be selected, select minimum candidate's vehicle that total expenses is corresponding by bus as the second vehicle, candidate's transfer site (i.e. the coincide point of this candidate's vehicle and the first vehicle) that this candidate's vehicle is corresponding is as transfer site, if n does not reach preset value, then perform step 208.
The numerical value of step 208:n adds 1, re-executes step 203.
If total riding fee that current n-th candidate's vehicle is corresponding is not less than cost threshold, n does not also reach preset value simultaneously, then perform step 203 after making n+1, judge whether next candidate's vehicle meets the demands.
By step 202 to step 208, can in the preset range of the described first current position of vehicle, select meet described current by bus demand information the second vehicle as transfer vehicle, the coincide point of the driving path of described first vehicle and the second vehicle is transfer site.After transfer vehicle and transfer site are determined, perform step 209.
Step 209, send passenger's acknowledge message to described first passenger, described passenger's acknowledge message comprises the mark of described transfer site and described second vehicle; Send vehicle acknowledge message to described first vehicle and described second vehicle, described vehicle acknowledge message comprises described transfer site.
The carpool that the present embodiment provides is called a taxi in method, after the editing order request receiving first passenger's transmission, candidate's vehicle intersection is determined according to the position of the first vehicle, judge whether the candidate's vehicle in intersection meets the current demand by bus of passenger successively, whether meet cost requirements, if do not meet the current demand by bus of passenger, then got rid of, if meet passenger to require to meet cost requirements again, then current candidate vehicle just can as the second vehicle, if the candidate's vehicle in a certain number of does not all meet cost requirements, candidate's vehicle that then selection minimum cost is corresponding is as the second vehicle, can rapidly for passenger provides suitable transfer vehicle after receiving the editing order information of passenger, meet the requirement of real time of passenger.
On the basis of the technical scheme provided in embodiment two, preferably, described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, also comprise:
According to position and the driving path of described candidate's transfer site, described first vehicle and n-th candidate's vehicle, determine that described first vehicle and n-th candidate's vehicle arrive the mistiming of described candidate's transfer site; Judge the described mistiming whether within the default stand-by period, if not, then perform step 208.
Particularly, determining by bus before total expenses, first can judge whether the mistiming of the first vehicle and n-th candidate's vehicle arrival candidate transfer site meets the demands, if the mistiming is excessive, illustrate that the first passenger needs to wait for the long period in candidate's transfer site, then n-th candidate's vehicle is not suitable as transfer vehicle, now n-th candidate's vehicle can be got rid of, directly judge whether next car meets the demands, passenger can be waited for the time controling of candidate's vehicle within the specific limits, avoid passenger waiting time long, save passenger's time further.
Embodiment three
Fig. 3 to call a taxi the process flow diagram of method for carpool that the embodiment of the present invention three provides.As shown in Figure 3, the method in the present embodiment, can comprise:
The editing order message that step 301, first passenger of reception carpool on the first vehicle send, described editing order message comprises the current demand information by bus of described first passenger.
Server, after receiving editing order message, is that the first passenger selects to change to vehicle, and determines transfer site.The selection of the transfer vehicle in the present embodiment can be realized by following steps 302 to step 304.
Step 302, determine candidate's vehicle intersection.
Candidate's vehicle intersection can be all vehicles in the preset range of the first vehicle position, also can be by obviously do not meet in rolling stock passenger require some vehicles remove after intersection, such as, if a certain vehicle is fully loaded with, can be got rid of, or, current location or the driving path distance current present position of passenger are exceeded to the vehicle of certain distance, they can be got rid of outside candidate's vehicle intersection, subsequent calculations amount can be reduced.
Step 303, determine candidate's transfer site of each candidate's vehicle and described first vehicle in candidate's vehicle intersection, and calculate corresponding total expenses by bus.
Method in the defining method of concrete candidate's transfer site and by bus total expenses and embodiment two is similar, repeats no more herein.
Before calculating by bus total expenses, further can also screen candidate's vehicle, such as, judge whether the time whether candidate's vehicle has expectation first passenger corresponding to vacant seating position, candidate's vehicle to arrive destination in candidate's transfer site meets the demands, whether the route of process meets the demands, the candidate's vehicle not meeting passenger's requirement is got rid of from described candidate's vehicle intersection.
Step 304, in candidate's vehicle intersection, select minimum by bus candidate's vehicle that total expenses is corresponding as the second vehicle, the coincide point of described candidate's vehicle and the first vehicle is as transfer site.
With the method selecting to change to vehicle in embodiment two unlike, the present embodiment, need first to determine to meet the total expenses by bus that whole candidate's vehicles of the current demand by bus of passenger are corresponding, and compare total expenses by bus corresponding to each candidate's vehicle, select minimum candidate's vehicle that total expenses is corresponding by bus as the second vehicle.
Step 305, send passenger's acknowledge message to described first passenger, described passenger's acknowledge message comprises the mark of described transfer site and described second vehicle; Send vehicle acknowledge message to described first vehicle and described second vehicle, described vehicle acknowledge message comprises described transfer site.
The carpool that the present embodiment provides is called a taxi in method, after the editing order request receiving first passenger's transmission, candidate's vehicle intersection is determined according to the position of the first vehicle, determine candidate's transfer site of each candidate's vehicle in intersection and the first vehicle, and determine to ride accordingly total expenses, then select minimum by bus candidate's vehicle that total expenses is corresponding as the transfer vehicle of the first passenger, the whole candidate of multianalysis can change to vehicle, for passenger provides most suitable transfer vehicle, meet the current demand by bus of passenger to greatest extent.
Embodiment four
Fig. 4 to call a taxi the structural representation of server for carpool that the embodiment of the present invention four provides.As shown in Figure 4, the server in the present embodiment, can comprise:
Message reception module 401, for receiving the editing order message that first passenger of carpool on the first vehicle sends, described editing order message comprises the current demand information by bus of described first passenger;
Module 402 selected by transfer vehicle, for in the preset range of the described first current position of vehicle, select the second vehicle meeting described current demand information by bus as transfer vehicle, the coincide point of the driving path of described first vehicle and the second vehicle is transfer site;
Message transmission module 403, for sending passenger's acknowledge message to described first passenger, described passenger's acknowledge message comprises the mark of described transfer site and described second vehicle; Send vehicle acknowledge message to described first vehicle and described second vehicle, described vehicle acknowledge message comprises described transfer site.
The carpool that the present embodiment provides is called a taxi server, may be used for performing the technical scheme in embodiment illustrated in fig. 1, and it realizes principle and technique effect is similar, repeats no more herein.
On the basis of the technical scheme provided in embodiment four, further, described transfer vehicle select module 402 specifically for:
Step a, all vehicles alternatively vehicle intersection selected in the preset range of the first vehicle position, make n=1, and perform step b;
Step b, in described candidate's vehicle intersection select n-th candidate's vehicle, determine the coincide point of the driving path of described first vehicle and n-th candidate's vehicle, alternatively transfer site; According to the Customer information on described n-th candidate's vehicle, judge whether described n-th candidate's vehicle has vacant seating position in described candidate's transfer site: if so, then perform step c, if not, then perform step f;
Step c, according to the driving path of other Customer informations, described first vehicle and n-th the candidate's vehicle on the departure place of described candidate's transfer site, described first passenger and current destination, described first vehicle and n-th candidate's vehicle, determine the by bus total expenses of described first passenger on described first vehicle and n-th candidate's vehicle; Judge whether described total expenses is by bus less than cost threshold: if so, then perform steps d, if not, then perform step e;
Steps d, select current n-th candidate's vehicle as described second vehicle;
Step e, judge whether n reaches predetermined value: if, in front n candidate's vehicle, then select there are all candidate's vehicles of vacant seating position as car intersection to be selected in corresponding candidate's transfer site, in described car intersection to be selected, select minimum candidate's vehicle that total expenses is corresponding by bus as the second vehicle; If not, then step f is performed;
The numerical value of step f:n adds 1, re-executes step b.
On the basis of above-described embodiment, further, described current demand information by bus comprises at least one item in amended destination, amended expectation route, amended expected approach time;
If described current demand information by bus comprises amended destination, then the current destination of described first passenger is described amended destination; If described current demand information by bus does not comprise amended destination, then the current destination of described first passenger is the destination in original order;
If described current demand information by bus comprises amended expectation route, then described transfer vehicle select module 402 also for: described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, according to the driving path of described candidate's transfer site, described current destination and described first vehicle and described n-th candidate's vehicle, determine that whether described first passenger is through described expected path, if not, then step f is performed;
If described current demand information by bus comprises amended expected approach time, then described transfer vehicle select module 402 also for: described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, according to position and the driving path of described candidate's transfer site, described first vehicle and described n-th candidate's vehicle, determine whether the time that described first passenger arrives current destination meets described expected approach time, if not, then step f is performed.
On the basis of above-described embodiment, further, described transfer vehicle select module 402 also for:
Described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, according to position and the driving path of described candidate's transfer site, described first vehicle and n-th candidate's vehicle, determine that described first vehicle and n-th candidate's vehicle arrive the mistiming of described candidate's transfer site;
Judge the described mistiming whether within the default stand-by period, if not, then perform step f.
On the basis of above-described embodiment, further, described transfer vehicle select module 402 also for:
If described n-th candidate's vehicle is current backlog, then select the driving path of the shortest driving path as n-th candidate's vehicle of driving path that described backlog is corresponding and destination to the current destination of described first passenger corresponding to described backlog;
If described n-th candidate's vehicle is current do not have backlog, then select the driving path of the shortest driving path as described n-th candidate's vehicle of the current position of described vehicle to the current destination of described first passenger.
On the basis of above-described embodiment, further, described transfer vehicle select module 402 also for:
Before by bus whether total expenses is less than cost threshold described in described judgement, determine described cost threshold according to the distance between the departure place of described first passenger and current destination.
Last it is noted that above each embodiment is only in order to illustrate technical scheme of the present invention, be not intended to limit; Although with reference to foregoing embodiments to invention has been detailed description, those of ordinary skill in the art is to be understood that: it still can be modified to the technical scheme described in foregoing embodiments, or carries out equivalent replacement to wherein some or all of technical characteristic; And these amendments or replacement, do not make the essence of appropriate technical solution depart from the scope of various embodiments of the present invention technical scheme.
Claims (12)
1. carpool is called a taxi a method, it is characterized in that, comprising:
Receive the editing order message that first passenger of carpool on the first vehicle sends, described editing order message comprises the current demand information by bus of described first passenger;
In the preset range of the described first current position of vehicle, select the second vehicle meeting described current demand information by bus as transfer vehicle, the coincide point of the driving path of described first vehicle and the second vehicle is transfer site;
Send passenger's acknowledge message to described first passenger, described passenger's acknowledge message comprises the mark of described transfer site and described second vehicle; Send vehicle acknowledge message to described first vehicle and described second vehicle, described vehicle acknowledge message comprises described transfer site.
2. method according to claim 1, is characterized in that, described in the preset range of the described first current position of vehicle, selects the second vehicle meeting described current demand information by bus as transfer vehicle, specifically comprises:
Step a, all vehicles alternatively vehicle intersection selected in the preset range of the first vehicle position, make n=1, and perform step b;
Step b, in described candidate's vehicle intersection select n-th candidate's vehicle, determine the coincide point of the driving path of described first vehicle and n-th candidate's vehicle, alternatively transfer site; According to the Customer information on described first candidate's vehicle, judge whether described first candidate's vehicle has vacant seating position in described candidate's transfer site: if so, then perform step c, if not, then perform step f;
Step c, according to the driving path of other Customer informations, described first vehicle and n-th the candidate's vehicle on the departure place of described candidate's transfer site, described first passenger and current destination, described first vehicle and n-th candidate's vehicle, determine the by bus total expenses of described first passenger on described first vehicle and n-th candidate's vehicle; Judge whether described total expenses is by bus less than cost threshold: if so, then perform steps d, if not, then perform step e;
Steps d, select current n-th candidate's vehicle as described second vehicle;
Step e, judge whether n reaches predetermined value: if, in front n candidate's vehicle, then select there are all candidate's vehicles of vacant seating position as car intersection to be selected in corresponding candidate's transfer site, in described car intersection to be selected, select minimum candidate's vehicle that total expenses is corresponding by bus as the second vehicle; If not, then step f is performed;
The numerical value of step f:n adds 1, re-executes step b.
3. method according to claim 2, is characterized in that, described current demand information by bus comprises at least one item in amended destination, amended expectation route, amended expected approach time;
If described current demand information by bus comprises amended destination, then the current destination of the first passenger described in step c is described amended destination; If described current demand information by bus does not comprise amended destination, then the current destination of the first passenger described in step c is the destination in original order;
If described current demand information by bus comprises amended expectation route, then described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, described step c also comprises: according to the driving path of described candidate's transfer site, described current destination and described first vehicle and described n-th candidate's vehicle, determine that whether described first passenger is through described expected path, if not, then step f is performed;
If described current demand information by bus comprises amended expected approach time, then described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, described step c also comprises: according to position and the driving path of described candidate's transfer site, described first vehicle and described n-th candidate's vehicle, determine whether the time that described first passenger arrives current destination meets described expected approach time, if not, then step f is performed.
4. method according to claim 2, is characterized in that, described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, described step c also comprises:
According to position and the driving path of described candidate's transfer site, described first vehicle and n-th candidate's vehicle, determine that described first vehicle and n-th candidate's vehicle arrive the mistiming of described candidate's transfer site;
Judge the described mistiming whether within the default stand-by period, if not, then perform step f.
5. method according to claim 2, is characterized in that,
If described n-th candidate's vehicle is current backlog, then the driving path of n-th candidate's vehicle comprises the shortest driving path of driving path corresponding to described backlog and destination corresponding to described backlog to the current destination of described first passenger;
If described n-th candidate's vehicle is current do not have backlog, then the driving path of described n-th candidate's vehicle is the shortest driving path of the current position of described vehicle to the current destination of described first passenger.
6. the method according to any one of claim 2-5, it is characterized in that, before described in described judgement, by bus whether total expenses is less than cost threshold, also comprise: determine described cost threshold according to the distance between the departure place of described first passenger and current destination.
7. carpool is called a taxi a server, it is characterized in that, comprising:
Message reception module, for receiving the editing order message that first passenger of carpool on the first vehicle sends, described editing order message comprises the current demand information by bus of described first passenger;
Module selected by transfer vehicle, for in the preset range of the described first current position of vehicle, select the second vehicle meeting described current demand information by bus as transfer vehicle, the coincide point of the driving path of described first vehicle and the second vehicle is transfer site;
Message transmission module, for sending passenger's acknowledge message to described first passenger, described passenger's acknowledge message comprises the mark of described transfer site and described second vehicle; Send vehicle acknowledge message to described first vehicle and described second vehicle, described vehicle acknowledge message comprises described transfer site.
8. server according to claim 7, is characterized in that, described transfer vehicle select module specifically for:
Step a, all vehicles alternatively vehicle intersection selected in the preset range of the first vehicle position, make n=1, and perform step b;
Step b, in described candidate's vehicle intersection select n-th candidate's vehicle, determine the coincide point of the driving path of described first vehicle and n-th candidate's vehicle, alternatively transfer site; According to the Customer information on described n-th candidate's vehicle, judge whether described n-th candidate's vehicle has vacant seating position in described candidate's transfer site: if so, then perform step c, if not, then perform step f;
Step c, according to the driving path of other Customer informations, described first vehicle and n-th the candidate's vehicle on the departure place of described candidate's transfer site, described first passenger and current destination, described first vehicle and n-th candidate's vehicle, determine the by bus total expenses of described first passenger on described first vehicle and n-th candidate's vehicle; Judge whether described total expenses is by bus less than cost threshold: if so, then perform steps d, if not, then perform step e;
Steps d, select current n-th candidate's vehicle as described second vehicle;
Step e, judge whether n reaches predetermined value: if, in front n candidate's vehicle, then select there are all candidate's vehicles of vacant seating position as car intersection to be selected in corresponding candidate's transfer site, in described car intersection to be selected, select minimum candidate's vehicle that total expenses is corresponding by bus as the second vehicle; If not, then step f is performed;
The numerical value of step f:n adds 1, re-executes step b.
9. server according to claim 8, is characterized in that, described current demand information by bus comprises at least one item in amended destination, amended expectation route, amended expected approach time;
If described current demand information by bus comprises amended destination, then the current destination of described first passenger is described amended destination; If described current demand information by bus does not comprise amended destination, then the current destination of described first passenger is the destination in original order;
If described current demand information by bus comprises amended expectation route, then described transfer vehicle select module also for: described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, according to the driving path of described candidate's transfer site, described current destination and described first vehicle and described n-th candidate's vehicle, determine that whether described first passenger is through described expected path, if not, then step f is performed;
If described current demand information by bus comprises amended expected approach time, then described transfer vehicle select module also for: described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, according to position and the driving path of described candidate's transfer site, described first vehicle and described n-th candidate's vehicle, determine whether the time that described first passenger arrives current destination meets described expected approach time, if not, then step f is performed.
10. server according to claim 8, is characterized in that, described transfer vehicle select module also for:
Described determine the by bus total expenses of described first passenger on the first vehicle and described n-th candidate's vehicle before, according to position and the driving path of described candidate's transfer site, described first vehicle and n-th candidate's vehicle, determine that described first vehicle and n-th candidate's vehicle arrive the mistiming of described candidate's transfer site;
Judge the described mistiming whether within the default stand-by period, if not, then perform step f.
11. servers according to claim 8, is characterized in that, described transfer vehicle select module also for:
If described n-th candidate's vehicle is current backlog, then select the driving path of the shortest driving path as n-th candidate's vehicle of driving path that described backlog is corresponding and destination to the current destination of described first passenger corresponding to described backlog;
If described n-th candidate's vehicle is current do not have backlog, then select the driving path of the shortest driving path as described n-th candidate's vehicle of the current position of described vehicle to the current destination of described first passenger.
12. servers according to Claim 8 described in-11 any one, it is characterized in that, described transfer vehicle select module also for: before whether total expenses is less than cost threshold by bus described in described judgement, determine described cost threshold according to the distance between the departure place of described first passenger and current destination.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410707502.8A CN104464274B (en) | 2014-11-27 | 2014-11-27 | Rideshare is called a taxi method and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410707502.8A CN104464274B (en) | 2014-11-27 | 2014-11-27 | Rideshare is called a taxi method and server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104464274A true CN104464274A (en) | 2015-03-25 |
| CN104464274B CN104464274B (en) | 2016-09-28 |
Family
ID=52910249
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410707502.8A Active CN104464274B (en) | 2014-11-27 | 2014-11-27 | Rideshare is called a taxi method and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104464274B (en) |
Cited By (28)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105243836A (en) * | 2015-10-14 | 2016-01-13 | 深圳市十方联智科技有限公司 | Carpooling method and device |
| CN106157600A (en) * | 2015-04-24 | 2016-11-23 | 北京中坤天朗信息技术有限公司 | Method, relevant device and the system of a kind of rideshare trip scheduling |
| CN107016584A (en) * | 2016-01-27 | 2017-08-04 | 滴滴（中国）科技有限公司 | Order screening technique and device |
| CN107063285A (en) * | 2017-04-25 | 2017-08-18 | 杭州纳戒科技有限公司 | With city trip service implementing method, device and system |
| CN107393295A (en) * | 2017-07-18 | 2017-11-24 | 鄂尔多斯市普渡科技有限公司 | A kind of countermeasure of unmanned cab-getter midway modification information |
| CN108090594A (en) * | 2016-11-21 | 2018-05-29 | 北京嘀嘀无限科技发展有限公司 | Share-car method and device |
| CN108399460A (en) * | 2017-02-07 | 2018-08-14 | 北京嘀嘀无限科技发展有限公司 | Network about vehicle Order splitting processing method and server |
| CN108734317A (en) * | 2017-04-24 | 2018-11-02 | 北京嘀嘀无限科技发展有限公司 | Net about vehicle order information processing method and processing device |
| CN108985543A (en) * | 2017-05-30 | 2018-12-11 | 本田技研工业株式会社 | Multiply managing device altogether, multiply management method and storage medium altogether |
| CN109102094A (en) * | 2017-06-21 | 2018-12-28 | 本田技研工业株式会社 | It is same to multiply system |
| CN109325185A (en) * | 2018-07-16 | 2019-02-12 | 北京三快在线科技有限公司 | A kind of determination is got on the bus method, apparatus, equipment and storage medium a little |
| CN109615848A (en) * | 2018-12-26 | 2019-04-12 | 世纪恒通科技股份有限公司 | A kind of cross-region user trip Resolving probiems system based on big data |
| CN109658685A (en) * | 2017-10-10 | 2019-04-19 | 丰田自动车株式会社 | Vehicle scheduling device |
| CN109741150A (en) * | 2019-01-10 | 2019-05-10 | 上海携程商务有限公司 | Editing order method, system, equipment and storage medium |
| CN110337057A (en) * | 2018-03-15 | 2019-10-15 | 北京搜狗科技发展有限公司 | A kind of based reminding method and device for vehicle service |
| CN110608748A (en) * | 2018-06-14 | 2019-12-24 | 丰田自动车株式会社 | Information processing apparatus and information processing method |
| CN110633815A (en) * | 2019-08-14 | 2019-12-31 | 杭州飞步科技有限公司 | Car pooling method and device, electronic equipment and storage medium |
| CN110717797A (en) * | 2018-07-11 | 2020-01-21 | 北京嘀嘀无限科技发展有限公司 | Order distribution method, device, server and storage medium |
| CN110832562A (en) * | 2017-12-04 | 2020-02-21 | 北京嘀嘀无限科技发展有限公司 | System and method for providing cost-sharing transportation services |
| CN110853240A (en) * | 2018-07-31 | 2020-02-28 | 丰田自动车株式会社 | Information processing device, riding vehicle adjusting method, and storage medium |
| CN111033595A (en) * | 2017-08-08 | 2020-04-17 | 日产自动车株式会社 | Shared vehicle management method and shared vehicle management device |
| CN111141299A (en) * | 2018-11-01 | 2020-05-12 | 丰田自动车株式会社 | Shared travel intermediation system, server, storage medium storing program, and shared travel intermediation method |
| CN111666362A (en) * | 2019-03-05 | 2020-09-15 | 本田技研工业株式会社 | Ride-sharing vehicle use support system and ride-sharing vehicle use support method |
| CN112189224A (en) * | 2018-05-15 | 2021-01-05 | 日产自动车株式会社 | Method for determining getting on/off position, device for determining getting on/off position, and system for determining getting on/off position |
| CN112529225A (en) * | 2019-09-17 | 2021-03-19 | 柯尼卡美能达株式会社 | System, information processing device, and program |
| US11327482B2 (en) * | 2016-10-20 | 2022-05-10 | Volkswagen Aktiengesellschaft | Apparatuses, methods and computer programs for a transportation vehicle and a central office |
| CN114898544A (en) * | 2022-04-29 | 2022-08-12 | 熊赵军 | Network-based traffic connection method and system |
| US11514796B2 (en) | 2017-12-04 | 2022-11-29 | Beijing Didi Infinity Technology And Development Co., Ltd. | System and method for determining and recommending vehicle pick-up location |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002230691A (en) * | 2001-02-02 | 2002-08-16 | Nippon Telegr & Teleph Corp <Ntt> | Taxi allocation device and taxi allocation method |
| CN101355714A (en) * | 2007-07-24 | 2009-01-28 | 梁宇杰 | System and method for real time pooling vehicle |
| CN101763567A (en) * | 2008-11-21 | 2010-06-30 | 北京携友聚信信息技术有限公司 | Online share-car mate matching method and system |
| JP2010250673A (en) * | 2009-04-17 | 2010-11-04 | Ntt Docomo Inc | Taxi user extraction device and taxi user extraction method |
| CN102663891A (en) * | 2012-06-04 | 2012-09-12 | 上海千年城市规划工程设计股份有限公司 | Taxi carpooling inducement system |
| CN103440685A (en) * | 2013-07-30 | 2013-12-11 | 马骁 | Taxi sharing method and system |
-
2014
- 2014-11-27 CN CN201410707502.8A patent/CN104464274B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002230691A (en) * | 2001-02-02 | 2002-08-16 | Nippon Telegr & Teleph Corp <Ntt> | Taxi allocation device and taxi allocation method |
| CN101355714A (en) * | 2007-07-24 | 2009-01-28 | 梁宇杰 | System and method for real time pooling vehicle |
| CN101763567A (en) * | 2008-11-21 | 2010-06-30 | 北京携友聚信信息技术有限公司 | Online share-car mate matching method and system |
| JP2010250673A (en) * | 2009-04-17 | 2010-11-04 | Ntt Docomo Inc | Taxi user extraction device and taxi user extraction method |
| CN102663891A (en) * | 2012-06-04 | 2012-09-12 | 上海千年城市规划工程设计股份有限公司 | Taxi carpooling inducement system |
| CN103440685A (en) * | 2013-07-30 | 2013-12-11 | 马骁 | Taxi sharing method and system |
Non-Patent Citations (2)
| Title |
|---|
| 李江山: "基于Android的出租拼车系统的设计与实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》, no. 05, 15 May 2014 (2014-05-15) * |
| 李洪伟 等: "语音"拼车"系统", 《物联网技术》, no. 9, 30 September 2013 (2013-09-30), pages 7 - 9 * |
Cited By (38)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106157600A (en) * | 2015-04-24 | 2016-11-23 | 北京中坤天朗信息技术有限公司 | Method, relevant device and the system of a kind of rideshare trip scheduling |
| CN105243836A (en) * | 2015-10-14 | 2016-01-13 | 深圳市十方联智科技有限公司 | Carpooling method and device |
| CN105243836B (en) * | 2015-10-14 | 2019-03-12 | 青岛众至创捷网络科技有限公司 | A kind of share-car method and apparatus |
| CN107016584A (en) * | 2016-01-27 | 2017-08-04 | 滴滴（中国）科技有限公司 | Order screening technique and device |
| US11327482B2 (en) * | 2016-10-20 | 2022-05-10 | Volkswagen Aktiengesellschaft | Apparatuses, methods and computer programs for a transportation vehicle and a central office |
| CN108090594B (en) * | 2016-11-21 | 2021-06-04 | 北京嘀嘀无限科技发展有限公司 | Carpooling method and device |
| CN108090594A (en) * | 2016-11-21 | 2018-05-29 | 北京嘀嘀无限科技发展有限公司 | Share-car method and device |
| CN108399460A (en) * | 2017-02-07 | 2018-08-14 | 北京嘀嘀无限科技发展有限公司 | Network about vehicle Order splitting processing method and server |
| CN108399460B (en) * | 2017-02-07 | 2021-06-04 | 北京嘀嘀无限科技发展有限公司 | Network taxi booking order distribution processing method and server |
| CN108734317A (en) * | 2017-04-24 | 2018-11-02 | 北京嘀嘀无限科技发展有限公司 | Net about vehicle order information processing method and processing device |
| CN107063285A (en) * | 2017-04-25 | 2017-08-18 | 杭州纳戒科技有限公司 | With city trip service implementing method, device and system |
| CN108985543A (en) * | 2017-05-30 | 2018-12-11 | 本田技研工业株式会社 | Multiply managing device altogether, multiply management method and storage medium altogether |
| CN109102094A (en) * | 2017-06-21 | 2018-12-28 | 本田技研工业株式会社 | It is same to multiply system |
| CN109102094B (en) * | 2017-06-21 | 2022-08-12 | 本田技研工业株式会社 | Ride-sharing system |
| CN107393295A (en) * | 2017-07-18 | 2017-11-24 | 鄂尔多斯市普渡科技有限公司 | A kind of countermeasure of unmanned cab-getter midway modification information |
| US11663532B2 (en) | 2017-08-08 | 2023-05-30 | Nissan Motor Co., Ltd. | Shared vehicle management method and shared vehicle management device |
| CN111033595A (en) * | 2017-08-08 | 2020-04-17 | 日产自动车株式会社 | Shared vehicle management method and shared vehicle management device |
| CN109658685A (en) * | 2017-10-10 | 2019-04-19 | 丰田自动车株式会社 | Vehicle scheduling device |
| US11514796B2 (en) | 2017-12-04 | 2022-11-29 | Beijing Didi Infinity Technology And Development Co., Ltd. | System and method for determining and recommending vehicle pick-up location |
| CN110832562A (en) * | 2017-12-04 | 2020-02-21 | 北京嘀嘀无限科技发展有限公司 | System and method for providing cost-sharing transportation services |
| CN110832562B (en) * | 2017-12-04 | 2022-09-30 | 北京嘀嘀无限科技发展有限公司 | System and method for providing cost-sharing transportation services |
| CN110337057A (en) * | 2018-03-15 | 2019-10-15 | 北京搜狗科技发展有限公司 | A kind of based reminding method and device for vehicle service |
| CN112189224A (en) * | 2018-05-15 | 2021-01-05 | 日产自动车株式会社 | Method for determining getting on/off position, device for determining getting on/off position, and system for determining getting on/off position |
| CN112189224B (en) * | 2018-05-15 | 2022-10-14 | 日产自动车株式会社 | Method for determining getting on/off position, device for determining getting on/off position, and system for determining getting on/off position |
| CN110608748A (en) * | 2018-06-14 | 2019-12-24 | 丰田自动车株式会社 | Information processing apparatus and information processing method |
| CN110717797A (en) * | 2018-07-11 | 2020-01-21 | 北京嘀嘀无限科技发展有限公司 | Order distribution method, device, server and storage medium |
| CN109325185A (en) * | 2018-07-16 | 2019-02-12 | 北京三快在线科技有限公司 | A kind of determination is got on the bus method, apparatus, equipment and storage medium a little |
| CN109325185B (en) * | 2018-07-16 | 2020-01-03 | 北京三快在线科技有限公司 | Method, device and equipment for determining getting-on point and storage medium |
| CN110853240A (en) * | 2018-07-31 | 2020-02-28 | 丰田自动车株式会社 | Information processing device, riding vehicle adjusting method, and storage medium |
| CN111141299A (en) * | 2018-11-01 | 2020-05-12 | 丰田自动车株式会社 | Shared travel intermediation system, server, storage medium storing program, and shared travel intermediation method |
| CN111141299B (en) * | 2018-11-01 | 2024-02-13 | 丰田自动车株式会社 | Shared travel mediating system, server, storage medium storing program, and shared travel mediating method |
| CN109615848A (en) * | 2018-12-26 | 2019-04-12 | 世纪恒通科技股份有限公司 | A kind of cross-region user trip Resolving probiems system based on big data |
| CN109615848B (en) * | 2018-12-26 | 2021-07-27 | 世纪恒通科技股份有限公司 | Cross-region user trip problem solving system based on big data |
| CN109741150A (en) * | 2019-01-10 | 2019-05-10 | 上海携程商务有限公司 | Editing order method, system, equipment and storage medium |
| CN111666362A (en) * | 2019-03-05 | 2020-09-15 | 本田技研工业株式会社 | Ride-sharing vehicle use support system and ride-sharing vehicle use support method |
| CN110633815A (en) * | 2019-08-14 | 2019-12-31 | 杭州飞步科技有限公司 | Car pooling method and device, electronic equipment and storage medium |
| CN112529225A (en) * | 2019-09-17 | 2021-03-19 | 柯尼卡美能达株式会社 | System, information processing device, and program |
| CN114898544A (en) * | 2022-04-29 | 2022-08-12 | 熊赵军 | Network-based traffic connection method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104464274B (en) | 2016-09-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104464274A (en) | Car-sharing taxi taking method and server | |
| CN105070044B (en) | Dynamic scheduling method for customized buses and car pooling based on passenger appointments | |
| CN105006145B (en) | A kind of taxi guidance scheduling system | |
| CN105279955B (en) | A kind of share-car method and apparatus | |
| WO2016074538A1 (en) | Sent order ranking system and method for reducing no-load running and waiting time in online taxi renting | |
| CN105243836A (en) | Carpooling method and device | |
| CN105788333A (en) | Intelligent transportation system with unmanned driving and field return charging functions and implementation method | |
| CN105551235A (en) | Internet-based intercity carpooling travel scheduling system | |
| CN103164751B (en) | A kind of indefinite website is without fixing circuit public transport operation system and method for running | |
| CN106940928A (en) | Order allocation method and device | |
| US20180241234A1 (en) | Methods And Charge Controllers For Charging Of Battery In Electric Vehicle | |
| DE102020120693A1 (en) | Systems and methods for mobile charging of electric vehicles | |
| CN105225472A (en) | A kind of share-car method and apparatus | |
| KR101586974B1 (en) | Method for providing one-way service of shared autonomous vehicle | |
| CN110580546A (en) | route planning method and system based on same vehicle carrier and goods | |
| CN106097702A (en) | Intelligent traffic dispatching method and system | |
| CN102063691A (en) | Method and system for intelligently scheduling vehicles | |
| CN103035122A (en) | Taxi automatic paging system based on smartphone | |
| CN106096868A (en) | A kind of multiple constraint network intensive minibus dispatching method | |
| CN105185148A (en) | Bus scheduling method, device and system | |
| CN110472912A (en) | A kind of net about vehicle provides express delivery with the method and system of city delivery service | |
| CN102324181A (en) | Self-service taxi instant reservation system and self-service taxi instant reservation method | |
| CN105976605A (en) | Automatic car sharing method based on internet of vehicles | |
| CN106981189B (en) | intelligent bus running route setting method and system | |
| CN103198652A (en) | Taxi operation business management system and method based on mobile internet |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |