CN109376886A - A kind of network share-car method and computer-readable medium - Google Patents
A kind of network share-car method and computer-readable medium Download PDFInfo
- Publication number
- CN109376886A CN109376886A CN201811133682.8A CN201811133682A CN109376886A CN 109376886 A CN109376886 A CN 109376886A CN 201811133682 A CN201811133682 A CN 201811133682A CN 109376886 A CN109376886 A CN 109376886A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- user
- share
- destination
- car
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 65
- 230000008569 process Effects 0.000 claims description 9
- 230000009467 reduction Effects 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000007613 environmental effect Effects 0.000 description 2
- 230000003466 anti-cipated effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 230000000644 propagated effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/02—Reservations, e.g. for tickets, services or events
- G06Q10/025—Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a kind of network share-car method and computer-readable mediums to be followed successively by the m vehicle successively order that user's matching meets order condition according to the share-car information of the user of acquisition and the running information of vehicle；The order condition of vehicle includes: that vacancy is greater than or equal to share-car number by the way and on vehicle with user；The destination of the m vehicle is the destination of user, the destination of n-th vehicle be (n+1)th vehicle with meeting user.The case where to make user successfully arrive at destination, but the vehicle of each order is the user connect by the way, avoids the empty driving that may occur to send user to arrive at the destination.
Description
Technical field
The present invention relates to network about vehicle technical field, espespecially a kind of network share-car method and computer-readable medium.
Background technique
Current network about vehicle software, has the function of share-car.Share-car function more from the aspect of customer, allows to
Very easily with other people same journeys, and it is too many to be unlikely to detour.But considered based on driver, the driver end of network about vehicle, which has, " to be set
Set intention destination " function, system can assign the order for going to the direction.However this mode, only simple setting is anticipated
To destination, the appointment of system is with certain uncertain, it may be possible to exceed or not reach yet the expected terminal reached of driver
's.Under such circumstances, it is likely to result in the empty driving of driver, especially more long-distance order returns to home in case of in driver
In process in, however order is assigned to have to connect, driver can only go to far place and then go home again.It is this unnecessary
Empty driving be a kind of waste greatly for gasoline or electric power resource and human resources, path resource, it is very not energy-efficient
Environmental protection.
Summary of the invention
The embodiment of the present invention provides a kind of network share-car method and computer-readable medium, to realize energy-saving and environment-friendly spelling
Vehicle.
A kind of network share-car method provided in an embodiment of the present invention, comprising:
According to the share-car information of the user of acquisition and the running information of vehicle, it is followed successively by user's matching and meets order condition
The successively order of m vehicle；Wherein, the share-car information include: user departure place, customer objective, share-car number and acceptable
At most change trains or buses times Ns, m is greater than 1 and to be less than or equal to the integer of N；The order condition of vehicle includes: suitable with the user
Vacancy is greater than or equal to share-car number on road and vehicle；
The destination of the m vehicle is the destination of the user, and the destination of n-th vehicle is that (n+1)th vehicle meets user
Ground；N is the integer greater than 0 and less than m.
Optionally, in share-car method provided in an embodiment of the present invention, it is followed successively by m that user's matching meets order condition
Vehicle successively order, specifically:
After n-th vehicle is connected to the user, and before n-th vehicle reaches its vehicle destination, start for
The user then matches (n+1)th vehicle, stops after matched the m vehicle is connected to the user to the user with vehicle.
Optionally, in share-car method provided in an embodiment of the present invention, after n-th vehicle is connected to the user, and
N-th vehicle reaches the first preset time before its vehicle destination, starts then to match (n+1)th vehicle for the user
Order.
Optionally, in share-car method provided in an embodiment of the present invention, after n-th vehicle is connected to the user, and
N-th vehicle reaches the first preset time before its vehicle destination, starts then to match (n+1)th vehicle for the user
Order specifically includes:
First after n-th vehicle is connected to the user, and before n-th vehicle reaches its vehicle destination is pre-
If in the time to the second preset time, whether search has the vehicle for the first order condition that meets；Wherein, the first order condition
Include: with the user by the way, vacancy is greater than or equal to share-car number on vehicle, it is contemplated that arrives at the destination in n-th vehicle
Its destination for reaching n-th vehicle in the certain time of front and back, and its destination for reaching n-th vehicle needs to occur
The distance to detour is less than preset value；
If so, then meeting the information of the vehicle of the first order condition to user push, so that user is according to pushing away
The priority of the information setting vehicle of the vehicle sent；
It is the vehicle that user matches highest priority according to the priority of the vehicle of user setting.
Optionally, in share-car method provided in an embodiment of the present invention, whether there is the first order condition that meets in search
After vehicle, further includes:
If not meeting the vehicle of the first order condition, second before n-th vehicle arrives at the destination is default
In time, whether search has the vehicle for the second order condition that meets；Wherein, the second order condition are as follows: suitable with the user
Road, on vehicle vacancy be greater than or equal to share-car number, in current slot just bill and it is expected that can within second time
Reach the destination of n-th vehicle；
If so, then and its according to search to vehicle be user's matching distance described in n-th vehicle destination it is nearest
Vehicle；
If no, matching an empty wagons for user.
Optionally, in share-car method provided in an embodiment of the present invention, when estimating as the matched highest priority of user
When vehicle cannot reach on time with meeting user, user is notified to reset the priority of vehicle, with what is reset according to user
The priority of vehicle is the vehicle that user matches highest priority.
Optionally, in share-car method provided in an embodiment of the present invention, when the vehicle for meeting order condition is more vehicles,
It is preferentially being travelled on the way to user push and it is driven a vehicle and connects the vehicle on user ground described in recommended route process, if without just
Traveling on the way and its recommended route of driving a vehicle pass through described in connect the vehicle on user ground, then again to user push set out point in
Vehicle within the scope of with the meeting user pre-determined distance.
Optionally, in share-car method provided in an embodiment of the present invention, if meeting the user in n-th vehicle reaches its vehicle
After destination in third preset time, for matched (n+1)th vehicle of the user do not reach also it is described connect user locations, then root
The expense of the user is reduced according to the waiting time of the user.
Optionally, in share-car method provided in an embodiment of the present invention, institute is not being connected for the matched vehicle of the user
Before stating user, the vehicle taken to the user, the matched vehicle and presently described user is shared described matched
The present position information for the vehicle that vehicle and presently described user take.
Correspondingly, the embodiment of the invention also provides a kind of computer-readable medium, including program code, work as described program
When code is run on the computing device, said program code is used for the step of making the calculating equipment execute above-mentioned share-car method.
The present invention has the beneficial effect that:
A kind of network share-car method provided in an embodiment of the present invention and computer-readable medium, according to the spelling of the user of acquisition
The running information of vehicle information and vehicle is followed successively by the m vehicle successively order that user's matching meets order condition；The order of vehicle
Condition includes: that vacancy is greater than or equal to share-car number by the way and on vehicle with user；The destination of the m vehicle is the purpose of user
Ground, the destination of n-th vehicle be (n+1)th vehicle with meeting user.To make user successfully arrive at destination, but each connects
The case where single vehicle is the user connect by the way, avoids the empty driving that may occur to send user to arrive at the destination.
Detailed description of the invention
Fig. 1 is the demonstration graph of share-car method provided in an embodiment of the present invention；
Fig. 2 is the flow diagram of share-car method provided in an embodiment of the present invention；
Fig. 3 is in share-car method provided in an embodiment of the present invention be user match vehicle flow diagram.
Specific embodiment
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with attached drawing to the present invention make into
It is described in detail to one step, it is clear that the described embodiment is only a part of the embodiment of the present invention, instead of all the embodiments.
Based on the embodiments of the present invention, obtained by those of ordinary skill in the art without making creative efforts all
Other embodiments shall fall within the protection scope of the present invention.
The shapes and sizes of each component do not reflect actual proportions in attached drawing, and purpose is schematically illustrate the content of present invention.
Share-car method provided in an embodiment of the present invention is mainly used in network Carpooling system, which is can
The running information of all vehicles in netting, such as the real-time planning driving path of vehicle destination, vehicle are got in real time, vehicle
Patronage etc., be based on this, the embodiment of the invention provides a kind of network share-car method, comprising:
According to the share-car information of the user of acquisition and the running information of vehicle, it is followed successively by user's matching and meets order condition
The successively order of m vehicle；Wherein, share-car information include: user departure place, customer objective, share-car number and it is acceptable most
Times Ns of changing trains or buses, m are the integer greater than 1 and less than or equal to N more；The order condition of vehicle include: with user by the way and vehicle on
Vacancy is greater than or equal to share-car number；
The destination of the m vehicle is the destination of user, the destination of n-th vehicle be (n+1)th vehicle with meeting user；n
For the integer greater than 0 and less than m.
With N=3, for m=3, as shown in Figure 1, it is assumed that the user information of acquisition are as follows: user departure place in A, user's
Destination in B, share-car number be 2 people, the destination of the vehicle 1 of acquisition in A1, and the vacancy of vehicle 1 be 2 and user
By the way, i.e., vehicle 1 meets order condition, therefore matches 1 order of vehicle for user, and vehicle 1 is made in A to meet user with going to A1；
The destination of the vehicle 2 of acquisition is in A2, and the vacancy of vehicle 2 is 3 and user's direct route, i.e., vehicle 2 meets order condition, therefore
2 order of vehicle is matched for user, vehicle 2 is made in A1 to meet user with going to A2；The destination of the vehicle 3 of acquisition is in B, and vehicle
3 vacancy is 2 and user's direct route, i.e., vehicle 3 meets order condition, and vehicle 3 is made in A2 to meet user with going to B.To make
User successfully arrives at destination, but the vehicle of each order is the user connect by the way, avoids to send user to reach mesh
Ground may occur empty driving the case where.
Therefore, network share-car method provided in an embodiment of the present invention, according to the share-car information and vehicle of the user of acquisition
Running information, be followed successively by user's matching and meet the m vehicle successively order of order condition；The order condition of vehicle includes: and uses
Vacancy is greater than or equal to share-car number by the way and on vehicle at family；The destination of the m vehicle is the destination of user, the mesh of n-th vehicle
Ground be (n+1)th vehicle with meeting user.To make user successfully arrive at destination, but the vehicle of each order is suitable
The user that road connects, the case where avoiding the empty driving that may occur to send user to arrive at the destination.
In the specific implementation, in share-car method provided in an embodiment of the present invention, order vehicle can be reserved in advance for user
, it further include at this moment user's departure time in the share-car information of user.It is of course also possible to be carried out in the driving conditions of user real
When share-car.
Optionally, in share-car method provided in an embodiment of the present invention, it is followed successively by m that user's matching meets order condition
Vehicle successively order, specifically:
After n-th vehicle is connected to user, and before n-th vehicle reaches its vehicle destination, start as user then
(n+1)th vehicle is matched, is stopped after matched the m vehicle is connected to user to user with vehicle.
Or by taking m=3 as an example, after receiving the share-car information of user, by the vehicle destination information of acquisition, for
Family matches the 1st vehicle order for meeting order condition, reaches its vehicle mesh after the 1st vehicle is connected to user, and in the 1st vehicle
Ground before, start to match for user and meet the 2nd vehicle order of order condition.In this way when then user reaches it to the 1st vehicle
The time of the 2nd vehicle can be avoided waiting for behind destination, or shortens the time for waiting the 2nd vehicle as far as possible.And so on,
After the 2nd vehicle is connected to user, and before the 2nd vehicle reaches its vehicle destination, start to meet order for user's matching
3rd vehicle order of condition, since the 3rd vehicle is through customer objective ground, stops after the 3rd vehicle is connected to user
Only match vehicle to user.
Optionally, in share-car method provided in an embodiment of the present invention, after n-th vehicle is connected to user, and at n-th
Vehicle reaches the first preset time before its vehicle destination, starts then to match (n+1)th vehicle order for user.Such as
N-th vehicle is connected to after user, it is contemplated that n-th vehicle reached its vehicle destination there are also 30 minutes, started then to match for user
(n+1)th vehicle order.Limiting a period in this way, (i.e. n-th vehicle reaches the first preset time before its vehicle destination
It is interior) it is that user matches (n+1)th vehicle order, matched vehicle can be more reasonably selected in this way.For example, the first preset time is
30 minutes, i.e., in 30 minutes before n-th vehicle reaches its vehicle destination, start to match (n+1)th vehicle for user, in this way
On the one hand it can guarantee before the destination that user reaches n-th vehicle, just be that user has matched (n+1)th vehicle, as far as possible
User is avoided to wait the time changed trains, on the other hand, for matched vehicle, the time is shorter, and during which generation is some can not be pre-
The chance of the case where material is fewer, more can guarantee that matched vehicle is more reasonable.
Optionally, in share-car method provided in an embodiment of the present invention, after n-th vehicle is connected to user, and at n-th
Vehicle reaches the first preset time before its vehicle destination, starts then to match (n+1)th vehicle order for user, specific to wrap
It includes:
After n-th vehicle is connected to user, and the first preset time before n-th vehicle reaches its vehicle destination is extremely
In second preset time, whether search has the vehicle for the first order condition that meets；Wherein, the first order condition includes: and user
By the way, vacancy is greater than or equal to share-car number on vehicle, it is contemplated that arriving at the destination in the certain time of front and back it in n-th vehicle can arrive
Up to the destination of n-th vehicle, and its destination for reaching n-th vehicle needs the distance to detour to be less than preset value；
If so, the information of the vehicle for the first order condition that meets then is pushed to user, so that vehicle of the user according to push
Information setting vehicle priority；
It is the vehicle that user matches highest priority according to the priority of the vehicle of user setting.
Wherein the first preset time is greater than the second preset time.
For example, the first preset time is 30 minutes, the second preset time is 5 minutes, after n-th vehicle is connected to user,
It estimates in estimated 30~5 minutes for reaching its vehicle destination there are also before of n-th vehicle, whether search, which has, meets the first order item
The vehicle of part.And the first order condition are as follows: by the way with user, vacancy is greater than or equal to share-car number on vehicle, it is contemplated that in n-th vehicle
The destination of its reachable n-th vehicle in the front and back certain time (such as -5 minutes~+5 minutes) arrived at the destination, and it is arrived
The distance for needing to detour up to the destination of n-th vehicle is less than preset value.
In the specific implementation, preset value can be set to the value less than or equal to 3km.
Optionally, in share-car method provided in an embodiment of the present invention, whether there is the first order condition that meets in search
After vehicle, further includes:
If not meeting the vehicle of the first order condition, the second preset time before n-th vehicle arrives at the destination
Interior, whether search has the vehicle for the second order condition that meets；Wherein, the second order condition are as follows: by the way with user, vacancy is big on vehicle
In or equal to share-car number, in current slot just bill and n-th vehicle is reached in the second preset time with estimated
Destination；
If so, then and it according to search to vehicle is the nearest vehicle in user's matching distance n-th vehicle destination；
If no, matching an empty wagons for user.
For example, the second preset time is 5 minutes, in 5 minutes before n-th vehicle arrives at the destination, whether search has
Meet the vehicle of the second order condition.If so, then and it according to search to vehicle is user's matching distance n-th vehicle destination
Nearest vehicle；If no, matching an empty wagons for user.
In the specific implementation, in share-car method provided in an embodiment of the present invention, it can be vehicle by the way with user and estimate
The path of process user departure place and customer objective on the ground or on the path that detour to user of vehicle distance in certain model
In enclosing.
Optionally, in share-car method provided in an embodiment of the present invention, when estimating as the matched highest priority of user
When vehicle cannot reach on time with meeting user, user is notified to reset the priority of vehicle, with what is reset according to user
The priority of vehicle is the vehicle that user matches highest priority.
For example, the information for the vehicle for meeting order condition that system pushes in user's riding process, user can be by
Passenger sees at end that it travels recommended route, current position, and vehicle estimates distance and the estimated time for reaching and connecing user ground at present, by
User voluntarily select first, and provide alternative sequences and vehicle priority, each vehicle all will receive the alternative sequences number of oneself,
When the vehicle of highest priority is when on the way interim traffic congestion or other unpredictable situations occur for driving, system can be believed according to road conditions
Breath is actively proposed, taken in conjunction user by the vehicle of highest priority, and priority can be that 2 vehicles are promoted to by user at this time
Priority is 1, and it is 2 that the vehicle that the priority of script is 1, which can be downgraded to priority, or can also be deleted from alternative vehicle
It removes, while the variation of alternative rank is pushed to the vehicle that priority is 1 and the vehicle that priority is 2.In this process, into one
Step really accomplishes that dynamic interconnection, route in real time are brought together, saves each side's time cost.
Optionally, in share-car method provided in an embodiment of the present invention, when the vehicle for meeting order condition is more vehicles,
It is preferentially being travelled on the way to user's push and its recommended route of driving a vehicle is by connecing the vehicle on user ground, if without travelling way
In and its recommended route of driving a vehicle by connecing the vehicle on user ground, then set out point in meeting user pre-determined distance to user's push again
Vehicle in range.To avoid order vehicle from excessively detouring.
Optionally, in share-car method provided in an embodiment of the present invention, for the matched vehicle of user do not connect user it
Before, the vehicle taken to user, matched vehicle and active user shares the vehicle of matched vehicle and active user's seating
Present position information.
Optionally, in share-car method provided in an embodiment of the present invention, for the matched vehicle of user do not connect user it
Before, the vehicle tripartite that user, matched vehicle and active user take can also converse.This call can by with
Family is initiated, and is saved driver and is touched screen bring danger in the process of moving.
Certainly, in the specific implementation, in share-car method provided in an embodiment of the present invention, when the vehicle for meeting order condition
It directly can also be that user matches a wherein vehicle order by system when for more vehicles.Optionally, vehicle purpose is matched for user
Far from customer objective the nearest vehicle order in ground, can reduce the transfer number of user as far as possible in this way.
Optionally, in share-car method provided in an embodiment of the present invention, if meeting user in n-th vehicle reaches its vehicle purpose
After ground in third preset time, is not reached also for matched (n+1)th vehicle of user and connect user locations, then according to the waiting of user
The expense of time reduction user.Increasing in this way user's journey time can be compensated by reduction expense.
For example, third preset time is 10 minutes, i.e., user is met in n-th vehicle and reached after its vehicle destination 10 minutes
Interior, (n+1)th vehicle, which does not reach also, connects user locations, then the expense of user, i.e., used reduction are reduced according to the waiting time of user
Expense compensates waiting time of user.
In the specific implementation, numerous services sites can be set in network Carpooling system, user, order vehicle all arrive service
Website will do it to pick and drive or get on or off the bus, and services sites is arranged near subway, bus station, Large Residential District, commercial circle more
Deng facilitating vehicle and the transfer of people.Therefore, optionally, in share-car method provided in an embodiment of the present invention, user's sets out
The departure place on ground, the destination of user and vehicle is the place set in system.
Illustrate share-car method provided in an embodiment of the present invention below by a specific embodiment.
Such as the departure place of user is in A, in B, in A there is the ground of multiple settings in the destination of user between the ground B
Point can be used to transfer to.As shown in Fig. 2, share-car method specifically includes:
S201, according to the share-car information of the user of acquisition and the running information of vehicle, meet order item for user's matching
1st vehicle order of part.
Wherein, share-car information include: user departure place, customer objective, share-car number and acceptable at most change trains or buses time
Number N；The order condition of 1st vehicle includes: that (i.e. vehicle program will be by user departure place or vehicle in user by the way with user
Near departure place, and vehicle destination is between user departure place and customer objective or vehicle destination is in customer objective
Ground) and vehicle on vacancy be greater than or equal to share-car number.
In the specific implementation, after receiving the share-car information of user, the institute for meeting order condition can be pushed to user
There is information of vehicles, to be selected as the 1st vehicle order that user's matching meets order condition according to user.
S202, if the destination of matched 1st vehicle of user it is not customer objective, then is connected to user in the 1st vehicle
Later, and in the first preset time before the 1st vehicle reaches its vehicle destination, start then to match the 2nd for user
Vehicle.
It is assumed that the destination of the 1st amount vehicle is in A1, the destination of the 2nd vehicle is in A2, wherein can be to A2 and is located at
A1 and a place of the customer objective ground between the ground B, with being also possible to customer objective B.
Specifically, it is specifically included as shown in figure 3, matching the 2nd vehicle for user:
S301, after the 1st vehicle is connected to user, and first before the 1st vehicle reaches its vehicle destination is default
In time to the second preset time (such as in 30~5 minutes), whether search has the vehicle for the first order condition that meets.
Wherein, the first order condition are as follows: by the way with user, vacancy is greater than or equal to share-car number on vehicle, it is contemplated that at the 1st
Vehicle arrives at the destination destination of its reachable 1st vehicle in the front and back certain time (such as -5 minutes~+5 minutes) of (A1)
(A1), and the distance that its destination for reaching the 1st vehicle (A1) needs to detour is less than preset value.
If so, thening follow the steps S302, if nothing, S303 is thened follow the steps；
S302, pushed to user the first order condition that meets vehicle information so that user is according to the vehicle of push
The priority of information setting vehicle；It is the vehicle that user matches highest priority according to the priority of the vehicle of user setting.
In the specific implementation, cannot reach on time with meeting user when estimating the vehicle for the matched highest priority of user
When, it notifies user to reset the priority of vehicle, is that user's matching is excellent with the priority of the vehicle reset according to user
The first highest vehicle of grade.
S303, before the 1st vehicle arrives at the destination in second preset time (such as 5 minutes) of (A1), search is
The no vehicle for having the second order condition that meets.
Wherein, the second order condition are as follows: by the way with user, vacancy is greater than or equal to share-car number, current slot on vehicle
Inside just bill and the 1st vehicle is reached in the second preset time with estimated destination (A1).
If so, thening follow the steps S304, if nothing, S305 is thened follow the steps；
It S304, is the nearest vehicle in user's matching distance the 1st vehicle destination (A1) according to search to vehicle.
S305, an empty wagons is matched for user.
If the destination of the 2nd vehicle is with customer objective the place between the ground B positioned at A1 in A2, use
The above method then matches the 3rd vehicle, the 4th vehicle etc., until the destination of the m vehicle is in the destination of user.
If the destination of the 2nd vehicle is in A2 for customer objective B.
S203, matched 2nd vehicle stop to the user after being connected to user with vehicle.
Share-car method provided in an embodiment of the present invention, while being " people's share-car ", and " vehicle spells people ".Therefore it is able to achieve section
It can environmental protection.
Share-car method provided in an embodiment of the present invention, in profit model, due to being that " vehicle spells people " and " people's share-car " are synchronous
It carries out, two groups or more (every group of 1-2 people) passengers is had on driver's vehicle, therefore collect the expense of each group passenger simultaneously, and driver
Fee charged is valuated by practical mileage, and it is exactly the profit of the network platform that the expense summation of each passenger, which subtracts driver's income,.
In the specific implementation, use share-car method provided in an embodiment of the present invention that can also save money for user.Such as
The road of user is S kilometers, wherein 12 kilometers of single hop or more the every kilometer remote way expense for collecting a member, then passenger's expense with multiply
There are following relationships for objective number of transfer.
Being segmented the total starting expense called a taxi there will not be variation.But be segmented entire distance, each section of distance all can
Shorten, has larger reduction in remote way expense, and also can be by subsidizing accordingly if encountering waiting during transfer.
Based on the same inventive concept, the embodiment of the invention also provides a kind of computer-readable medium, including program code,
When program code is run on the computing device, program code calculates the step of equipment executes above-mentioned share-car method for making.By
It is similar to a kind of aforementioned share-car method in the principle that the computer-readable medium solves the problems, such as, therefore the computer-readable medium
Implementation may refer to the implementation of share-car method, and overlaps will not be repeated.
Program product can be using any combination of one or more readable mediums.Readable medium can be readable signal Jie
Matter or readable storage medium storing program for executing.Readable storage medium storing program for executing for example may be-but not limited to-electricity, magnetic, optical, electromagnetic, infrared
The system of line or semiconductor, device or device, or any above combination.The more specific example of readable storage medium storing program for executing is (non-
The list of exhaustion) include: electrical connection with one or more conducting wires, portable disc, hard disk, random access memory (RAM),
Read-only memory (ROM), erasable programmable read only memory (EPROM or flash memory), optical fiber, the read-only storage of portable compact disc
Device (CD-ROM), light storage device, magnetic memory device or above-mentioned any appropriate combination.
Embodiment according to the present invention for showing product, portable compact disc read only memory can be used
(CD-ROM) it and including program code, and can be run on server apparatus.However, program product of the invention is not limited to
This, in this document, readable storage medium storing program for executing can be any tangible medium for including or store program, which can be by information
Transmission, device or device use or in connection.
Readable signal medium may include in a base band or as the data-signal that carrier wave a part is propagated, wherein carrying
Readable program code.The data-signal of this propagation can take various forms, including --- but being not limited to --- electromagnetism letter
Number, optical signal or above-mentioned any appropriate combination.Readable signal medium can also be other than readable storage medium storing program for executing it is any can
Medium is read, which can send, propagates or transmit for being used by periodic network moving system, device or device
Or program in connection.
The program code for including on readable medium can transmit with any suitable medium, including --- but being not limited to ---
Wirelessly, wired, optical cable, RF etc. or above-mentioned any appropriate combination.
The program for executing operation of the present invention can be write with any combination of one or more programming languages
Code, programming language include object oriented program language-Java, C++ etc., further include conventional process
Formula programming language-such as " C " language or similar programming language.Program code can be calculated fully in user
It executes in equipment, partly execute on a user device, executing, as an independent software package partially in user calculating equipment
Upper part executes on a remote computing or executes in remote computing device or server completely.It is being related to remotely counting
In the situation for calculating equipment, remote computing device can pass through the network of any kind --- including local area network (LAN) or wide area network
(WAN)-it is connected to user calculating equipment, or, it may be connected to external computing device.
Through the above description of the embodiments, those skilled in the art can be understood that the embodiment of the present invention
The mode of necessary general hardware platform can also be added to realize by software by hardware realization.Based on such reason
Solution, the technical solution of the embodiment of the present invention can be embodied in the form of software products, which can store one
In a non-volatile memory medium (can be CD-ROM, USB flash disk, mobile hard disk etc.), including some instructions are used so that a meter
Calculate the method that machine equipment (can be personal computer, server or the network equipment etc.) executes each embodiment of the present invention.
It will be appreciated by those skilled in the art that attached drawing is the schematic diagram of a preferred embodiment, module or stream in attached drawing
Journey is not necessarily implemented necessary to the present invention.
It will be appreciated by those skilled in the art that the module in device in embodiment can describe be divided according to embodiment
It is distributed in the device of embodiment, corresponding change can also be carried out and be located in one or more devices different from the present embodiment.On
The module for stating embodiment can be merged into a module, can also be further split into multiple submodule.
The serial number of the above embodiments of the invention is only for description, does not represent the advantages or disadvantages of the embodiments.
Obviously, various changes and modifications can be made to the invention without departing from essence of the invention by those skilled in the art
Mind and range.In this way, if these modifications and changes of the present invention belongs to the range of the claims in the present invention and its equivalent technologies
Within, then the present invention is also intended to include these modifications and variations.
Claims (10)
1. a kind of network share-car method characterized by comprising
According to the share-car information of the user of acquisition and the running information of vehicle, it is followed successively by the m that user's matching meets order condition
Vehicle successively order；Wherein, the share-car information include: user departure place, customer objective, share-car number and it is acceptable most
Times Ns of changing trains or buses, m are the integer greater than 1 and less than or equal to N more；The order condition of vehicle include: with the user by the way and
Vacancy is greater than or equal to share-car number on vehicle；
The destination of the m vehicle is the destination of the user, the destination of n-th vehicle be (n+1)th vehicle with meeting user；n
For the integer greater than 0 and less than m.
2. share-car method as described in claim 1, which is characterized in that be followed successively by the m vehicle that user's matching meets order condition
Successively order, specifically:
After n-th vehicle is connected to the user, and before n-th vehicle reaches its vehicle destination, start to be described
User then matches (n+1)th vehicle, stops after matched the m vehicle is connected to the user to the user with vehicle.
3. share-car method as claimed in claim 2, which is characterized in that after n-th vehicle is connected to the user, and described
N-th vehicle reaches the first preset time before its vehicle destination, starts then to match (n+1)th vehicle for the user and connects
It is single.
4. share-car method as claimed in claim 3, which is characterized in that after n-th vehicle is connected to the user, and described
N-th vehicle reaches the first preset time before its vehicle destination, starts then to match (n+1)th vehicle for the user and connects
It is single, it specifically includes:
First after n-th vehicle is connected to the user, and before n-th vehicle reaches its vehicle destination it is default when
Between in the second preset time, whether search has the vehicle for the first order condition that meets；Wherein, the first order condition packet
Include: by the way with the user, vacancy is greater than or equal to share-car number on vehicle, it is contemplated that before n-th vehicle arrives at the destination
Its destination for reaching n-th vehicle in certain time afterwards, and its destination for reaching n-th vehicle need to occur around
The distance on road is less than preset value；
If so, then meeting the information of the vehicle of the first order condition to user push, so that user is according to push
The priority of the information setting vehicle of vehicle；
It is the vehicle that user matches highest priority according to the priority of the vehicle of user setting.
5. share-car method as claimed in claim 4, which is characterized in that whether have the vehicle for the first order condition that meets in search
Later, further includes:
The second preset time if not meeting the vehicle of the first order condition, before n-th vehicle arrives at the destination
Interior, whether search has the vehicle for the second order condition that meets；Wherein, the second order condition are as follows: by the way with the user, vehicle
Upper vacancy be greater than or equal to share-car number, in current slot just bill and it is expected that institute is reached within second time
State the destination of n-th vehicle；
If so, then and its according to search to vehicle be user's matching distance described in the nearest vehicle in n-th vehicle destination；
If no, matching an empty wagons for user.
6. share-car method as claimed in claim 4, which is characterized in that when estimating as the vehicle of the matched highest priority of user
When cannot reach on time with meeting user, user is notified to reset the priority of vehicle, with the vehicle reset according to user
Priority be user match highest priority vehicle.
7. share-car method as claimed in claim 4, which is characterized in that excellent when the vehicle for meeting order condition is more vehicles
It is first being travelled on the way to user push and it is driven a vehicle and connects the vehicle on user ground described in recommended route process, if without
Traveling is on the way and it is driven a vehicle and connects the vehicle on user ground described in recommended route process, then sets out point in institute to user push again
State the vehicle within the scope of with meeting user pre-determined distance.
8. share-car method as claimed in claim 2, which is characterized in that if meeting the user in n-th vehicle reaches its vehicle mesh
Ground after in third preset time, for matched (n+1)th vehicle of the user do not reach also it is described connect user locations, then basis
The waiting time of the user reduces the expense of the user.
9. share-car method as claimed in claim 2, which is characterized in that do not connecting the use for the matched vehicle of the user
Before family, the vehicle taken to the user, the matched vehicle and presently described user shares the matched vehicle
The present position information for the vehicle taken with presently described user.
10. a kind of computer-readable medium, which is characterized in that including program code, when said program code on the computing device
When operation, said program code is used to make the step of the calculating equipment perform claim requirement described in any item share-car methods of 1-9
Suddenly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811133682.8A CN109376886A (en) | 2018-09-27 | 2018-09-27 | A kind of network share-car method and computer-readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811133682.8A CN109376886A (en) | 2018-09-27 | 2018-09-27 | A kind of network share-car method and computer-readable medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109376886A true CN109376886A (en) | 2019-02-22 |
Family
ID=65402080
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811133682.8A Pending CN109376886A (en) | 2018-09-27 | 2018-09-27 | A kind of network share-car method and computer-readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109376886A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112396199A (en) * | 2019-08-19 | 2021-02-23 | 丰田自动车株式会社 | Server, vehicle scheduling method, and non-transitory computer-readable medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106940928A (en) * | 2017-04-25 | 2017-07-11 | 杭州纳戒科技有限公司 | Order allocation method and device |
| US20170200320A1 (en) * | 2014-09-26 | 2017-07-13 | Natan Tomer | Methods and systems of managing parking space occupancy |
| CN106971248A (en) * | 2017-04-25 | 2017-07-21 | 杭州纳戒科技有限公司 | It is segmented share-car method, apparatus and system |
| CN107045650A (en) * | 2016-10-25 | 2017-08-15 | 罗轶 | Net based on block chain about car |
| CN108537430A (en) * | 2018-03-30 | 2018-09-14 | 京东方科技集团股份有限公司 | Drive service evaluation method and device, equipment and storage medium |
-
2018
- 2018-09-27 CN CN201811133682.8A patent/CN109376886A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170200320A1 (en) * | 2014-09-26 | 2017-07-13 | Natan Tomer | Methods and systems of managing parking space occupancy |
| CN107045650A (en) * | 2016-10-25 | 2017-08-15 | 罗轶 | Net based on block chain about car |
| CN106940928A (en) * | 2017-04-25 | 2017-07-11 | 杭州纳戒科技有限公司 | Order allocation method and device |
| CN106971248A (en) * | 2017-04-25 | 2017-07-21 | 杭州纳戒科技有限公司 | It is segmented share-car method, apparatus and system |
| CN108537430A (en) * | 2018-03-30 | 2018-09-14 | 京东方科技集团股份有限公司 | Drive service evaluation method and device, equipment and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112396199A (en) * | 2019-08-19 | 2021-02-23 | 丰田自动车株式会社 | Server, vehicle scheduling method, and non-transitory computer-readable medium |
| CN112396199B (en) * | 2019-08-19 | 2024-01-19 | 丰田自动车株式会社 | Server, vehicle scheduling method, and non-transitory computer readable medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108162771B (en) | Intelligent charging navigation method for electric automobile | |
| CN104167093B (en) | Windward driving operation system based on driver's certificate address information | |
| CN104537831B (en) | The method and apparatus of vehicle scheduling | |
| CN105788335B (en) | A kind of method and terminal of navigation | |
| CN104123836B (en) | Based on the order supplying system of city chauffeur order time place combination | |
| CN105243836A (en) | Carpooling method and device | |
| CN107798415A (en) | Optimize the selection of the battery electric vehicle for performing transport task | |
| CN105279955B (en) | A kind of share-car method and apparatus | |
| US20160273927A1 (en) | Route searching device for rechargeable vehicle, route searching method for rechargeable vehicle, and program | |
| CN107438226A (en) | Order release processing method and server | |
| CN105489001A (en) | Taxi scheduling optimization method and system | |
| CN110390544A (en) | The delivery method and device of driver's reward | |
| CN106470236B (en) | Methods, devices and systems of calling a taxi based on mobile terminal | |
| CN104156826B (en) | A kind of dynamic charge path planning service system of center service formula electric automobile | |
| CN108780554A (en) | A kind of share-car method and system | |
| CN106096868A (en) | A kind of multiple constraint network intensive minibus dispatching method | |
| CN108332765B (en) | Carpooling travel route generation method and device | |
| KR101586974B1 (en) | Method for providing one-way service of shared autonomous vehicle | |
| CN106169240A (en) | A kind of vehicle dispatch system and dispatching method and device | |
| CN108320065B (en) | Car pooling order distribution method and device | |
| JP2019095196A (en) | System, method, and program for guiding charging facility | |
| CN108428364A (en) | A kind of Navigation Management System based on high in the clouds big data | |
| CN109711588A (en) | Pick booking method, system, storage medium and the electronic equipment of machine service | |
| CN110472912A (en) | A kind of net about vehicle provides express delivery with the method and system of city delivery service | |
| CN103034906A (en) | Multiplex mode traffic intermodal system based on cloud computing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |