CN108062855B - Method and system for dispatching vehicles in peak vehicle time period - Google Patents
Method and system for dispatching vehicles in peak vehicle time period Download PDFInfo
- Publication number
- CN108062855B CN108062855B CN201711365180.3A CN201711365180A CN108062855B CN 108062855 B CN108062855 B CN 108062855B CN 201711365180 A CN201711365180 A CN 201711365180A CN 108062855 B CN108062855 B CN 108062855B
- Authority
- CN
- China
- Prior art keywords
- vehicle
- area
- current
- peak
- time point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
- G08G1/205—Indicating the location of the monitored vehicles as destination, e.g. accidents, stolen, rental
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention relates to the technical field of vehicle scheduling, in particular to a method and a system for scheduling vehicles in a peak vehicle using time period, wherein the method comprises the following steps: judging whether each vehicle area is a peak vehicle area or not according to historical data, inventory and a preset amount of each vehicle area in the peak vehicle time period; if the current vehicle using area is a peak vehicle using area, determining a starting time point of starting to call the vehicle in the current vehicle using area according to the time length T1 of the current peak vehicle using time period and the scheduling time length T2 required by the current vehicle using area; and determining the number of the vehicles to be called into the current vehicle using area in the current peak vehicle using time period, and calling the corresponding vehicles into the current vehicle using area at the starting time point. The invention can meet the vehicle using requirement in the area with large vehicle using requirement in the peak vehicle using time period.
Description
Technical Field
The invention relates to the technical field of vehicle scheduling, in particular to a method and a system for scheduling vehicles in a peak vehicle using time period.
Background
Shared vehicles are now widespread and are found everywhere in life. Due to the difference of areas, the demands of shared vehicles are different in different areas and different time periods, for example, the vehicle using demand near a working area is far larger than that in an entertainment business area at the morning and evening peak time of a working day; during the rest day, the demand for vehicles near the entertainment business area is much greater than near the work area. The variable demand creates a great difficulty in the scheduling of shared vehicles.
In the prior art, vehicles are usually thrown differently according to the properties of each region, and the throwing amount is relatively fixed, so that the vehicle demand in each time period can be met. However, different areas have different vehicle using demands at different time periods, so that the same area cannot always be an area with a large vehicle using demand. Especially during peak usage periods, if the vehicles in the area are simply dropped in a conventional manner, waste is easily caused. Moreover, since all people are not always guaranteed to use the car, more and more people adopt a preset car using mode, and therefore the dispatching situation of each area is more complicated.
Disclosure of Invention
The invention aims to solve the technical problem of overcoming the defects of the prior art and providing a method and a system for dispatching vehicles in a peak vehicle using time period, which can meet the vehicle using requirements of an area with large vehicle using requirements in the peak vehicle using time period.
In order to achieve the above technical object, in one aspect, the present invention provides a method for scheduling vehicles in a peak time period, including:
judging whether each vehicle area is a peak vehicle area or not according to historical data, inventory and a preset amount of each vehicle area in the peak vehicle time period;
if the current vehicle using area is a peak vehicle using area, determining a starting time point of starting to call the vehicle in the current vehicle using area according to the time length T1 of the current peak vehicle using time period and the scheduling time length T2 required by the current vehicle using area;
and determining the number of the vehicles to be called into the current vehicle using area in the current peak vehicle using time period, and calling the corresponding vehicles into the current vehicle using area at the starting time point.
In another aspect, the present invention provides a system for peak vehicle time slot vehicle scheduling, comprising:
the judging unit is used for judging whether each vehicle area is a peak vehicle area or not according to historical data, inventory and a preset amount of each vehicle area in the peak vehicle time period;
the time determining unit is used for determining a starting time point of starting to call in the vehicle in the current vehicle using area according to the time length T1 of the current peak vehicle using time period and the scheduling time length T2 required by the current vehicle using area if the current vehicle using area is the peak vehicle using area;
and the calculation scheduling unit is used for determining the number of the vehicles to be called into the current vehicle using area in the current peak vehicle using time period and calling the corresponding vehicles into the current vehicle using area at the starting time point.
In the invention, whether the current vehicle using area is a peak vehicle using area in the current peak vehicle using time period is judged firstly, because the vehicle using demand of the same vehicle using area is different in different time periods, namely, the current vehicle using area can not be ensured to belong to the peak vehicle using area (the vehicle using area with high demand) all the time; therefore, the judgment is carried out in advance, and then the vehicle dispatching is carried out according to the judgment result, so that the resource waste is avoided. And then determining the starting time point of starting to call in the vehicle in the current vehicle using area according to the time length T1 of the current peak vehicle using time period and the required dispatching time length T2 of the current vehicle using area. The starting time point of the dispatching vehicle is determined by considering T1 and T2, so that the dispatching scheme is effectively ensured to be in accordance with the current vehicle using condition, the vehicle is dispatched to the current vehicle using area at a proper time, and the vehicle is not dispatched to the current area too early or too late. After the starting time point is determined, the corresponding number of vehicles to be called (the number of vehicles to be called) is determined, so that the vehicle using requirement of the current vehicle using area can be met.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a schematic flow chart of a method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a system configuration according to an embodiment of the present invention;
FIG. 3 is a schematic structural diagram of a determining unit according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a structure of determining a time unit according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a calculation scheduling unit according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
As shown in fig. 1, the method for vehicle scheduling in peak time period according to the present invention includes:
101. judging whether each vehicle area is a peak vehicle area or not according to historical data, inventory and a preset amount of each vehicle area in the peak vehicle time period;
102. if the current vehicle using area is a peak vehicle using area, determining a starting time point of starting to call the vehicle in the current vehicle using area according to the time length T1 of the current peak vehicle using time period and the scheduling time length T2 required by the current vehicle using area;
103. and determining the number of the vehicles to be called into the current vehicle using area in the current peak vehicle using time period, and calling the corresponding vehicles into the current vehicle using area at the starting time point.
Further, the air conditioner is provided with a fan,
historical data of a current vehicle utilization area during peak vehicle utilization time periods comprises: calling historical average numbers of the total number of vehicles in the current vehicle using area in the current peak vehicle using time period and historical average numbers of the vehicle using demand in the current vehicle using area in the current peak vehicle using time period;
the method for judging whether each vehicle area is a peak vehicle area or not according to historical data, inventory and preset quantity of each vehicle area in the peak vehicle time period specifically comprises the following steps:
acquiring a historical average number Q1 of the number of vehicles called to a current vehicle using area in a current peak vehicle using time period, a historical average number S of vehicle using demand of the current vehicle using area in the current peak vehicle using time period, a stock m and a predetermined amount D;
calculating an evaluation coefficient delta of the current vehicle area;
when delta is larger than or equal to 1, judging that the current vehicle using area is a peak vehicle using area;
when delta is more than or equal to 0 and less than 1, judging that the current vehicle using area is a flat peak vehicle using area;
when delta is less than 0, judging that the current vehicle using area is a low-peak vehicle using area;
the evaluation coefficient delta of the current vehicle area is calculated according to the formula:
δ＝(S+D-m)/Q1 (1)
or the evaluation coefficient delta of the current vehicle area is calculated according to the formula:
δ＝(S-m)/Q1 (2)
when the delta is larger than or equal to 1, the current vehicle using area is judged to be a peak vehicle using area, and the method specifically comprises the following steps:
when delta is larger than or equal to 2, the current vehicle using area is an emergency peak vehicle using area;
when 2 is larger than delta and is larger than or equal to 1, the current vehicle using area is a common peak vehicle using area.
Further, in the present invention,
the determining the starting time point of starting to call in the vehicle in the current vehicle using area according to the time length T1 of the peak vehicle using time period and the scheduling time length T2 required by the current vehicle using area specifically comprises the following steps:
if T2 is greater than T1, determining a time point before the starting time point of the peak vehicle time period (T2-T1) as a starting time point when the current vehicle usage area starts to call in the vehicle;
if T2 is not more than T1, determining that the time point of starting to call the vehicle in the current vehicle using area is behind the starting time point of the peak vehicle using time period, wherein the starting time point at least comprises one;
when only one starting time point exists, determining that the starting time point is before the moment when the current vehicle using area inventory m minus a preset amount D equals to a preset value K (K is more than 0);
when more than two starting time points exist, determining that the current starting time point is before the current vehicle utilization area inventory m is added with the corresponding number n of the unreached vehicles minus a preset amount D to be equal to a preset value K;
the vehicle which does not arrive at the current starting time point is the vehicle which starts to call into the current vehicle using area but does not arrive at the current vehicle using area before the current starting time point.
In a still further aspect of the present invention,
the determining the number of the vehicles called into the current vehicle using area in the current peak vehicle using time period specifically comprises the following steps:
when T2 is larger than T1, or T2 is smaller than or equal to T1, and only one starting time point exists, determining the total number of vehicles which are called into the current vehicle using area at the only starting time point;
when T2 is less than or equal to T1 and when more than two starting time points exist, determining the number of single vehicles and the total number of vehicles which are called into the current vehicle using area at each starting time point;
the transferring the corresponding vehicle to the current vehicle using area at the starting time point specifically includes:
setting at least one turnover parking point in a preset range from a current vehicle using area, and transferring vehicles with corresponding vehicle transferring numbers to the current vehicle using area from the turnover parking point at a starting time point;
and/or the corresponding vehicles with the number of the vehicles are called from the low peak vehicle area to the current vehicle area at the starting time point;
and/or the corresponding vehicles with the number of the vehicles are called from the flat peak vehicle area to the current vehicle area at the starting time point.
In the above-mentioned technical solution,
when T2 > T1, or T2. ltoreq.T 1 and there is only one starting point in time,
the total number Q of vehicles in the current vehicle using area is called at the unique starting time point and is determined by the historical average number S, the inventory m and the preset amount D of the vehicle using demand of the current vehicle using area in the current peak vehicle using time period, and the determination formula is as follows:
Q≥S+D-m (3)
when T2 ≦ T1 and when there are more than two startup time points,
the number Q' of single vehicles which are called into the current vehicle using area at the current starting time point is determined by the time length T1 of the current peak vehicle using time period, the dispatching time length T2 required by the current vehicle using area, the inventory m of the current vehicle using area in the current peak vehicle using time period, the preset quantity D and the number n of the non-arriving vehicles corresponding to the current starting time point, and the determination formula is as follows:
Q’T2/T1≥m+n-D (4)
the total number Qn of vehicles in the current vehicle using area is called at the current starting time point, the historical average number S, the inventory amount m and the preset amount D of the vehicle using demand of the current vehicle using area in the current peak vehicle using time period are determined, and the number n of the vehicles which do not arrive corresponding to the current starting time point is determined, wherein the determination formula is as follows:
Qn≥S+D-m-n (5)
the total number Q0 of vehicles required by the turnover parking point of the current vehicle using area is determined by the historical average number S of the vehicle using demand quantity of the current vehicle using area in the current peak vehicle using time period, the inventory quantity m, the preset quantity D, the number n of the vehicles which are not reached and correspond to the current starting time point and the inventory quantity L of the turnover parking point, and the determination formula is as follows:
Q0≥S+D-m-n-δL (6)
delta is a transfer coefficient of the turnover parking point of the current vehicle area, and after the dispatching is finished, the turnover parking point of the current vehicle area still has proper vehicles to be reserved through delta adjustment;
the low-peak vehicle using area called by the vehicle is still a low-peak vehicle using area or a flat-peak vehicle using area; the vehicle area for flat peak called by the vehicle is still the vehicle area for flat peak.
As shown in fig. 2, the system for dispatching vehicles in peak time period according to the present invention comprises:
the judging unit 21 is used for judging whether each vehicle area is a peak vehicle area or not according to the historical data, the inventory and the preset quantity of each vehicle area in the peak vehicle time period;
the time determining unit 22 is configured to determine, if the current vehicle using area is a peak vehicle using area, a starting time point at which the current vehicle using area starts to call in vehicles according to a time length T1 of the current peak vehicle using time period and a scheduling time length T2 required by the current vehicle using area;
and the calculation scheduling unit 23 is configured to determine the number of vehicles to be called into the current vehicle usage area in the current peak vehicle usage time period, and call the corresponding vehicle into the current vehicle usage area at the starting time point.
Historical data of a current vehicle utilization area during peak vehicle utilization time periods comprises: calling historical average numbers of the total number of vehicles in the current vehicle using area in the current peak vehicle using time period and historical average numbers of the vehicle using demand in the current vehicle using area in the current peak vehicle using time period;
as shown in fig. 3, as a possible structure, the judging unit 21 includes:
the obtaining module 211 is used for obtaining a historical average number Q1 of the number of vehicles called to the current vehicle using area in the current peak vehicle using time period, a historical average number S of vehicle using demand of the current vehicle using area in the current peak vehicle using time period, a stock m and a predetermined amount D;
a calculating module 212, configured to calculate an evaluation coefficient δ of the current vehicle-using region;
a decision module 213 for: when delta is larger than or equal to 1, judging that the current vehicle using area is a peak vehicle using area; when delta is more than or equal to 0 and less than 1, judging that the current vehicle using area is a flat peak vehicle using area; when delta is less than 0, judging that the current vehicle using area is a low-peak vehicle using area;
the evaluation coefficient delta of the current vehicle area is calculated according to the formula:
δ＝(S+D-m)/Q1 (1)
or the evaluation coefficient delta of the current vehicle area is calculated according to the formula:
δ＝(S-m)/Q1 (2)
the determination module is specifically configured to: when delta is larger than or equal to 2, the current vehicle using area is an emergency peak vehicle using area; when 2 is larger than delta and is larger than or equal to 1, the current vehicle using area is a common peak vehicle using area.
As shown in fig. 4, as a possible structure, the unit 22 for determining time includes:
a first determining module 221, configured to: if T2 is greater than T1, determining a time point before the starting time point of the peak vehicle time period (T2-T1) as a starting time point when the current vehicle usage area starts to call in the vehicle;
a second determining module 222 for: if T2 is not more than T1, determining that the time point of starting to call the vehicle in the current vehicle using area is behind the starting time point of the peak vehicle using time period, wherein the starting time point at least comprises one;
when only one starting time point exists, determining that the starting time point is before the moment when the current vehicle using area inventory m minus a preset amount D equals to a preset value K (K is more than 0);
when more than two starting time points exist, determining that the current starting time point is before the current vehicle utilization area inventory m is added with the corresponding number n of the unreached vehicles minus a preset amount D to be equal to a preset value K;
the vehicle which does not arrive at the current starting time point is the vehicle which starts to call into the current vehicle using area but does not arrive at the current vehicle using area before the current starting time point.
As shown in fig. 5, as a possible structure, the calculation scheduling unit 23 includes: a calculation module 231 and a scheduling module 232;
as a possible structure, the calculation module 231 includes:
a first computation submodule for: when T2 is larger than T1, or T2 is smaller than or equal to T1, and only one starting time point exists, determining the total number of vehicles which are called into the current vehicle using area at the only starting time point;
a second calculation submodule for: when T2 is less than or equal to T1 and when more than two starting time points exist, determining the number of single vehicles and the total number of vehicles which are called into the current vehicle using area at each starting time point;
as one possible configuration, the scheduling module 232 includes:
the first scheduling submodule is used for setting at least one turnover parking point in a preset range from the current vehicle using area, and transferring the vehicles with the corresponding transferred vehicle number to the current vehicle using area from the turnover parking point at the starting time point;
and/or the second scheduling submodule is used for scheduling the vehicles with the corresponding number of the vehicles from the low peak vehicle utilization area to the current vehicle utilization area at the starting time point;
and/or the third scheduling submodule is used for scheduling the vehicles with the corresponding number of the vehicles from the flat peak vehicle area to the current vehicle area at the starting time point.
When T2 > T1, or T2. ltoreq.T 1 and there is only one starting point in time,
the total number Q of vehicles in the current vehicle using area is called at the unique starting time point and is determined by the historical average number S, the inventory m and the preset amount D of the vehicle using demand of the current vehicle using area in the current peak vehicle using time period, and the determination formula is as follows:
Q≥S+D-m (3)
when T2 ≦ T1 and when there are more than two startup time points,
the number Q' of single vehicles which are called into the current vehicle using area at the current starting time point is determined by the time length T1 of the current peak vehicle using time period, the dispatching time length T2 required by the current vehicle using area, the inventory m of the current vehicle using area in the current peak vehicle using time period, the preset quantity D and the number n of the non-arriving vehicles corresponding to the current starting time point, and the determination formula is as follows:
Q’T2/T1≥m+n-D (4)
the total number Qn of vehicles in the current vehicle using area is called at the current starting time point, the historical average number S, the inventory amount m and the preset amount D of the vehicle using demand of the current vehicle using area in the current peak vehicle using time period are determined, and the number n of the vehicles which do not arrive corresponding to the current starting time point is determined, wherein the determination formula is as follows:
Qn≥S+D-m-n (5)
the total number Q0 of vehicles required by the turnover parking point of the current vehicle using area is determined by the historical average number S of the vehicle using demand quantity of the current vehicle using area in the current peak vehicle using time period, the inventory quantity m, the preset quantity D, the number n of the vehicles which are not reached and correspond to the current starting time point and the inventory quantity L of the turnover parking point, and the determination formula is as follows:
Q0≥S+D-m-n-δL (6)
delta is a transfer coefficient of the turnover parking point of the current vehicle area, and after the dispatching is finished, the turnover parking point of the current vehicle area still has proper vehicles to be reserved through delta adjustment;
the low-peak vehicle using area called by the vehicle is still a low-peak vehicle using area or a flat-peak vehicle using area; the vehicle area for flat peak called by the vehicle is still the vehicle area for flat peak.
The above technical solutions of the embodiments of the present invention are described in detail below with reference to application examples:
the current peak vehicle utilization time period is assumed to be 7: 00-9: 00 in the morning of the current Monday, and the current vehicle utilization area is an area A.
Step one, judging whether the area A is a peak vehicle area:
and acquiring a historical average Q1 of the area A which is called to the area A within 7: 00-9: 00 a.m. of Monday according to the big data. Selecting continuous 30 Monday morning time of 7: 00-9: 00 as sampling time duration, and assuming that the number of vehicles called into the area A is 3000 within 7: 00-9: 00 Monday morning time of 30 continuous Monday morning time, the historical average number Q1 of the area A is 100. Here, the vehicle tuned into the area a is only a vehicle scheduled to the area a, and does not include a vehicle returned to the area a by the user.
And acquiring a historical average S of the vehicle demand of the area A in 7: 00-9: 00 in Monday morning according to the big data. And selecting continuous 30 Monday morning hours of 7: 00-9: 00 as sampling duration, and solving the historical average S of the vehicle demand of the area A in 7: 00-9: 00 Monday morning hours in the same way as the average, wherein the historical average S is assumed to be 100. In a normal case, when the historical average S of the vehicle demand and the historical average Q1 tuned into the area A are obtained, the sampling time period is the same, so that S and Q1 are matched and are data in the same period.
And acquiring a preset amount D of the area A of 7: 00-9: 00 in the morning of the current Monday according to the big data, wherein the current preset amount D is assumed to be 100.
Then, the inventory m of the area A before 7: 00-9: 00 in the morning of Monday, namely the number of vehicles which can be originally provided in the area A in the peak vehicle-using time period of 7: 00-9: 00 in the morning of Monday, is counted. Assume that the current inventory amount m of the area a is 250.
Therefore, the evaluation coefficient δ of the a region is 1.5 > 1 for the current monday morning of 7:00 to 9:00, and therefore the a region is determined to be the peak vehicle region.
The evaluation coefficient delta is calculated by the formula:
δ＝(S+D-m)/Q1 (1)
the judgment standard is as follows: when delta is larger than or equal to 1, judging that the current vehicle using area is a peak vehicle using area;
when delta is more than or equal to 0 and less than 1, judging that the current vehicle using area is a flat peak vehicle using area;
and when delta is less than 0, judging that the current vehicle using area is a low-peak vehicle using area.
Of course, the predetermined amount of the current area may not be considered when determining whether the current area is a peak-use area. Then, the evaluation coefficient δ of the current vehicle-using region is calculated by the formula:
δ＝(S-m)/Q1 (2)
the peak-use area can also be divided into an emergency peak-use area and a general peak-use area. When delta is larger than or equal to 2, the current vehicle using area is an emergency peak vehicle using area; when 2 is larger than delta and is larger than or equal to 1, the current vehicle using area is a common peak vehicle using area. If the current car using area is the emergency peak car using area, the dispatching work of the current car using area needs to be processed preferentially.
The calculation formula for the determination may have the following form:
s + D-m is less than or equal to 0, and the current vehicle using area is judged to be a low-peak vehicle using area;
s + D-m is larger than kQ1, the current vehicle using area is judged to be a peak vehicle using area, and k is larger than or equal to 1;
and S + D-m is larger than 0, and the current vehicle using area is judged to be a flat peak vehicle using area.
In the present calculation formula described above, the predetermined amount D may not be considered.
Secondly, determining a starting time point of the area A for starting to call the vehicle:
determining a starting time point needs to be discussed in two situations; when the scheduling time length T2 of the first and a-zones is greater than 2 hours (the time length T1 of the current peak vehicle time period), the scheduling time length T2 of the second and a-zones is less than or equal to 2 hours.
If T2 is more than 2h, the scheduling time is too long, and scheduling work needs to be done in advance. Assuming that T2 is 3h, T2-T1 is 1h, and the starting time point of the a area at 7:00 am to 9:00 am on the current monday is 6:00 am on the current monday. The method is characterized in that the method includes the step of starting to transfer the vehicles required for transferring in the area A to the area A from 6:00 am on the current Monday, so that the vehicles required for transferring in the area A can reach the area A before 9:00 am on the current Monday.
If T2 is less than or equal to 2h, the scheduling time is relatively short, and scheduling operation can be performed after the current peak vehicle using time period begins, so that the situation that a required vehicle is called into the area A too early can be avoided, and resource waste is avoided. Assuming that T2 is 1h, the startup time point is after 7:00 am on the current monday, and the startup time point may be more than one. In this case, if only one starting time point exists, determining that the starting time point is before the current vehicle using area inventory m minus a predetermined amount D equals to a preset value K (K is more than 0); and if more than two starting time points exist, determining that the current starting time point is before the current vehicle utilization area inventory m is added with the corresponding number n of the unreached vehicles minus a preset amount D to be equal to a preset value K. The function of K here is to ensure that the dispatching vehicles required for the a-zone can reach the a-zone before the a-zone inventory m is consumed. The vehicle which does not arrive at the current starting time point is the vehicle which starts to call into the area A but does not arrive at the area A before the current starting time point.
Thirdly, determining the number of the vehicles to be called into the area A within 7: 00-9: 00 a.m. of the current Monday:
when T2 is more than 2h, or T2 is less than or equal to 1h and only one starting time point exists, determining the total number of vehicles which are called into the area A at the only starting time point; the total number of vehicles Q, which are called into the area A at the unique starting time point, is determined by S, m and D, and the determination formula is as follows:
Q≥S+D-m (3)
therefore, Q ≧ 150 is guaranteed in this case.
When T2 is less than or equal to 2h and more than two starting time points exist, determining the number of single vehicles and the total number of vehicles which are called into the area A at each starting time point;
the number Q' of single vehicles which are called into the area A at the current starting time point is determined by T1, T2, m, D and n in the current peak vehicle time period, and the determination formula is as follows:
Q’T2/T1≥m+n-D (4)
the total number Qn of vehicles which are called into the area A at the current starting time point is determined by S, m, D and n, and the determination formula is as follows:
Qn≥S+D-m-n (5)
in this case, since the starting time points are more than one, both the total number of vehicles brought into the a-zone and the number of single vehicles are determined.
Fourthly, transferring the corresponding vehicle to the area A at the starting time point:
in the above steps, it has been determined at what point in time to start dispatching the vehicle to zone a, and also how many vehicles to call into zone a, then this step discusses where to dispatch the vehicle to zone a, divided into the following cases:
setting at least one turnover parking point in a preset range from the current vehicle using area, and transferring vehicles with corresponding vehicle transferring number to the area A from the turnover parking point at the starting time point; the scheduling efficiency is determined by the length of the scheduling time, so that the scheduling is generally followed by near scheduling, and turnover parking points are arranged around the area A, so that the scheduling time can be shortened, and vehicles which cannot be stored in the area A can be stored in a certain place, and the situation is suitable for the situation that the area of a peak vehicle area is too small.
And/or the corresponding vehicles with the number of the vehicles are called from the low peak vehicle area to the current vehicle area at the starting time point;
and/or the corresponding vehicles with the number of the vehicles are dispatched to the current vehicle utilization area from the flat peak vehicle utilization area at the starting time point;
certainly, the low-peak vehicle using area called by the vehicle is still the low-peak vehicle using area or the flat-peak vehicle using area; the vehicle area for flat peak called by the vehicle is still the vehicle area for flat peak. That is, the area where the vehicle is called cannot become the peak area.
The total number Q0 of vehicles required by the turnover parking point of the current vehicle using area is determined by the historical average number S of the vehicle using demand quantity of the current vehicle using area in the current peak vehicle using time period, the inventory quantity m, the preset quantity D, the number n of the vehicles which are not reached and correspond to the current starting time point and the inventory quantity L of the turnover parking point, and the determination formula is as follows:
Q0≥S+D-m-n-δL (6)
delta is the transfer coefficient of the turnover parking point of the current vehicle area, and the turnover parking point of the current vehicle area still has proper vehicles to be reserved after the dispatching is finished through delta adjustment.
Each turnaround parking space may provide vehicles for other nearby peak-use areas in addition to the function of providing vehicles for the current use area. In addition, if there are remaining vehicles in the case where provision of vehicles for each peak vehicle area is satisfied, the remaining vehicles may be lent by the user.
On the basis of the scheme, when the number of the called vehicles is small, namely the number of the called vehicles required in the peak-use area is small, the dispatching efficiency is high. Therefore, in order to increase the scheduling efficiency, the inventory of each vehicle area can be increased, so that the scheduling efficiency can be increased.
However, as described in the above-mentioned schemes, there are cases where the peak-load area is too small. When there are more vehicles called into the area, the area may not be stored, plus the vehicles already stored in the area. In this case, in addition to the construction of a turnaround parking spot, a stereo parking garage can be built up in the area, i.e. the area of the storage vehicles in the area is enlarged.
The embodiment of the invention also provides a system for dispatching vehicles in the peak vehicle using time period, which can realize the method embodiment provided above, and for concrete function realization, please refer to the description in the method embodiment, and no further description is given here.
In the invention, whether the current vehicle using area is a peak vehicle using area in the current peak vehicle using time period is judged firstly, because the vehicle using demand of the same vehicle using area is different in different time periods, namely, the current vehicle using area can not be ensured to belong to the peak vehicle using area (the vehicle using area with high demand) all the time; therefore, the judgment is carried out in advance, and then the vehicle dispatching is carried out according to the judgment result, so that the resource waste is avoided. And then determining the starting time point of starting to call in the vehicle in the current vehicle using area according to the time length T1 of the current peak vehicle using time period and the required dispatching time length T2 of the current vehicle using area. The starting time point of the dispatching vehicle is determined by considering T1 and T2, so that the dispatching scheme is effectively ensured to be in accordance with the current vehicle using condition, the vehicle is dispatched to the current vehicle using area at a proper time, and the vehicle is not dispatched to the current area too early or too late. Under a specific condition, the system can be divided into a plurality of starting time points, so that the dispatching efficiency is higher, and the condition that vehicles are piled up in the current vehicle using area is reduced as much as possible. After the starting time point is determined, the corresponding number of vehicles to be called (the number of vehicles to be called) is determined, so that the vehicle using requirement of the current vehicle using area can be met.
It should be understood that the specific order or hierarchy of steps in the processes disclosed is an example of exemplary approaches. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged without departing from the scope of the present disclosure. The accompanying method claims present elements of the various steps in a sample order, and are not intended to be limited to the specific order or hierarchy presented.
In the foregoing detailed description, various features are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments of the subject matter require more features than are expressly recited in each claim. Rather, as the following claims reflect, invention lies in less than all features of a single disclosed embodiment. Thus, the following claims are hereby expressly incorporated into the detailed description, with each claim standing on its own as a separate preferred embodiment of the invention.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. To those skilled in the art; various modifications to these embodiments will be readily apparent, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the disclosure. Thus, the present disclosure is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
What has been described above includes examples of one or more embodiments. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the aforementioned embodiments, but one of ordinary skill in the art may recognize that many further combinations and permutations of various embodiments are possible. Accordingly, the embodiments described herein are intended to embrace all such alterations, modifications and variations that fall within the scope of the appended claims. Furthermore, to the extent that the term "includes" is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term "comprising" as "comprising" is interpreted when employed as a transitional word in a claim. Furthermore, any use of the term "or" in the specification of the claims is intended to mean a "non-exclusive or".
Those of skill in the art will further appreciate that the various illustrative logical blocks, units, and steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate the interchangeability of hardware and software, various illustrative components, elements, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design requirements of the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present embodiments.
The various illustrative logical blocks, or elements, described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor, an Application Specific Integrated Circuit (ASIC), a field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other similar configuration.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may be stored in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. For example, a storage medium may be coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC, which may be located in a user terminal. In the alternative, the processor and the storage medium may reside in different components in a user terminal.
In one or more exemplary designs, the functions described above in connection with the embodiments of the invention may be implemented in hardware, software, firmware, or any combination of the three. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media that facilitate transfer of a computer program from one place to another. Storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, such computer-readable media can include, but is not limited to, RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to carry or store program code in the form of instructions or data structures and which can be read by a general-purpose or special-purpose computer, or a general-purpose or special-purpose processor. Additionally, any connection is properly termed a computer-readable medium, and, thus, is included if the software is transmitted from a website, server, or other remote source via a coaxial cable, fiber optic cable, twisted pair, Digital Subscriber Line (DSL), or wirelessly, e.g., infrared, radio, and microwave. Such discs (disk) and disks (disc) include compact disks, laser disks, optical disks, DVDs, floppy disks and blu-ray disks where disks usually reproduce data magnetically, while disks usually reproduce data optically with lasers. Combinations of the above may also be included in the computer-readable medium.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are merely exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (8)
1. A method of peak vehicle time slot vehicle dispatch, the method comprising:
judging whether each vehicle area is a peak vehicle area or not according to historical data, inventory and a preset amount of each vehicle area in the peak vehicle time period;
if the current vehicle using area is a peak vehicle using area, determining a starting time point of starting to call the vehicle in the current vehicle using area according to the time length T1 of the current peak vehicle using time period and the scheduling time length T2 required by the current vehicle using area;
determining the number of the vehicles to be called into the current vehicle using area in the current peak vehicle using time period, and calling the corresponding vehicles into the current vehicle using area at the starting time point;
the historical data of each vehicle area in the peak vehicle using time period comprises the following data: the historical average number of vehicles in the current vehicle using area and the historical average number of vehicle demand in the current vehicle using area in the current peak vehicle using time period are called in the current peak vehicle using time period;
the method for judging whether each vehicle area is a peak vehicle area or not according to historical data, inventory and preset quantity of each vehicle area in the peak vehicle time period specifically comprises the following steps:
acquiring a historical average number Q1 of the number of vehicles called to a current vehicle using area in a current peak vehicle using time period, a historical average number S of vehicle using demand of the current vehicle using area in the current peak vehicle using time period, a stock m and a predetermined amount D;
calculating an evaluation coefficient delta of the current vehicle area;
when delta is larger than or equal to 1, judging that the current vehicle using area is a peak vehicle using area;
when delta is more than or equal to 0 and less than 1, judging that the current vehicle using area is a flat peak vehicle using area;
when delta is less than 0, judging that the current vehicle using area is a low-peak vehicle using area;
the evaluation coefficient delta of the current vehicle area is calculated according to the formula:
δ＝(S+D-m)/Q1 (1) 。
2. the method of peak vehicular time slot vehicle dispatching of claim 1,
when the delta is larger than or equal to 1, the current vehicle using area is judged to be a peak vehicle using area, and the method specifically comprises the following steps:
when delta is larger than or equal to 2, the current vehicle using area is an emergency peak vehicle using area;
when 2 is larger than delta and is larger than or equal to 1, the current vehicle using area is a common peak vehicle using area.
3. The method for peak vehicular time period according to claim 2, wherein the determining the starting time point of the current vehicular area to start to transfer into the vehicle according to the time length T1 of the peak vehicular time period and the required scheduling time length T2 of the current vehicular area comprises:
if T2 is greater than T1, determining a time point before the starting time point of the peak vehicle time period (T2-T1) as a starting time point when the current vehicle usage area starts to call in the vehicle;
if T2 is not more than T1, determining that the time point of starting to call the vehicle in the current vehicle using area is behind the starting time point of the peak vehicle using time period, wherein the starting time point at least comprises one;
when only one starting time point exists, determining that the starting time point is before the moment when the current vehicle using area inventory m minus a preset amount D equals to a preset value K (K is more than 0);
when more than two starting time points exist, determining that the current starting time point is before the current vehicle utilization area inventory m is added with the corresponding number n of the unreached vehicles minus a preset amount D to be equal to a preset value K;
the vehicle which does not arrive at the current starting time point is the vehicle which starts to call into the current vehicle using area but does not arrive at the current vehicle using area before the current starting time point.
4. The method of peak vehicular time slot vehicle dispatching of claim 3,
the determining the number of the vehicles called into the current vehicle using area in the current peak vehicle using time period specifically comprises the following steps:
when T2 is larger than T1, or T2 is smaller than or equal to T1, and only one starting time point exists, determining the total number of vehicles which are called into the current vehicle using area at the only starting time point;
when T2 is less than or equal to T1 and when more than two starting time points exist, determining the number of single vehicles and the total number of vehicles which are called into the current vehicle using area at each starting time point;
the transferring the corresponding vehicle to the current vehicle using area at the starting time point specifically includes:
setting at least one turnover parking point in a preset range from a current vehicle using area, and transferring vehicles with corresponding vehicle transferring numbers to the current vehicle using area from the turnover parking point at a starting time point;
and/or the corresponding vehicles with the number of the vehicles are called from the low peak vehicle area to the current vehicle area at the starting time point;
and/or the corresponding vehicles with the number of the vehicles are called from the flat peak vehicle area to the current vehicle area at the starting time point.
5. A system for peak vehicular time slot vehicle dispatch, the system comprising:
the judging unit is used for judging whether each vehicle area is a peak vehicle area or not according to historical data, inventory and a preset amount of each vehicle area in the peak vehicle time period;
the time determining unit is used for determining a starting time point of starting to call in the vehicle in the current vehicle using area according to the time length T1 of the current peak vehicle using time period and the scheduling time length T2 required by the current vehicle using area if the current vehicle using area is the peak vehicle using area;
the calculation scheduling unit is used for determining the number of the vehicles to be called into the current vehicle using area in the current peak vehicle using time period and calling the corresponding vehicles into the current vehicle using area at the starting time point;
the historical data of each vehicle area in the peak vehicle using time period comprises the following data: the historical average number of vehicles in the current vehicle using area and the historical average number of vehicle demand in the current vehicle using area in the current peak vehicle using time period are called in the current peak vehicle using time period;
the judging unit includes:
the acquisition module is used for acquiring the historical average number Q1 of the number of vehicles called to the current vehicle utilization area in the current peak vehicle utilization time period, the historical average number S of the vehicle utilization demand of the current vehicle utilization area in the current peak vehicle utilization time period, the inventory m and the preset amount D;
the calculation module is used for calculating the evaluation coefficient delta of the current vehicle area;
a determination module to: when delta is larger than or equal to 1, judging that the current vehicle using area is a peak vehicle using area; when delta is more than or equal to 0 and less than 1, judging that the current vehicle using area is a flat peak vehicle using area; when delta is less than 0, judging that the current vehicle using area is a low-peak vehicle using area;
the evaluation coefficient delta of the current vehicle area is calculated according to the formula:
δ＝(S+D-m)/Q1 (1) 。
6. the peak vehicular time period vehicle dispatching system of claim 5,
the determination module is specifically configured to: when delta is larger than or equal to 2, the current vehicle using area is an emergency peak vehicle using area; when 2 is larger than delta and is larger than or equal to 1, the current vehicle using area is a common peak vehicle using area.
7. The peak hour vehicle dispatching system of claim 6, wherein the determining a time unit comprises:
a first determination module to: if T2 is greater than T1, determining a time point before the starting time point of the peak vehicle time period (T2-T1) as a starting time point when the current vehicle usage area starts to call in the vehicle;
a second determination module to: if T2 is not more than T1, determining that the time point of starting to call the vehicle in the current vehicle using area is behind the starting time point of the peak vehicle using time period, wherein the starting time point at least comprises one;
when only one starting time point exists, determining that the starting time point is before the moment when the current vehicle using area inventory m minus a preset amount D equals to a preset value K (K is more than 0);
when more than two starting time points exist, determining that the current starting time point is before the current vehicle utilization area inventory m is added with the corresponding number n of the unreached vehicles minus a preset amount D to be equal to a preset value K;
the vehicle which does not arrive at the current starting time point is the vehicle which starts to call into the current vehicle using area but does not arrive at the current vehicle using area before the current starting time point.
8. The peak hour vehicle dispatching system of claim 6,
the calculation scheduling unit comprises: a calculation module and a scheduling module;
the calculation module comprises:
a first computation submodule for: when T2 is larger than T1, or T2 is smaller than or equal to T1, and only one starting time point exists, determining the total number of vehicles which are called into the current vehicle using area at the only starting time point;
a second calculation submodule for: when T2 is less than or equal to T1 and when more than two starting time points exist, determining the number of single vehicles and the total number of vehicles which are called into the current vehicle using area at each starting time point;
the scheduling module includes:
the first scheduling submodule is used for setting at least one turnover parking point in a preset range from the current vehicle using area, and transferring the vehicles with the corresponding transferred vehicle number to the current vehicle using area from the turnover parking point at the starting time point;
and/or the second scheduling submodule is used for scheduling the vehicles with the corresponding number of the vehicles from the low peak vehicle utilization area to the current vehicle utilization area at the starting time point;
and/or the third scheduling submodule is used for scheduling the vehicles with the corresponding number of the vehicles from the flat peak vehicle area to the current vehicle area at the starting time point.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911374499.1A CN110930687B (en) | 2017-12-18 | 2017-12-18 | Method and system for dispatching vehicles in peak vehicle time period |
| CN201711365180.3A CN108062855B (en) | 2017-12-18 | 2017-12-18 | Method and system for dispatching vehicles in peak vehicle time period |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711365180.3A CN108062855B (en) | 2017-12-18 | 2017-12-18 | Method and system for dispatching vehicles in peak vehicle time period |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911374499.1A Division CN110930687B (en) | 2017-12-18 | 2017-12-18 | Method and system for dispatching vehicles in peak vehicle time period |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108062855A CN108062855A (en) | 2018-05-22 |
| CN108062855B true CN108062855B (en) | 2020-03-10 |
Family
ID=62139399
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711365180.3A Active CN108062855B (en) | 2017-12-18 | 2017-12-18 | Method and system for dispatching vehicles in peak vehicle time period |
| CN201911374499.1A Active CN110930687B (en) | 2017-12-18 | 2017-12-18 | Method and system for dispatching vehicles in peak vehicle time period |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911374499.1A Active CN110930687B (en) | 2017-12-18 | 2017-12-18 | Method and system for dispatching vehicles in peak vehicle time period |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN108062855B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110796323A (en) * | 2018-08-03 | 2020-02-14 | 北京嘀嘀无限科技发展有限公司 | Vehicle scheduling method, device, terminal and computer readable storage medium |
| CN110046719A (en) * | 2019-03-20 | 2019-07-23 | 北京物资学院 | A kind of bicycle method for diagnosing status and device |
| EP3772729B1 (en) * | 2019-08-08 | 2022-08-31 | Ningbo Geely Automobile Research & Development Co. Ltd. | A method for preconditioning vehicles |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104540706A (en) * | 2012-02-13 | 2015-04-22 | 埃森哲环球服务有限公司 | Electric vehicle distributed intelligence |
| CN105426997A (en) * | 2015-11-18 | 2016-03-23 | 西南交通大学 | Intelligent dispatching and application management system of urban public bicycles and implementation method thereof |
| CN105551150A (en) * | 2016-02-03 | 2016-05-04 | 江西师范大学 | Internet and intelligent public bicycle traffic management system and reservation scheduling method |
| CN105719019A (en) * | 2016-01-21 | 2016-06-29 | 华南理工大学 | Public bicycle peak time demand prediction method considering user reservation data |
| CN106156866A (en) * | 2016-07-01 | 2016-11-23 | 宁波轩悦行电动汽车服务有限公司 | Hire a car control system and method in a kind of strange land |
| CN106875674A (en) * | 2017-04-14 | 2017-06-20 | 上海雷腾软件股份有限公司 | A kind of method and apparatus for vehicle scheduling |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103729724B (en) * | 2013-12-06 | 2017-02-08 | 浙江工业大学 | Natural-mixing scheduling method of public bike system |
| CN104574679B (en) * | 2014-10-11 | 2018-07-06 | 浙江致晟信息科技有限公司 | A kind of public scheduling for renting bicycle system and guidance method |
| US9869257B2 (en) * | 2015-08-19 | 2018-01-16 | General Electric Company | System and method for predicting peak pressure values using knock sensor |
| CN106952414A (en) * | 2016-01-07 | 2017-07-14 | 覃鹏 | One kind is directed to peak period public bicycles lease point addressing layout method |
| CN105719083A (en) * | 2016-01-21 | 2016-06-29 | 华南理工大学 | Public bicycle peak time scheduling method based on multilevel partition |
| US10008121B2 (en) * | 2016-05-02 | 2018-06-26 | Conduent Business Services, Llc | Method and system for managing a dispatch of vehicles |
| CN106503869A (en) * | 2016-11-14 | 2017-03-15 | 东南大学 | A kind of public bicycles dynamic dispatching method that is predicted based on website short-term needs |
| CN107330586A (en) * | 2017-06-16 | 2017-11-07 | 东南大学 | A kind of public bicycles dynamic dispatching method based on improvement ant group algorithm |
-
2017
- 2017-12-18 CN CN201711365180.3A patent/CN108062855B/en active Active
- 2017-12-18 CN CN201911374499.1A patent/CN110930687B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104540706A (en) * | 2012-02-13 | 2015-04-22 | 埃森哲环球服务有限公司 | Electric vehicle distributed intelligence |
| CN105426997A (en) * | 2015-11-18 | 2016-03-23 | 西南交通大学 | Intelligent dispatching and application management system of urban public bicycles and implementation method thereof |
| CN105719019A (en) * | 2016-01-21 | 2016-06-29 | 华南理工大学 | Public bicycle peak time demand prediction method considering user reservation data |
| CN105551150A (en) * | 2016-02-03 | 2016-05-04 | 江西师范大学 | Internet and intelligent public bicycle traffic management system and reservation scheduling method |
| CN106156866A (en) * | 2016-07-01 | 2016-11-23 | 宁波轩悦行电动汽车服务有限公司 | Hire a car control system and method in a kind of strange land |
| CN106875674A (en) * | 2017-04-14 | 2017-06-20 | 上海雷腾软件股份有限公司 | A kind of method and apparatus for vehicle scheduling |
Non-Patent Citations (3)
| Title |
|---|
| 基于GPS/GIS协同的动态车辆调度和路径规划问题研究;冯亮；梁工谦;《计算机科学》;20170915;第44卷(第9期);全文 * |
| 基于时空分析的共享单车调度模型;陶永虎 陈辉浩 杨壮;《中国战略新兴产业》;20170928(第36期);全文 * |
| 突发灾害事件情景下应急救援车辆调度问题综述;王付宇；王涛；叶春明;《计算机应用研究》;20171031;第34卷(第10期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110930687A (en) | 2020-03-27 |
| CN110930687B (en) | 2020-12-25 |
| CN108062855A (en) | 2018-05-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108062855B (en) | Method and system for dispatching vehicles in peak vehicle time period | |
| JP6245563B2 (en) | Car sharing management device, car sharing management method, and program | |
| CN106971604B (en) | Parking space resource allocation method and device | |
| CN107170278A (en) | A kind of shared method in parking stall and server | |
| US10032377B2 (en) | Parking space management | |
| CN105489001A (en) | Taxi scheduling optimization method and system | |
| CN110378519B (en) | Method and device for configuring number of vehicles at public bicycle station | |
| CN113610321A (en) | Shared vehicle scheduling method and device for parking points and computer equipment | |
| CN111553699B (en) | Resource scheduling method and device | |
| US20190266531A1 (en) | Vehicle management device and vehicle management method | |
| US11505080B2 (en) | Controlling transfer of data | |
| CN106382036B (en) | A kind of parking management method, system and terminal | |
| CN114333094A (en) | Vehicle scheduling method and device, terminal equipment and medium | |
| CN111815937B (en) | Control method and device for dispatching of super-parking vehicles, storage medium and electronic equipment | |
| CN113095549A (en) | Electric vehicle charging pile recommendation method and device, electronic equipment and storage medium | |
| CN108985476A (en) | A kind of personal identification method and device | |
| CN110930758A (en) | Parking method, system, device and storage medium | |
| CN104615382A (en) | Memory space scheduling method and multi-system terminal | |
| CN103021168B (en) | Method and system for scheduling control processing | |
| KR102086122B1 (en) | Taxi reservation method and device based on schedule | |
| CN103021170B (en) | Information interaction method and system | |
| JP5510390B2 (en) | Communication device and message transmission control method | |
| CN111523723A (en) | Method and device for optimal configuration of vehicles at public bicycle station | |
| TWI841840B (en) | Method and system for resource selection | |
| CN103035120B (en) | Dispatch control method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |