CN110033161A - A kind of dispatching method and system of shared automobile - Google Patents
A kind of dispatching method and system of shared automobile Download PDFInfo
- Publication number
- CN110033161A CN110033161A CN201910146846.9A CN201910146846A CN110033161A CN 110033161 A CN110033161 A CN 110033161A CN 201910146846 A CN201910146846 A CN 201910146846A CN 110033161 A CN110033161 A CN 110033161A
- Authority
- CN
- China
- Prior art keywords
- site
- state
- scheduling
- vehicle
- preset
- 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 35
- 230000000875 corresponding effect Effects 0.000 description 52
- 238000012545 processing Methods 0.000 description 11
- 238000005303 weighing Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000000750 progressive 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
-
- G06Q50/40—
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07F—COIN-FREED OR LIKE APPARATUS
- G07F17/00—Coin-freed apparatus for hiring articles; Coin-freed facilities or services
- G07F17/0042—Coin-freed apparatus for hiring articles; Coin-freed facilities or services for hiring of objects
- G07F17/0057—Coin-freed apparatus for hiring articles; Coin-freed facilities or services for hiring of objects for the hiring or rent of vehicles, e.g. cars, bicycles or wheelchairs
Abstract
This application involves the dispatching methods and system of a kind of shared automobile.This method comprises: determining the reservation order data and History Order data of multiple shared automobile sites in preset time period；Reservation order data includes reservation in preset time period is returned the car quantity with vehicle quantity and reservation；History Order data include in history the history in the period relevant to preset time period returned the car quantity with vehicle quantity and history；According to the History Order data and reservation order data in preset time period, determine each site in predeterminable area within a preset period of time with vehicle quantity and return the car quantity；According to each site in predeterminable area within a preset period of time with vehicle quantity and return the car quantity, determine the dispatch state of each site within a preset period of time and scheduling grade；Dispatch state includes: the state of calling in and recalls state；It is corresponding with the shared Truck dispartching quantity prestored to dispatch grade.Technical solution provided by the present application reduces the cost of vehicle scheduling, improves the efficiency of vehicle scheduling.
Description
Technical field
The present invention relates to field of computer technology more particularly to the dispatching methods of shared automobile.
Background technique
In recent years, rapid economic development is shared, shared bicycle, shared charger baby, shared automobile etc. enter people one after another
Daily life in.
Currently, demand of the resident to shared automobile is growing, the scheduling problem of automobile is shared to shared automobile industry
Develop most important.Since the user of different zones uses vehicle demand with different, lead to the shared automobile leasing in each region
The vehicle of site is unevenly distributed weighing apparatus, and then causes user subsequent and be not being met with vehicle demand.In the prior art, it often needs
Put into a large amount of manpower and material resources, carry out the scheduling of shared automobile by the way of artificial, vehicle scheduling it is at high cost, and cannot
Vehicle demand dispatch vehicle, the low efficiency of vehicle scheduling are used based on user in real time.
Therefore, need at present it is a kind of can dynamically meet user to the use demand of shared vehicle, effectively to shared vehicle
The method being scheduled.
Summary of the invention
For solve the problems, such as it is above-mentioned share that Truck dispartching is at high cost, low efficiency in the prior art, the embodiment of the present application provides
A kind of dispatching method and system of shared automobile.
On the one hand, the embodiment of the present application provides a kind of dispatching method of shared automobile, this method comprises: when determining default
Between in section multiple shared automobile sites reservation order data and History Order data.Reserving order data includes preset time
Reservation in section is returned the car quantity with vehicle quantity and reservation, and History Order data include time relevant to preset time period in history
History in section is returned the car quantity with vehicle quantity and history.According to the History Order data and reservation order numbers in preset time period
According to, determine each site in predeterminable area within a preset period of time with vehicle quantity and return the car quantity.According in predeterminable area
Each site within a preset period of time with vehicle quantity and return the car quantity, determine the dispatch state of each site within a preset period of time and
Dispatch grade.Dispatch state includes: the state of calling in and recalls state, and scheduling grade is opposite with the shared Truck dispartching quantity prestored
It answers.
In one example, according to the History Order data and reservation order data in preset time period, preset areas is determined
Each site in domain within a preset period of time with vehicle quantity and quantity of returning the car, specifically: predeterminable area within a preset period of time
Use vehicle quantity in interior each site are as follows: T (x, t)=aS (x, t)+bM (x, t).Wherein, x indicates site mark, and t indicates pre-
It makes an appointment segment identification, a is the first weight, and a is constant, and S (x, t) is reservation vehicle quantity of the site x within the t period, and b is
Second weight, and b is constant, M (x, t) is that history of the site x within the t period averagely uses vehicle quantity, and a is greater than b, and a and b
Difference is greater than threshold value, and the sum of a and b are 1.And the quantity of returning the car of each site in predeterminable area within a preset period of time are as follows: F
(x, t)=aR (x, t)+bN (x, t).Wherein, x indicates site mark, and t indicates subscription time segment identification, and a is the first power
Weight, and a is constant, R (x, t) is that reservation of the site x within the t period is returned the car quantity, and b is the second weight, and b is constant, N
(x, t) is that history of the site x within the t period is averagely returned the car quantity, and a is greater than b, and the difference of a and b is greater than threshold value, a and b it
Be 1.
In one example, according to each site in predeterminable area within a preset period of time with vehicle quantity and return the car number
Amount, after determining the dispatch state of each site within a preset period of time and scheduling grade, this method further include: determine shared automobile
Whether the scheduling grade of site reaches predetermined level.In the case where the scheduling grade of shared automobile site reaches predetermined level,
Vehicle scheduling is carried out according to the dispatch state of shared automobile site and scheduling grade.Scheduling grade in shared automobile site does not have
In the case where reaching predetermined level, vehicle scheduling is carried out according to the parking information of the shared automobile of shared automobile site.
In one example, in the case where the scheduling grade of shared automobile site reaches predetermined level, according to shared vapour
The dispatch state and scheduling grade of vehicle site carry out vehicle scheduling specifically: the first site is to call in state in determining each site
In the case of, according to the location information of the first site and preset first distance threshold value, determine the first site it is corresponding one or
It is multiple to recall site.The second site is to recall under state status in determining each site, according to the location information of the second site, with
And preset second distance threshold value, determine that the corresponding one or more in the second site calls in site.
In one example, in the case where the scheduling grade of shared automobile site does not reach predetermined level, according to altogether
The parking information for enjoying the shared automobile in automobile site carries out vehicle scheduling specifically: determines current each in the shared automobile site
Down time of a shared automobile in the site.In the case where down time is more than parking threshold condition, by the tune of corresponding shared automobile
Degree state is set as recalling state, and to share automobile true in the site down time by this for the scheduling grade of the shared automobile
It is fixed.In the case of sharing the quantity that automobile is the state that recalls in shared automobile site and be more than preset threshold, the shared vapour is determined
The dispatch state of vehicle site is the state that recalls, and the scheduling grade of the shared automobile site is shared by this and shares vapour in automobile site
Vehicle is the quantity for the state that recalls and determines.
In one example, the first site is to call under state status in determining each site, according to the position of the first site
Confidence breath and preset first distance threshold value, determine that the corresponding one or more in the first site recalls site specifically: with the
One dot location coordinate is the center of circle, using preset first distance as radius, obtains multiple state sites that recall and gathers.In multiple tune
In the site set that does well, determine that the nearest state site that recalls in the first site of distance recalls site for the first site is corresponding.
Alternatively, recalling in the set of state site multiple, determine that the highest state site that recalls of scheduling grade is that the first site is corresponding
Recall site.The second site is to recall under state status in determining each site, according to the location information of the second site, and it is pre-
If second distance threshold value, determine that the corresponding one or more in the second site calls in site specifically: with the second dot location seat
It is designated as the center of circle, using default second distance as radius, multiple state sites of calling in is obtained and gathers.Gather in multiple state sites of calling in
In, determine that site is called in for the second site is corresponding in the nearest state site of calling in the second site of distance.Alternatively, being called in multiple
In the set of state site, determine that the highest state site of calling in of scheduling grade is that the second site is corresponding calls in site.
In one example, according to each site in predeterminable area within a preset period of time with vehicle quantity and return the car number
Amount, after determining the dispatch state of each site within a preset period of time and scheduling grade, this method further include: in each shared automobile
The first site in site is
Radius obtains multiple state sites that recall and gathers.It obtains multiple recall in the set of state site and respectively recalls state site and first
Traffic information between site.According to traffic information, determine that multiple one recalled in the set of state site recall state site
Site is recalled for the first site is corresponding.The second site in each shared automobile site is in the case where recalling state, with the
Two dot location coordinates are the center of circle, using default second distance as radius, obtain multiple state sites of calling in and gather.Obtain multiple tune
Enter in the set of state site and respectively calls in the traffic information between state site and the second site.According to traffic information, determine multiple
One called in the set of state site calls in state site and calls in site for the second site is corresponding.Wherein, traffic information packet
It includes following one or more: road condition information, Weather information, traffic related information.
In one example, this method further include: the location data for obtaining multiple dispatcher's counterpart terminals determines distance
Recall the nearest dispatcher in state site.Dispatch command is generated, dispatch command is issued to dispatcher's counterpart terminal, is adjusted
Degree instruction includes: the location information for recalling state site, the location information for calling in state site, scheduling time, scheduling route, adjusts
It spends one or more in the information of vehicle.The dispatcher that reception dispatcher's counterpart terminal is sent is corresponding to dispatch buses
Starting information, obtain the location information dispatched buses in real time.
In one example, according to each site in the predeterminable area within a preset period of time with vehicle quantity and returning the car
Quantity determines the dispatch state of each site within a preset period of time and scheduling grade, specifically includes: being tune in dispatch state
Enter under state status, is gone through according to return the car quantity, preset time period of the reservation vehicle quantity of the preset time period of each site, reservation
History is returned the car quantity and each site current idle parking stall quantity for obtaining in real time with vehicle quantity, history, determines each site default
Dispatch state and scheduling grade in period.
On the other hand, the embodiment of the present application provides a kind of scheduling system of shared automobile.The system includes: first determining
Unit, the second determination unit, third determination unit.First determination unit is for determining multiple shared grid motors in preset time period
The reservation order data and History Order data of point.Reservation order data include reservation vehicle quantity in preset time period and
Reserve quantity of returning the car.History Order data include in history the history vehicle quantity in the period relevant to preset time period and
History is returned the car quantity.Second determination unit is used for according to the History Order data and reservation order data in preset time period, really
Determine each site in predeterminable area within a preset period of time with vehicle quantity and return the car quantity.Third determination unit is used for according to pre-
If each site in region within a preset period of time with vehicle quantity and quantity of returning the car, determine each site within a preset period of time
Dispatch state and scheduling grade.Dispatch state includes: the state of calling in and the state that recalls, the shared automobile tune dispatching grade and prestoring
Degree amount is corresponding.
The embodiment of the present application provides the dispatching method and system of a kind of shared automobile, more in preset time period by determining
The reservation order data and History Order data of a shared automobile site determine each site in the predeterminable area when default
Between in section with vehicle quantity and quantity of returning the car, according to each site in predeterminable area within a preset period of time with vehicle quantity and also
Vehicle quantity, determine the dispatch state of each site within a preset period of time and scheduling grade, the dispatch state include call in state and
State is recalled, scheduling grade is corresponding with the shared Truck dispartching quantity prestored.According to the dispatch state of each site and scheduling etc.
Grade carries out the scheduling of shared automobile, the cost that can be effectively improved the efficiency of shared Truck dispartching, reduce shared Truck dispartching.
Detailed description of the invention
The drawings described herein are used to provide a further understanding of the present application, constitutes part of this application, this Shen
Illustrative embodiments and their description please are not constituted an undue limitation on the present application for explaining the application.In the accompanying drawings:
Fig. 1 is a kind of flow chart of the dispatching method of shared automobile provided by the embodiments of the present application；
Fig. 2 provides a kind of schematic diagram of the scheduling system of shared automobile for the embodiment of the present application.
Specific embodiment
For the clearer general idea for illustrating the application, carry out in an illustrative manner with reference to the accompanying drawings of the specification detailed
It describes in detail bright.Obviously, described embodiment is only a part of the embodiment of the application, is not intended to limit this application, right
For those skilled in the art, various changes and changes are possible in this application.All institutes within the spirit and principles of the present application
Any modification, equivalent substitution, improvement and etc. of work, should be included within the scope of the claims of this application.
The embodiment of the present application provides the dispatching method and system of a kind of shared automobile, more in preset time period by determining
The reservation order data and History Order data of a shared automobile site determine each site in the predeterminable area when default
Between in section with vehicle quantity and quantity of returning the car.According to each site in predeterminable area within a preset period of time with vehicle quantity and also
Vehicle quantity determines the dispatch state of each site within a preset period of time and scheduling grade.The dispatch state include call in state and
Recall state, the corresponding shared Truck dispartching quantity of each scheduling grade is different.According to the dispatch state of each site and scheduling etc.
Grade carries out the scheduling of shared automobile, the cost that can be effectively improved the efficiency of shared Truck dispartching, reduce shared Truck dispartching.
Below by taking Fig. 1 as an example, a kind of dispatching method of shared automobile provided by the embodiments of the present application, this method is described in detail
Executing subject be server.As shown in Figure 1, this method comprises the following steps:
Step 101, the reservation order data and History Order number of multiple shared automobile sites in preset time period are determined
According to.
Currently, shared automobile industry includes reservation vehicle and uses two kinds of situations of vehicle immediately in terms of user's vehicle.Reservation is used
Vehicle usually requires user and shifts to an earlier date a period of time progress vehicle reservation, is immediately that user sees the case where vehicle just uses immediately with vehicle.
In the embodiment of the present application, it also includes use later such as after several days using vehicle that reservation, which not merely refers to user's reservation for a long time,
The case where vehicle is just used after the reservation a few minutes of family.
In one embodiment of the application, reservation order data includes reservation vehicle quantity in preset time period and pre-
It about returns the car quantity.Preset time period can be determined according to actual demand, and preset time period is not only limited only to one day,
It can be thought as several days.For example, preset time period can be weekend, festivals or holidays, or specific a period of time such as morning peak
The 7:00-8:30 of period.
In one embodiment of the application, History Order data include the period relevant to preset time period in history
Interior history is returned the car quantity with vehicle quantity and history.Such as: History Order data include the daily morning peak in three middle of the month in the past
History in period is returned the car quantity with vehicle quantity and history.
In one embodiment of the application, reservation order data includes following any one or more: reservation vehicle net
Point information reserves site information of returning the car, reservation time of using cars, reserves time of returning the car, order generation time.
In one embodiment of the application, History Order data include following any one or more: being believed with vehicle site
It ceases, site information of returning the car, time of using cars, the time of returning the car, order generation time, order end time, information of vehicles.Wherein, vehicle
Information is the information that the History Order data correspond to the vehicle that user uses, information of vehicles may include following any one or
It is multinomial: license plate number, vehicle model, vehicle identification code, vehicle color.
Step 102, it according to the History Order data and reservation order data in preset time period, determines each in predeterminable area
Site within a preset period of time with vehicle quantity and return the car quantity.
Server determines each net in predeterminable area according to History Order data and reservation order data in preset time period
Point within a preset period of time with vehicle quantity and return the car quantity.In the embodiment of the present application, this with vehicle quantity and returns the car quantity not
It is an accurate data, but the data estimated.In one embodiment of the application, predeterminable area has a variety of strokes
The mode of dividing, can be determined according to the actual situation.It, can also be with for example, predeterminable area can be divided according to administrative region
It is divided, can also be divided according to longitude and latitude according to geographical location.
Server determines each net in predeterminable area according to History Order data and reservation order data in preset time period
Put use vehicle quantity within a preset period of time.Specifically, within a preset period of time each site in predeterminable area use vehicle quantity
Calculation formula are as follows:
T (x, t)=aS (x, t)+bM (x, t)；
Wherein, x indicates site mark, and t indicates subscription time segment identification, and a is the first weight, and a is constant, and S (x, t) is
The site x vehicle quantity of the reservation within the t period, b is the second weight, and b is constant, and M (x, t) is site x within the t period
History averagely use vehicle quantity, a is greater than b, and the difference of a and b is greater than threshold value, and the sum of a and b are 1.
In one embodiment of the application, threshold value can be configured according to the actual situation.For example, threshold value is set as
0.1, the first weight a are 0.6, and the second weight b is 0.4, reservation vehicle quantity S (x, the 7:00- of site x 7:00-8:30 in the morning
It 8:30) is 200,7:00-8:30 history averagely uses vehicle quantity M (x, 7:00-8:30) to site x in the morning is 250, then server root
Estimating the site x that obtains according to History Order data and reservation order data, 7:00-8:30 uses vehicle quantity in the morning are as follows:
T (x, 7:00-8:30)=aS (x, 7:00-8:30)+bM (x, 7:00-8:30)=220.
Server determines each net in predeterminable area according to History Order data and reservation order data in preset time period
The quantity of returning the car of point within a preset period of time.Specifically, the quantity of returning the car of each site in predeterminable area within a preset period of time
Calculation formula are as follows:
F (x, t)=aR (x, t)+bN (x, t)；
Wherein, x indicates site mark, and t indicates subscription time segment identification, and a is the first weight, and a is constant, and R (x, t) is
Reservation of the site x within the t period is returned the car quantity, and b is the second weight, and b is constant, and N (x, t) is site x within the t period
History averagely return the car quantity, a is greater than b, and the difference of a and b is greater than threshold value, and the sum of a and b are 1.
For example, threshold value is set as 0.1, the first weight a is 0.6, and the second weight b is 0.4, site x 7:00-8:30 in the morning
Reservation return the car amount R (x, 7:00-8:30) be 200, site x in the morning 7:00-8:30 history averagely return the car quantity N (x, 7:
00-8:30) it is 250, then server estimates the site x that obtains in the morning 7 according to History Order data and reservation order data:
The quantity of returning the car of 00-8:30 are as follows:
F (x, 7:00-8:30)=aR (x, 7:00-8:30)+bN (x, 7:00-8:30)=220.
In one embodiment of the application, the first weight be it is pre-set reservation order data weighted value, second
Weight is the weighted value of History Order data.First weight and the second weight can be determined according to the actual situation, the first power
The value that the value of weight can be greater than the second weight is big, and the value of the first weight might be less that the value of the second weight.
In one embodiment of the application, the second weight can be determined as follows: for each history
The corresponding History Order data of order calculate the order end time in History Order data and the time interval of current time,
Value based on the time interval determines the weighted value of History Order data within the scope of default weighted value.The History Order data
Weighted value and the time interval value it is negatively correlated, default weighted value range can be determined according to the actual situation.
Step 103, according to each site in predeterminable area within a preset period of time with vehicle quantity and return the car quantity, determine
The dispatch state of each site within a preset period of time and scheduling grade.
In one embodiment of the application, dispatch state includes: the state of calling in and recalls state, each scheduling grade pair
The shared Truck dispartching quantity answered is different.
Server obtains the current shared automobile quantity and current idle parking stall quantity of each site in real time, and each site is currently total
Automobile quantity and current idle parking stall quantity are enjoyed, can be analyzed from the information that the sensor being arranged in the site uploads
Out.Server is according to current idle parking stall quantity, reservation of the site in the current slot vehicle number for sharing automobile site
Amount and reservation are returned the car quantity, judge the dispatch state of shared automobile site.
Specifically, in P (x, t') < V1 or P (x, t')-R (x, t')+S (x, t') < V2, determine that shared automobile site is
State is called in, in P (x, t') < 0 or P (x, t')-R (x, t')+S (x, t') < 0, determines that shared automobile site is to recall state.
Wherein, x indicates site mark, and t' indicates current time segment identification, and P (x, t') is site x in current idle parking stall
Quantity, R (x, t') are that reservation of the site x in current slot is returned the car quantity, and S (x, t') is site x in current slot
Reservation vehicle quantity, V1 is preset first amount threshold, and V2 is preset second amount threshold, the first amount threshold and the
Two amount thresholds can be determined according to the total quantity on shared automobile site parking stall.Such as the parking when shared automobile site
When the total quantity of position is 100, the first amount threshold is set as 60, when the total quantity on the parking stall of shared automobile site is 50,
First amount threshold is set as 30.
In the case where the dispatch state of shared automobile site is to call in state, according to the use of the preset time period of each site
Return the car quantity, the history of preset time period of vehicle quantity, reservation is returned the car quantity and each site for obtaining in real time with vehicle quantity, history
Current idle parking stall number, determine shared automobile calls in quantity, calls in quantity according to shared automobile, determines each site default
Scheduling grade in period.
Specifically, the quantity for the shared automobile that each site is called within a preset period of time are as follows:
P (x, t ')-F (x, t)+T (x, t).
Wherein, x indicates site mark, and t' indicates current time segment identification, and t indicates preset time period, and P (x, t') is site
X uses vehicle quantity in the t period for site x in current idle parking stall quantity, T (x, t), and F (x, t) is site x in the t period
Return the car quantity, and F (x, t) < P (x, t')+T (x, t).T (x, t) and F (x, t) are obtained by step 102.
In the case where the dispatch state of shared automobile site is to recall state, according to the use of the preset time period of each site
Return the car quantity, the history of preset time period of vehicle quantity, reservation is returned the car quantity and each site for obtaining in real time with vehicle quantity, history
Current idle parking stall number, determine shared automobile recalls quantity, recalls quantity according to shared automobile, determines each site default
Scheduling grade in period.
Specifically, the quantity for the shared automobile that each site recalls within a preset period of time are as follows:
F (x, t)-P (x, t ')-T (x, t).
Wherein, x indicates site mark, and t' indicates current time segment identification, and t indicates preset time period, and P (x, t') is site
X uses vehicle quantity in the t period for site x in current idle parking stall quantity, T (x, t), and F (x, t) is site x in the t period
Return the car quantity, and F (x, t) > P (x, t')+T (x, t).T (x, t) and F (x, t) are obtained by step 102.
In one embodiment of the application, the dispatch state for the shared automobile parked in each shared automobile site is total with this
The dispatch state for enjoying automobile site is identical, the scheduling grade for the shared automobile parked in each shared automobile site and the shared automobile
The scheduling grade of site is identical.
In one embodiment of the application, it is previously stored with a relation table in memory, is recorded in the relation table
There are the corresponding relationship of pre-set scheduling grade and shared Truck dispartching quantity, scheduling grade and the shared Truck dispartching prestored
Quantity is corresponding.According to the scheduling grade of each site within a preset period of time, corresponding shared automobile is determined in preset table
Quantity is dispatched, the efficiency of shared Truck dispartching is effectively improved.For example, pre-set scheduling grade and shared Truck dispartching quantity
Corresponding relationship can be stored in the form of following table:
| Grade | Level-one | Second level | Three-level | Level Four | Pyatyi |
| Shared Truck dispartching quantity | 0-5 | 5-10 | 10-20 | 20-40 | 40+ |
Table 1
In one embodiment of the application, can by each shared automobile site, each site preset time period scheduling
State and dispatch grade corresponding relationship stored, can also by each site, each site preset time period scheduling shape
The corresponding relationship real-time display of state and scheduling grade is on a display screen.Each site, each site preset time period scheduling shape
State and the corresponding relationship for dispatching grade, can be stored and be shown in table form.For example, each site, each site exist
The dispatch state of preset time period and the part corresponding relationship for dispatching grade can be as shown in the table:
Table 2
Step 104, determine whether the scheduling grade of shared automobile site reaches predetermined level.
When the scheduling grade of shared automobile site is lower, user's vehicle and demand of returning the car are lower, dispatch buses at this time at
This is higher.Before being scheduled to shared grid motor point, judge whether shared automobile site meets schedulable condition, determines shared vapour
Whether the scheduling grade of vehicle site reaches predetermined level, and predetermined level can be determined according to the actual situation.
Step 105, in the case where the scheduling grade of shared automobile site reaches predetermined level, according to shared automobile site
Dispatch state and scheduling grade carry out vehicle scheduling.
In the case where the scheduling grade of shared automobile reaches predetermined level, according to the dispatch state of shared automobile site and
Grade is dispatched, recalls state site to call in state Selection of Net Points one or more, or to recall state Selection of Net Points one
Or it is multiple call in state site, the vehicle for needing to recall in state site will be recalled and called in state site.
The first site is in the case where calling in state, according to the location information of the first site and in advance in determining each site
If first distance threshold value, determine that the corresponding one or more in the first site recalls site, preset first distance threshold value can be with
It is configured according to the actual situation.
Specifically, it using the first dot location coordinate as the center of circle, using preset first distance as radius, obtains multiple recalling shape
State site set.It is recalled in the set of state site multiple, determines that the nearest state site that recalls in the first site of distance is first
Site is corresponding to recall site.Alternatively, recalling in the set of state site multiple, determine that grade is highest recalls state net for scheduling
Point recalls site for the first site is corresponding.
The second site is in the case where recalling state, according to the location information of the second site and in advance in determining each site
If second distance threshold value, determine that the corresponding one or more in the second site calls in site, preset second distance threshold value can be with
It is configured according to the actual situation.
Specifically, it using the second dot location coordinate as the center of circle, using default second distance as radius, obtains multiple calling in state
Site set is called in the set of state site multiple, determines that the nearest state site of calling in the second site of distance is the second net
Point is corresponding to call in site.Or called in the set of state site multiple, determine that grade is highest calls in state site for scheduling
Site is called in for the second site is corresponding.
As an alternative embodiment, may be used also in the case where the scheduling grade of shared automobile reaches predetermined level
To carry out vehicle scheduling according to the dispatch state and traffic information of sharing automobile site.
In one embodiment of the application, traffic information includes road condition information, Weather information, traffic condition letter
Breath.Road condition information reflects that the material on road surface, pavement damage situation, Weather information reflect weather phenomenon, visibility, temperature etc.
The relevant information of weather, traffic related information reflect the unimpeded situation of traffic road congestion
Specifically, the first site in each shared automobile site is in the case where calling in state, with the first dot location
Coordinate is the center of circle, using default first distance as radius, obtains multiple state sites that recall and gathers.It obtains and multiple recalls state site
The traffic information between state site and the first site is respectively recalled in set, according to the traffic information, is determined and multiple is recalled state
One in the set of site recalls state site and recalls site for the first site is corresponding.For example, can be according to recalling state net
The traffic related information between state site and the first site is respectively recalled in point set, selects to hand in recalling state site set
The state site that recalls of logical situation not congestion recalls site for the first site is corresponding.
Specifically, the second site in each site is in the case where recalling state, is circle with the second dot location coordinate
The heart obtains multiple state sites of calling in and gathers using default second distance as radius.Obtain multiple call in the set of state site respectively
The traffic information between state site and the second site is called in, according to the traffic information, determines that multiple state sites of calling in are gathered
In one to call in state site be that the second site is corresponding calls in site.For example, can according to call in state site set in
The traffic related information between state site and the second site is respectively called in, selects traffic condition not in calling in state site set
Site is called in for the second site is corresponding in the state site of calling in of congestion.
Step 106, in the case where the scheduling grade of shared automobile site does not reach predetermined level, according to shared automobile
The parking information of the shared automobile of site carries out vehicle scheduling.
Shared automobile site can also have following situations: shared automobile site is for a long time without using vehicle demand, many vehicles
It parks and is not used for a long time, vast resources is caused to waste.For long-time without with the shared automobile site of vehicle demand and
The shared automobile that does not use for a long time, it is also desirable to carry out corresponding scheduling with realize between each site reasonable vehicle allocation and
It uses.
In the case where the scheduling grade of shared automobile site does not reach predetermined level, determine in the shared automobile site
Down time of each shared automobile in the site.In the embodiment of the present application, the down time for sharing automobile shares vapour from this
Vehicle last time starts to calculate after stopping.
In the case where the down time being more than parking threshold value, it is set as the dispatch state of corresponding shared automobile to recall shape
State, and scheduling grade of the shared automobile is shared automobile by this and determined in the down time of the site, threshold value of stopping can be with
It is configured according to the actual situation.For example, the storage period of shared automobile is more than the scheduling of the shared automobile after 24 hours
State is set as recalling state, and the scheduling grade of the shared automobile is set as level-one.The storage period of the shared automobile is more than 48
After hour, the scheduling grade of the shared automobile is changed to second level by level-one.
In the case where sharing the quantity that automobile is the state that recalls in shared automobile site and be more than preset threshold, determine that this is total
The dispatch state for enjoying automobile site is the state that recalls, and the scheduling grade of the shared automobile site is shared in automobile site altogether by this
It enjoys the quantity that automobile is the state that recalls and determines, preset threshold can be determines according to actual conditions.For example, preset threshold is 30,
It is 40 that the quantity that automobile is the state that recalls is shared in shared automobile site, the wherein scheduling for recalling state vehicle of more than half
Grade is second level, and the scheduling grade that residue recalls state vehicle is level-one, then can determine that the shared automobile site is to recall shape
State, and the scheduling grade of the shared automobile site is second level.
Step 107, it is nearest to determine that distance recalls state site for the location data for obtaining multiple dispatcher's counterpart terminals
Dispatcher.
Step 108, dispatch command is generated, dispatch command is issued to dispatcher's counterpart terminal.
Dispatch command is generated, dispatch command is issued to distance and recalls the nearest dispatcher's counterpart terminal in state site.
In one embodiment of the application, dispatch command includes following any one or more: recalling state site
Location information, the location information for calling in state site, scheduling time, information scheduling route, dispatched buses.Wherein, when scheduling
Between for from the maximum time threshold value dispatched buses state site to the state site of calling in is recalled, scheduling route is to recall state site
For the line information called between state site, the information dispatched buses may include following any one or more: car hauler
License plate number, dispatch buses model, dispatch buses location information, dispatch buses color, dispatcher to the scheduling
The line information of vehicle.
Dispatcher is after receiving dispatch command, according to the instruction of dispatch command, goes to and recalls state site, by needs
It dispatches buses to recall to and calls in state site.Dispatcher, need to be according to the tune of dispatch command instruction during dispatching buses
Route is spent, and completes vehicle scheduling in the scheduling time as defined in dispatch command.
Step 109, the corresponding starting information dispatched buses of the dispatcher that dispatcher's counterpart terminal is sent is received,
The location information dispatched buses is obtained in real time.
After dispatcher is dispatched buses by counterpart terminal starting, dispatcher's counterpart terminal is automatically sent to server
The starting information dispatched buses.In the embodiment of the present application, which includes dispatcher's information, this dispatches buses
Information, starting the time.
In one embodiment of the application, which includes the identity information of the dispatcher.The scheduling
The information of vehicle may include following any one or more: license plate number, vehicle model, vehicle identification code, vehicle color.
Server receives the corresponding starting information dispatched buses of the dispatcher that dispatcher's counterpart terminal is sent, real
When obtain the location information dispatched buses, and in real time to the scheduling line indicated in the location information and dispatch command dispatched buses
Road is matched.When the line information that server indicates in determining the location information and dispatch command dispatched buses mismatches,
Route is issued to the counterpart terminal of dispatcher and deviates prompt, and records relevant stitch seam leans out line information.
In one embodiment of the application, stitch seam leans out line information may include it is following any one or more: scheduling people
Member's information, stitch seam leans out line time of origin, stitch seam leans out line scene, recalls state site information, calls in shape information of dispatching buses
State site information.Such as: the dispatcher of work number A0012 by the vehicle of number B0009 from site A call in site B dispatch when,
Deviate scheduling route in 9:18.
During dispatcher dispatches buses, server calculates the used scheduling time dispatched buses in real time,
When scheduling time being more than threshold value, scheduling time-out prompt is issued to dispatcher's counterpart terminal, and record related scheduling time-out letter
Breath.
In one embodiment of the application, scheduling time-out information may include it is following any one or more: scheduling people
Member's information, time-out time, recalls state site information, calls in state site information information of dispatching buses.Such as: work number A0012
Dispatcher by the vehicle of number B0009 from site A call in site B dispatch when, time-out 30 minutes.
Dispatcher will dispatch buses be parked in shared automobile site after, dispatcher passes through counterpart terminal and sends shared vapour
Instruction is completed in vehicle scheduling.Server receives the shared Truck dispartching sent from dispatcher's counterpart terminal and completes instruction, judgement
The parking position information dispatched buses calls in whether site matches with specified.Server is in the parking position dispatched buses
Information when calling in site mismatch, issues scheduling error prompt to dispatcher's counterpart terminal, and record related tune with specified
Spend error message.
In one embodiment of the application, scheduling error information may include it is following any one or more: scheduling people
Member information, information of dispatching buses recall state site information, call in state site information.Such as: the scheduling people of work number A0012
The vehicle of number B0009 is called in site B to dispatch by member from site A occurs mistake, by vehicle scheduling to site C.
In one embodiment of the application, server is after receiving the starting information dispatched buses, by shared
The sensor being arranged in automobile site obtains the first image dispatched buses.Server is receiving the scheduling completion dispatched buses
After instruction, second image dispatched buses is obtained by calling in the sensor being arranged in site.Server is by the second image
It is matched with the first image, under the second image and the unmatched situation of the first image, is issued to dispatcher's counterpart terminal
Scheduling error prompt, and record related scheduling error information.
In one embodiment of the application, when there is the problems such as traffic jam in the scheduling route of dispatch command instruction,
Server can be also sent to according to the traffic information obtained in real time again programming dispatching route, and by the scheduling route planned again
Dispatcher's counterpart terminal, and the location information dispatched buses is matched with the scheduling route planned again in real time.
In one embodiment of the application, after dispatcher is dispatched buses by counterpart terminal starting, dispatcher couple
Answer terminal that the starting information dispatched buses automatically is sent to server, server receives what dispatcher's counterpart terminal was sent
The dispatcher is corresponding dispatch buses and start information after, obtain the location information dispatched buses in real time, and by car hauler
Location information shown in a manner of electronic map on a display screen, in order to realize monitoring vehicle dispatch situation.
In one embodiment of the application, server can also be shown the information of each shared automobile site obtained in real time
Show on a display screen.Information of the shared automobile site include it is following any one or more: remaining parking stall number can use vehicle
It counts, the information of vehicles while passing site.
The embodiment of the present application provides a kind of dispatching method of shared automobile, multiple shared in preset time period by determining
The reservation order data and History Order data of automobile site determine each site in the predeterminable area within a preset period of time
With vehicle quantity and return the car quantity, according to each site in predeterminable area within a preset period of time with vehicle quantity and number of returning the car
Amount determines that the dispatch state of each site within a preset period of time and scheduling grade, the dispatch state include calling in state and recalling
State, scheduling grade are corresponding with the shared Truck dispartching quantity prestored.It is grading according to the dispatch state of each site and scheduling etc.
The scheduling of the shared automobile of row, dynamically carries out vehicle scheduling with vehicle demand based on user, can effectively improve shared automobile tune
The efficiency of degree, the cost for reducing shared Truck dispartching, efficiently solve the problems, such as that the vehicle of shared automobile site is unevenly distributed weighing apparatus.
Fig. 2 is a kind of schematic diagram of the scheduling system of shared automobile provided by the embodiments of the present application.As shown in Fig. 2, this is
System includes: the first determination unit 201, the second determination unit 202, third determination unit 203, the 4th determination unit 204, the first industry
It is engaged in processing unit 205, the second Service Processing Unit 206, third Service Processing Unit 207, the 4th Service Processing Unit 208, the
Five determination units 209 generate scheduling unit 210, receiving unit 211, acquiring unit 212.
First determination unit 201 for determine in preset time period the reservation order data of multiple shared automobile sites and
History Order data.
In one embodiment of the application, reservation order data includes the reservation vehicle quantity in the preset time period
It returns the car quantity with reservation, History Order data include the history vehicle in the period relevant to the preset time period in history
Quantity and history are returned the car quantity.
Second determination unit 202 is used to be determined according to the History Order data and reservation order data in preset time period
Each site in predeterminable area within a preset period of time with vehicle quantity and quantity of returning the car.
Second determination unit 202 uses vehicle quantity specifically for each site in predeterminable area in determining preset time period
Are as follows: T (x, t)=aS (x, t)+bM (x, t).Wherein, x indicates site mark, and t indicates subscription time segment identification, a first
Weight, and a is constant, S (x, t) is reservation vehicle quantity of the site x within the t period, and b is the second weight, and b is constant, M
(x, t) is that history of the site x within the t period averagely uses vehicle quantity, and a is greater than b, and the difference of a and b is greater than threshold value, a and b it
Be 1.And determine the quantity of returning the car of each site in predeterminable area within a preset period of time are as follows: F (x, t)=aR (x, t)+
b·N(x,t).Wherein, x indicates site mark, and t indicates subscription time segment identification, and a is the first weight, and a is constant, R (x, t)
It returns the car quantity for reservation of the site x within the t period, b is the second weight, and b is constant, and N (x, t) is site x in the t period
Interior history is averagely returned the car quantity, and a is greater than b, and the difference of a and b is greater than threshold value, and the sum of a and b are 1.
Third determination unit 203 be used for according to each site in predeterminable area within a preset period of time with vehicle quantity and also
Vehicle quantity determines the dispatch state of each site within a preset period of time and scheduling grade.
Third determination unit 203 be specifically used for dispatch state be call in state status under, according to each site it is default when
Between section reservation vehicle quantity, reservation return the car quantity, the history of preset time period with vehicle quantity, history return the car quantity and in real time
Each site current idle parking stall quantity obtained, determines the scheduling grade of each site within a preset period of time.
In one embodiment of the application, dispatch state includes: the state of calling in and recalls state, dispatches grade and prestores
Shared Truck dispartching quantity it is corresponding.
4th determination unit 204 is for determining whether the scheduling grade of shared automobile site reaches predetermined level.
First Service Processing Unit 205 is used in the case where the scheduling grade of shared automobile site reaches predetermined level,
Vehicle scheduling is carried out according to the dispatch state of shared automobile site and scheduling grade.
It is to call under state status that first Service Processing Unit 205, which is specifically used for the first site in determining each site, root
Location information and preset first distance threshold value according to the first site, determine that the corresponding one or more in the first site recalls
Site.The second site is to recall under state status in determining each site, according to the location information of the second site and preset
Second distance threshold value determines that the corresponding one or more in the second site calls in site.
First Service Processing Unit 205 is specifically used for using the first dot location coordinate as the center of circle, with preset first distance
For radius, obtains multiple state sites that recall and gather.It is recalled in the set of state site multiple, determines that the first site of distance is nearest
The state site that recalls be that the first site is corresponding recalls site.Alternatively, recalling in the set of state site multiple, scheduling is determined
Grade is highest to be recalled state site to be that the first site is corresponding recalls site.Using the second dot location coordinate as the center of circle, with pre-
If second distance is radius, obtains multiple state sites of calling in and gather.It is called in the set of state site multiple, determines distance the
Site is called in for the second site is corresponding in the nearest state site of calling in two sites.Alternatively, gathering in multiple state sites of calling in
In, determine that the highest state site of calling in of scheduling grade is that the second site is corresponding calls in site.
Second Service Processing Unit 206 is used for the case where the scheduling grade of shared automobile site does not reach predetermined level
Under, vehicle scheduling is carried out according to the parking information of the shared automobile in shared automobile site.
Second Service Processing Unit 206 is specifically used for determining that current each shared automobile is in the net in the shared automobile site
The down time of point.In the case where down time is more than parking threshold condition, the dispatch state of corresponding shared automobile is set as recalling
State, and the scheduling grade of the shared automobile is shared automobile by this and is determined in the site down time.In shared automobile site
In share in the case of the quantity that automobile is the state that recalls is more than preset threshold, determine that the dispatch state of the shared automobile site is
State is recalled, and the scheduling grade of the shared automobile site is shared by this and shares the quantity that automobile is the state that recalls in automobile site
And it determines.
Third Service Processing Unit 207 is the case where calling in state for the first site in each shared automobile site
Under, using the first dot location coordinate as the center of circle, using default first distance as radius, obtains multiple state sites that recall and gather.It obtains
Take multiple traffic informations for recalling and respectively being recalled between state site and the first site in the set of state site.According to traffic information,
Determine that multiple one recalled in the set of state site recall state site and recall site for the first site is corresponding.
4th Service Processing Unit 208 is the case where recalling state for the second site in each shared automobile site
Under, using the second dot location coordinate as the center of circle, using default second distance as radius, obtains multiple state sites of calling in and gather.It obtains
Multiple call in the set of state site is taken respectively to call in the traffic information between state site and the second site.According to traffic information,
Determine that multiple one called in the set of state site call in state site and call in site for the second site is corresponding.
In one embodiment of the application, traffic information includes road condition information, Weather information, traffic condition letter
Breath.
5th determination unit 209 is used to obtain the location data of multiple dispatcher's counterpart terminals, determines that distance recalls shape
The nearest dispatcher in state site.
Scheduling unit 210 is generated for generating dispatch command, dispatch command is issued to dispatcher's counterpart terminal.
In one embodiment of the application, dispatch command includes: the location information for recalling state site, calls in state net
It is the location information of point, scheduling time, scheduling route, one or more in the information dispatched buses.
Receiving unit 211 be used for receive dispatcher's counterpart terminal transmission the dispatcher it is corresponding dispatch buses open
Dynamic information.
Acquiring unit 212 for obtaining the location information dispatched buses in real time.
The embodiment of the present application provides a kind of scheduling system of shared automobile, multiple shared in preset time period by determining
The reservation order data and History Order data of automobile site determine each site in the predeterminable area within a preset period of time
With vehicle quantity and return the car quantity, according to each site in predeterminable area within a preset period of time with vehicle quantity and number of returning the car
Amount determines that the dispatch state of each site within a preset period of time and scheduling grade, the dispatch state include calling in state and recalling
State, scheduling grade are corresponding with the shared Truck dispartching quantity prestored.It is grading according to the dispatch state of each site and scheduling etc.
The scheduling of the shared automobile of row, dynamically carries out vehicle scheduling with vehicle demand based on user, can effectively improve shared automobile tune
The efficiency of degree, the cost for reducing shared Truck dispartching, efficiently solve the problems, such as that the vehicle of shared automobile site is unevenly distributed weighing apparatus.
All the embodiments in this specification are described in a progressive manner for the embodiment of the present invention, between each embodiment
Same and similar part may refer to each other, and each embodiment focuses on the differences from other embodiments.Especially
Its, for system embodiments, since it is substantially similar to the method embodiment, so being described relatively simple, related place
Illustrate referring to the part of embodiment of the method.
Above-described specific embodiment has carried out further the purpose of the present invention, technical scheme and beneficial effects
It is described in detail, it should be understood that being not used to limit the application the foregoing is merely the specific embodiment of the application
Protection scope, within the spirit and principles of this application, any modification, equivalent substitution, improvement and etc. done should all include
Within the scope of protection of this application.
Claims (10)
1. a kind of dispatching method of shared automobile, which is characterized in that the described method includes:
Determine the reservation order data and History Order data of multiple shared automobile sites in preset time period；The reservation is ordered
Forms data includes reservation in the preset time period is returned the car quantity with vehicle quantity and reservation；The History Order data include going through
History in the relevant period of preset time period described in Shi Shangyu is returned the car quantity with vehicle quantity and history；
According to the History Order data and reservation order data in the preset time period, determine that each site in predeterminable area exists
In the preset time period with vehicle quantity and return the car quantity；
According to each site in the predeterminable area within a preset period of time with vehicle quantity and return the car quantity, determine each net
The dispatch state and scheduling grade of point within a preset period of time；The dispatch state includes: the state of calling in and recalls state；It is described
It is corresponding with the shared Truck dispartching quantity prestored to dispatch grade.
2. the method according to claim 1, wherein according in the preset time period History Order data and
Reserve order data, determine each site in predeterminable area in the preset time period with vehicle quantity and return the car quantity, tool
Body are as follows:
The use vehicle quantity of each site in the preset time period in predeterminable area are as follows:
T (x, t)=aS (x, t)+bM (x, t)；
Wherein, x indicates site mark, and t indicates subscription time segment identification, and a is the first weight, and a is constant, and S (x, t) is site
The x vehicle quantity of the reservation within the t period, b is the second weight, and b is constant, and M (x, t) is site x going through within the t period
History averagely uses vehicle quantity, and a is greater than b, and the difference of a and b is greater than threshold value, and the sum of a and b are 1；And
The quantity of returning the car of each site in the preset time period in predeterminable area are as follows:
F (x, t)=aR (x, t)+N (x, t)；
Wherein, x indicates site mark, and t indicates subscription time segment identification, and a is the first weight, and a is constant, and R (x, t) is site
Reservation of the x within the t period is returned the car quantity, and b is the second weight, and b is constant, and N (x, t) is site x going through within the t period
History is averagely returned the car quantity, and a is greater than b, and the difference of a and b is greater than threshold value, and the sum of a and b are 1.
3. the method according to claim 1, wherein according to each site in the predeterminable area when default
Between in section with vehicle quantity and quantity of returning the car, determine the dispatch state of each site within a preset period of time and scheduling grade it
Afterwards, the method also includes:
Determine whether the scheduling grade of shared automobile site reaches predetermined level；
In the case where the scheduling grade of the shared automobile site reaches predetermined level, according to the tune of the shared automobile site
Degree state and scheduling grade carry out vehicle scheduling；
In the case where the scheduling grade of the shared automobile site does not reach predetermined level, according in shared automobile site
The parking information of shared automobile carries out vehicle scheduling.
4. according to the method described in claim 3, it is characterized in that, the scheduling grade in the shared automobile site reaches default
In the case where grade, vehicle scheduling is carried out according to the dispatch state of the shared automobile site and scheduling grade specifically:
The first site is under calling in state status in determining each site, according to the location information of first site, with
And preset first distance threshold value, determine that the corresponding one or more in first site recalls site；
The second site is under recalling state status in determining each site, according to the location information of second site, with
And preset second distance threshold value, determine that the corresponding one or more in second site calls in site.
5. according to the method described in claim 3, it is characterized in that, the scheduling grade in the shared automobile site does not reach
In the case where predetermined level, vehicle scheduling is carried out according to the parking information of the shared automobile in shared automobile site specifically:
Determine that current each shared automobile is more than in the down time in the down time of the site in the shared automobile site
It stops under threshold condition, the dispatch state of corresponding shared automobile is set as to recall state, and the scheduling grade of the shared automobile
Automobile is shared by this to determine in the site down time；
In the case of sharing the quantity that automobile is the state that recalls in shared automobile site and be more than preset threshold, the shared vapour is determined
The dispatch state of vehicle site is the state that recalls, and the scheduling grade of the shared automobile site is shared by this and shares vapour in automobile site
Vehicle is the quantity for the state that recalls and determines.
6. according to the method described in claim 4, it is characterized in that, first site in determining each site is to call in
Under state status, according to the location information of first site and preset first distance threshold value, first site is determined
Corresponding one or more recalls site specifically:
Using the first dot location coordinate as the center of circle, using preset first distance as radius, obtain multiple recalling state site
Set；Recalled in the set of state site the multiple, determine apart from first site it is nearest recall state site as institute
State that the first site is corresponding to recall site；Alternatively, recalling in the set of state site the multiple, determine that scheduling grade is highest
It recalls state site and recalls site for first site is corresponding；
Second site in determining each site is under recalling state status, to be believed according to the position of second site
Breath and preset second distance threshold value, determine that the corresponding one or more in second site calls in site specifically:
Using the second dot location coordinate as the center of circle, using default second distance as radius, obtain multiple calling in state site collection
It closes；It is called in the set of state site the multiple, determines that the call in state site nearest apart from second site is described
Second site is corresponding to call in site；Alternatively, calling in the set of state site the multiple, the scheduling highest tune of grade is determined
Enter state site and calls in site for second site is corresponding.
7. the method according to claim 1, wherein according to each site in the predeterminable area when default
Between in section with vehicle quantity and quantity of returning the car, determine the dispatch state of each site within a preset period of time and scheduling grade it
Afterwards, the method also includes:
The first site in each shared automobile site is in the case where calling in state, is circle with the first dot location coordinate
The heart obtains multiple state sites that recall and gathers using default first distance as radius；The multiple state site that recalls is obtained to gather
In respectively recall traffic information between state site and first site；
According to the traffic information, determining that the multiple one recalled in the set of state site recalls state site is described the
One site is corresponding to recall site；
The second site in each shared automobile site is in the case where recalling state, is circle with the second dot location coordinate
The heart obtains multiple state sites of calling in and gathers using default second distance as radius；The multiple state site of calling in is obtained to gather
In respectively call in the traffic information between state site and second site；According to the traffic information, the multiple tune is determined
Entering one in the set of state site to call in state site is that second site is corresponding calls in site；
Wherein, the traffic information includes following one or more: road condition information, Weather information, traffic related information.
8. the method according to claim 1, wherein the method also includes:
The location data for obtaining multiple dispatcher's counterpart terminals determines that distance recalls the nearest dispatcher in state site；
Dispatch command is generated, the dispatch command is issued to dispatcher's counterpart terminal, the dispatch command includes: to adjust
Do well the location information of site, the location information for calling in state site, scheduling time, information scheduling route, dispatched buses
In it is one or more；
Receive the corresponding starting information dispatched buses of the dispatcher that dispatcher's counterpart terminal is sent；
The location information dispatched buses described in obtaining in real time.
9. the method according to claim 1, wherein according to each site in the predeterminable area in preset time
In section with vehicle quantity and return the car quantity, determine the dispatch state of each site within a preset period of time and scheduling grade, tool
Body includes:
In the case where the dispatch state is to call in state status, according to the reservation of the preset time period of each site vehicle quantity, reservation
Quantity, the history of preset time period of returning the car are returned the car quantity and each site current idle vehicle for obtaining in real time with vehicle quantity, history
Bit quantity determines the scheduling grade of each site within a preset period of time.
10. a kind of scheduling system of shared automobile, which is characterized in that the system comprises:
First determination unit, for determining that the reservation order data and history of multiple shared automobile sites in preset time period are ordered
Forms data；The reservation order data includes reservation in the preset time period is returned the car quantity with vehicle quantity and reservation；It is described
History Order data include that the history in history in the period relevant to the preset time period is returned the car with vehicle quantity and history
Quantity；
Second determination unit, for determining pre- according to the History Order data and reservation order data in the preset time period
If each site in region in the preset time period with vehicle quantity and return the car quantity；
Third determination unit, for according to each site in the predeterminable area within a preset period of time with vehicle quantity and returning the car
Quantity determines the dispatch state of each site within a preset period of time and scheduling grade；The dispatch state includes: to call in shape
State and recall state；The scheduling grade is corresponding with the shared Truck dispartching quantity prestored.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910146846.9A CN110033161A (en) | 2019-02-27 | 2019-02-27 | A kind of dispatching method and system of shared automobile |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910146846.9A CN110033161A (en) | 2019-02-27 | 2019-02-27 | A kind of dispatching method and system of shared automobile |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110033161A true CN110033161A (en) | 2019-07-19 |
Family
ID=67235774
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910146846.9A Pending CN110033161A (en) | 2019-02-27 | 2019-02-27 | A kind of dispatching method and system of shared automobile |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110033161A (en) |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110807921A (en) * | 2019-10-24 | 2020-02-18 | 上海钧正网络科技有限公司 | Vehicle scheduling method, device, equipment and storage medium |
| CN110853374A (en) * | 2019-10-30 | 2020-02-28 | 中国第一汽车股份有限公司 | Shared automobile scheduling method and system based on unmanned technology |
| CN111402573A (en) * | 2020-03-24 | 2020-07-10 | 深圳市元征科技股份有限公司 | Shared vehicle scheduling method, system, equipment and computer storage medium |
| CN111429226A (en) * | 2020-03-30 | 2020-07-17 | 北京骑胜科技有限公司 | Order repairing method and device |
| CN111461562A (en) * | 2020-04-07 | 2020-07-28 | 北京首汽智行科技有限公司 | Vehicle scheduling effectiveness judgment method |
| CN111539629A (en) * | 2020-04-23 | 2020-08-14 | 北京首汽智行科技有限公司 | Route generation method based on shared vehicle |
| CN111815096A (en) * | 2019-07-31 | 2020-10-23 | 北京嘀嘀无限科技发展有限公司 | Shared automobile delivery method, electronic device and storage medium |
| CN111832872A (en) * | 2020-01-03 | 2020-10-27 | 北京嘀嘀无限科技发展有限公司 | Vehicle scheduling method and device, electronic equipment and storage medium |
| CN112613752A (en) * | 2020-12-25 | 2021-04-06 | 环球车享汽车租赁有限公司 | Method, electronic device, and storage medium for vehicle scheduling |
| CN112950041A (en) * | 2021-03-11 | 2021-06-11 | 北京骑胜科技有限公司 | Shared vehicle scheduling method, device, storage medium and computer program product |
| CN113065915A (en) * | 2021-03-17 | 2021-07-02 | 北京首汽智行科技有限公司 | Car-arranging method for sharing cars |
| CN113095636A (en) * | 2021-03-25 | 2021-07-09 | 深圳前海联动云软件科技有限公司 | Intelligent scheduling system and method for fuel sharing automobile |
| CN113159883A (en) * | 2021-03-23 | 2021-07-23 | 深圳前海联动云软件科技有限公司 | Automobile leasing dynamic inventory management method and system |
| CN113610321A (en) * | 2021-08-23 | 2021-11-05 | 宁波小遛共享信息科技有限公司 | Shared vehicle scheduling method and device for parking points and computer equipment |
| CN113902156A (en) * | 2021-11-16 | 2022-01-07 | 南京领行科技股份有限公司 | Scheduling method and device for network appointment vehicle and storage medium |
| CN116028191A (en) * | 2023-02-27 | 2023-04-28 | 北京派网科技有限公司 | Distributed storage-based distributed scheduling method and system |
| CN116363854A (en) * | 2023-05-31 | 2023-06-30 | 北京阿帕科蓝科技有限公司 | Shared travel vehicle dispatching method and device and computer equipment |
| CN116453324A (en) * | 2023-06-15 | 2023-07-18 | 北京阿帕科蓝科技有限公司 | Shared vehicle operation and maintenance method, system and storage medium |
| CN116822916A (en) * | 2023-08-31 | 2023-09-29 | 北京阿帕科蓝科技有限公司 | Order quantity acquisition method, order quantity acquisition device, computer equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105719019A (en) * | 2016-01-21 | 2016-06-29 | 华南理工大学 | Public bicycle peak time demand prediction method considering user reservation data |
| CN106971271A (en) * | 2017-03-30 | 2017-07-21 | 上海卓易科技股份有限公司 | Vehicle put-on method and device |
| CN107742184A (en) * | 2017-10-11 | 2018-02-27 | 北京摩拜科技有限公司 | Vehicle dispatching method, server, client and system |
| US20180209803A1 (en) * | 2017-01-25 | 2018-07-26 | Via Transportation, Inc. | Dynamic Route Planning |
| CN108346010A (en) * | 2018-04-23 | 2018-07-31 | 徐漫洋 | Shared Truck dispartching method based on user requirements analysis |
| CN108388999A (en) * | 2018-03-09 | 2018-08-10 | 北京摩拜科技有限公司 | Vehicle dispatching method, server, client and system |
-
2019
- 2019-02-27 CN CN201910146846.9A patent/CN110033161A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105719019A (en) * | 2016-01-21 | 2016-06-29 | 华南理工大学 | Public bicycle peak time demand prediction method considering user reservation data |
| US20180209803A1 (en) * | 2017-01-25 | 2018-07-26 | Via Transportation, Inc. | Dynamic Route Planning |
| CN106971271A (en) * | 2017-03-30 | 2017-07-21 | 上海卓易科技股份有限公司 | Vehicle put-on method and device |
| CN107742184A (en) * | 2017-10-11 | 2018-02-27 | 北京摩拜科技有限公司 | Vehicle dispatching method, server, client and system |
| CN108388999A (en) * | 2018-03-09 | 2018-08-10 | 北京摩拜科技有限公司 | Vehicle dispatching method, server, client and system |
| CN108346010A (en) * | 2018-04-23 | 2018-07-31 | 徐漫洋 | Shared Truck dispartching method based on user requirements analysis |
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111815096A (en) * | 2019-07-31 | 2020-10-23 | 北京嘀嘀无限科技发展有限公司 | Shared automobile delivery method, electronic device and storage medium |
| CN111815096B (en) * | 2019-07-31 | 2024-02-20 | 北京嘀嘀无限科技发展有限公司 | Shared automobile throwing method, electronic equipment and storage medium |
| CN110807921A (en) * | 2019-10-24 | 2020-02-18 | 上海钧正网络科技有限公司 | Vehicle scheduling method, device, equipment and storage medium |
| CN110853374A (en) * | 2019-10-30 | 2020-02-28 | 中国第一汽车股份有限公司 | Shared automobile scheduling method and system based on unmanned technology |
| CN111832872A (en) * | 2020-01-03 | 2020-10-27 | 北京嘀嘀无限科技发展有限公司 | Vehicle scheduling method and device, electronic equipment and storage medium |
| CN111402573A (en) * | 2020-03-24 | 2020-07-10 | 深圳市元征科技股份有限公司 | Shared vehicle scheduling method, system, equipment and computer storage medium |
| CN111429226B (en) * | 2020-03-30 | 2023-07-18 | 北京骑胜科技有限公司 | Order repairing method and device |
| CN111429226A (en) * | 2020-03-30 | 2020-07-17 | 北京骑胜科技有限公司 | Order repairing method and device |
| CN111461562A (en) * | 2020-04-07 | 2020-07-28 | 北京首汽智行科技有限公司 | Vehicle scheduling effectiveness judgment method |
| CN111539629A (en) * | 2020-04-23 | 2020-08-14 | 北京首汽智行科技有限公司 | Route generation method based on shared vehicle |
| CN112613752A (en) * | 2020-12-25 | 2021-04-06 | 环球车享汽车租赁有限公司 | Method, electronic device, and storage medium for vehicle scheduling |
| CN112950041A (en) * | 2021-03-11 | 2021-06-11 | 北京骑胜科技有限公司 | Shared vehicle scheduling method, device, storage medium and computer program product |
| CN113065915A (en) * | 2021-03-17 | 2021-07-02 | 北京首汽智行科技有限公司 | Car-arranging method for sharing cars |
| CN113159883A (en) * | 2021-03-23 | 2021-07-23 | 深圳前海联动云软件科技有限公司 | Automobile leasing dynamic inventory management method and system |
| CN113095636A (en) * | 2021-03-25 | 2021-07-09 | 深圳前海联动云软件科技有限公司 | Intelligent scheduling system and method for fuel sharing automobile |
| CN113095636B (en) * | 2021-03-25 | 2024-01-23 | 深圳前海联动云软件科技有限公司 | Intelligent scheduling system and method for fuel sharing automobile |
| CN113610321A (en) * | 2021-08-23 | 2021-11-05 | 宁波小遛共享信息科技有限公司 | Shared vehicle scheduling method and device for parking points and computer equipment |
| CN113902156B (en) * | 2021-11-16 | 2022-04-08 | 南京领行科技股份有限公司 | Scheduling method and device for network appointment vehicle and storage medium |
| CN113902156A (en) * | 2021-11-16 | 2022-01-07 | 南京领行科技股份有限公司 | Scheduling method and device for network appointment vehicle and storage medium |
| CN116028191A (en) * | 2023-02-27 | 2023-04-28 | 北京派网科技有限公司 | Distributed storage-based distributed scheduling method and system |
| CN116363854A (en) * | 2023-05-31 | 2023-06-30 | 北京阿帕科蓝科技有限公司 | Shared travel vehicle dispatching method and device and computer equipment |
| CN116363854B (en) * | 2023-05-31 | 2023-10-24 | 北京阿帕科蓝科技有限公司 | Shared travel vehicle dispatching method and device and computer equipment |
| CN116453324A (en) * | 2023-06-15 | 2023-07-18 | 北京阿帕科蓝科技有限公司 | Shared vehicle operation and maintenance method, system and storage medium |
| CN116822916A (en) * | 2023-08-31 | 2023-09-29 | 北京阿帕科蓝科技有限公司 | Order quantity acquisition method, order quantity acquisition device, computer equipment and storage medium |
| CN116822916B (en) * | 2023-08-31 | 2024-01-26 | 北京阿帕科蓝科技有限公司 | Order quantity acquisition method, order quantity acquisition device, computer equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110033161A (en) | A kind of dispatching method and system of shared automobile | |
| CN107341553B (en) | A kind of vehicle dispatching method and device, electronic equipment | |
| US9299256B2 (en) | Real-time parking assistant application | |
| CN103996290B (en) | A kind of provide the method for dial-a-cab, server and system | |
| CN105761541B (en) | A kind of automated parking ground's vehicle collection reservation System and method for | |
| US20170301054A1 (en) | Dynamic forecasting for forward reservation of cab | |
| CN109635971A (en) | A kind of people's goods is shared to use vehicle method of servicing | |
| BRPI0012935B1 (en) | method for communication between the dispatch center and a plurality of wireless communication devices in a vehicular dispatch system | |
| CN110741402A (en) | System and method for capacity scheduling | |
| CN107301586A (en) | Vehicle Forecasting Methodology, device and server can be rented | |
| CN111626648B (en) | Survey task scheduling method and device, computer equipment and storage medium | |
| CN115311894A (en) | Intelligent parking management method, system, terminal and medium based on big data analysis | |
| CN110473028A (en) | A kind of taxi fare calculation method and system | |
| CN110942220A (en) | Transport capacity scheduling method and device and server | |
| CN112257936B (en) | Recommendation method and device for order receiving area, electronic equipment and storage medium | |
| CN107146123B (en) | Order allocation method and system | |
| CN110119955B (en) | Order rate estimation method and device | |
| CN115762131A (en) | Intelligent driving plan compiling method and system applied to public transportation | |
| CN115759660A (en) | Scheduling method, device, equipment and medium for unmanned vehicle | |
| CN113129102B (en) | Delayed order dispatching method and device, electronic equipment and storage medium | |
| CN103607408A (en) | Fuel consumption accounting method and device based on real-time fuel consumption information acquisition | |
| CN113505945A (en) | BD card punching and shop visiting method for maintaining customer relationship and supervising BD personnel | |
| CN113269339A (en) | Method and system for automatically creating and distributing network appointment tasks | |
| CN110992686A (en) | Traffic travel big data analysis method | |
| CN110059839A (en) | A kind of method that need-based extracts unmet demand |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: Room 2001, block B, newspaper building, middle section of Lashan Hexi Road, Huaiyin District, Jinan City, Shandong Province Applicant after: Shandong Chuangqi cloud computing Co., Ltd Address before: 250000 Room 2001, Block B, Jinan Newspaper Building, Middle Section of Lashan Hexi Road, Huaiyin District, Jinan City, Shandong Province Applicant before: Shandong pioneer cloud Software Co., Ltd. |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190719 |