CN114333094A - Vehicle scheduling method and device, terminal equipment and medium - Google Patents
Vehicle scheduling method and device, terminal equipment and medium Download PDFInfo
- Publication number
- CN114333094A CN114333094A CN202111659478.1A CN202111659478A CN114333094A CN 114333094 A CN114333094 A CN 114333094A CN 202111659478 A CN202111659478 A CN 202111659478A CN 114333094 A CN114333094 A CN 114333094A
- Authority
- CN
- China
- Prior art keywords
- parking
- vehicle
- time
- time period
- spot
- 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
Images
Landscapes
- Traffic Control Systems (AREA)
Abstract
The embodiment of the invention discloses a vehicle scheduling method, a vehicle scheduling device, terminal equipment and a medium. The vehicle scheduling method is applied to a server and comprises the following steps: responding to a locking request of a first vehicle, and acquiring the current position and locking time of the first vehicle; judging whether the first vehicle is in a parking spot or not according to the current position of the first vehicle; if the first vehicle is in the parking spot, acquiring a current parking time period corresponding to the locking time, and determining a parking time length threshold corresponding to the current parking time period; determining all second vehicles with the locking time within the current parking time period in the parking spot, and monitoring the parking time of each second vehicle; and determining whether to send first scheduling information corresponding to the parking points to the management terminal or not according to the parking time of each second vehicle and the parking time threshold. The long-time idling of the parked vehicles is avoided, and the situation that the vehicles in the parking spots are dispatched to other areas due to the fact that the parking time is too long is avoided, so that the vehicle using requirements of users cannot be met.
Description
Technical Field
The present invention relates to the field of vehicle management, and in particular, to a vehicle scheduling method, apparatus, terminal device, and medium.
Background
With the development of internet technology and vehicle control technology, sharing vehicles is an important travel mode. In order to improve the utilization rate of shared vehicles and avoid the vehicles from being parked at the same position for a long time. The manager who shares the vehicle will usually set up a length of time threshold for every vehicle, when the length of time of parking exceeds length of time threshold, the suggestion managers with the vehicle dispatch to the region that the car demand is high.
However, when using the shared vehicle in the parking spot, the user gives priority to the vehicle close to his/her own position, and does not consider the time period for which the vehicle has been parked in the parking spot. Scheduling vehicles according to their parking duration may result in vehicles in the parking spot being scheduled to other areas because the parking duration exceeds a duration threshold before a user requests use of the vehicle parked in the parking spot. When no available vehicle exists in the parking spot nearest to the user, part of the users will give up using the shared vehicle, and the utilization rate of the vehicle is reduced.
Disclosure of Invention
In view of the defects in the prior art, embodiments of the present application provide a vehicle scheduling method, apparatus, terminal device and medium to solve the problem that the location scheduling of a shared vehicle is not reasonable.
In a first aspect, an embodiment of the present application provides a vehicle scheduling method, which is applied to a server, and the vehicle scheduling method includes:
responding to a locking request of a first vehicle, and acquiring the current position and locking time of the first vehicle;
judging whether the first vehicle is in a parking spot or not according to the current position of the first vehicle;
if the first vehicle is in a parking spot, acquiring a current parking time period corresponding to the locking time, and determining a parking time length threshold corresponding to the current parking time period by the parking spot;
determining all second vehicles with the locking time within the current parking time period in the parking spot, and monitoring the parking time of each second vehicle;
and determining whether to send first scheduling information corresponding to the parking points to a management terminal according to the parking time of each second vehicle and the parking time threshold.
And dispatching the vehicles in the parking spots according to the set parking time threshold value of the parking spots. The long-time idle of the vehicle is avoided, and the situation that the vehicle in the parking spot is dispatched to other areas due to the fact that the parking time is too long is avoided, so that the vehicle using requirements of users cannot be met.
With reference to the first aspect, in a first possible implementation manner, the determining, according to the parking time length of each second vehicle and the parking time length threshold, whether to send first scheduling information corresponding to the parking point to a management terminal includes:
if the second vehicles with the parking duration larger than the parking duration threshold exist, determining the number of the second vehicles with the parking duration larger than the parking duration threshold, and sending first scheduling information corresponding to the parking points to a management terminal, wherein the first scheduling information comprises the number of the second vehicles which are required to be scheduled.
And vehicles in the parking spots are dispatched according to the number of the second vehicles, so that the vehicles in the parking spots are prevented from being dispatched to other positions in advance on the basis of improving the vehicle utilization rate, and no available vehicle exists in the nearest parking spot when a user wants to use the vehicle.
With reference to the first aspect, in a second possible implementation manner, after determining whether to send first scheduling information corresponding to the parking spot to a management terminal according to the parking duration of each second vehicle and the parking duration threshold, the method further includes:
and if the first vehicle is not scheduled and the parking time of the first vehicle is greater than a first time threshold, sending second scheduling information corresponding to the first vehicle to a management terminal, wherein the first time threshold is greater than the parking time threshold.
If the first vehicle is not scheduled and the parking time of the first vehicle is longer than the first time threshold, determining that the vehicle is parked in a parking spot for a long time, sending second scheduling information corresponding to the first vehicle to the management terminal, and prompting a manager to check the first vehicle so as to avoid the first vehicle from being idle due to faults and improve the vehicle utilization rate.
With reference to the first aspect, in a third possible implementation manner, after determining whether the first vehicle is located within a parking spot according to the current position of the first vehicle, the method further includes:
and if the first vehicle is not in the parking spot and the parking time of the first vehicle is greater than a second time threshold, sending third scheduling information corresponding to the first vehicle to a management terminal.
And for the vehicles which are not parked in the parking spot, detecting whether the parking time of the vehicles is greater than a second time threshold value or not, and scheduling the vehicles with the parking time greater than the second time threshold value so as to avoid the vehicles from being idle due to remote parking positions, faults and other reasons.
With reference to the first aspect, in a fourth possible implementation manner, the method further includes:
setting parking time thresholds of the parking spots according to the vehicle parking data of the parking spots in historical time, and determining different parking time thresholds of the parking spots according to the actual operation condition of each parking spot, wherein the vehicle parking data comprises vehicle locking time, parking time, vehicle turnover rate and vehicle polymerization degree in the parking spots.
The actual operating conditions of each parking spot are different, and the recorded vehicle parking data in the historical time of each parking spot are also different. And obtaining the parking time length threshold value according with the actual condition of the parking point according to the vehicle parking data of each parking point in the historical time. Different parking spots set different parking duration thresholds to determine whether the vehicle is parked within the parking spot for an extended period of time.
With reference to the fourth possible implementation manner of the first aspect, in a fifth possible implementation manner, the setting a parking duration threshold of the parking spot according to the vehicle parking data of the parking spot in a historical time period includes:
acquiring historical parking time period corresponding to the current parking time period and weather information of the current parking time period;
and setting a parking time length threshold corresponding to the current parking time period by the parking point according to the weather information of the historical parking time period, the weather information of the current parking time period and the vehicle parking data of the historical parking time period so as to determine the parking time length threshold corresponding to the current parking time period by different parking points.
According to the vehicle parking data of the parking spot in the historical time, the parking time length threshold value which is in accordance with the actual situation of the parking spot is obtained, so that the influence on normal vehicle use of a user due to the fact that the parking time length threshold value is too long or too short is avoided.
With reference to the first aspect, in a sixth possible implementation manner, after the obtaining a parking time period corresponding to the locking time and determining a parking time period threshold corresponding to the parking point in the parking time period if the first vehicle is located in the parking point, the method further includes:
and if the parking time length threshold value does not exist in the parking spot and the parking time length of the first vehicle is greater than a third time length threshold value, sending fourth scheduling information corresponding to the first vehicle to a management terminal.
For a recently set parking spot, the vehicle parking data which can be collected is insufficient, and the parking time threshold value cannot be set according to the actual vehicle supply requirement of the parking spot. And detecting whether the parking time of the vehicle is greater than a third time threshold value or not, and scheduling the vehicle with the parking time greater than the third time threshold value so as to avoid the idle state of the vehicle due to reasons such as faults and the like.
In a second aspect, an embodiment of the present application provides a vehicle scheduling apparatus, which is applied to a server, and includes:
the response module is used for responding to a locking request of a first vehicle and acquiring the current position and locking time of the first vehicle;
the parking spot judging module is used for judging whether the first vehicle is in a parking spot or not according to the current position of the first vehicle;
the time period acquisition module is used for acquiring a current parking time period corresponding to the locking time if the first vehicle is in a parking spot, and determining a parking time period threshold corresponding to the current parking time period by the parking spot;
the parking duration determining module is used for determining all second vehicles with the locking time within the current parking time period in the parking spot and monitoring the parking duration of each second vehicle;
and the scheduling information determining module is used for determining whether to send first scheduling information corresponding to the parking points to a management terminal according to the parking time of each second vehicle and the parking time threshold.
In a third aspect, an embodiment of the present application provides a computer device, including a processor and a memory, where the memory stores a program or instructions, and the program or instructions are executed by the processor to make the computer device execute the steps of the vehicle scheduling method.
In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium having stored thereon a program or instructions, which when executed by a processor, implement the steps of the vehicle scheduling method described above.
Drawings
In order to more clearly illustrate the technical solution of the present invention, the drawings required to be used in the embodiments will be briefly described below, and it should be understood that the following drawings only illustrate some embodiments of the present invention, and therefore should not be considered as limiting the scope of the present invention. Like components are numbered similarly in the various figures.
Fig. 1 is a flowchart illustrating a vehicle scheduling method according to embodiment 1 of the present invention;
fig. 2 shows another flowchart of a vehicle dispatching method provided in embodiment 1 of the present invention;
fig. 3 is a schematic structural diagram illustrating a vehicle dispatching device provided in embodiment 2 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.
The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present invention without making any creative effort, shall fall within the protection scope of the present invention.
Hereinafter, the terms "including", "having", and their derivatives, which may be used in various embodiments of the present invention, are only intended to indicate specific features, numbers, steps, operations, elements, components, or combinations of the foregoing, and should not be construed as first excluding the existence of, or adding to, one or more other features, numbers, steps, operations, elements, components, or combinations of the foregoing.
Furthermore, the terms "first," "second," "third," and the like are used solely to distinguish one from another and are not to be construed as indicating or implying relative importance.
Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which various embodiments of the present invention belong. The terms (such as those defined in commonly used dictionaries) should be interpreted as having a meaning that is consistent with their contextual meaning in the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein in various embodiments of the present invention.
Example 1
Referring to fig. 1, fig. 1 is a flowchart illustrating a vehicle dispatching method according to embodiment 1 of the present invention. The vehicle dispatching method in fig. 1 is applied to a server and comprises the following steps:
And arranging a positioning device on the vehicle, and establishing communication connection between the server and the positioning device. When the server receives a locking request for the first vehicle, the server acquires locking time and the current position of the vehicle sent by the positioning device.
And step 120, judging whether the first vehicle is in a parking spot or not according to the current position of the first vehicle.
Specifically, a parking spot closest to the current position of the first vehicle is acquired, and an electronic fence range of the parking spot is acquired. And judging whether the current position of the first vehicle is within the electronic fence range of the parking spot, and if the current position of the first vehicle is within the electronic fence range of the parking spot, determining that the first vehicle is within the parking spot. And if the current position of the first vehicle is not within the range of the electronic fence of the parking spot, determining that the first vehicle is not in the parking spot.
The parking time threshold for a parking spot is used to represent the maximum parking time for which the vehicle is parked. If the supply and demand balance of the vehicles is realized at the parking point, namely the number of the vehicles parked in the parking point is the same as that of the vehicles driven out of the parking point, the vehicles can be driven out of the parking point before the parking time length reaches the threshold value of the parking time length.
Specifically, for the convenience of understanding of the present application, it is assumed that the parking time period threshold values of all the parking time periods are 8 hours, and 24 parking time periods are set corresponding to 24 time integral points of a day. If the locking time of the first vehicle is 8: 40, determining that the current parking time period is a 8 o 'clock to 9 o' clock parking time period, and determining that the monitored first vehicle should be stopped at 17: and moving out of the parking spot before 00. Similarly, if the locking time of the first vehicle is 7: 10, determining that the current parking time period is a 7 o 'clock to 8 o' clock parking time period, and determining that the monitored first vehicle should be at 16: and moving out of the parking spot before 00.
As an example, the method further comprises:
setting parking time thresholds of the parking spots according to vehicle parking data of the parking spots in historical time so as to determine different parking time thresholds of the parking spots according to actual operation conditions of each parking spot, wherein the vehicle parking data comprise locking time of vehicles in the parking spots, parking time of the vehicles, vehicle turnover rate and vehicle polymerization degree.
It is to be understood that the degree of polymerization of the vehicle indicates the number of parked vehicles per unit area. The vehicle turnover rate refers to the number of vehicles that are parked in all parking positions in a parking spot on average in a fixed time. The more frequent the vehicle is parked and driven out of the parking spot, the higher the vehicle turnover rate. The parking point with higher vehicle turnover rate has lower average parking time length when the vehicle is parked in the parking point, and the parking point with lower vehicle turnover rate has higher average parking time length when the vehicle is parked in the parking point.
The actual operating conditions of each parking spot are different, and the recorded vehicle parking data in the historical time of each parking spot are also different. And predicting the predicted parking time after each vehicle is parked to the parking spot according to the vehicle parking data of the parking spot in the historical time, and setting the parking time threshold of the parking spot according to the predicted parking time. And obtaining a parking time threshold value according with the actual condition of the parking point according to the vehicle parking data of the parking point in the historical time. Different parking spots set different parking duration thresholds to determine whether the vehicle is parked within the parking spot for an extended period of time.
In an optional example, the setting of the parking duration threshold for the parking spot according to the vehicle parking data of the parking spot in the historical time period includes:
acquiring historical parking time period corresponding to the current parking time period and weather information of the current parking time period;
and setting a parking time length threshold corresponding to the current parking time period by the parking point according to the weather information of the historical parking time period, the weather information of the current parking time period and the vehicle parking data of the historical parking time period so as to determine the parking time length threshold corresponding to the current parking time period by different parking points.
It is understood that both weather and current parking time affect how long a vehicle is parked in a park. For example, if the current weather is rainy, the parking time of the vehicle is long. Whether the parking time period is a working day time period, the weather of an area, the turnover ratio of vehicles in a parking spot and the degree of polymerization of the vehicles are constraints, the locking time and the parking time of the vehicles in the historical parking time period are input samples, the parking time threshold value of the parking spot is output, and a parking time model of the parking spot is created. According to the vehicle parking data of the parking spot in the historical time, the parking time length threshold value which is in accordance with the actual situation of the parking spot is obtained, so that the influence on normal vehicle use of a user due to the fact that the parking time length threshold value is too long or too short is avoided.
For example, assume that 2 vehicles have been parked to a parking spot within a parking spot time period of 8 to 9 spots. The first vehicle is at 8: 40 park to a parking spot and update the first vehicle to a second vehicle. At this time, the server updates that 3 vehicles park to the parking spot within the parking spot time period from 8 to 9 spots, and monitors the parking time length of 3 second vehicles in real time.
And 150, determining whether to send first scheduling information corresponding to the parking points to a management terminal according to the parking time of each second vehicle and the parking time threshold.
And judging whether idle vehicles exist in the parking spot or not according to the parking time of each second vehicle and the threshold value of the parking time. And when an idle vehicle exists, sending first scheduling information corresponding to the parking point to the management terminal.
As an example, the determining whether to send the first scheduling information corresponding to the parking spot to the management terminal according to the parking time of each second vehicle and the parking time threshold includes:
if the second vehicles with the parking duration larger than the parking duration threshold exist, determining the number of the second vehicles with the parking duration larger than the parking duration threshold, and sending first scheduling information corresponding to the parking points to a management terminal, wherein the first scheduling information comprises the number of the second vehicles which are required to be scheduled.
It should be understood that, during the actual use of the vehicle, the user does not actively select to request unlocking of the vehicle according to the sequence of the parking time lengths of the vehicles in the parking spot. And when the idle vehicles exist, sending first scheduling information to the management terminal according to the number of the idle vehicles. Compared with the method for directly scheduling the vehicles parked for a long time, the method and the device for scheduling the vehicles in the parking spots schedule the vehicles in the parking spots according to the number of the second vehicles, and avoid the situation that the vehicles in the parking spots are scheduled to other positions in advance on the basis of improving the vehicle utilization rate, so that when a user wants to use the vehicles, no vehicles which can be used are arranged in the nearest parking spots.
For example, according to the vehicle parking data of the historical parking time period, it is obtained that 2 vehicles are usually parked in the parking spot in the 8-9-spot parking time period, and the parking time threshold is 8 hours. If the parking spot achieves vehicle balance of supply and demand, then 2 vehicles will be at 17:00 was previously requested by the user to unlock and move out of the parking spot. Assuming that 5 vehicles park in the parking spot in the current 8-9 parking spot time period, according to the supply and demand relationship of the parking spot, when the time reaches 17:00, the parking time of 3 vehicles is greater than the parking time threshold of 8 hours. And sending first scheduling information for scheduling 3 vehicles to a management terminal, and prompting a manager to schedule any 3 vehicles in the parking spot to other positions.
As an example, after determining whether to send the first scheduling information corresponding to the parking spot to the management terminal according to the parking duration of each second vehicle and the parking duration threshold, the method further includes:
and if the first vehicle is not scheduled and the parking time of the first vehicle is greater than a first time threshold, sending second scheduling information corresponding to the first vehicle to a management terminal, wherein the first time threshold is greater than the parking time threshold.
It should be understood that the first duration threshold is set according to actual requirements, and is not limited herein. If the first vehicle is not scheduled and the parking time of the first vehicle is longer than the first time threshold, determining that the vehicle is parked in a parking spot for a long time, sending second scheduling information corresponding to the first vehicle to the management terminal, and prompting a manager to check the first vehicle so as to avoid the first vehicle from being idle due to faults and improve the vehicle utilization rate.
Referring to fig. 2, fig. 2 is a flowchart illustrating another vehicle scheduling method according to embodiment 1 of the present invention, which includes, as an example, after determining whether the first vehicle is located in a parking spot according to the current position of the first vehicle:
It should be understood that the second time threshold is set according to actual requirements, and is not limited herein. And for the vehicles which are not parked in the parking spot, detecting whether the parking time of the vehicles is greater than a second time threshold value or not, and scheduling the vehicles with the parking time greater than the second time threshold value so as to avoid the vehicles from being idle due to remote parking positions, faults and other reasons.
As an example, after acquiring a parking time period corresponding to the locking time and determining a parking time period threshold corresponding to the parking time period corresponding to the parking point if the first vehicle is located in the parking point, the method further includes:
and if the parking time length threshold value does not exist in the parking spot and the parking time length of the first vehicle is greater than a third time length threshold value, sending fourth scheduling information corresponding to the first vehicle to a management terminal.
It should be understood that the third duration threshold is set according to actual requirements, and the third duration threshold may be the same as the second duration threshold, which is not limited herein. The parking duration threshold for a parking spot is typically set based on vehicle parking data for the parking spot over the past days. For a recently set parking spot, the vehicle parking data which can be collected is insufficient, and the parking time threshold value cannot be set according to the actual vehicle supply requirement of the parking spot. And detecting whether the parking time of the vehicle is greater than a third time threshold value or not, and scheduling the vehicle with the parking time greater than the third time threshold value so as to avoid the idle state of the vehicle due to reasons such as faults and the like.
The application provides a vehicle scheduling method, which is applied to a server and comprises the following steps: responding to a locking request of a first vehicle, and acquiring the current position and locking time of the first vehicle; judging whether the first vehicle is in a parking spot or not according to the current position of the first vehicle; if the first vehicle is in a parking spot, acquiring a current parking time period corresponding to the locking time, and determining a parking time length threshold corresponding to the current parking time period by the parking spot; determining all second vehicles with the locking time within the current parking time period in the parking spot, and monitoring the parking time of each second vehicle; and determining whether to send first scheduling information corresponding to the parking points to a management terminal according to the parking time of each second vehicle and the parking time threshold. And dispatching the vehicles in the parking spots according to the set parking time threshold value of the parking spots. The long-time idle of the vehicle is avoided, and the situation that the vehicle in the parking spot is dispatched to other areas due to the fact that the parking time is too long is avoided, so that the vehicle using requirements of users cannot be met.
Example 2
Referring to fig. 3, fig. 3 is a schematic structural diagram illustrating a vehicle dispatching device according to embodiment 2 of the present invention, and the vehicle dispatching device 200 in fig. 3 includes:
a response module 210, configured to respond to a locking request for a first vehicle, and obtain a current location and a locking time of the first vehicle;
a stopping point determining module 220, configured to determine whether the first vehicle is in a stopping point according to the current position of the first vehicle;
a time period obtaining module 230, configured to obtain a current parking time period corresponding to the locking time if the first vehicle is located in a parking spot, and determine a parking time period threshold corresponding to the current parking time period for the parking spot;
the parking duration determining module 240 is configured to determine all second vehicles in the parking spot, which have locking time within the current parking time period, and monitor the parking duration of each second vehicle;
and the scheduling information determining module 250 is configured to determine whether to send the first scheduling information corresponding to the parking spot to the management terminal according to the parking time of each second vehicle and the parking time threshold.
As an example, the scheduling information determining module 250 is further configured to determine, if there is a second vehicle with the parking duration being greater than the parking duration threshold, the number of the second vehicles with the parking duration being greater than the parking duration threshold, and send first scheduling information corresponding to the parking spot to a management terminal, where the first scheduling information includes the number of the second vehicles requesting scheduling.
As an example, the vehicle scheduling apparatus 200 further includes:
the second scheduling module is configured to send second scheduling information corresponding to the first vehicle to a management terminal if the first vehicle is not scheduled and the parking duration of the first vehicle is greater than a first duration threshold, where the first duration threshold is greater than the parking duration threshold.
As an example, the vehicle scheduling apparatus 200 further includes:
and the third scheduling module is used for sending third scheduling information corresponding to the first vehicle to the management terminal if the first vehicle is not in the parking spot and the parking time of the first vehicle is greater than a second time threshold.
As an example, the vehicle scheduling apparatus 200 further includes:
the threshold setting module is used for setting the parking time threshold of the parking points according to the vehicle parking data of the parking points in historical time so as to determine different parking time thresholds of the parking points according to the actual running condition of each parking point, wherein the vehicle parking data comprise the locking time, the parking time, the turnover rate and the polymerization degree of the vehicle in the parking points.
As an example, the threshold setting module is further configured to obtain a historical parking time period corresponding to a current parking time period and weather information of the current parking time period;
and setting a parking time length threshold corresponding to the current parking time period by the parking point according to the weather information of the historical parking time period, the weather information of the current parking time period and the vehicle parking data of the historical parking time period so as to determine the parking time length threshold corresponding to the current parking time period by different parking points.
As an example, the vehicle scheduling apparatus 200 further includes:
and the fourth scheduling module is used for sending fourth scheduling information corresponding to the first vehicle to the management terminal if the parking spot does not have the parking time threshold and the parking time of the first vehicle is greater than the third time threshold.
The vehicle dispatching device 200 is configured to execute corresponding steps in the vehicle dispatching method, and specific implementation of each function is not described one by one here. The alternative example in embodiment 1 is also applied to the vehicle scheduling device 200 in embodiment 2.
The embodiment of the application also provides a computer device, which comprises a processor and a memory, wherein the memory is stored with a program or an instruction, and the program or the instruction is executed by the processor, so that the computer device executes the vehicle dispatching method.
The embodiment of the present application further provides a computer-readable storage medium, wherein a program or an instruction is stored on the computer-readable storage medium, and the program or the instruction is executed by a processor to implement the vehicle scheduling method.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other ways. The apparatus embodiments described above are merely illustrative and, for example, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, each functional module or unit in each embodiment of the present invention may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention or a part of the technical solution that contributes to the prior art in essence can be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a smart phone, a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention.
Claims (10)
1. A vehicle scheduling method is applied to a server, and comprises the following steps:
responding to a locking request of a first vehicle, and acquiring the current position and locking time of the first vehicle;
judging whether the first vehicle is in a parking spot or not according to the current position of the first vehicle;
if the first vehicle is in a parking spot, acquiring a current parking time period corresponding to the locking time, and determining a parking time length threshold corresponding to the current parking time period by the parking spot;
determining all second vehicles with the locking time within the current parking time period in the parking spot, and monitoring the parking time of each second vehicle;
and determining whether to send first scheduling information corresponding to the parking points to a management terminal according to the parking time of each second vehicle and the parking time threshold.
2. The vehicle scheduling method according to claim 1, wherein the determining whether to send the first scheduling information corresponding to the parking spot to a management terminal according to the parking time of each of the second vehicles and the parking time threshold comprises:
if the second vehicles with the parking duration larger than the parking duration threshold exist, determining the number of the second vehicles with the parking duration larger than the parking duration threshold, and sending first scheduling information corresponding to the parking points to a management terminal, wherein the first scheduling information comprises the number of the second vehicles which are required to be scheduled.
3. The vehicle scheduling method according to claim 1, wherein after determining whether to send the first scheduling information corresponding to the parking spot to a management terminal according to the parking time length of each of the second vehicles and the parking time length threshold, the method further comprises:
and if the first vehicle is not scheduled and the parking time of the first vehicle is greater than a first time threshold, sending second scheduling information corresponding to the first vehicle to a management terminal, wherein the first time threshold is greater than the parking time threshold.
4. The vehicle scheduling method of claim 1, wherein after determining whether the first vehicle is within a parking spot according to the current location of the first vehicle, further comprising:
and if the first vehicle is not in the parking spot and the parking time of the first vehicle is greater than a second time threshold, sending third scheduling information corresponding to the first vehicle to a management terminal.
5. The vehicle scheduling method of claim 1, further comprising:
setting parking time thresholds of the parking spots according to vehicle parking data of the parking spots in historical time so as to determine different parking time thresholds of the parking spots according to actual operation conditions of each parking spot, wherein the vehicle parking data comprise locking time of vehicles in the parking spots, parking time of the vehicles, vehicle turnover rate and vehicle polymerization degree.
6. The vehicle scheduling method of claim 5, wherein the setting of the parking duration threshold for the parking spot according to the vehicle parking data of the parking spot over the historical time period comprises:
acquiring historical parking time period corresponding to the current parking time period and weather information of the current parking time period;
and setting a parking time length threshold corresponding to the current parking time period by the parking point according to the weather information of the historical parking time period, the weather information of the current parking time period and the vehicle parking data of the historical parking time period so as to determine the parking time length threshold corresponding to the current parking time period by different parking points.
7. The vehicle scheduling method according to claim 1, wherein after acquiring the parking time period corresponding to the locking time and determining the parking time period threshold corresponding to the parking point in the parking time period if the first vehicle is in the parking point, the method further comprises:
and if the parking time length threshold value does not exist in the parking spot and the parking time length of the first vehicle is greater than a third time length threshold value, sending fourth scheduling information corresponding to the first vehicle to a management terminal.
8. A vehicle scheduling device is applied to a server, and the device comprises:
the response module is used for responding to a locking request of a first vehicle and acquiring the current position and locking time of the first vehicle;
the parking spot judging module is used for judging whether the first vehicle is in a parking spot or not according to the current position of the first vehicle;
the time period acquisition module is used for acquiring a current parking time period corresponding to the locking time if the first vehicle is in a parking spot, and determining a parking time period threshold corresponding to the current parking time period by the parking spot;
the parking duration determining module is used for determining all second vehicles with the locking time within the current parking time period in the parking spot and monitoring the parking duration of each second vehicle;
and the scheduling information determining module is used for determining whether to send first scheduling information corresponding to the parking points to a management terminal according to the parking time of each second vehicle and the parking time threshold.
9. A computer device comprising a processor and a memory, the memory having stored thereon a program or instructions which, when executed by the processor, carry out the steps of the vehicle scheduling method of any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored thereon a program or instructions which, when executed by a processor, carry out the steps of the vehicle scheduling method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111659478.1A CN114333094A (en) | 2021-12-31 | 2021-12-31 | Vehicle scheduling method and device, terminal equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111659478.1A CN114333094A (en) | 2021-12-31 | 2021-12-31 | Vehicle scheduling method and device, terminal equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114333094A true CN114333094A (en) | 2022-04-12 |
Family
ID=81018818
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111659478.1A Pending CN114333094A (en) | 2021-12-31 | 2021-12-31 | Vehicle scheduling method and device, terminal equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114333094A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115527360A (en) * | 2022-09-01 | 2022-12-27 | 汉海信息技术(上海)有限公司 | Method and medium for determining vehicle home parking point |
| CN116151489A (en) * | 2023-04-19 | 2023-05-23 | 之江实验室 | Vehicle stay behavior analysis and prediction method and system based on multitask learning |
| CN116863748A (en) * | 2023-08-29 | 2023-10-10 | 成都宜泊信息科技有限公司 | AVP intelligent scheduling method and scheduling system |
-
2021
- 2021-12-31 CN CN202111659478.1A patent/CN114333094A/en active Pending
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115527360A (en) * | 2022-09-01 | 2022-12-27 | 汉海信息技术(上海)有限公司 | Method and medium for determining vehicle home parking point |
| CN115527360B (en) * | 2022-09-01 | 2024-03-15 | 汉海信息技术(上海)有限公司 | Method and medium for judging vehicle attribution parking point |
| CN116151489A (en) * | 2023-04-19 | 2023-05-23 | 之江实验室 | Vehicle stay behavior analysis and prediction method and system based on multitask learning |
| CN116151489B (en) * | 2023-04-19 | 2023-07-21 | 之江实验室 | Vehicle stay behavior analysis and prediction method and system based on multitask learning |
| CN116863748A (en) * | 2023-08-29 | 2023-10-10 | 成都宜泊信息科技有限公司 | AVP intelligent scheduling method and scheduling system |
| CN116863748B (en) * | 2023-08-29 | 2023-11-28 | 成都宜泊信息科技有限公司 | AVP intelligent scheduling method and scheduling system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114333094A (en) | Vehicle scheduling method and device, terminal equipment and medium | |
| KR101278830B1 (en) | Apparatus and method for managing assiduity | |
| US20090070156A1 (en) | Visitor parking system and method | |
| US20140280962A1 (en) | Method and system for delegating functionality based on availability | |
| CN108777002A (en) | Parking fee collective system method, system and computer readable storage medium | |
| WO2019000811A1 (en) | Method and apparatus for controlling shared bicycle | |
| EP3594875A1 (en) | Systems and methods for providing an access management platform | |
| CN105205873A (en) | Parking lot management device, system and method | |
| JP2020160736A (en) | Vehicle parking/stopping hours prediction device, vehicle parking/stopping hours prediction method, and program | |
| CN106683477A (en) | Control method of and system for a plurality of cars belonging to one person passing access control | |
| CN109919492B (en) | Sanitation resource scheduling method, device and system | |
| CN106327917B (en) | The management method and system of parking lot reservation parking | |
| CN108922235A (en) | Parking space state monitoring method, device and computer readable storage medium | |
| CN110930687A (en) | Method and system for dispatching vehicles in peak vehicle time period | |
| CN106297387A (en) | A kind of remote reserved method of parking position | |
| CN114446063B (en) | Remaining parking number reminding method and device | |
| JP2018081575A (en) | Vehicle management method and vehicle management system | |
| US20190279436A1 (en) | Server for management system, management method, and non-transitory computer recording medium | |
| CN113723646A (en) | Vehicle parking method and device and terminal equipment | |
| CN106931596B (en) | Engineering monitoring method and system | |
| CN113596728B (en) | Vehicle parking method and device and terminal equipment | |
| CN112686415B (en) | Method and device for monitoring network taxi appointment behaviors | |
| CN114724404A (en) | Parking management method and system | |
| CN110136473B (en) | Property community visitor vehicle intelligent management method and system | |
| CN113689629B (en) | Parking spot generation method and device and terminal equipment |
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 |