CN104464274B - Rideshare is called a taxi method and server - Google Patents
Rideshare is called a taxi method and server Download PDFInfo
- Publication number
- CN104464274B CN104464274B CN201410707502.8A CN201410707502A CN104464274B CN 104464274 B CN104464274 B CN 104464274B CN 201410707502 A CN201410707502 A CN 201410707502A CN 104464274 B CN104464274 B CN 104464274B
- Authority
- CN
- China
- Prior art keywords
- vehicle
- candidate
- passenger
- bus
- destination
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- FGUUSXIOTUKUDN-IBGZPJMESA-N C1(=CC=CC=C1)N1C2=C(NC([C@H](C1)NC=1OC(=NN=1)C1=CC=CC=C1)=O)C=CC=C2 Chemical compound C1(=CC=CC=C1)N1C2=C(NC([C@H](C1)NC=1OC(=NN=1)C1=CC=CC=C1)=O)C=CC=C2 FGUUSXIOTUKUDN-IBGZPJMESA-N 0.000 claims description 30
- 230000008901 benefit Effects 0.000 claims description 7
- 230000005540 biological transmission Effects 0.000 claims description 3
- 230000032258 transport Effects 0.000 abstract 1
- 230000003466 anti-cipated effect Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000005096 rolling process Methods 0.000 description 1
- 230000002747 voluntary effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Landscapes
- Traffic Control Systems (AREA)
Abstract
The present invention provides a kind of rideshare to call a taxi method and server, and wherein method includes: receive the editing order message that the rideshare the first passenger on the first vehicle sends, and described editing order message includes the current demand information by bus of described first passenger；In the preset range of described first vehicle present position, selecting the second vehicle meeting described current demand information by bus as transfer vehicle, the coincidence point of the driving path of described first vehicle and the second vehicle is transfer site；Send passenger to described first passenger and confirm that message, described passenger confirm that message includes described transfer site and the mark of described second vehicle；Sending vehicle to described first vehicle and described second vehicle and confirm message, described vehicle confirms that message includes described transfer site.The rideshare that the present invention provides is called a taxi method and server, it is possible to farthest meet passenger's requirement, saves passenger's time, improves and transports success rate and user experience.
Description
Technical field
The present invention relates to intelligent transport technology, particularly relate to a kind of rideshare and call a taxi method and server.
Background technology
Rideshare, also known as taking advantage of altogether, refers to that the voluntary of same taxi is taken in the negotiated agreement of multidigit passenger jointly.Along with developing rapidly and the intensive growth of urban population of urbanization process, occur in that call a taxi difficulty and the big problem of commuter time traffic pressure in a lot of cities.For making the maximizing the benefits of transport facility, alleviating pollution and waste that transportation causes, and reduce the daily transportation cost of people, the call a taxi importance of service system of passenger's rideshare is increasing.
Existing rideshare call a taxi service system can for passenger provide registration, log in, submission demand, the basic function such as confirm an order, after receiving the order that passenger submits to, according to information such as the destinatioies comprised in passenger's present position and order, using optimization algorithm is that passenger selects suitably to transport vehicle, the driving path transporting vehicle is arranged, and information of vehicles and fee payable are sent to passenger, after passenger arrives at, it is also possible to the function complaining and evaluating this pick-up service is provided for passenger.
It is in place of the deficiencies in the prior art, owing to passenger is with taking advantage of a car with other people, the route of vehicle before passenger loading just it has been acknowledged that and fix, therefore passenger can only accept to have arranged after confirming an order, passenger is not allowed to change again destination or driving path after getting on the bus, it is impossible to meet the up-to-date demand that passenger proposes in time.
Summary of the invention
The present invention provides a kind of rideshare to call a taxi method and server, can not meet the technical problem of the up-to-date demand that passenger proposes in time in order to solve rideshare taxi take system of the prior art.
The present invention provides a kind of rideshare to call a taxi method, including:
Receiving the editing order message that the rideshare the first passenger on the first vehicle sends, described editing order message includes the current demand information by bus of described first passenger；
In the preset range of described first vehicle present position, selecting the second vehicle meeting described current demand information by bus as transfer vehicle, the coincidence point of the driving path of described first vehicle and the second vehicle is transfer site；
Send passenger to described first passenger and confirm that message, described passenger confirm that message includes described transfer site and the mark of described second vehicle；Sending vehicle to described first vehicle and described second vehicle and confirm message, described vehicle confirms that message includes described transfer site.
Further, described in the preset range of described first vehicle present position, select the second vehicle meeting described current demand information by bus as transfer vehicle, specifically include:
Step a, select all vehicles in the preset range of the first vehicle position as candidate's vehicle intersection, make n=1, and perform step b；
Step b, in described candidate's vehicle intersection select n-th candidate's vehicle, determine the coincidence point of the driving path of described first vehicle and n-th candidate's vehicle, as candidate's transfer site；According to the Customer information on described n-th candidate's vehicle, it is judged that whether described n-th candidate's vehicle has vacant seating position in described candidate's transfer site: the most then perform step c, if it is not, then perform step f；
Step c, according to other Customer informations, described first vehicle and the driving path of n-th candidate's vehicle on described candidate's transfer site, the departure place of described first passenger and current destination, described first vehicle and n-th candidate's vehicle, determine described first passenger total cost by bus on described first vehicle and n-th candidate's vehicle；Judge that whether described total cost by bus is less than cost threshold: the most then perform step d, if it is not, then perform step e；
Step 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, select minimum candidate's vehicle that total cost is corresponding by bus as the second vehicle in described car intersection to be selected；If it is not, then perform step f；
The numerical value of step f:n adds 1, re-executes step b.
Further, described current demand information by bus includes at least one in amended destination, amended expectation route, amended expected approach time；
If described current demand information by bus includes 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 include amended destination, the then destination during the current destination of the first passenger is original order described in step c；
If described current demand information by bus includes amended expectation route, then described determine described first passenger by bus total cost on the first vehicle and described n-th candidate's vehicle before, described step c also includes: according to described candidate's transfer site, described current destination and described first vehicle and the driving path of described n-th candidate's vehicle, determine that whether described first passenger is through described expected path, if it is not, then perform step f；
If described current demand information by bus includes amended expected approach time, then described determine described first passenger by bus total cost on the first vehicle and described n-th candidate's vehicle before, described step c also includes: according to described candidate's transfer site, described first vehicle and the position of described n-th candidate's vehicle and driving path, determine that described first passenger arrives whether time of current destination meets described expected approach time, if it is not, then perform step f.
Further, described determine described first passenger by bus total cost on the first vehicle and described n-th candidate's vehicle before, described step c also includes:
According to described candidate's transfer site, described first vehicle and the position of n-th candidate's vehicle and driving path, determine described first vehicle and the time difference of n-th candidate's vehicle described candidate's transfer site of arrival；
Judge described time difference whether in the range of the default waiting time, if it is not, then perform step f.
Further, if described n-th candidate's vehicle currently has a backlog, then the driving path of n-th candidate's vehicle includes that driving path that described backlog is corresponding and destination corresponding to described backlog are to the shortest driving path of the current destination of described first passenger；
If described n-th candidate's vehicle is currently without backlog, the driving path of the most described n-th candidate's vehicle is the shortest driving path of the described vehicle present position extremely current destination of described first passenger.
Further, before described in described judgement, whether total cost is less than cost threshold by bus, also include: determine described cost threshold according to the distance between departure place and the current destination of described first passenger.
The present invention also provides for a kind of rideshare and calls a taxi server, including:
Message reception module, for receiving the editing order message that the rideshare the first passenger on the first vehicle sends, described editing order message includes the current demand information by bus of described first passenger；
Transfer vehicle selects module, in the preset range in described first vehicle present position, selecting the second vehicle meeting described current demand information by bus as transfer vehicle, the coincidence point of the driving path of described first vehicle and the second vehicle is transfer site；
For sending passenger to described first passenger, message transmission module, confirms that message, described passenger confirm that message includes described transfer site and the mark of described second vehicle；Sending vehicle to described first vehicle and described second vehicle and confirm message, described vehicle confirms that message includes described transfer site.
Further, described transfer vehicle select module specifically for:
Step a, select all vehicles in the preset range of the first vehicle position as candidate's vehicle intersection, make n=1, and perform step b；
Step b, in described candidate's vehicle intersection select n-th candidate's vehicle, determine the coincidence point of the driving path of described first vehicle and n-th candidate's vehicle, as candidate's transfer site；According to the Customer information on described n-th candidate's vehicle, it is judged that whether described n-th candidate's vehicle has vacant seating position in described candidate's transfer site: the most then perform step c, if it is not, then perform step f；
Step c, according to other Customer informations, described first vehicle and the driving path of n-th candidate's vehicle on described candidate's transfer site, the departure place of described first passenger and current destination, described first vehicle and n-th candidate's vehicle, determine described first passenger total cost by bus on described first vehicle and n-th candidate's vehicle；Judge that whether described total cost by bus is less than cost threshold: the most then perform step d, if it is not, then perform step e；
Step 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, select minimum candidate's vehicle that total cost is corresponding by bus as the second vehicle in described car intersection to be selected；If it is not, then perform step f；
The numerical value of step f:n adds 1, re-executes step b.
Further, described current demand information by bus includes at least one in amended destination, amended expectation route, amended expected approach time；
If described current demand information by bus includes 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 include amended destination, the then destination during the current destination of the first passenger is original order described in step c；
If described current demand information by bus includes amended expectation route, then described determine described first passenger by bus total cost on the first vehicle and described n-th candidate's vehicle before, described step c also includes: according to described candidate's transfer site, described current destination and described first vehicle and the driving path of described n-th candidate's vehicle, determine that whether described first passenger is through described expected path, if it is not, then perform step f；
If described current demand information by bus includes amended expected approach time, then described determine described first passenger by bus total cost on the first vehicle and described n-th candidate's vehicle before, described step c also includes: according to described candidate's transfer site, described first vehicle and the position of described n-th candidate's vehicle and driving path, determine that described first passenger arrives whether time of current destination meets described expected approach time, if it is not, then perform step f.
Further, described transfer vehicle selects module to be additionally operable to:
Described determine described first passenger by bus total cost on the first vehicle and described n-th candidate's vehicle before, according to described candidate's transfer site, described first vehicle and the position of n-th candidate's vehicle and driving path, determine described first vehicle and the time difference of n-th candidate's vehicle described candidate's transfer site of arrival；
Judge described time difference whether in the range of the default waiting time, if it is not, then perform step f.
Further, if described n-th candidate's vehicle currently has a backlog, then the driving path of n-th candidate's vehicle includes that driving path that described backlog is corresponding and destination corresponding to described backlog are to the shortest driving path of the current destination of described first passenger；
If described n-th candidate's vehicle is currently without backlog, the driving path of the most described n-th candidate's vehicle is the shortest driving path of the described vehicle present position extremely current destination of described first passenger.
Further, described transfer vehicle selects module to be additionally operable to:
Before whether total cost is less than cost threshold by bus described in described judgement, determine described cost threshold according to the distance between departure place and the current destination of described first passenger.
The solution have the advantages that: by receiving the current demand information by bus that the rideshare the first passenger on the first vehicle sends, in the preset range of the first vehicle present position, select to meet the transfer vehicle of described current demand information by bus, determine transfer site, and the mark of described transfer site and transfer vehicle is sent to the first passenger, first passenger can be changed to described transfer vehicle in transfer site, can farthest meet passenger's requirement, save passenger's time, improve and transport success rate and user experience.
Accompanying drawing explanation
Fig. 1 calls a taxi for the rideshare that the embodiment of the present invention one provides the flow chart of method；
Fig. 2 calls a taxi for the rideshare that the embodiment of the present invention two provides the flow chart of method；
Fig. 3 calls a taxi for the rideshare that the embodiment of the present invention three provides the flow chart of method；
Fig. 4 calls a taxi for the rideshare that the embodiment of the present invention four provides the structural representation of server.
Detailed description of the invention
For making the purpose of the embodiment of the present invention, technical scheme and advantage clearer, 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 a part of embodiment of the present invention rather than whole embodiments.Based on the embodiment in the present invention, the every other embodiment that those of ordinary skill in the art are obtained under not making creative work premise, broadly fall into the scope of protection of the invention.
Embodiment one
Fig. 1 calls a taxi for the rideshare that the embodiment of the present invention one provides the flow chart of method.As it is shown in figure 1, the method in the present embodiment, may include that
The editing order message that step 101, the reception rideshare the first passenger on the first vehicle send, described editing order message includes the current demand information by bus of described first passenger.
Specifically, in the present embodiment, the executive agent of method can be server.
When the first passenger has demand by bus, sequence information can be sent to server, sequence information can include the first passenger's present position and destination.Server can be according to the first passenger's present position and destination, it is 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, first passenger position is sent to the first vehicle, in order to the first passenger can wait in current location that the first vehicle arrives.After the first passenger loading, can send prompting message to server, represent and oneself got on the bus, server can update the passenger status information of the first vehicle according to this prompting message.
If needing amendment demand by bus after the first passenger loading, such as, needing to change current destination, then can send editing order message to server, editing order message includes that currently demand information can be such as amended destination by bus.Server, after receiving editing order message, before described first passenger getting off car, can select transfer vehicle for it according to the current demand information by bus wherein comprised.
Step 102, in the preset range of described first vehicle present position, select the second vehicle meeting described current demand information by bus as transfer vehicle, the coincidence 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 vehicle present position and current time by server, such as, if the first vehicle present position is more remote or current time is peak period on and off duty, the most described preset range can be relatively big, otherwise the most described preset range can be less.
The coincidence point of the driving path of the first vehicle and the second vehicle can be the first vehicle and the cross point of the second vehicle running path, when there being multiple cross point, arbitrarily can select in multiple cross points a little as coincidence point, when the driving path of the first vehicle and the second vehicle overlaps, the any point of lap can be selected as coincidence point, and described coincidence point is first passenger transfer site by the first vehicle transfer to the second vehicle.
Existing rideshare is called a taxi in method, owing to passenger and other people take advantage of same car altogether, therefore to avoid damaging other people interests, passenger is not allowed to revise order afterwards getting on the bus, passenger is if it is desired to go to other destination, it is merely able to terminate 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 suitably to change to vehicle and transfer site according to demand information by bus, for passenger in described transfer site transfer to described transfer vehicle.
Step 103, send passenger to described first passenger and confirm that message, described passenger confirm that message includes described transfer site and the mark of described second vehicle；Sending vehicle to described first vehicle and described second vehicle and confirm message, described vehicle confirms that message includes described transfer site.
Specifically, 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, it is simple to the first passenger gets off from described first vehicle in described transfer site, and changes to the second vehicle.
When the first passenger is taking after the second vehicle arrives at the destination, and the statement of expense can also be sent to the first passenger by server, the first passenger complete charge operation.Additionally, the first passenger can also send this evaluation information serviced by bus and/or calling information to server, server carry out respective handling.
The rideshare that the present embodiment provides is called a taxi in method, by receiving the current demand information by bus that the rideshare the first passenger on the first vehicle sends, in the preset range of the first vehicle present position, select meet the transfer vehicle of described current demand information by bus and determine transfer site, and the mark of described transfer site and transfer vehicle is sent to the first passenger, first passenger can be changed to described transfer vehicle in transfer site, can farthest meet passenger's requirement, save passenger's time, improve and transport success rate and user experience.
Wherein, described in the preset range of described first vehicle present position, select the second vehicle meeting described current demand information by bus as transfer vehicle, can there is multiple implementation, the present invention provides two kinds of methods selecting transfer vehicle, illustrates with embodiment two and embodiment three respectively.
Embodiment two
Fig. 2 calls a taxi for the rideshare that the embodiment of the present invention two provides the flow chart of method.As in figure 2 it is shown, the method in the present embodiment, may include that
The editing order message that step 201, the reception rideshare the first passenger on the first vehicle send, described editing order message includes the current demand information by bus of described first passenger.
Wherein, described current demand information by bus can include at least one in amended destination, amended expectation route, amended expected approach time.
When the first passenger get on the bus want afterwards change destination time, amended destination can be sent to server, or, when although the first passenger is not desired to change destination after getting on the bus, but to present running route or anticipated reach the time and be unsatisfied with, then can using want through route or want the time arrived to be sent to server as amended expectation route or amended expected approach time.
Server is after receiving editing order message, it is that the first passenger selects to change to vehicle, specifically, in the preset range of described first vehicle present position, 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, select all vehicles in the preset range of the first vehicle position as candidate's vehicle intersection, make n=1, and perform step 203.
Step 203, in described candidate's vehicle intersection select n-th candidate's vehicle, determine the coincidence point of the driving path of described first vehicle and n-th candidate's vehicle, as candidate's transfer site；According to the Customer information on described n-th candidate's vehicle, it is judged that whether described n-th candidate's vehicle has vacant seating position in described candidate's transfer site: the most then perform step 204, if it is not, then perform step 208.
Specifically, the driving path of n-th candidate's vehicle is determined as follows: if described n-th candidate's vehicle currently has a backlog, then the driving path of n-th candidate's vehicle includes that driving path that described backlog is corresponding and destination corresponding to described backlog are to the shortest driving path of the current destination of described first passenger；If described n-th candidate's vehicle is currently without backlog, the driving path of the most described n-th candidate's vehicle is the shortest driving path of the described vehicle present position extremely current destination of described first passenger.
That is, before other passengers take n-th candidate's vehicle, server can determine n-th candidate's vehicle driving path between 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 having backlog on n-th candidate's vehicle, 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, it is believed that the driving path of n-th candidate's vehicle is arbitrary, the nearest path of described passenger's present position can be chosen as driving path.
According to the first vehicle and the driving path of n-th candidate's vehicle, it may be determined that go out coincidence point, specifically, coincidence point can be first cross point of the first vehicle and n-th candidate's vehicle, selects this coincidence point as candidate's transfer site.
After candidate's transfer site determines, can determine whether whether n-th candidate's vehicle has vacant seating position in candidate's transfer site, without vacant seating position, illustrate that n-th candidate's vehicle is undesirable, the most directly perform step 208, change candidate's vehicle to calculate, if meeting the requirements, then execution step 204:
Step 204, according to other Customer informations, described first vehicle and the driving path of n-th candidate's vehicle on described candidate's transfer site, the departure place of described first passenger and current destination, described first vehicle and n-th candidate's vehicle, determine described first passenger total cost by bus on described first vehicle and n-th candidate's vehicle；Judge that whether described total cost by bus is less than cost threshold: the most then perform step 205, if it is not, then perform step 206.
Specifically, if demand information includes amended destination the most by bus, then described in step 204, the current destination of the first passenger refers to amended destination；If demand information does not include that amended destination, the current destination of the most described first passenger refer to the destination in original order the most by bus.
After candidate's transfer site determines, mileage and unit price that server can be passed by by passenger determine that riding fee is used, such as, concrete rideshare expense standard is: passenger's rideshare 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 with getting off all determine that, therefore can obtain first passenger riding fee on the first vehicle to use, in like manner can obtain first passenger riding fee on the second vehicle to use, it is added the total cost by bus that i.e. can obtain the first passenger.Additionally, according to above-mentioned each information it may also be determined that the first passenger estimates the time arrived at.
Described cost threshold can determine according to the distance between the departure place of the first passenger and current destination, and distance is the biggest, and cost threshold is the biggest, otherwise then cost threshold is the least.When total cost is less than cost threshold by bus of the first passenger, performs step 205, otherwise perform step 208.
If described current demand information by bus includes amended expectation route, then described determine described first passenger by bus total cost on the first vehicle and described n-th candidate's vehicle before, can also be according to described candidate's transfer site, described current destination and described first vehicle and the driving path of described n-th candidate's vehicle, determine that whether described first passenger is through described expected path, if it is not, then perform step 208.As such, it is possible to candidate's vehicle of the expected path not meeting passenger is got rid of.
If described current demand information by bus includes amended expected approach time, then described determine described first passenger by bus total cost on the first vehicle and described n-th candidate's vehicle before, can also be according to described candidate's transfer site, described first vehicle and the position of described n-th candidate's vehicle and driving path, determine that described first passenger arrives whether time of current destination meets described expected approach time, if it is not, then perform step 208.As such, it is possible to candidate's vehicle of the expected approach time not meeting passenger is got rid of.
Step 205, select current n-th candidate's vehicle as described second vehicle, and perform step 209.
When determining when total cost is less than cost threshold by bus of the first passenger, it is believed that n-th current candidate's vehicle is to change to vehicle than more preferably candidate, therefore selecting 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: the most then perform step 207；If it is not, then perform step 208.
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, select minimum by bus candidate's vehicle that total cost is corresponding as the second vehicle in described car intersection to be selected, and perform step 209.
If the total cost by bus that the first passenger is 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 abundant candidate's vehicle to be calculated, conduct second vehicle of most suitable one can be selected in this n candidate's vehicle, specifically, can be first in front n candidate's vehicle, candidate's vehicle of vacant seating position will not had all to get rid of in corresponding candidate's transfer site, remaining all candidate's vehicles are as car intersection to be selected, then select minimum candidate's vehicle that total cost is corresponding by bus as the second vehicle in car intersection to be selected, candidate's transfer site (i.e. this candidate's vehicle and the coincidence point of the first vehicle) that this candidate's vehicle is corresponding is as transfer site, if n is not reaching to 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 is also not reaching to preset value simultaneously, then perform step 203 after making n+1, it is judged that whether next candidate's vehicle meets requirement.
By step 202 to step 208, can be in the preset range of described first vehicle present position, selecting and meet the second vehicle of described current demand information by bus as transfer vehicle, the coincidence point of the driving path of described first vehicle and the second vehicle is transfer site.After transfer vehicle and transfer site determine, perform step 209.
Step 209, send passenger to described first passenger and confirm that message, described passenger confirm that message includes described transfer site and the mark of described second vehicle；Sending vehicle to described first vehicle and described second vehicle and confirm message, described vehicle confirms that message includes described transfer site.
The rideshare that the present embodiment provides is called a taxi in method, after receiving the editing order request that the first passenger sends, position according to the first vehicle determines candidate's vehicle intersection, judge successively the candidate's vehicle in intersection whether meet passenger currently ride demand, whether meet cost requirements, if be unsatisfactory for passenger currently ride demand, then got rid of, if meeting passenger to require to meet again cost requirements, then current candidate vehicle can serve as the second vehicle, if the candidate's vehicle in a certain number of is all unsatisfactory for cost requirements, then select candidate's vehicle that minimum cost is corresponding as the second vehicle, can provide for passenger rapidly after receiving the editing order information of passenger and suitably change to vehicle, meet the requirement of real time of passenger.
On the basis of the technical scheme that embodiment two provides, it is preferred that described determine described first passenger by bus total cost on the first vehicle and described n-th candidate's vehicle before, also include:
According to described candidate's transfer site, described first vehicle and the position of n-th candidate's vehicle and driving path, determine described first vehicle and the time difference of n-th candidate's vehicle described candidate's transfer site of arrival；Judge described time difference whether in the range of the default waiting time, if it is not, then perform step 208.
Specifically, determining by bus before total cost, can first judge whether the time difference of the first vehicle and n-th candidate's vehicle arrival candidate's transfer site meets requirement, if time difference is excessive, illustrate that the first passenger needs to wait the long period in candidate's transfer site, then n-th candidate's vehicle is not suitable as changing to vehicle, now n-th candidate's vehicle can be got rid of, directly judge whether next car meets requirement, passenger can being waited, the time of candidate's vehicle controls within the specific limits, avoid passenger waiting time long, save passenger's time further.
Embodiment three
Fig. 3 calls a taxi for the rideshare that the embodiment of the present invention three provides the flow chart of method.As it is shown on figure 3, the method in the present embodiment, may include that
The editing order message that step 301, the reception rideshare the first passenger on the first vehicle send, described editing order message includes 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, it can also be the intersection after some vehicles substantially not meeting passenger's requirement in rolling stock are removed, such as, if a certain vehicle is fully loaded with, can be got rid of, or, away from passenger, position is presently in for current location or driving path and exceedes the vehicle of certain distance, they can be got rid of outside candidate's vehicle intersection, it is possible to reduce subsequent calculations amount.
Step 303, determine in candidate's vehicle intersection each candidate's vehicle candidate's transfer site with described first vehicle, and calculate corresponding total cost by bus.
The determination method of concrete candidate's transfer site and by bus total cost is similar with the method in embodiment two, and here is omitted.
Before calculating total cost of riding, candidate's vehicle further can also be screened, such as, judge whether the time that candidate's vehicle arrives at anticipated first passenger whether candidate's transfer site has vacant seating position, candidate's vehicle corresponding meets requirement, whether the route of process meets requirement etc., is got rid of by the candidate's vehicle not meeting passenger's requirement from described candidate's vehicle intersection.
Step 304, selecting minimum by bus candidate's vehicle that total cost is corresponding as the second vehicle in candidate's vehicle intersection, the coincidence point of described candidate's vehicle and the first vehicle is as transfer site.
Unlike the method selecting transfer vehicle in embodiment two, the present embodiment, need first to be determined for compliance with passenger's total cost by bus that currently whole candidate's vehicles of demand are corresponding by bus, and compare the total cost by bus that each candidate's vehicle is corresponding, select minimum candidate's vehicle that total cost is corresponding by bus as the second vehicle.
Step 305, send passenger to described first passenger and confirm that message, described passenger confirm that message includes described transfer site and the mark of described second vehicle；Sending vehicle to described first vehicle and described second vehicle and confirm message, described vehicle confirms that message includes described transfer site.
The rideshare that the present embodiment provides is called a taxi in method, after receiving the editing order request that the first passenger sends, position according to the first vehicle determines candidate's vehicle intersection, determine each candidate's vehicle in intersection and candidate's transfer site of the first vehicle, and determine corresponding total cost by bus, then select minimum by bus candidate's vehicle that total cost is corresponding as the transfer vehicle of the first passenger, whole candidate can be analyzed comprehensively and change to vehicle, there is provided most suitable transfer vehicle for passenger, meet the current demand by bus of passenger to greatest extent.
Embodiment four
Fig. 4 calls a taxi for the rideshare that the embodiment of the present invention four provides the structural representation of server.As shown in Figure 4, the server in the present embodiment, may include that
Message reception module 401, for receiving the editing order message that the rideshare the first passenger on the first vehicle sends, described editing order message includes the current demand information by bus of described first passenger；
Transfer vehicle selects module 402, in the preset range in described first vehicle present position, selecting the second vehicle meeting described current demand information by bus as transfer vehicle, the coincidence point of the driving path of described first vehicle and the second vehicle is transfer site；
For sending passenger to described first passenger, message transmission module 403, confirms that message, described passenger confirm that message includes described transfer site and the mark of described second vehicle；Sending vehicle to described first vehicle and described second vehicle and confirm message, described vehicle confirms that message includes described transfer site.
The rideshare that the present embodiment provides is called a taxi server, may be used for performing the technical scheme in embodiment illustrated in fig. 1 one, and it is similar with technique effect that it realizes principle, and here is omitted.
Embodiment four provide technical scheme on the basis of, further, described transfer vehicle select module 402 specifically for:
Step a, select all vehicles in the preset range of the first vehicle position as candidate's vehicle intersection, make n=1, and perform step b；
Step b, in described candidate's vehicle intersection select n-th candidate's vehicle, determine the coincidence point of the driving path of described first vehicle and n-th candidate's vehicle, as candidate's transfer site；According to the Customer information on described n-th candidate's vehicle, it is judged that whether described n-th candidate's vehicle has vacant seating position in described candidate's transfer site: the most then perform step c, if it is not, then perform step f；
Step c, according to other Customer informations, described first vehicle and the driving path of n-th candidate's vehicle on described candidate's transfer site, the departure place of described first passenger and current destination, described first vehicle and n-th candidate's vehicle, determine described first passenger total cost by bus on described first vehicle and n-th candidate's vehicle；Judge that whether described total cost by bus is less than cost threshold: the most then perform step d, if it is not, then perform step e；
Step 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, select minimum candidate's vehicle that total cost is corresponding by bus as the second vehicle in described car intersection to be selected；If it is not, then perform step f；
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 includes at least one in amended destination, amended expectation route, amended expected approach time；
If described current demand information by bus includes that amended destination, the current destination of the most described first passenger are described amended destination；If described current demand information by bus does not include that amended destination, the current destination of the most described first passenger are the destination in original order；
If described current demand information by bus includes amended expectation route, the most described transfer vehicle selects module 402 to be additionally operable to: described determine described first passenger by bus total cost on the first vehicle and described n-th candidate's vehicle before, according to described candidate's transfer site, described current destination and described first vehicle and the driving path of described n-th candidate's vehicle, determine that whether described first passenger is through described expected path, if it is not, then perform step f；
If described current demand information by bus includes amended expected approach time, the most described transfer vehicle selects module 402 to be additionally operable to: described determine described first passenger by bus total cost on the first vehicle and described n-th candidate's vehicle before, according to described candidate's transfer site, described first vehicle and the position of described n-th candidate's vehicle and driving path, determine that described first passenger arrives whether time of current destination meets described expected approach time, if it is not, then perform step f.
On the basis of above-described embodiment, further, described transfer vehicle selects module 402 to be additionally operable to:
Described determine described first passenger by bus total cost on the first vehicle and described n-th candidate's vehicle before, according to described candidate's transfer site, described first vehicle and the position of n-th candidate's vehicle and driving path, determine described first vehicle and the time difference of n-th candidate's vehicle described candidate's transfer site of arrival；
Judge described time difference whether in the range of the default waiting time, if it is not, then perform step f.
On the basis of above-described embodiment, further, described transfer vehicle selects module 402 to be additionally operable to:
If described n-th candidate's vehicle currently has backlog, then select driving path that described backlog is corresponding and destination corresponding to described backlog to the shortest driving path of the current destination of described first passenger as the driving path of n-th candidate's vehicle；
If described n-th candidate's vehicle is currently without backlog, then select the shortest driving path driving path as described n-th candidate's vehicle of the described vehicle present position extremely current destination of described first passenger.
On the basis of above-described embodiment, further, described transfer vehicle selects module 402 to be additionally operable to:
Before whether total cost is less than cost threshold by bus described in described judgement, determine described cost threshold according to the distance between departure place and the current destination of described first passenger.
Last it is noted that various embodiments above is only in order to illustrate technical scheme, it is not intended to limit；Although the present invention being described in detail with reference to foregoing embodiments, it will be understood by those within the art that: the technical scheme described in foregoing embodiments still can be modified by it, or the most some or all of technical characteristic is carried out equivalent；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. a rideshare is called a taxi method, it is characterised in that including:
Receive the editing order message that the rideshare the first passenger on the first vehicle sends, described editing order
Message includes the current demand information by bus of described first passenger；
In the preset range of described first vehicle present position, select to meet described current need by bus
Ask the second vehicle of information as transfer vehicle, the weight of the driving path of described first vehicle and the second vehicle
Chalaza is transfer site；
Send passenger to described first passenger and confirm that message, described passenger confirm that message includes described transfer
Place and the mark of described second vehicle；Send vehicle to described first vehicle and described second vehicle to confirm
Message, described vehicle confirms that message includes described transfer site.
Method the most according to claim 1, it is characterised in that described current at described first vehicle
In the preset range of position, select the second vehicle meeting described current demand information by bus as changing
By bus, specifically include:
Step a, select all vehicles in the preset range of the first vehicle position as candidate's vehicle
Intersection, makes n=1, and performs step b；
Step b, in described candidate's vehicle intersection select n-th candidate's vehicle, determine described first car
And the coincidence point of driving path of n-th candidate's vehicle, as candidate's transfer site；According to described
Customer information on n candidate's vehicle, it is judged that described n-th candidate's vehicle is in described candidate's transfer site
Whether there is vacant seating position: the most then perform step c, if it is not, then perform step f；
Step c, according to described candidate's transfer site, the departure place of described first passenger and current destination,
Other Customer informations on described first vehicle and n-th candidate's vehicle, described first vehicle and n-th
The driving path of candidate's vehicle, determines that described first passenger is at described first vehicle and n-th candidate's vehicle
On by bus total cost；Judge that whether described total cost by bus is less than cost threshold: the most then perform step
Rapid d, if it is not, then perform step e；
Step d, select current n-th candidate's vehicle as described second vehicle；
Step e, judge whether n reaches predetermined value: the most then select in front n candidate's vehicle
Corresponding candidate's transfer site has all candidate's vehicles of vacant seating position as car intersection to be selected, in institute
State and car intersection to be selected selects minimum candidate's vehicle that total cost is corresponding by bus as the second vehicle；If it is not,
Then perform step f；
The numerical value of step f:n adds 1, re-executes step b.
Method the most according to claim 2, it is characterised in that described current demand information bag by bus
Include at least in amended destination, amended expectation route, amended expected approach time
?；
If described current demand information by bus includes amended destination, then first take advantage of described in step c
The current destination of visitor is described amended destination；If described current demand information by bus does not includes repairing
Destination after changing, then the purpose during the current destination of the first passenger is original order described in step c
Ground；
If described current demand information by bus includes amended expectation route, then determine described the described
Before one passenger total cost by bus on the first vehicle and described n-th candidate's vehicle, described step c
Also include: according to described candidate's transfer site, described current destination and described first vehicle and described
The driving path of n-th candidate's vehicle, determine described first passenger whether through described expected path, if
No, then perform step f；
If described current demand information by bus includes amended expected approach time, then determine institute described
Before stating first passenger total cost by bus on the first vehicle and described n-th candidate's vehicle, described step
Rapid c also includes: according to described candidate's transfer site, described first vehicle and described n-th candidate's vehicle
Position and driving path, determine that described first passenger arrives time of current destination and whether meets described
Expected approach time, if it is not, then perform step f.
Method the most according to claim 2, it is characterised in that determine described first passenger described
Before total cost by bus on the first vehicle and described n-th candidate's vehicle, described step c also includes:
According to described candidate's transfer site, described first vehicle and the position of n-th candidate's vehicle and traveling
Path, determines described first vehicle and the time difference of n-th candidate's vehicle described candidate's transfer site of arrival；
Judge described time difference whether in the range of the default waiting time, if it is not, then perform step f.
Method the most according to claim 2, it is characterised in that
If described n-th candidate's vehicle currently has backlog, then the traveling road of n-th candidate's vehicle
Footpath includes driving path that described backlog is corresponding and destination corresponding to described backlog extremely
The shortest driving path of the current destination of described first passenger；
If described n-th candidate's vehicle is currently without backlog, the most described n-th candidate's vehicle
Driving path is the shortest traveling of the described vehicle present position extremely current destination of described first passenger
Path.
6. according to the method described in any one of claim 2-5, it is characterised in that described in described judgement
By bus whether total cost less than before cost threshold, also includes: according to the departure place of described first passenger and
Distance between current destination determines described cost threshold.
7. a rideshare is called a taxi server, it is characterised in that including:
Message reception module, for receiving the editing order that the rideshare the first passenger on the first vehicle sends
Message, described editing order message includes the current demand information by bus of described first passenger；
Transfer vehicle selects module, is used in the preset range of described first vehicle present position,
Select the second vehicle meeting described current demand information by bus as transfer vehicle, described first vehicle with
The coincidence point of the driving path of the second vehicle is transfer site；
Message transmission module, confirms message for sending passenger to described first passenger, and described passenger confirms
Message includes described transfer site and the mark of described second vehicle；To described first vehicle and described
Two vehicles send vehicle and confirm message, and described vehicle confirms that message includes described transfer site.
Server the most according to claim 7, it is characterised in that described transfer vehicle selects module
Specifically for:
Step a, select all vehicles in the preset range of the first vehicle position as candidate's vehicle
Intersection, makes n=1, and performs step b；
Step b, in described candidate's vehicle intersection select n-th candidate's vehicle, determine described first car
And the coincidence point of driving path of n-th candidate's vehicle, as candidate's transfer site；According to described
Customer information on n candidate's vehicle, it is judged that described n-th candidate's vehicle is in described candidate's transfer site
Whether there is vacant seating position: the most then perform step c, if it is not, then perform step f；
Step c, according to described candidate's transfer site, the departure place of described first passenger and current destination,
Other Customer informations on described first vehicle and n-th candidate's vehicle, described first vehicle and n-th
The driving path of candidate's vehicle, determines that described first passenger is at described first vehicle and n-th candidate's vehicle
On by bus total cost；Judge that whether described total cost by bus is less than cost threshold: the most then perform step
Rapid d, if it is not, then perform step e；
Step d, select current n-th candidate's vehicle as described second vehicle；
Step e, judge whether n reaches predetermined value: the most then select in front n candidate's vehicle
Corresponding candidate's transfer site has all candidate's vehicles of vacant seating position as car intersection to be selected, in institute
State and car intersection to be selected selects minimum candidate's vehicle that total cost is corresponding by bus as the second vehicle；If it is not,
Then perform step f；
The numerical value of step f:n adds 1, re-executes step b.
Server the most according to claim 8, it is characterised in that described current demand information by bus
Including in amended destination, amended expectation route, amended expected approach time at least
One；
If described current demand information by bus includes amended destination, the most described first passenger's is current
Destination is described amended destination；If described current demand information by bus does not include amended mesh
Ground, the current destination of the most described first passenger is the destination in original order；
If described current demand information by bus includes amended expectation route, the most described transfer vehicle selects
Module is additionally operable to: determine that described first passenger is on the first vehicle and described n-th candidate's vehicle described
By bus total cost before, according to described candidate's transfer site, described current destination and described first
Vehicle and the driving path of described n-th candidate's vehicle, determine that whether described first passenger is through the described phase
Hope path, if it is not, then perform step f；
If described current demand information by bus includes amended expected approach time, the most described transfer vehicle
Selection module is additionally operable to: determine that described first passenger is at the first vehicle and described n-th candidate's car described
Before total cost by bus on, according to described candidate's transfer site, described first vehicle and described n-th
The position of candidate's vehicle and driving path, determine that the time that described first passenger arrives current destination is
No meet described expected approach time, if it is not, then perform step f.
Server the most according to claim 8, it is characterised in that described transfer vehicle selects mould
Block is additionally operable to:
Described first passenger always riding on the first vehicle and described n-th candidate's vehicle is determined described
Before expense, according to described candidate's transfer site, described first vehicle and the position of n-th candidate's vehicle
And driving path, determine that described first vehicle and n-th candidate's vehicle arrive described candidate's transfer site
Time difference；
Judge described time difference whether in the range of the default waiting time, if it is not, then perform step f.
11. servers according to claim 8, it is characterised in that described transfer vehicle selects mould
Block is additionally operable to:
If described n-th candidate's vehicle currently has backlog, then select described backlog corresponding
Driving path and destination corresponding to described backlog to the current destination of described first passenger
The shortest driving path as the driving path of n-th candidate's vehicle；
If described n-th candidate's vehicle is currently without backlog, then described vehicle is selected to be currently located
The shortest driving path of the position extremely current destination of described first passenger is as described n-th candidate's vehicle
Driving path.
12. servers described in-11 any one according to Claim 8, it is characterised in that described transfer car
Module is selected to be additionally operable to: before by bus whether total cost is less than cost threshold described in described judgement, root
Described cost threshold is determined according to the distance between departure place and the current destination of described first passenger.
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 CN104464274A (en) | 2015-03-25 |
| CN104464274B true 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) |
Families Citing this family (29)
| 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 |
| CN105243836B (en) * | 2015-10-14 | 2019-03-12 | 青岛众至创捷网络科技有限公司 | A kind of share-car method and apparatus |
| CN107016584B (en) * | 2016-01-27 | 2021-01-05 | 北京嘀嘀无限科技发展有限公司 | Order screening method and device |
| WO2018073230A1 (en) * | 2016-10-20 | 2018-04-26 | Volkswagen Aktiengesellschaft | Apparatuses, methods and computer programs for a vehicle and a central office |
| CN108090594B (en) * | 2016-11-21 | 2021-06-04 | 北京嘀嘀无限科技发展有限公司 | Carpooling method and device |
| 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 |
| JP2018205829A (en) * | 2017-05-30 | 2018-12-27 | 本田技研工業株式会社 | Ride-sharing control device, ride-sharing control method, and program |
| JP6602345B2 (en) * | 2017-06-21 | 2019-11-06 | 本田技研工業株式会社 | Passenger system |
| CN107393295A (en) * | 2017-07-18 | 2017-11-24 | 鄂尔多斯市普渡科技有限公司 | A kind of countermeasure of unmanned cab-getter midway modification information |
| JP6844703B2 (en) * | 2017-08-08 | 2021-03-17 | 日産自動車株式会社 | Shared vehicle management method and shared vehicle management device |
| JP6870561B2 (en) * | 2017-10-10 | 2021-05-12 | トヨタ自動車株式会社 | Vehicle dispatching device and vehicle dispatching method |
| CN115578848A (en) * | 2017-12-04 | 2023-01-06 | 北京嘀嘀无限科技发展有限公司 | System and method for providing cost-sharing transportation services |
| WO2019109198A1 (en) | 2017-12-04 | 2019-06-13 | Beijing Didi Infinity Technology And Development Co., Ltd. | System and method for determining and recommending vehicle pick-up location |
| CN110337057B (en) * | 2018-03-15 | 2022-09-20 | 北京搜狗科技发展有限公司 | Reminding method and device for vehicle service |
| US11370455B2 (en) * | 2018-05-15 | 2022-06-28 | Nissan Motor Co., Ltd. | Boarding-alighting position determination method, boarding-alighting position determination device, and boarding-alighting position determination system |
| JP6992684B2 (en) * | 2018-06-14 | 2022-01-13 | トヨタ自動車株式会社 | Information processing equipment and information processing method |
| CN110717797A (en) * | 2018-07-11 | 2020-01-21 | 北京嘀嘀无限科技发展有限公司 | Order distribution method, device, server and storage medium |
| CN109325185B (en) * | 2018-07-16 | 2020-01-03 | 北京三快在线科技有限公司 | Method, device and equipment for determining getting-on point and storage medium |
| JP7063172B2 (en) * | 2018-07-31 | 2022-05-09 | トヨタ自動車株式会社 | Information processing device, vehicle adjustment method and vehicle adjustment program |
| JP7206818B2 (en) * | 2018-11-01 | 2023-01-18 | トヨタ自動車株式会社 | Ride-sharing brokerage system, server, program and ride-sharing brokerage method |
| 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 |
| JP6916230B2 (en) * | 2019-03-05 | 2021-08-11 | 本田技研工業株式会社 | Shared vehicle usage support system and shared vehicle usage support method |
| CN110633815A (en) * | 2019-08-14 | 2019-12-31 | 杭州飞步科技有限公司 | Car pooling method and device, electronic equipment and storage medium |
| JP7363248B2 (en) * | 2019-09-17 | 2023-10-18 | コニカミノルタ株式会社 | Systems, information processing devices and programs |
| CN113869735A (en) * | 2021-09-28 | 2021-12-31 | 驭势科技（北京）有限公司 | Vehicle monitoring method and device, electronic equipment and storage medium |
| CN114898544A (en) * | 2022-04-29 | 2022-08-12 | 熊赵军 | Network-based traffic connection method and system |
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的出租拼车系统的设计与实现;李江山;《中国优秀硕士学位论文全文数据库 信息科技辑》;20140515(第05期);正文第25页 * |
| 语音"拼车"系统;李洪伟 等;《物联网技术》;20130930(第9期);第7-9页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104464274A (en) | 2015-03-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104464274B (en) | Rideshare is called a taxi method and server | |
| CN104931063B (en) | Path planning method | |
| d'Orey et al. | Empirical evaluation of a dynamic and distributed taxi-sharing system | |
| CN103996290B (en) | A kind of provide the method for dial-a-cab, server and system | |
| CN105070044B (en) | Dynamic scheduling method for customized buses and car pooling based on passenger appointments | |
| CN105279955B (en) | A kind of share-car method and apparatus | |
| CN107919013B (en) | Get-on point processing method and server | |
| CN112419706B (en) | Real-time single processing method and server | |
| WO2016074538A1 (en) | Sent order ranking system and method for reducing no-load running and waiting time in online taxi renting | |
| CN106940928A (en) | Order allocation method and device | |
| CN112149855A (en) | Order allocation method and device | |
| WO2016135648A1 (en) | Systems and methods for managing a vehicle sharing facility | |
| CN103164751B (en) | A kind of indefinite website is without fixing circuit public transport operation system and method for running | |
| CN107767322B (en) | Carpooling method and device | |
| CN106297273B (en) | The processing method and processing device of regular bus route | |
| CN108510730A (en) | Vehicle dispatching method and system between shared automobile site | |
| KR101586974B1 (en) | Method for providing one-way service of shared autonomous vehicle | |
| CN107316092B (en) | Inter-city network taxi booking and sharing client searching and receiving and sending method | |
| CN104951848A (en) | Real-time car-pooling matching method | |
| CN106989754A (en) | Multi-mode public transport planning system and method based on public bicycles | |
| CN112561379A (en) | Regional network taxi appointment-oriented scheduling method | |
| DE102014210381A1 (en) | Method and apparatus for operating a vehicle fleet system | |
| CN110472912A (en) | A kind of net about vehicle provides express delivery with the method and system of city delivery service | |
| CN113393137B (en) | Scheduling sharing system based on Internet of vehicles | |
| CN107786600B (en) | Driver terminal recommendation processing method and server |
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 |